QMRPACK: A Package of QMR Algorithms

ACM Transactions on Mathematical Software

Volumn 22, Issue 1, 1996, Pages 46-77

  Freund, Roland W ^a   Nachtigal, Noël M ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b OAK RIDGE NATIONAL LABORATORY   (United States)

Author keywords

D.3.2 Programming Languages : Language Classifications Fortran 77; F.2.1 Analysis of Algorithms and Problem Complexity : Numerical Algorithms and Problems computations on matrices

Indexed keywords

ALGEBRA; COMPUTER SOFTWARE; EIGENVALUES AND EIGENFUNCTIONS; FORTRAN (PROGRAMMING LANGUAGE); ITERATIVE METHODS; MATRIX ALGEBRA; NUMERICAL ANALYSIS; RELIABILITY; TRANSFER FUNCTIONS;

KRYLOV SUBSPACE; LANCZOS METHOD; NON-HERMITIAN MATRICES; QMRPACK PACKAGE;

ALGORITHMS;

EID: 0030092645     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/225545.225551     Document Type: Article

References (32)

1. ARNOLDI, W. E. 1951. The principle of minimized iterations in the solution of the matrix eigenvalue problem. Q. Appl. Math. 9, 1, 17-29.
2. AXELSSON, O. 1985. A survey of preconditioned iterative methods for linear systems of algebraic equations. BIT 25, 1, 166-187.
3. BEAM, R. M. AND WARMING, R. F. 1976. An implicit finite-difference algorithm for hyperbolic systems in conservation-law form. J. Comput. Phys. 22, 1, 87-110.
4. CULLUM, J. AND WILLOUGHBY, R. A. 1986. A practical procedure for computing eigenvalues of large sparse nonsymmetric matrices. In Large Scale Eigenvalue Problems, J. Cullum and R. A. Willoughby, Eds. North-Holland, Amsterdam, 193-240.
5. DONGARRA, J. J. AND GROSSE, E. H. 1987. Distribution of mathematical software via electronic mail. Commun. ACM 30, 5, 403-407.
6. EISENSTAT, S. C. 1981. Efficient implementation of a class of preconditioned conjugate gradient methods. SIAM J. Sci. Stat. Comput. 2, 1, 1-4.
7. FELDMANN, P. AND FREUND, R. W. 1994. Efficient linear circuit analysis by Padé approximation via the Lanczos process. Numerical Analysis Manuscript 94-01, AT&T Bell Laboratories, Murray Hill, N.J.
8. FREUND, R. W. 1989. Conjugate gradient type methods for linear systems with complex symmetric coefficient matrices, RLACS Tech. Report 89.54, NASA Ames Research Center, Moffett Field, Calif.
9. FREUND, R. W. 1992a. Conjugate gradient-type methods for linear systems with complex symmetric coefficient matrices. SIAM J. Sci. Stat. Comput. 13, 1, 425-448.
10. FREUND, R. W. 1992b. Quasi-kernel polynomials and their use in non-Hermitian matrix iterations. J. Comput. Appl. Math. 43, 1-2, 135-158.
11. FREUND, R. W. 1992c. Quasi-kernel polynomials and convergence results for quasi-minimal residual iterations. In Numerical Methods of Approximation Theory, D. Braess and L. Schumaker, Eds. Birkhaüser, Basel, Switzerland, 77-95.
12. FREUND, R. W. 1993. A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems. SIAM J. Sci. Comput. 14, 2, 470-482.
13. FREUND, R. W. 1994. The look-ahead Lanczos process for nonsymmetric matrices and its applications. In Proceedings of the Cornelius Lanczos International Centenary Conference, J. D. Brown, M. T. Chu, D. C. Ellison, and R. J. Plemmons, Eds. SIAM, Philadelphia, Pa., 33-47.
14. FREUND, R. W. AND NACHTIGAL, N. M. 1991. QMR: A quasi-minimal residual method for non-Hermitian linear systems. Numer. Math. 60, 3, 315-339.
15. FREUND, R. W. AND NACHTIGAL, N. M. 1993. Implementation details of the coupled QMR algorithm. In Numerical Linear Algebra, L. Reichel, A. Ruttan, and R. S. Varga, Eds. W. de Gruyter, Berlin, 101-121.
16. FREUND, R. W. AND NACHTIGAL, N. M. 1994. An implementation of the QMR method based on coupled two-term recurrences. SIAM J. Sci. Comput. 15, 2, 313-337.
17. FREUND, R. W. AND SZETO, T. 1992. A transpose-free quasi-minimal residual squared algorithm for non-Hermitian linear systems. In Advances in Computer Methods for Partial Differential Equations - VII, R. Vichnevetsky, D. Knight, and G. Richter, Eds. IMACS, 258-264.
18. FREUND, R. W. AND ZHA, H, 1995. Simplifications of the nonsymmetric Lanczos process and a new algorithm for Hermitian indefinite linear systems. AT & T Numerical Analysis Manuscript, Bell Laboratories, Murray Hill, N.J.
19. FREUND, R. W., GUTKNECHT, M. H., AND NACHTIGAL, N. M. 1993. An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices. SIAM J. Sci. Comput. 14, 1, 137-158.
20. GILL, P. E., MURRAY, W., PICKEN, S. M., AND WRIGHT, M. H. 1979. The design and structure of a Fortran program library for optimization. ACM Trans. Math. Softw. 5, 3, 259-283.
21. GRAGG, W. B. 1974. Matrix interpretations and applications of the continued fraction algorithm. Rocky Mountain J. Math. 4, 2, 213-225.
22. GRAGG, W. B. AND LINDQUIST, A. 1983. On the partial realization problem. Linear Algebra Appl. 50, 277-319.
23. KROGH, F. T. 1969. VODQ/SVDQ/DVDQ-Variable order integrators for the numerical solution of ordinary differential equations. Subroutine Write-Up, Sec. 314, Jet Propulsion Lab., Pasadena, Calif.
24. LANCZOS, C. 1950. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Standards 45, 4, 255-282.
25. LANCZOS, C. 1952. Solution of systems of linear equations by minimized iterations. J. Res. Nat. Bur. Standards 49, 1, 33-53.
26. LANCZOS, C. 1956. Applied Analysis. Prentice-Hall, Englewood Cliffs, N.J.
27. NACHTIGAL, N. M. AND SEMERARO, B. D. 1995. QMR methods in computational fluid dynamics. In Solution Techniques for Large-Scale CFD Problems, W. G. Habashi, Ed. John Wiley & Sons, New York.
28. NACHTIGAL, N. M., SHELTON, W. A., AND STOCKS, G. M. 1994. Combining the QMR method with first principles electronic structure codes. Tech. Rep. ORNL/TM-12873, Oak Ridge National Laboratory, Oak Ridge, Tenn.
29. PARLETT, B. N., TAYLOR, D. R., AND LIU, Z. A. 1985. A look-ahead Lanczos algorithm for unsymmetric matrices. Math. Comput. 44, 105-124.
30. SAAD, Y. 1992. ILUT: A dual threshold incomplete LU factorization. Res. Rep. UMSI 92/38, Univ. of Minnesota Supercomputer Institute, Minneapolis, Minn.
31. TAYLOR, D. R. 1982. Analysis of the look ahead Lanczos algorithm. Ph.D. thesis, Dept. of Mathematics, Univ. of California, Berkeley, Calif.
32. VENKATAKRISHNAN, V. AND BARTH, T. J. 1992. Unstructured grid solvers on the iPSC/860. In Parallel Computational Fluid Dynamics. Rutgers, N.J.