Direct solutions of sparse network equations by optimally ordered triangular factorization Export

@article{tinney76mindegree, abstract = {Matrix inversion is very inefficient for computing direct solutions of the large sparse systems of linear equations that arise in many network problems. Optimally ordered triangular factorization of sparse matrices is more efficient and offers other important computational advantages in some applications. With this method, direct solutions are computed from sparse matrix factors instead of from a full inverse matrix, thereby gaining a significant advantage in speed, computer memory requirements, and reduced round-off error. Improvements of tea to one or more in speed and problem size over present applications of the inverse can be achieved in many cases. Details of the method, numerical examples, and the results of a large problem are given.}, author = {Tinney, W. F. and Walker, J. W.}, citeulike-article-id = {849246}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1447941}, journal = {Proceedings of the IEEE}, keywords = {bsc-math-thesis, graph, numerics, optimization}, number = {11}, pages = {1801--1809}, posted-at = {2006-09-19 05:18:06}, priority = {2}, title = {Direct solutions of sparse network equations by optimally ordered triangular factorization}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1447941}, volume = {55}, year = {1967} }

TY - JOUR ID - tinney76mindegree L3 - citeulike-article-id:849246 N2 - Matrix inversion is very inefficient for computing direct solutions of the large sparse systems of linear equations that arise in many network problems. Optimally ordered triangular factorization of sparse matrices is more efficient and offers other important computational advantages in some applications. With this method, direct solutions are computed from sparse matrix factors instead of from a full inverse matrix, thereby gaining a significant advantage in speed, computer memory requirements, and reduced round-off error. Improvements of tea to one or more in speed and problem size over present applications of the inverse can be achieved in many cases. Details of the method, numerical examples, and the results of a large problem are given. IS - 11 JF - Proceedings of the IEEE EP - 1809 TI - Direct solutions of sparse network equations by optimally ordered triangular factorization VL - 55 SP - 1801 KW - bsc-math-thesis KW - graph KW - numerics KW - optimization AU - Tinney, WF AU - Walker, JW PY - 1967/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1447941 ER -