4 April 1986 Stability, Strong Stability, And Weak Stability Of Algorithms For Solving Linear Equations
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); doi: 10.1117/12.936870; https://doi.org/10.1117/12.936870
PROCEEDINGS
4 PAGES


SHARE
RELATED CONTENT

Fast RNS algorithm for computational geometry problems
Proceedings of SPIE (November 20 2001)
Old And New Algorithms For Toeplitz Systems
Proceedings of SPIE (February 23 1988)
Two-step Gram-Schmidt downdating methods
Proceedings of SPIE (November 20 2001)
Parity-preserving transformations in computer arithmetic
Proceedings of SPIE (December 06 2002)
Solution of the Yule-Walker equations
Proceedings of SPIE (December 01 1991)
How bad are symmetric Pick matrices?
Proceedings of SPIE (November 13 2000)
Architecture Of An Advanced Signal Processor
Proceedings of SPIE (July 30 1982)

Back to Top