The weak and strong stability of algorithms in numerical linear algebra (Q1107263)
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: The weak and strong stability of algorithms in numerical linear algebra |
scientific article; zbMATH DE number 4064367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The weak and strong stability of algorithms in numerical linear algebra |
scientific article; zbMATH DE number 4064367 |
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
0 references
0.8263471126556396
0 references
0.7674322724342346
0 references
