Name
Title | ||
|---|---|---|
Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations |
Abstract | ||
|---|---|---|
An efficient implementation of the Crout elimination method in solving large sparse systems of linear algebraic equations of arbitrary structure is described. A computer program, GNSO, by symbolic processing, generates another program, SOLVE, which represents the op- timal reduced Crout algorithm in the sense that only nonzero elements are stored and operated on. The method presented is particularly powerful when a system of fixed sparseness structure must be solved repeatedly with different numerical values. In practical examples, the execution of SOLVE was observed to be typically N times as fast as that of the full Crout algorithm, where N is the order of the system. |
Year | DOI | Venue |
|---|---|---|
1970 | 10.1145/321556.321565 | J. ACM |
Keywords | DocType | Volume |
crout algorithm,Optimal Crout Algorithm,Symbolic Generation,linear algebraic system,direct ma- trix methods,symbolic processing,sparse matrices,Sparse Systems,matrix-equation-solving,Linear Equations | Journal | 17 |
Issue | ISSN | Citations |
1 | 0004-5411 | 20 |
PageRank | References | Authors |
26.83 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| F. G. Gustavson | 1 | 338 | 75.23 |
| W. Liniger | 2 | 25 | 28.27 |
| R. Willoughby | 3 | 20 | 26.83 |