Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (Q1372035)

From MaRDI portal
Revision as of 18:55, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
scientific article

    Statements

    Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (English)
    0 references
    0 references
    0 references
    1 March 1998
    0 references
    parallel computation
    0 references
    Krylov subspace
    0 references
    Arnoldi's method
    0 references
    Faber iterations
    0 references
    best uniform approximation
    0 references
    algorithm
    0 references
    large non-Hermitian eigenvalue problems
    0 references
    performance
    0 references
    machine Paragon
    0 references
    Chebyshev acceleration
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers