Abstract
We build up algorithms using some set of elementary operations. If a problem is solved with a finite number of elementary operations (in exact arithmetic), then the corresponding method is said to be direct.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, 1989.
N. Gould. On growth in Gaussian elimination with complete pivoting. SIAM J. Matrix Anal Appl. 12(2): 354–361 (1991).
V. V. Voevodin. Computational Bases of Linear Algebra. Nauka, Moscow, 1977 (in Russian).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tyrtyshnikov, E.E. (1997). Lecture 7. In: A Brief Introduction to Numerical Analysis. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8136-4_7
Download citation
DOI: https://doi.org/10.1007/978-0-8176-8136-4_7
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6413-2
Online ISBN: 978-0-8176-8136-4
eBook Packages: Springer Book Archive