A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations (Q1970443)
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: A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations |
scientific article; zbMATH DE number 1419870
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations |
scientific article; zbMATH DE number 1419870 |
Statements
A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations (English)
0 references
1999
0 references
This paper deals with Cauchy systems of linear equations. A new fast parallel algorithm is proposed. The new solver is an analog of the well-known Björck-Pereyra algorithm for Vandemonde systems. Numerical examples are given to illustrate the high relative accuracy. In particular, Hilbert linear systems, often considered to be to ill-conditioned to be attached, can be rapidly solved with high precision. Rounding error analysis are performed and the results indicate that for totally positive Cauchy systems the new algorithm is forward and backward stable.
0 references
Cauchy matrix
0 references
stability
0 references
numerical examples
0 references
rounding error analysis
0 references
Cauchy systems
0 references
fast parallel algorithm
0 references
Björck-Pereyra algorithm
0 references
Hilbert linear systems
0 references
0 references
0 references