A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials
From MaRDI portal
Cited in
(51)- Richardson's iteration for nonsymmetric matrices
- A study of semiiterative methods for nonsymmetric systems of linear equations
- On the solution of singular linear systems of algebraic equations by semiiterative methods
- On the convergence of the SAOR method and the error bounds for its acceleration
- On semiiterative methods generated by Faber polynomials
- On the acceleration of the preconditioned simultaneous displacement method
- Parallel diagonally implicit Runge-Kutta-Nyström methods
- On the accelerated SSOR method for solving large linear systems
- The Tchebychev iteration for nonsymmetric linear systems
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
- A historical overview of iterative methods
- Generalizations of some Bernstein-type inequalities for the polar derivative of a polynomial
- On maximum modulus of polynomials with restricted zeros
- Is the optimal best for the SOR iteration method?
- Optimal semi-iterative methods for complex SOR with results from potential theory
- Continuation and optimization of the Born expansion in nonrelativistic quantum theory
- On generalizations of the theory of consistent orderings for successive overrelaxation methods
- Second-degree iterative methods for the solution of large linear systems
- Inequalities concerning the rate of growth of polynomials
- Relaxation parameters and composite refinement techniques
- Inequalities for polynomials satisfying p(z) ≡ znp(1/z)
- Inequalities for Polynomials
- Error Bounds for the SSOR Semi-Iterative Method
- The extrapolated gauss-seidel plus semi-iterative method for generalized consistently ordered matrices
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- The convergence of Krylov subspace methods for large unsymmetric linear systems
- Parallel block pc methods with rkn-type correctors and adams-type predictors∗
- On sharpening of a theorem of T. J. Rivlin
- Iterative methods for linear systems of equations: a brief historical journey
- On sharpening and generalization of Rivlin's inequality
- On the Generalized Overrelaxation Method for Operation Equations
- Bernstein type inequalities concerning growth of polynomials
- scientific article; zbMATH DE number 3331879 (Why is no real title available?)
- Convergence properties of the symmetric and unsymmetric successive overrelaxation methods and related methods
- Coupled Harmonic Equations, SOR, and Chebyshev Acceleration
- scientific article; zbMATH DE number 7589372 (Why is no real title available?)
- On the maximum modulus of polynomials
- Inequalities for a polynomial and its derivative
- Inequalities for a polynomial and its derivative
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- On the growth of a polynomial with constraints on zeros
- Extension of some Bernstein-type inequalities to the polar derivative of a polynomial
- Improvement and generalization of polynomial inequality due to Rivlin
- Inequalities for meromorphic functions not vanishing outside the disk
- Improvement and generalization of polynomial inequality of T. J. Rivlin
- On extensions and generalizations of Rivlin's inequality
- Relative growth of a complex polynomial with restricted zeros
- On the sharpening of an inequality due to Rivlin
- New extensions of the well-known Rivlin's onequality
- Sharper upper bounds on maximum modulus for rational functions
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
This page was built for publication: A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3247407)