Newton-like iteration based on a cubic polynomial for structured matrices (Q1768394): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:29, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Newton-like iteration based on a cubic polynomial for structured matrices |
scientific article |
Statements
Newton-like iteration based on a cubic polynomial for structured matrices (English)
0 references
15 March 2005
0 references
Matrices with a low displacement rank are considered. A new Newton-like iteration for computing the Moore-Penrose generalized inverses of such matrices is presented, which is based on a cubic polynomial. Numerical experiments for Toeplitz-like and Cauchy-like matrices show its efficiency and enigmatic effect of the improvement of approximation by compression in the case of structured input.
0 references
inverse of a matrix
0 references
Moore-Penrose generalized inverse
0 references
Newton-like iteration
0 references
structured matrices
0 references
displacement structure
0 references
Toeplitz-like matrices
0 references
displacement rank
0 references
numerical experiments
0 references
Cauchy-like matrices
0 references
