Operator trigonometry of preconditioning, domain decomposition, sparse approximate inverses, successive overrelaxation, minimum residual schemes
Karl Gustafson · Numerical Linear Algebra with Applications · 2002
Abstract This paper extends the relationship between the author's operator trigonometry and convergence rates and other properties of important iterative methods. A new interesting trigonometric preconditioning lemma is given. The general relationship between domain decomposition methods and the operator trigonometry is established. A new basic conceptual link between sparse approximate inverse algorithms and the operator trigonometry is observed. A new underlying fundamental inherent trigonometry of the classical successive over‐relaxation scheme is exposed. Some improved trigonometric interpretations of minimum residual schemes are mentioned. Copyright © 2002 John Wiley & Sons, Ltd.