Pivoting and backward stability of fast algorithms for solving Cauchy linear equations (Q1348084)
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: Pivoting and backward stability of fast algorithms for solving Cauchy linear equations |
scientific article; zbMATH DE number 1741656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pivoting and backward stability of fast algorithms for solving Cauchy linear equations |
scientific article; zbMATH DE number 1741656 |
Statements
Pivoting and backward stability of fast algorithms for solving Cauchy linear equations (English)
0 references
15 May 2002
0 references
The authors suggest three fast algorithms for solving linear systems with Cauchy coefficient matrices. They investigate related pivoting techniques and stability, and show that Vandermonde matrices can be effectively transformed into Cauchy matrices. Computational results are also given.
0 references
Cauchy matrix
0 references
Vandermonde matrix
0 references
pivoting
0 references
backward stability
0 references
numerical examples
0 references
fast algorithms
0 references
linear systems
0 references
0 references
0.8295068740844727
0 references
0.8253535032272339
0 references
0.8235448002815247
0 references
0.8217284083366394
0 references
