Newton-like iteration based on a cubic polynomial for structured matrices (Q1768394)
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: Newton-like iteration based on a cubic polynomial for structured matrices |
scientific article; zbMATH DE number 2145929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Newton-like iteration based on a cubic polynomial for structured matrices |
scientific article; zbMATH DE number 2145929 |
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
0 references
0.8358926773071289
0 references
0.8337257504463196
0 references
0.8318214416503906
0 references
0.8015204668045044
0 references
0.7802071571350098
0 references
