Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
DOI10.1016/S0377-0427(97)00046-0zbMATH Open0883.65030MaRDI QIDQ1372035FDOQ1372035
Authors: V. Heuveline, M. Sadkane 
Publication date: 1 March 1998
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Recommendations
- Parallel iterative refinement in polynomial eigenvalue problems.
- On parallelizable eigensolvers
- A Parallel Implementation of the Trace Minimization Eigensolver
- Parallel computation of determinants of matrices with polynomial entries
- Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc
- scientific article; zbMATH DE number 1817673
- scientific article; zbMATH DE number 1113885
- scientific article; zbMATH DE number 1305039
- A Parallel Algorithm for the Nonsymmetric Eigenvalue Problem
- Exponentially convergent parallel algorithm for nonlinear eigenvalue problems
performancealgorithmparallel computationKrylov subspacebest uniform approximationArnoldi's methodChebyshev accelerationFaber iterationslarge non-Hermitian eigenvalue problemsmachine Paragon
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- Title not available (Why is that?)
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- An approach to nonlinear programming
- Numerical methods for large eigenvalue problems
- A New Method for Chebyshev Approximation of Complex-Valued Functions
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- An optimum iterative method for solving any linear system with a square matrix
- Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- Some outer approximation methods for semi-infinite optimization problems
- Implicitly restarted Arnoldi methods and subspace iteration
- The Tchebychev iteration for nonsymmetric linear systems
- Large-scale complex eigenvalue problems
- Arnoldi-Faber method for large non Hermitian eigenvalue problems
- Chebyshev polynomials are not always optimal
- A Unified Approach to Certain Problems of Approximation and Minimization
- Sparse matrix test problems
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- Title not available (Why is that?)
- An algorithm for complex linear approximation based on semi-infinite programming
- Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices
- Title not available (Why is that?)
- Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
- Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
- Complex Chebyshev Polynomials on Circular Sectors with Degree Six or Less
- Linear Chebyshev Approximation of Complex-Valued Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Chebyshev acceleration techniques for large complex 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
Cited In (1)
Uses Software
This page was built for publication: Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372035)
