50 likes | 185 Vues
This document explores a novel approach to developing a 3-term conjugate gradient (CG) method tailored for nonsymmetric real matrices, specifically focusing on SPD (symmetric positive definite) normal matrices. It discusses the properties of normal matrices and their implications for convergence in iterative methods. The inquiry extends to the conditions under which iterations can be executed through a 3-term recursion. The findings utilize insights from established works, including Faber and M, and address practical considerations for hermitian matrices as well.
E N D
TWO Directions Gene Golub: for the construction of a 3-term conjugate gradient like (CG) method for nonsymmetric real matrices SPD
Normal(1) Matrices • Remark: • A symmetric?? • A is normal matrix ???
A normal + A normal + If eigs not line wathen CG(3)=matrices for which iterations can be carried out using 3-term recursion Any idea??? Faber&M def F&M slides
A is the translation and rotation of a -self adjoint matrix A normal if A is B-self adjoint + Use A normal + Use If eigs not line Faber & M wathen for HSPD wathen wathen Faber&M def F&M slides F&M slides BA Hermition CG(3)=matrices for which iterations can be carried out using 3-term recursion