Fast QR factorization of low-rank changes of Vandermonde-like matrices (Q1294068)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast QR factorization of low-rank changes of Vandermonde-like matrices |
scientific article; zbMATH DE number 1310852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast QR factorization of low-rank changes of Vandermonde-like matrices |
scientific article; zbMATH DE number 1310852 |
Statements
Fast QR factorization of low-rank changes of Vandermonde-like matrices (English)
0 references
11 January 2000
0 references
Matrices that are close to Vandermonde matrices arise for example in the Remez algorithm and in least-squares problems. Starting from \textit{L. Reichel's} algorithm for Vandermonde matrices [SIAM J. Matrix Anal. Appl. 12, No.~3, 552--564 (1991; Zbl 0739.65024)] an inverse QR factorization is presented. Special care is taken of an efficient storage. The connection with Lanczos type methods is discussed.
0 references
inverse QR factorization
0 references
Vandermonde matrices
0 references
Remez algorithm
0 references
least-squares problems
0 references
Lanczos-type methods
0 references
0.8365318179130554
0 references
0.8308219313621521
0 references
0.8147727251052856
0 references
0.791332483291626
0 references
