Computing for Eigenpairs on Globally Convergent Iterative Method for Hermitian Matrices
暂无分享,去创建一个
Let A = A* ∈ Mn and ${\cal L} = \{ (U_k, \lambda_k)|\; U_k \in {\mathbb{C}}^n, ||U_k|| = 1$ and λk∈ℝ } for k = 1,⋯,n be the set of eigenpairs of A. In this paper we develop a modified Newton method that converges to a point in $\cal L$ starting from any point in a compact subset ${\cal D} \subseteq {\mathbb{C}}^{n+1}, {\cal L} \subseteq {\cal D}\!$.
[1] Karabi Datta,et al. Parametrized Newton’s Iteration for Computing an Eigenpair of a Real Symmetric Matrix in an Interval , 2003 .
[2] J. Ortega. Numerical Analysis: A Second Course , 1974 .
[3] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[4] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.