An efficient nonsymmetric Lanczos method on parallel vector computers (Q1200180): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: s-step iterative methods for symmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrix calculations on the CRAY-2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of Lanczos-like algorithms implemented on parallel computers / 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: Q3968381 / 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: The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Krylov Subspace Methods on Supercomputers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leapfrog variants of iterative methods for linear algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / rank
 
Normal rank

Latest revision as of 12:56, 17 May 2024

scientific article
Language Label Description Also known as
English
An efficient nonsymmetric Lanczos method on parallel vector computers
scientific article

    Statements

    An efficient nonsymmetric Lanczos method on parallel vector computers (English)
    0 references
    0 references
    17 January 1993
    0 references
    The purpose is to reduce the number of synchronization points, when executing the nonsymmetric Lanczos algorithm on a shared memory parallel computer. This is effected by doing the same operations as in \(s\)-step look ahead Lanczos every \(s\)-th iteration. Break down can then occur only every \(s\)-th step, and running time gets shorter on an \(s\)-processor parallel Cray2 computer.
    0 references
    0 references
    0 references
    0 references
    0 references
    biorthogonal
    0 references
    \(s\)-step
    0 references
    breakdown
    0 references
    conditions reduction
    0 references
    nonsymmetric Lanczos algorithm
    0 references
    shared memory parallel computer
    0 references
    0 references