An adaptive block Lanczos algorithm (Q1921322): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: na1 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding breakdown and near-breakdown in Lanczos type algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier Analysis of Iterative Methods for Elliptic pr / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3868672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of a refined error bound when updating eigenvalues of tridiagonals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lanczos Algorithm with Selective Orthogonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Estimating the Largest Eigenvalue with the Lanczos Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lanczos Algorithm With Partial Reorthogonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convergence behavior of Ritz values in the presence of close eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convergence Analysis for Nonsymmetric Lanczos Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02141743 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015768950 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:32, 30 July 2024

scientific article
Language Label Description Also known as
English
An adaptive block Lanczos algorithm
scientific article

    Statements

    An adaptive block Lanczos algorithm (English)
    0 references
    0 references
    7 April 1997
    0 references
    The paper is devoted to a generalization of the block Lanczos algorithm for a symmetric matrix, which allows the block size to be increased during the iterative process. In particular, the algorithm can be implemented with the block size chosen adaptively according to the clustering of Ritz values. The author considers an approach that is based on a single run of the algorithm. The adaptive algorithm, which is proposed, tests the clustering of Ritz values at each step and increases the block size when it is found inadequate. In this way all multiple and clustered eigenvalues can be found and the difficulty of choosing the block size is eased. Residual bounds for clustered eigenvalues are given. Numerical examples illustrate the adaptive algorithm.
    0 references
    numerical examples
    0 references
    block Lanczos algorithm
    0 references
    symmetric matrix
    0 references
    Ritz values
    0 references
    adaptive algorithm
    0 references
    clustered eigenvalues
    0 references

    Identifiers