4 citations · 13 across the 8 of their papers we have counts for
6 papers · 1 filter
Approximate GCD in Lagrange bases
Leili Rafiee Sevyeri, Robert M. Corless
For a pair of polynomials with real or complex coefficients, given in any particular basis, the problem of finding their GCD is known to be ill-posed. An answer is still desired fo…
Equivalences for Linearizations of Matrix Polynomials
Robert M. Corless, Leili Rafiee Sevyeri, B. David Saunders
One useful standard method to compute eigenvalues of matrix polynomials of degree at most in (denoted of grade , for sho…
Inverse Cubic Iteration
Robert M. Corless
There are thousands of papers on rootfinding for nonlinear scalar equations. Here is one more, to talk about an apparently new method, which I call ``Inverse Cubic Iteration'' (ICI…
Approximate GCD in a Bernstein basis
Robert M. Corless, Leili Rafiee Sevyeri
We adapt Victor Y. Pan's root-based algorithm for finding approximate GCD to the case where the polynomials are expressed in Bernstein bases. We use the numerically stable companio…
Compact Finite Differences and Cubic Splines
Robert M. Corless
In this paper I uncover and explain---using contour integrals and residues---a connection between cubic splines and a popular compact finite difference formula. The connection is t…
Generalized Standard Triples for Algebraic Linearizations of Matrix Polynomials
Eunice Y. S. Chan, Robert M. Corless, Leili Rafiee Sevyeri
We define \emph{generalized standard triples} , , and , where is a linearization of a regular matrix polynom…