arXiv · physics/0102066
A simple iterative algorithm for generating selected eigenspaces of large matrices
Abstract
We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its efficiency by evaluating computer storage and time requirements and by a few numerical tests.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
F. Andreozzi, A. Porrino, N. Lo Iudice. 2002-02-27. A simple iterative algorithm for generating selected eigenspaces of large matrices. https://doi.org/10.1088/0305-4470%2F35%2F5%2F101
Cite the original work for its findings. Save a collection to share your selection of sources.