Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems

A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems The approximate eigenvectors or Ritz vectors obtained by the block Arnoldi method may converge very slowly and even fail to converge even if the approximate eigenvalues do. In order to improve the quality of the Ritz vectors, a modified strategy is proposed such that new approximate eigenvectors are certain combinations of the Ritz vectors and thewasted (m+1) th block basis vector and their corresponding residual norms are minimized in a certain sense. They can be cheaply computed by solving a few smallp-dimensional minimization problems. The resulting modifiedm-step block Arnoldi method is better than the standardm-step one in theory and cheaper than the standard (m+1)-step one. Based on this strategy, a modifiedm-step iterative block Arnoldi algorithm is presented. Numerical experiments are reported to show that the modifiedm-step algorithm is often considerably more efficient than the standard (m+1)-step iterative one. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems

Zhongxiao, Jia
Acta Mathematicae Applicatae Sinica , Volume 14 (4) – Jul 4, 2007
Download PDF
8 pages

Loading next page...
 
/lp/springer-journals/a-variation-on-the-block-arnoldi-method-for-large-unsymmetric-matrix-92p17ZkX0m
Publisher
Springer Journals
Copyright
Copyright © 1998 by Science Press
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02683827
Publisher site
See Article on Publisher Site

Abstract

The approximate eigenvectors or Ritz vectors obtained by the block Arnoldi method may converge very slowly and even fail to converge even if the approximate eigenvalues do. In order to improve the quality of the Ritz vectors, a modified strategy is proposed such that new approximate eigenvectors are certain combinations of the Ritz vectors and thewasted (m+1) th block basis vector and their corresponding residual norms are minimized in a certain sense. They can be cheaply computed by solving a few smallp-dimensional minimization problems. The resulting modifiedm-step block Arnoldi method is better than the standardm-step one in theory and cheaper than the standard (m+1)-step one. Based on this strategy, a modifiedm-step iterative block Arnoldi algorithm is presented. Numerical experiments are reported to show that the modifiedm-step algorithm is often considerably more efficient than the standard (m+1)-step iterative one.

Journal

Acta Mathematicae Applicatae Sinica – Springer Journals

Published: Jul 4, 2007

References

  • The Principle of Minimized Iterations in the Solution of the Matrix Eigenvalue Problem
    Arnoldi, W.E.
  • Variations on Arnoldi's Method for Computing Eigenelements of Large Unsymmetric Matrices
    Saad, Y.
  • Some Numerical Methods for Large Unsymmetric Eigenproblems
    Jia, Z.
  • A Block Arnoldi-Chebyshev Method for Computing the Leading Eigenpairs of Large Sparse Unsymmetric Matrices
    Sadkane, M.
  • Block Arnoldi and Davidson Methods for Unsymmetric Large Eigenvalue Problems
    Sadkane, M.
  • The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
    Jia, Z.
  • A Block Incomplete Orthogonalization Method for Large Nonsymmetric Eigenproblems
    Jia, Z.
  • Refined Iterative Algorithms Based on Arnoldi's Process for Large Unsymmetric Eigenproblems
    Jia, Z.
  • A Refined Iterative Algorithm Based on the Block Arnoldi Process for Large Unsymmetric Eigenproblems
    Jia, Z.
  • Rational Krylov Algorithms for Nonsymmetric Eigenvalue Problems. II: Matrix Pairs
    Ruhe, A.
  • The Rational Krylov Algorithm for Nonsymmetric Eigenvalue Problems. III: Complex Shifts for Real Matrices
    Ruhe, A.
  • Matrix Pencils
    Saad, Y.
  • Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
    Saad, Y.
  • Numerical Solution of Large Nonsymmetric Eigenvalue Problems
    Saad, Y.
  • Implicit Application of Polynomial Filters in ak-step Arnoldi Method
    Sorensen, D.C.
  • Proceedings of the 2nd Symposium on High Performance Computing
    Chatelin, F.; Godet-Thobie, S.