Linear algebraic equation polyalgorithm for the CDC 6600 and 7600. A user's guide for LEQSOL(). [For solving systems of equations]
Year: 1977
Type: report
Abstract: A guide for persons who must compute numerical solutions of linear algebraic systems of equations is presented. Subprogram usage instructions are presented. Five often-occurring FORTRAN program examples arising from linear algebraic equations are listed. These are the following: solving Ax = b, computing matrix products A/sup -1/D or EA/sup -1/, iterative refinement, and determinant evaluation. A final example illustrates an analysis of a poorly conditioned problem. Some discussion of how to deal with constraint requirements on the solution should this occur is also presented. The subprogram for solving the systems is LEQSOL( ). The code has additional features beyond those of its Sandia Math Library counterpart SAXB( ). One feature is to provide an estimate of the accuracy of the computed solution. The subprogram LEQSOL( ) is considerably more efficient than SAXB( ) for large values of N. 3 figures, 1 table.
DOI: 10.2172/7293949
Authors: R.J. Hanson, J.A. Wisniewski
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Sandia National Laboratories
OpenAlex ID: W304681122
