Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
作者： F. G. Gustavson , W. Liniger , R. Willoughby
关键词:
摘要:
acm.org
sci-hub.se 参考文章(8)
Lester Randolph Ford, Flows in networks ,(1962)
Nobou Sato, W. Tinney, Techniques for Exploiting the Sparsity or the Network Admittance Matrix IEEE Transactions on Power Apparatus and Systems. ,vol. 82, pp. 944- 950 ,(1963) , 10.1109/TPAS.1963.291477
G. G. Alway, An algorithm for reducing the bandwidth of a matrix of symmetrical configuration The Computer Journal. ,vol. 8, pp. 264- 272 ,(1965) , 10.1093/COMJNL/8.3.264
A. Jennings, A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous Equations The Computer Journal. ,vol. 9, pp. 281- 285 ,(1966) , 10.1093/COMJNL/9.3.281
R. P. Tewarson, The product form of inverses of sparse matrices and graph theory. Siam Review. ,vol. 9, pp. 91- 99 ,(1967) , 10.1137/1009004
Harry M. Markowitz, The Elimination form of the Inverse and its Application to Linear Programming Management Science. ,vol. 3, pp. 255- 269 ,(1957) , 10.1287/MNSC.3.3.255
H. J. Bowdler, R. S. Martin, G. Peters, J. H. Wilkinson, Solution of real and complex systems of linear equations Numerische Mathematik. ,vol. 8, pp. 217- 234 ,(1966) , 10.1007/BF02162559
Richard S. Varga, Matrix iterative analysis ,(1961)