Add to ORKGAbstract. The computation of zeros of polynomials is a classical computational problem. This paper presents two new zerofinders that are based on the observation that, after a suitable change of variable, any polynomial can be considered a member of a family of Szego ̋ polynomials. Nu-merical experiments indicate that these methods generally give higher accuracy than computing the eigenvalues of the companion matrix associated with the polynomial. Key words. Szegő-Hessenberg matrix, companion matrix, eigenvalue problem, continuation method, parallel computation. 1. Introduction. Th
A new approach to the computation of the poles of a stable autoregressive system from the reflection...
AbstractA globally convergent matrix algorithm is presented for finding the real and complex zeros o...
The problem of finding the zeros of a polynomial p(z) of degree n is considered. Some results relate...
In linear algebra, the eigenvalues of a matrix are equivalently defined as the zeros of its characte...
AbstractLet {φj}∞j = 0 be a family of monic polynomials that are orthogonal with respect to an inner...
AbstractThe computation of zeros of polynomials is a classical computational problem. This paper pre...
AbstractLet {φj}∞j = 0 be a family of monic polynomials that are orthogonal with respect to an inner...
Abstract. Jim Wilkinson discovered that the computation of zeros of polynomials is ill condi-tioned ...
A new fast algorithm for computing the zeros of a polynomial in $O(n^{2})$ time using $O(n)$ memory ...
AbstractA globally convergent matrix algorithm is presented for finding the real and complex zeros o...
It is well known that the zeros of a polynomial $p$ are equal to the eigenvalues of the associated ...
AbstractIn this paper, we introduce a new type of companion matrices, namely, D-companion matrices. ...
AbstractFor a function f(x) that is smooth on the interval x∈[a,b] but otherwise arbitrary, the real...
This is to certify that this PhD thesis is, to the best of my knowledge, entirely my own work, excep...
In this lecture we will propose a new fast and stable manner of computing roots of polynomials. Root...
A new approach to the computation of the poles of a stable autoregressive system from the reflection...
AbstractA globally convergent matrix algorithm is presented for finding the real and complex zeros o...
The problem of finding the zeros of a polynomial p(z) of degree n is considered. Some results relate...
In linear algebra, the eigenvalues of a matrix are equivalently defined as the zeros of its characte...
AbstractLet {φj}∞j = 0 be a family of monic polynomials that are orthogonal with respect to an inner...
AbstractThe computation of zeros of polynomials is a classical computational problem. This paper pre...
AbstractLet {φj}∞j = 0 be a family of monic polynomials that are orthogonal with respect to an inner...
Abstract. Jim Wilkinson discovered that the computation of zeros of polynomials is ill condi-tioned ...
A new fast algorithm for computing the zeros of a polynomial in $O(n^{2})$ time using $O(n)$ memory ...
AbstractA globally convergent matrix algorithm is presented for finding the real and complex zeros o...
It is well known that the zeros of a polynomial $p$ are equal to the eigenvalues of the associated ...
AbstractIn this paper, we introduce a new type of companion matrices, namely, D-companion matrices. ...
AbstractFor a function f(x) that is smooth on the interval x∈[a,b] but otherwise arbitrary, the real...
This is to certify that this PhD thesis is, to the best of my knowledge, entirely my own work, excep...
In this lecture we will propose a new fast and stable manner of computing roots of polynomials. Root...
A new approach to the computation of the poles of a stable autoregressive system from the reflection...
AbstractA globally convergent matrix algorithm is presented for finding the real and complex zeros o...
The problem of finding the zeros of a polynomial p(z) of degree n is considered. Some results relate...