Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
From MaRDI portal
Publication:3756405
Recommendations
- scientific article; zbMATH DE number 46994
- Remarks on polynomial methods for solving systems of linear algebraic equations
- A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 2016596
- scientific article; zbMATH DE number 811973
Cited in
(24)- A distributed and parallel unite and conquer method to solve sequences of non-Hermitian linear systems
- Polynomial preconditioning for the action of the matrix square root and inverse square root
- Polynomial approximation of functions of matrices and applications
- On the generation of Krylov subspace bases
- Iterative solution of linear systems in the 20th century
- Remarks on polynomial methods for solving systems of linear algebraic equations
- Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- Region-dependent optimal m-stage Runge-Kutta schemes for solving a class of nonsymmetric linear systems
- A polynomial preconditioner for the GMRES algorithm
- Optimal one-stage and two-stage schemes for steady state solutions of hyperbolic equations
- Numerical solution of large nonsymmetric eigenvalue problems
- Locally optimal and heavy ball GMRES methods
- Matrix-free polynomial-based nonlinear least squares optimized preconditioning and its application to discontinuous Galerkin discretizations of the Euler equations
- Polynomial preconditioned Arnoldi with stability control
- Solving the three-dimensional high-frequency Helmholtz equation using contour integration and polynomial preconditioning
- Polynomial Preconditioned GMRES and GMRES-DR
- Efficient time integration of Navier-Stokes equations
- A hybrid GMRES/LS-Arnoldi method to accelerate the parallel solution of linear systems
- An optimum iterative method for solving any linear system with a square matrix
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
- On the condition number of some Gram matrices arising from least squares approximation in the complex plane
- The use of the CADNA library for validating the numerical results of the hybrid GMRES algorithm
This page was built for publication: Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3756405)
