𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized eigenvalue problems: Lanczos algorithm with a recursive partitioning method

✍ Scribed by S. Sundar; B.K. Bhagavan

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
608 KB
Volume
39
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computing eigenvalues: Lanczos algorithm
Computing eigenvalues: Lanczos algorithm with a new recursive partitioning method
✍ S. Sundar; B.K. Bhagavan; A. Datta πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 488 KB

The Lanczos algorithm with a new recursive partitioning method to compute the eigenvalues, in a given specified interval, is presented in this paper. Comparisons have been made respecting the numerical results as well as the CPU-time with that of the Sturm sequence-bisection method.

A Chebyshev Polynomial Interval-Searchin
A Chebyshev Polynomial Interval-Searching Method ("Lanczos Economization") for Solving a Nonlinear Equation with Application to the Nonlinear Eigenvalue Problem
✍ John P. Boyd πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 362 KB

To search a given real interval for roots, our algorithm is to replace \(f(\lambda)\) by \(f_{N}(\lambda)\), its \(N\)-term Chebyshev expansion on the search interval \(\lambda \in\left[\lambda_{\min }, \lambda_{\max }\right]\), and compute the roots of this proxy. This strategy is efficient if and

A general approach to one-step iterative
A general approach to one-step iterative methods with application to eigenvalue problems
✍ Steve F. McCormick πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 707 KB

This paper considers the problem of finding the zeros of an operator G on a Hilbert space subject to a constraint of the general form P(x) = x. Convergence theorems are given for a class of iterative methods and, using these results, we derive several techniques for solving eigenvalue problems, one