A new method for accelerating Arnoldi algorithms for large scale eigenproblems (Q1037802): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56457287, #quickstatements; #temporary_batch_1712101902020
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The principle of minimized iterations in the solution of the matrix eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrix test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of algebraic systems arising from fourth‐order compact discretizations of convection‐diffusion equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicitly Restarted Arnoldi Methods and Subspace Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: ARPACK Users' Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restarting the Arnoldi method for large nonsymmetric eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES with Deflated Restarting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4814499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Application of Polynomial Filters in a <i>k</i>-Step Arnoldi Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods / rank
 
Normal rank

Latest revision as of 05:06, 2 July 2024

scientific article
Language Label Description Also known as
English
A new method for accelerating Arnoldi algorithms for large scale eigenproblems
scientific article

    Statements

    A new method for accelerating Arnoldi algorithms for large scale eigenproblems (English)
    0 references
    16 November 2009
    0 references
    0 references
    dynamic switching
    0 references
    convergence acceleration
    0 references
    Krylov subspace method
    0 references
    implicitly restarted Arnoldi algorithm
    0 references
    large sparse nonsymmetric eigenvalue problems
    0 references
    numerical results
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references