The weak and strong stability of algorithms in numerical linear algebra (Q1107263): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LINPACK / rank | |||
Normal rank | |||
Revision as of 03:56, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The weak and strong stability of algorithms in numerical linear algebra |
scientific article |
Statements
The weak and strong stability of algorithms in numerical linear algebra (English)
0 references
1987
0 references
The stability of algorithm in numeical linear algebra is discussed. The concept of stability is extended to notions of weak stability and strong stability. Justifications are given for these extensions, and the implications of error analysis in terms of these definitions are discussed. The concept of weak stability helps to clarify some of the controversy which has arisen concerning the stability of algorithms for Toeplitz systems.
0 references
backward error analysis
0 references
conditioning
0 references
stability of algorithm
0 references
weak stability
0 references
strong stability
0 references
Toeplitz systems
0 references
