On Transformations of Graded Matrices, with Applications to Stiff ODE's.
On worst-case GMRES, ideal GMRES, and the polynomial numerical hull of a Jordan block.
Optimal Successive Overrelaxation Iterative Methods fo P-Cyclic Matrices.
Optimality Relationships for p-Cyclic SOR.
Optimizing tensor product computations in stochastic automata networks
Optimum Stationary and Nonstationary Iterative Methods for the Solution of Singular Linear Systems.
Orthogonal polynomials and the Lanczos method
Lanczos method for solving a system of linear equations is well known. It is derived from a generalization of the method of moments and one of its main interests is that it provides the exact answer in at most n steps where n is the dimension of the system. Lanczos method can be implemented via several recursive algorithms known as Orthodir, Orthomin, Orthores, Biconjugate gradient,... In this paper, we show that all these procedures can be explained within the framework of formal orthogonal polynomials....