A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices (Q861029)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices |
scientific article |
Statements
A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices (English)
0 references
9 January 2007
0 references
The paper presents a Björk-Pereyra-type algorithm to solve linear systems with a polynomial-Vandermonde \(n\times n \) matrix, where the corresponding polynomials are the Szegö polynomials. Such matrix is called the Szegö-Vandermonde matrix. The algorithm exploits the properties of the related unitary Hessenberg matrix to reduce the computational complexity \(O(n^2)\) operations which is in contrast to the usual \(O(n^3)\) complexity of standard structure ignoring methods. Numerical experiments indicate a good performance for ill-conditioned systems when comparing it with the Gaussian elimination.
0 references
Björk-Pereyra algorihm
0 references
Szegö polynomials
0 references
unitary Hessenberg matrices
0 references
polynomial Vandermonde matrices
0 references
fast algorithms
0 references
comparison of methods
0 references
computational complexity
0 references
numerical experiments
0 references
ill-conditioned systems
0 references
Gaussian elimination
0 references