LQ-Schur projection on large sparse matrix equations

Numerical Linear Algebra with Applications

Volumn 7, Issue 7-8, 2000, Pages 491-503

  Boley, Daniel ^a   Goehring, Todd ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Orthogonal factorization; Schur complement; Sparse matrix equations

Indexed keywords

EID: 0034356075     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/1099-1506(200010/12)7:7/8<491::AID-NLA209>3.0.CO;2-F     Document Type: Article

References (10)

1. Chan TF, Mathew TP. Domain decomposition algorithms. In Acta Numerica, 1994; 3:61-143.
2. Saad Y. Iterative Methods for Sparse Linear Systems. PWS, 1996.
3. Golub GH, Van Loan CF. Matrix Computations. Johns Hopkins University Press, 3rd edn, 1996.
4. Smith B, Bjorstad P, Gropp W. Domain Decomposition, Paralllel Methods for Elliptic Partial Differential Equations. Cambridge University Press, 1996.
5. Duff I, Grimes R, Lewis J. Harwell-Boeing sparse matrix collection. http://math.nist.gov/MatrixMarket/collections/hb.html.
6. Davis T. University of Florida sparse matrix collection, http://www.cise.ufl.edu/~davis/sparse/, ftp://ftp.cise.ufl. edu/pub/faculty/davis/matrices. See NA Digest vol. 97, no. 23, June 7, 1997.
7. Davis T. University of Florida sparse matrix collection, http://www.cise.ufl.edu/~davis/sparse/, ftp://ftp.cise.ufl. edu/pub/faculty/davis/matrices. See NA Digest vol. 97, no. 23, June 7, 1997.
8. Saad Y, Schultz M. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing 1986; 7:856-869.
9. Goehring T, Saad Y. Heuristic algorithms for automatic graph partitioning. Technical Report UMSI 94-29, University of Minnesota Supercomputer Institute, 1994.
10. Goehring T. Accelerating iterative methods by inducing sparsity in the residual vector. PhD thesis, Computer Science and Engineering, University of Minnesota, 1999.