A study of semiiterative methods for nonsymmetric systems of linear equations

From MaRDI portal
Publication:1070763

DOI10.1007/BF01389454zbMath0585.65025OpenAlexW2019027232MaRDI QIDQ1070763

Richard S. Varga, Wilhelm Niethammer, Michael Eiermann

Publication date: 1985

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

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




Related Items (50)

A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equationsIs the optimal \(\omega\) best for the SOR iteration method?Iterative k-step methods for computing possibly repulsive fixed points in Banach spacesAn optimum iterative method for solving any linear system with a square matrixA stable Richardson iteration method for complex linear systemsThe convergence rate of the Chebyshev SIM under a perturbation of a complex line-segment spectrumQuasi-iteration methods of Chebyshev type for the approximate solution of operator equationsOn the solution of singular linear systems of algebraic equations by semiiterative methodsThe convergence of inexact Chebyshev and Richardson iterative methods for solving linear systemsAdaptive Richardson iteration based on Leja pointsA note on the tau-method approximations for the Bessel functions \(Y_ 0(z)\) and \(Y_ 1(z)\)An adaptive Richardson iteration method for indefinite linear systemsOn semiiterative methods generated by Faber polynomialsTensor Equivalents for Solution of Linear Systems: A Parallel AlgorithmOn the generation of Krylov subspace basesIterative methods for the Drazin inverse of a matrix with a complex spectrum.Preconditionings and splittings for rectangular systemsKrylov Subspace Solvers and PreconditionersOptimal successive overrelaxation iterative methods for \(p\)-cyclic matricesA parallelizable SOR-like method: Systems with plus-shaped and linear spectraIterative and Semi-Iterative Methods for Computing Stationary Probability Vectors of Markov OperatorsChebyshev polynomials for disjoint compact setsMatrices, moments, and rational quadratureProperties and examples of Faber-Walsh polynomialsAn adaptive method for solving nonsymmetric linear systems involving applications of SCPACKUnnamed ItemThe superiority of a new type (2,2)-step iterative method over the related Chebyshev methodTHE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIESAn interpolatory approximation of the matrix exponential based on Faber polynomialsOptimal semi-iterative methods for complex SOR with results from potential theoryOver- and underrelaxation for linear systems with weakly cyclic Jacobi matrices of index pOn some convergence results of the k-step iterative methodsIs a Chebyshev method optimal for an elliptic region also optimal for a nearly elliptic region?The Faber Polynomials for Annular SectorsAsynchronous Richardson iterations: theory and practiceStationary and almost stationary iterative (k,l)-step methods for linear and nonlinear systems of equationsRelaxation methods for non-Hermitian linear systemsPreconditioning the Helmholtz equation with the shifted Laplacian and Faber polynomialsAccelerating the convergence of power series of certain entire functionsSuccessive overrelaxation (SOR) and related methodsOn the use of incomplete semiiterative methods for singular systems and applications in Markov chain modeling.On the constrained Chebyshev approximation problem on ellipsesA polynomial method based on Fejér points for the computation of functions of unsymmetric matricesOn parameter acceleration methods for saddle point problemsThe application of Leja points to Richardson iteration and polynomial preconditioningSome recent results on the modified SOR theoryOn polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matricesRevisiting \((k,\ell)\)-step methodsOn the spectrum of the SOR operator for symmetric positive definite matricesExperiments with Krylov subspace methods on a massively parallel computer



Cites Work


This page was built for publication: A study of semiiterative methods for nonsymmetric systems of linear equations