Chapter 1 Large sparse systems of linear equations

Part of the Lecture Notes in Computer Science book series (LNCS, volume 165)


Conjugate Gradient Sparse Matrix Permutation Matrix Cholesky Decomposition Cholesky Factor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

1.1.8 References

  1. Cuthill, E., McKee, J., [1969]. Reducing the bandwidth of sparse symmetric matrices, in Proc. 24th Nat. Conf. Assoc. Comput. Mach., ACM Publ.Google Scholar
  2. Garey M.R.,Graham R.L,Johnson D.S., and Knuth D.E. [1978]. Complexity results for bandwidth minimization, SIAM Journal on Applied Mathematics, 34,477–495Google Scholar
  3. George, A. and Liu, J., [1981]. Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood-Cliffs, N.J.Google Scholar
  4. George, A. and Lui, J. [1980], A fast implementation of the minimum degree algorithm using quotient graphs, ACM Transactions on Mathematical Software, 3, 337–358.Google Scholar
  5. Gibbs, N.E., Poole, W.G., Stockmeyer, P.K.[1976]. An algorithm for reducing the bandwidth and profile of a sparse matrix, SIAM Journal on Numerical Analysis, 13, 236–250.Google Scholar
  6. Markowitz, H.M.,[1957]. The elimination form of the inverse and its application to linear programming, Management Science 3, 255–269.Google Scholar
  7. Tinney, W.F. [1969]. Comments on using sparsity techniques for power system problems, in Sparse Matrix Proceedings, IBM Research Rept. RAI 3-12-69.Google Scholar
  8. Yannakakis, M. [1981], Computing minimum fill-in is NP-complete, SIAM Journal on Algebraic and Discrete Methods, 1,77–79.Google Scholar

1.2.6 References

  1. Duff, I.S. [1981], On algorithms for obtaining a maximum transversal, ACM Transactions on Mathematical Software, 7, 315–330.Google Scholar
  2. Duff, I.S. [1977], MA28-A set of FORTRAN subroutines for sparse unsymmetric matrices, Report R8730,A.R.E., Harwell, England.Google Scholar
  3. Duff, I.S. [1976], On permutations to block triangular form, Harwell report CSS 27, Harwell, England.Google Scholar
  4. Duff, I.S. [1977]. A survey of sparse matrix research, Proceedings of the IEEE, 65, 500–535.Google Scholar
  5. Duff, I.S. and Reid, J.K. [1976]. An implementation of Tarjan's algorithm for the block triangularization of a matrix, ACM Transaction on Mthematical Software 4, 137–147.Google Scholar
  6. Eisenstat, S.C., Gursky, M.C., Schultz, M.H., Sherman, A.H., Yale sparse matrix package, II. The nonsymmetric codes, Computer Science RR 114, Yale University.Google Scholar
  7. George, A., and Gustavson, F. [1980]. A new proof on permuting to block triangular form, IBM report RC8238, Yorktown Heights, N.Y.Google Scholar
  8. George, A. and Heath, M., [1980] Solution of sparse linear least squares problems using Givens rotations, Linear Algebra and Its Applications, 34, 69–83.Google Scholar
  9. Hopcroft, J.E. and Karp, R.M. [1973]. An n 2.5 algorithm for maximum matching in bipartite graphs, SIAM J. Computing 2, 225–231.Google Scholar
  10. Howell, T.D. [1976]. Partitioning using PAQ, in Sparse Matrix Computations, edited by Bunch, J.R. and Rose, D.J., Academic Press, New York.Google Scholar
  11. Markowitz, H.M. [1957]. The elimination form of the inverse and its application to linear programming, Management Science 3, 255–269.Google Scholar
  12. Paige, C.C. [1973], An error analysis of a method for solving matrix equations, Mathematics of Computation, 27, 355–359.Google Scholar
  13. Reid, J.R. [1976]. Solution of linear systems of equations: direct methods (general), Lecture Notes in Mathematics 572, Cpoenhagen.Google Scholar
  14. Tarjan, R [1972]. Depth first search and linear graph algorithms, SIAM J. Computing, 1, 146–160.Google Scholar

1.3.5 References

  1. Axelsson, O [1980]. Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations, Lin. Algebra and Applic., 29, 1–66Google Scholar
  2. Concus P., Golub G., O'Leary D. [1976]. A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations, in Sparse Matrix Computations, J. Bunch and D. Rose (eds), Academic Press, New York.Google Scholar
  3. Golub G.H. and Van Loan C. [1983]. Advanced Matrix Computations, The Johns Hopkins Press, Baltimore, Maryland.Google Scholar
  4. Hageman, L. and Young, D. [1981]. Applied Iterative Methods, Academic Press, New York.Google Scholar
  5. Hestenes, M. and Steifel, E, [1952].Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Stand., 49, 409–436.Google Scholar
  6. Hestenes, M. [1980], Conjugate Direction Methods in Optimization, Springer-Verlag, BerlinGoogle Scholar
  7. Kahan, W., [1958]. Gauss-Seidel methods of solving large systems of linear equations, Doctoral thesis, U. of Toronto, Toronto, Canada.Google Scholar
  8. Manteuffel, T.A. [1979]. Shifted incomplete factorization, in Sparse Matrix Proceedings, I. Duff and G. Stewart (eds), SIAM, Philadelphia.Google Scholar
  9. Stoer, J, and Bulirsch, R. [1980]. Introduction to Numerical Analysis, Springer-Verlag, New York.Google Scholar
  10. Varga, R.S [1962], Matrix Iterative Analysis,Printice-Hall, Englewood Cliffs, N.J.Google Scholar
  11. Young, D., [1971], Iterative Solution of Large Linear Systems, Academic Press, New York.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Personalised recommendations