References

  • [1] J. Bennett(1965) Triangular factors of modified matrices. Numerische Mathematik 7, pp. 217–221. Cited by: Section 6.3, Section 6.3.
  • [2] S. Chan and V. Brandwajn(1986) Partial matrix refactorization. IEEE Transactions on Power Systems 1 (1), pp. 193–200. Cited by: Section 6.3, Section 8.8.
  • [3] S. Conte and C. de Boor(1972) Elementary numerical analysis. McGraw-Hill Book Company, New York. Cited by: Section 4.2, Section 4.6.
  • [4] I. S. Duff, A. M. Erisman and J. K. Reid(1986) Direct methods for sparse matrices. Clarendon Press, Oxford. Cited by: Section 4.3, Section 4, Section 8.2, Section 8.3.1.
  • [5] L. Fox(1964) An introduction to numerical linear algebra. Clarendon Press, Oxford. Cited by: Section 4.
  • [6] A. George and J. W.H. Liu(1981) Computer solutions of large sparse positive definite systems. Prentice-Hall, Engle Wood Cliffs, New Jersey. External Links: ISBN 9780131652743 Cited by: Section 5.3, Section 8.3.2.
  • [7] P. Gill, G. Golub, W. Murray and M. Sanders(1974) Methods for modifying matrix factorizations. Mathematics of Computation 28 (126), pp. 505–535. Cited by: Section 6.3, Section 6.3, Section 7.8.1.
  • [8] G. H. Golub and C. F. van Van Loan(1983) Matrix computations. Johns Hopkins University Press, Baltimore. Cited by: Section 4.1, Section 4.6, Section 4.
  • [9] A. Gomez and L. Franquelo(1988) An efficient ordering algorithm to improve sparse vector methods. IEEE Transactions on Power Systems 3 (4), pp. 1538–1544. Cited by: Section 8.3.2.
  • [10] A. Gomez and L. Franquelo(1988) Node ordering algorithms for sparse vector method improvement. IEEE Transactions on Power Systems 3 (1). Cited by: Section 8.3.2.
  • [11] G. Gonnet(1984) Handbook of algorithms and data structures. Addison-Wesley, Reading, Massachusetts. Cited by: Section 9.2.2, Section 9.2.4.
  • [12] W. Hager(1989) Updating the inverse of a matrix. SIAM Review 31 (2), pp. 221–239. Cited by: Section 6.3.
  • [13] P. Lehman and B. Yao(1981-12) Efficient locking for concurrent operations on b-trees. ACM Transaction on Database Systems 6 (4), pp. 650–669. Cited by: Section 9.1, Section 9.2.
  • [14] W. H. Press, B. P. Flannery, S. A. Teukolsky and W. T. Vetterling(1988) Numerical recipes in c. Cambridge University Press, Cambridge and New York. External Links: ISBN 9780521354660 Cited by: Section 4.6, Section 4.
  • [15] D. Rose and R. Tarjan(1975) Algorithmic aspects of vertex elimination. pp. 245–254. Cited by: Section 8.3.
  • [16] W. Tinney, V. Brandwajn and S. Chan(1985) Sparse vector methods. IEEE Transactions on Power Apparatus and Systems 104 (2). Cited by: Section 5.3, Section 8.8.
  • [17] W. Tinney and C. Hart(1972) Power flow solution by newton’s method. IEEE Transactions on Power Apparatus and Systems 86 (6). Cited by: Section 8.2, Section 8.3.2, Section 8.
  • [18] W. Tinnney and J. Walker(1967) Direct solutions of sparse network equations by optimally ordered triangular factorization. Proceedings of the IEEE 55 (11), pp. 1801–1809. Cited by: Section 4.4.