Structured matrices and Newton's iteration: unified approach (Q1348095)
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: Structured matrices and Newton's iteration: unified approach |
scientific article; zbMATH DE number 1741663
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Structured matrices and Newton's iteration: unified approach |
scientific article; zbMATH DE number 1741663 |
Statements
Structured matrices and Newton's iteration: unified approach (English)
0 references
15 May 2002
0 references
Recent progress in the study of structured matrices shows advantages of unifying the treatment of various classes of such matrices. The authors recall some fundamental techniques for such a unification and then specify it in full details for Newton's iteration. Thereby methods proposed for Toeplitz matrices and Cauchy-like matrices are extended to a more general class of structured matrices. Estimates for the convergence rate as well as the computational complexity are presented.
0 references
inverse displacement operators
0 references
displacement rank
0 references
structured matrices
0 references
Newton's iteration
0 references
Toeplitz matrices
0 references
Cauchy-like matrices
0 references
convergence
0 references
0 references
0 references
0 references
0.8318214416503906
0 references
0.8010957837104797
0 references
0.7914168834686279
0 references
