Abstract
After the foregoing discussion of the pivotal strategies that can be used during the GE process and of the iterative refinement (IR) process, everything is prepared to describe the main principles that can be applied in a sparse matrix code for solving systems of linear algebraic equations. The particular code used to illustrate the implementations is Y12M. Hence the two main storage schemes described in Chapter 2 the input storage scheme and the dynamic storage scheme, are applied. However, similar ideas can be implemented if other codes and/or other storage schemes are used.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Zlatev, Z. (1991). Implementation of the Algorithms. In: Computational Methods for General Sparse Matrices. Mathematics and Its Applications, vol 65. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1116-6_6
Download citation
DOI: https://doi.org/10.1007/978-94-017-1116-6_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4086-2
Online ISBN: 978-94-017-1116-6
eBook Packages: Springer Book Archive