A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials

From MaRDI portal
Publication:3247407

DOI10.1137/0105004zbMath0080.10701OpenAlexW1978274896MaRDI QIDQ3247407

Richard S. Varga

Publication date: 1957

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0105004




Related Items (47)

A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equationsError Bounds for the SSOR Semi-Iterative MethodA historical overview of iterative methodsIs the optimal \(\omega\) best for the SOR iteration method?On the solution of singular linear systems of algebraic equations by semiiterative methodsOn the convergence of the SAOR method and the error bounds for its accelerationOn maximum modulus of polynomials with restricted zerosAdaptive procedure for estimating parameters for the nonsymmetric Tchebychev iterationOn semiiterative methods generated by Faber polynomialsConvergence properties of the symmetric and unsymmetric successive overrelaxation methods and related methodsRelaxation parameters and composite refinement techniquesBernstein Type Inequalities Concerning Growth of PolynomialsOn sharpening and generalization of Rivlin's inequalityUnnamed ItemOn the growth of a polynomial with constraints on zerosExtension of some Bernstein-type inequalities to the polar derivative of a polynomialKrylov Subspace Methods for Solving Large Unsymmetric Linear SystemsInequalities for meromorphic functions not vanishing outside the diskImprovement and generalization of polynomial inequality of T. J. RivlinOn the acceleration of the preconditioned simultaneous displacement methodInequalities for polynomials satisfying p(z) ≡ znp(1/z)Unnamed ItemUnnamed ItemOn sharpening of a Theorem of T. J. RivlinThe extrapolated gauss-seidel plus semi-iterative method for generalized consistently ordered matricesParallel diagonally implicit Runge-Kutta-Nyström methodsInequalities for a polynomial and its derivativeOn the Generalized Overrelaxation Method for Operation EquationsInequalities for a polynomial and its derivativeUnnamed ItemCoupled Harmonic Equations, SOR, and Chebyshev AccelerationOn the maximum modulus of polynomialsOptimal semi-iterative methods for complex SOR with results from potential theoryGeneralizations of some Bernstein-type inequalities for the polar derivative of a polynomialOn the accelerated SSOR method for solving large linear systemsThe Tchebychev iteration for nonsymmetric linear systemsContinuation and optimization of the Born expansion in nonrelativistic quantum theoryOn generalizations of the theory of consistent orderings for successive overrelaxation methodsSecond-degree iterative methods for the solution of large linear systemsChebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, IIInequalities for PolynomialsIterative methods for linear systems of equations: A brief historical journeyParallel block pc methods with rkn-type correctors and adams-type predictorsThe convergence of Krylov subspace methods for large unsymmetric linear systemsRichardson's iteration for nonsymmetric matricesA study of semiiterative methods for nonsymmetric systems of linear equationsInequalities concerning the rate of growth of polynomials




This page was built for publication: A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials