Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
From MaRDI portal
Publication:1372035
DOI10.1016/S0377-0427(97)00046-0zbMath0883.65030MaRDI QIDQ1372035
Vincent Heuveline, Miloud Sadkane
Publication date: 1 March 1998
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
performancealgorithmparallel computationKrylov subspacebest uniform approximationArnoldi's methodChebyshev accelerationFaber iterationslarge non-Hermitian eigenvalue problemsmachine Paragon
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- An optimum iterative method for solving any linear system with a square matrix
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Chebyshev polynomials are not always optimal
- The Tchebychev iteration for nonsymmetric linear systems
- Large-scale complex eigenvalue problems
- An algorithm for complex linear approximation based on semi-infinite programming
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- Some outer approximation methods for semi-infinite optimization problems
- Arnoldi-Faber method for large non Hermitian eigenvalue problems
- Tchebychev acceleration technique for large scale nonsymmetric matrices
- Conjugate gradient-like solution algorithms for the mixed finite element approximation of the biharmonic equation, applied to plate bending problems
- Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems
- An approach to nonlinear programming
- Implicitly Restarted Arnoldi Methods and Subspace Iteration
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices
- Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
- Sparse matrix test problems
- A Unified Approach to Certain Problems of Approximation and Minimization
- A New Method for Chebyshev Approximation of Complex-Valued Functions
- Complex Chebyshev Polynomials on Circular Sectors with Degree Six or Less
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
- Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
- Linear Chebyshev Approximation of Complex-Valued Functions
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
