Fast QR factorization of Cauchy-like matrices (Q2465328): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2007.08.038 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013171201 / rank | |||
Normal rank | |||
Revision as of 02:41, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast QR factorization of Cauchy-like matrices |
scientific article |
Statements
Fast QR factorization of Cauchy-like matrices (English)
0 references
3 January 2008
0 references
The paper presents two fast numerical methods for computing the QR factorization of an \(n\times n\) Cauchy-like matrix \(C\), \(C=\text{QR}\), with data points lying on the real axis or on the unit circle in the complex plane. It is shown that the rows of the \(Q\)-factor of \(C\) are the eigenvectors of a rank structured matrix partially determined by some prescribed spectral data. This property establishes a basic connection between the computation of \(Q\) and the solution of an inverse eigenvalue problem for a rank structured matrix.
0 references
displacement structured matrix
0 references
quasiseparable matrices
0 references
Cauchy-like matrices
0 references
inverse eigenvalue problems
0 references
QR factorization
0 references
