Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
type: Item
instance of: scholarly article
title: Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
zbMATH Open document ID: 0883.65030
DOI: 10.1016/S0377-0427(97)00046-0
author: V. Heuveline
author: M. Sadkane
published in: Journal of Computational and Applied Mathematics
publication date: 1998-03-01T00:00:00Z
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 1084079
zbMATH Keywords: parallel computation
zbMATH Keywords: Krylov subspace
zbMATH Keywords: Arnoldi's method
zbMATH Keywords: Faber iterations
zbMATH Keywords: best uniform approximation
zbMATH Keywords: algorithm
zbMATH Keywords: large non-Hermitian eigenvalue problems
zbMATH Keywords: performance
zbMATH Keywords: machine Paragon
zbMATH Keywords: Chebyshev acceleration
describes a project that uses: eigs
describes a project that uses: COCA
describes a project that uses: IRAM
describes a project that uses: LAPACK
describes a project that uses: Harwell-Boeing sparse matrix collection
MaRDI profile type: Publication
cites work: Q4003886
cites work: Linear Chebyshev Approximation of Complex-Valued Functions
cites work: Q3723055
cites work: Sparse matrix test problems
cites work: Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
cites work: Chebyshev polynomials are not always optimal
cites work: An algorithm for complex linear approximation based on semi-infinite programming
cites work: A New Method for Chebyshev Approximation of Complex-Valued Functions
cites work: Q3359644
cites work: Complex Chebyshev Polynomials on Circular Sectors with Degree Six or Less
cites work: Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems
cites work: Arnoldi-Faber method for large non Hermitian eigenvalue problems
cites work: Tchebychev acceleration technique for large scale nonsymmetric matrices
cites work: Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices
cites work: Large-scale complex eigenvalue problems
cites work: Q4057460
cites work: Implicitly restarted Arnoldi methods and subspace iteration
cites work: An approach to nonlinear programming
cites work: The Tchebychev iteration for nonsymmetric linear systems
cites work: Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
cites work: On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
cites work: Q3900444
cites work: Some outer approximation methods for semi-infinite optimization problems
cites work: A Unified Approach to Certain Problems of Approximation and Minimization
cites work: Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
cites work: Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
cites work: Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
cites work: Numerical methods for large eigenvalue problems
cites work: A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
cites work: An optimum iterative method for solving any linear system with a square matrix
cites work: Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
cites work: Q4692259
cites work: A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
cites work: Q3978912
cites work: Conjugate gradient-like solution algorithms for the mixed finite element approximation of the biharmonic equation, applied to plate bending problems
cites work: Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
Recommended article: Parallel iterative refinement in polynomial eigenvalue problems
Recommended article: On parallelizable eigensolvers
Recommended article: A Parallel Implementation of the Trace Minimization Eigensolver
Recommended article: Parallel computation of determinants of matrices with polynomial entries
Recommended article: Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc
Recommended article: Q3150790
Recommended article: Q4375664
Recommended article: Q4251967
Recommended article: A Parallel Algorithm for the Nonsymmetric Eigenvalue Problem
Recommended article: Exponentially convergent parallel algorithm for nonlinear eigenvalue problems
description: scientific article; zbMATH DE number 1084079