The optimal is not best for the SOR iteration method

DOI10.1016/0024-3795(91)90405-LMaRDI QIDQ808162zbMATH OpenOpenAlexFDO

Authors Jerome Dancis

Publication date 1991

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(91)90405-l

zbMATH Keywords

numerical resultssuccessive overrelaxationpolynomial accelerationsuboptimal relaxation factor

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Recommendations

• Is the optimal \(\omega\) best for the SOR iteration method?
• Diagonalizing the Adaptive SOR Iteration Method
• scientific article; zbMATH DE number 672005
• Brief derivation for optimal iteration parameters in the generalized SOR method
• A practical asymptotical optimal SOR method

Cites work

• scientific article; zbMATH DE number 3720254 (Why is no real title available?)
• scientific article; zbMATH DE number 3325215 (Why is no real title available?)
• Diagonalizing the Adaptive SOR Iteration Method

Cited in

(7)

• A review of Padé methods for the acceleration of convergence of a sequence of vectors
• A practical asymptotical optimal SOR method
• Optimal semi-iterative methods for complex SOR with results from potential theory
• The rise and fall of the vector epsilon algorithm
• Successive overrelaxation (SOR) and related methods
• Is the optimal \(\omega\) best for the SOR iteration method?
• scientific article; zbMATH DE number 672005 (Why is no real title available?)

This page was built for publication: The optimal \(\omega\) is not best for the SOR iteration method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808162)