On the Convergence of a New Rayleigh Quotient Method with Applicationsto Large Eigenproblems
暂无分享,去创建一个
[1] Gerard L. G. Sleijpen,et al. Jacobi-Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils , 1998, SIAM J. Sci. Comput..
[2] Zhongxiao Jia,et al. A refined iterative algorithm based on the block arnoldi process for large unsymmetric eigenproblems , 1998 .
[3] Ronald B. Morgan,et al. On restarting the Arnoldi method for large nonsymmetric eigenvalue problems , 1996, Math. Comput..
[4] Zhongxiao Jia,et al. The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems , 1995, SIAM J. Matrix Anal. Appl..
[5] Danny C. Sorensen,et al. Implicit Application of Polynomial Filters in a k-Step Arnoldi Method , 1992, SIAM J. Matrix Anal. Appl..
[6] V. N. Bogaevski,et al. Matrix Perturbation Theory , 1991 .
[7] G. W. Stewart,et al. Computable Error Bounds for Aggregated Markov Chains , 1983, JACM.
[8] A. M. Ostrowski,et al. On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. III , 1959 .