A simple iterative algorithm for generating selected eigenspaces of large matrices
F. Andreozzi, A. Porrino, N. Lo Iudice
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.
Create a lesson
Related papers
Deriving Schwarzschild and Kerr from the Einstein Equivalence Principle
G. Alencar
Binary Classifier Wire-Resistance Attack on KLJN: Bayes-Optimal Limit at a Narrow Resistor Gap
Mehmet Yildirim, Fahrettin Ay, Laszlo B. Kish
On the notion of kinetic energy in a spacetime of maximal proper acceleration
Ricardo Gallego Torromé
Is MOND an effect of cosmic frame-dragging à la Mach?
Manuel Uruena Palomo
Partially Thermalized eV-Scale Sterile Neutrinos in Dynamical Dark Energy and Non-Flat Cosmologies
Gopal Kashyap, Kanhaiya Lal Pandey
Metric Variation of the Energy-Momentum Tensor of a Perfect Fluid and Its Applications to Cosmology and Neutron Stars
Pham Van Ky