Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
From MaRDI portal
(Redirected from Publication:1372035)
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
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3953483 (Why is no real title available?)
- scientific article; zbMATH DE number 3708924 (Why is no real title available?)
- scientific article; zbMATH DE number 19426 (Why is no real title available?)
- scientific article; zbMATH DE number 53686 (Why is no real title available?)
- scientific article; zbMATH DE number 3473169 (Why is no real title available?)
- scientific article; zbMATH DE number 194309 (Why is no real title available?)
- A New Method for Chebyshev Approximation of Complex-Valued Functions
- A Unified Approach to Certain Problems of Approximation and Minimization
- 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
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- An algorithm for complex linear approximation based on semi-infinite programming
- An approach to nonlinear programming
- An optimum iterative method for solving any linear system with a square matrix
- Arnoldi-Faber method for large non Hermitian eigenvalue problems
- Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems
- Chebyshev polynomials are not always optimal
- Complex Chebyshev Polynomials on Circular Sectors with Degree Six or Less
- Conjugate gradient-like solution algorithms for the mixed finite element approximation of the biharmonic equation, applied to plate bending problems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Implicitly restarted Arnoldi methods and subspace iteration
- Large-scale complex eigenvalue problems
- Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
- Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
- Linear Chebyshev Approximation of Complex-Valued Functions
- Numerical methods for large eigenvalue problems
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Some outer approximation methods for semi-infinite optimization problems
- Sparse matrix test problems
- Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
- Tchebychev acceleration technique for large scale nonsymmetric matrices
- The Tchebychev iteration for nonsymmetric linear systems
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Describes a project that uses
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)
