4 citations · 5 across the 6 of their papers we have counts for
5 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…
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…
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…
The Runge Example for Interpolation and Wilkinson's Examples for Rootfinding
Robert M. Corless, Leili Rafiee Sevyeri
We look at two classical examples in the theory of numerical analysis, namely the Runge example for interpolation and Wilkinson's example (actually two examples) for rootfinding. W…