Abstract:

Based on the classic truncated Newton algorithm for nonlinear optimization, a new subspace accelerated truncated Newton algorithm is presented for large-scale symmetric sparse extreme eigenvalue problems. The convergence properties are proved and numerical experiments are done. The numerical results match the convergence analysis,which showing the new algorithm is effective.

Key words: symmetric matrix; eigenvalue; eigen-vector; truncated Newton method; subspace accelerated method