Eigendecomposition algorithms solving sequentially quadratic systems by Newton method
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we design new algorithms for eigendecomposition. With the help of the Newton iterative method, we solve a nonlinear quadratic system whose solution is equal to an eigenvector on a hyperplane. By choosing normal vector of the hyperplane in the orthogonal complement of the space spanned by already obtained eigenvectors, all eigenpairs are sequentially obtained by solving the quadratic systems.
- The Japan Society for Industrial and Applied Mathematicsの論文
著者
-
Kondo Koichi
Faculty Of Engineering Gifu University
-
Iwasaki Masashi
Faculty Of Life And Environmental Sciences Kyoto Prefectural University
-
Yasukouchi Shinji
Faculty of Science and Engineering, Doshisha University
関連論文
- Discrete hungry integrable systems related to matrix eigenvalue and their local analysis by center manifold theory (Expansion of Integrable Systems)
- ENVIRONMENTAL UNDERSTANDING USING THE SOS FOR SECURITY SYSTEMS(International Workshop on Advanced Image Technology 2007)
- ENVIRONMENTAL UNDERSTANDING USING THE SOS FOR SECURITY SYSTEMS
- On the qd-type discrete hungry Lotka-Volterra system and its application to the matrix eigenvalue algorithm
- Synthesis of Carboxylic Acid Derivatives of Adenine and Theophylline
- Mixed double-multiple precision version of hyperplane constrained method for singular value decomposition
- Eigendecomposition algorithms solving sequentially quadratic systems by Newton method
- On the convergence of the V-type hyperplane constrained method for singular value decomposition