A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations

DOI10.1007/BF01388688zbMath0795.65015OpenAlexW1985014527MaRDI QIDQ1326402

Gerhard Starke, Richard S. Varga

Publication date: 8 September 1994

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133704

zbMATH Keywords

numerical resultsiterative methodlarge sparse nonsymmetric linear systemssparse systemhybrid Arnoldi-Faber method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Related Items

A generalized ADI iterative method, Preconditioned Galerkin and minimal residual methods for solving Sylvester equations, Conformal Mapping via a Density Correspondence for the Double-Layer Potential, On the best linear approximation of holomorphic functions, The degree of approximation by polynomials on some disjoint intervals in the complex plane, Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems, A note on the tau-method approximations for the Bessel functions \(Y_ 0(z)\) and \(Y_ 1(z)\), A parallel Monte Carlo method for solving electromagnetic scattering in clusters of dielectric objects, An explicit exponential integrator based on Faber polynomials and its application to seismic wave modeling, On the generation of Krylov subspace bases, GMRES algorithms over 35 years, A NEW VERSION OF THE SMITH METHOD FOR SOLVING SYLVESTER EQUATION AND DISCRETE-TIME SYLVESTER EQUATION, A strategy for detecting extreme eigenvalues bounding gaps in the discrete spectrum of self-adjoint operators, Krylov-subspace methods for the Sylvester equation, Properties and examples of Faber-Walsh polynomials, An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK, THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES, An interpolatory approximation of the matrix exponential based on Faber polynomials, Wave packet propagation by the Faber polynomial approximation in electrodynamics of passive media, Convergence analysis of Krylov subspace methods, Approximation on disjoint intervals and its applicability to matrix preconditioning, The Faber Polynomials for Annular Sectors, Preconditioning the Helmholtz equation with the shifted Laplacian and Faber polynomials, Multigrid methods for convection-diffusion problems discretized by a monotone scheme, Symbolic and numerical computation on Bessel functions of complex argument and large magnitude, A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices, Experiments with Krylov subspace methods on a massively parallel computer, A priori error bounds on invariant subspace approximations by block Krylov subspaces

Uses Software

• CGS
• SCPACK

Cites Work

• Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
• Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
• Implementation of an adaptive algorithm for Richardson's method
• The near-best solution of a polynomial minimization problem by the Carathéodory-Fejér method
• A study of semiiterative methods for nonsymmetric systems of linear equations
• On semiiterative methods generated by Faber polynomials
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• Near-circularity of the error curve in complex Chebyshev approximation
• The analysis of k-step iterative methods for linear systems from summability theory
• Chebyshev polynomials are not always optimal
• Fields of values and iterative methods
• Konforme Abbildung und Fekete-Punkte
• On Faber polynomials and Faber expansions
• NOTE ON DEGREE OF APPROXIMATION TO ANALYTIC FUNCTIONS BY RATIONAL FUNCTIONS WITH PREASSIGNED POLES
• A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials
• On the Construction of Semi-Iterative Methods
• The use of Faber polynomials to solve systems of linear equations
• Computation of Faber Series With Application to Numerical Polynomial Approximation in the Complex Plane
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• On Hybrid Semi-Iterative Methods
• A Unified Approach to Certain Problems of Approximation and Minimization
• Numerical Computation of the Schwarz–Christoffel Transformation
• A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
• A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item