Answers are grounded in this paper and cite their sources.
While applying iterative methods to solve a linear algebraic system with matrix A, one often uses some preconditioner C. Two kinds of preconditioners are investigated: the "optimal" one, which minimizes \| C - A \|F, and the "superoptimal" one, which minimizes \| I - C- 1 A \|F. It is proved that both inherit nonsingularity and positive-definiteness from A. Fast algorithms for finding superoptimal preconditioners are suggested that take O(n² log ₂ n) operations in case of arbitrary A of order n, and only O(nlog ₂ n) operations in case of Toeplitz or doubly Toeplitz A.
No takes yet. Share an insight, caveat, or question.
Evgenij E. Tyrtyshnikov (1992) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: