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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: eigs / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: COCA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: IRAM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LAPACK / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Harwell-Boeing sparse matrix collection / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Chebyshev Approximation of Complex-Valued Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3723055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrix test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev polynomials are not always optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for complex linear approximation based on semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Method for Chebyshev Approximation of Complex-Valued Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex Chebyshev Polynomials on Circular Sectors with Degree Six or Less / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arnoldi-Faber method for large non Hermitian eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tchebychev acceleration technique for large scale nonsymmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale complex eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057460 / 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: An approach to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tchebychev iteration for nonsymmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration / 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: Q3900444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some outer approximation methods for semi-infinite optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Certain Problems of Approximation and Minimization / 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: Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimum iterative method for solving any linear system with a square matrix / 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: Q4692259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3978912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate gradient-like solution algorithms for the mixed finite element approximation of the biharmonic equation, applied to plate bending problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:55, 27 May 2024

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