Abstract
The incomplete orthogonalization method (IOM) proposed by Saad for computing a few eigenpairs of large nonsymmetric matrices is generalized into a block incomplete orthogonalization method (BIOM). It is studied how the departure from symmetry ‖A − A H‖ affects the conditioning of the block basis vectors generated by BIOM, and some relationships are established between the approximate eigenpairs obtained by BIOM and Ritz pairs. It is proved that BIOM behaves much like generalized block Lanczos methods if the basis vectors of the block Krylov subspace generated by it are strongly linearly independent. However, it is shown that BIOM may generate a nearly linearly dependent basis for a general nonsymmetric matrix. Numerical experiments illustrate the convergence behavior of BIOM.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. E. Arnoldi,The principle of minimized iteration in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 11–29.
Z. Bai,A collection of test matrices for large scale nonsymmetric eigenvalue problems, Report, Department of Mathematics, University of Kentucky, 1994.
P. N. Brown and A. C. Hindmarsh,Reduced storage methods in stiff ODE systems, Appl. Math. Comput., 31 (1989), pp. 40–91.
P. N. Brown and Y. Saad,Hybrid Krylov methods for nonlinear systems of equations, SIAM J. Sci. Stat. Comput., 11 (1990), pp. 450–481.
S. C. Eisenstat, H. C. Elman and M. H. Schultz,Variational iterative methods for nonsymmetric systems of linear equations, SIAM J. Numer. Anal., 20 (1983), pp. 345–357.
H. C. Elman,Iterative Methods for Large Sparse Nonsymmetric Systems of Linear Equations, Ph.D. Thesis, Yale University, 1982.
H. C. Elman, Y. Saad and P. E. Saylor,A hybrid Chebyshev Krylov subspace algorithm for solving nonsymmetric systems of linear equations, SIAM J. Sci. Stat. Comput., 7 (1986), pp. 840–855.
G. W. Gear and Y. Saad,Iterative solution of linear equations in ODE codes, SIAM J. Sci. Stat. Comput., 4 (1983), pp. 583–601.
J. F. Grcar,Operator coefficient methods for linear equations, Technical Report Sand89-8691, Sandia National Laboratories, New Mexico 87185 and Livermore, California 94551, 1989.
D. Ho,Tchebychev acceleration technique for large scale nonsymmetric matrices, Numer. Math., 56 (1990), pp. 721–734.
Z. Jia and X. Xiong,The convergence of generalized Lanczos methods for solving the eigenproblems of large unsymmetric matrices (in Chinese), J. Dalian Univ. of Tech., 30 (1990), pp. 1–7.
Z. Jia,The convergence of generalized Lanczos methods for large unsymmetric eigenproblems, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 843–862.
Z. Jia,Generalized block Lanczos methods for large unsymmetric eigenproblems, Invited presentation at the Lanczos Centenary International Conference, Dec. 12–17, 1993, Raleigh, and submitted for publication.
Z. Jia,Some numerical methods for large unsymmetric eigenproblems, Ph.D. Thesis, University of Bielefeld, 1994.
Z. Jia,On IGMRES: an incomplete generalized minimal residual method for large unsymmetric linear systems, Preprint 94-047, University of Bielefeld, 1994.
Z. Jia,On IOM(q): an incomplete orthogonalization method for large unsymmetric linear systems, Preprint 94-051, University of Bielefeld, 1994.
R. B. Morgan,Restarting GMRES for large nonsymmetric systems of linear equations, Preprint, University of Missouri, 1992.
Y. Saad,Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices, Linear Algebra Appl., 34 (1980), pp. 269–295.
Y. Saad,Krylov subspace methods for solving large unsymmetric linear systems, Math. Comput., 37 (1981), pp. 105–126.
Y. Saad,The biorthogonalization Lanczos algorithm and other unsymmetric systems, SIAM J. Numer. Anal., 19 (1982), pp. 485–506.
Y. Saad,Projection methods for solving large sparse eigenvalue problems, Matrix Pencils, Proceedings Pitea Havsbad, B. Kågström and A. Ruhe, eds., Lecture Notes in Mathematics, No. 973, pp. 121–144, Springer-Verlag, Berlin, 1983.
Y. Saad,Practical use of some Krylov subspace methods for solving indefinite and unsymmetric linear systems, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 203–228.
Y. Saad,Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems, Math. Comput., 42 (1985), pp. 567–588.
Y. Saad and M. H. Schultz,GMRES: a generalized minimum residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput., (1986), pp. 856–869.
M. Sadkane,A block Arnoldi-Chebyshev method for computing the leading eigen-pairs of large sparse unsymmetric matrices, Numer. Math., 64 (1993), pp. 181–194.
M. Sadkane,Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems, Numer. Math., 64 (1993), pp. 195–212.
D. Sorensen,Implicit application of polynomials filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357–385.
G. W. Stewart and J-G. Sun,Matrix Perturbation Theory, Academic Press, Boston, 1990.
J. H. Wilkinson,The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, 1965.
Author information
Authors and Affiliations
Additional information
This work was supported in part by the Graduiertenkolleg at the University of Bielefeld, Germany.
Rights and permissions
About this article
Cite this article
Jia, Z. A block incomplete orthogonalization method for large nonsymmetric eigenproblems. Bit Numer Math 35, 516–539 (1995). https://doi.org/10.1007/BF01739824
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01739824