Abstract
<p style='text-indent:20px;'>An efficiently preconditioned Newton-like method for the computation of the eigenpairs of large and sparse nonsymmetric matrices is proposed. A sequence of preconditioners based on the Broyden-type rank-one update formula are constructed for the solution of the linearized Newton system. The properties of the preconditioned matrix are investigated. Numerical results are given which reveal that the new proposed algorithms are efficient.</p>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Control and Optimization,Algebra and Number Theory,Applied Mathematics,Control and Optimization,Algebra and Number Theory
Reference16 articles.
1. Z. Z. Bai, G. H. Golub.Accelerated Hermitian and skew-Hermitian splitting methods for saddle-point problems, SIAM J. Numer. Anal., 27 (2007), 1-23.
2. Z. Z. Bai, C. Q. Miao.On local quadratic convergence of inexact simplified Jacobi-Davidson method, Linear Algebra Appl., 520 (2017), 215-241.
3. K. J. Bathe, Finite Element Procedures in Engineering Analysis, Prentice-Hall, Englewood Cliffs, 1982.
4. M. Benzi, G. H. Golub, J. Liesen.Numerical solution of saddle point problems, Acta Numer., 14 (2005), 1-137.
5. L. Bergamaschi, R. Bru, A. Martinez, M. Putti.Quasi-Newton preconditioners for the inexact Newton method, Electronic Transactions on Numerical Analysis, 23 (2006), 76-87.