Paper
4 April 1986 Stability, Strong Stability, And Weak Stability Of Algorithms For Solving Linear Equations
James R. Bunch
Author Affiliations +
Abstract
Differing concepts of the stability of algorithms for solving linear equations are scrutinized. These concepts are expanded to two new concepts: strong stability and weak stability; examples are given for the need for these concepts.
© (1986) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
James R. Bunch "Stability, Strong Stability, And Weak Stability Of Algorithms For Solving Linear Equations", Proc. SPIE 0696, Advanced Algorithms and Architectures for Signal Processing I, (4 April 1986); https://doi.org/10.1117/12.936870
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Actinium

Matrices

Error analysis

Computing systems

Algorithms

Signal processing

Computer arithmetic

RELATED CONTENT

Fast RNS algorithm for computational geometry problems
Proceedings of SPIE (November 20 2001)
Two-step Gram-Schmidt downdating methods
Proceedings of SPIE (November 20 2001)
Stability of Bareiss algorithm
Proceedings of SPIE (December 01 1991)
Solution of the Yule-Walker equations
Proceedings of SPIE (December 01 1991)
How bad are symmetric Pick matrices?
Proceedings of SPIE (November 13 2000)

Back to Top