Geodesic
A generalization of the steepest descent method for matrix functions
Electronic transactions on numerical analysis, Tome 28 (2008).

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

Summary: We consider the special case of the restarted Arnoldi method for approximating the product of a function of a Hermitian matrix with a vector which results when the restart length is set to one. When applied to the solution of a linear system of equations, this approach coincides with the method of steepest descent. We show that the method is equivalent to an interpolation process in which the node sequence has at most two points of accumulation. This knowledge is used to quantify the asymptotic convergence rate.
Classification : 65F10, 65F99, 65M20
Keywords: matrix function, Krylov subspace approximation, restarted Krylov subspace method, restarted arnoldi/Lanczos method, linear system of equations, steepest descent, polynomial interpolation 
@article{ETNA_2008__28__a0,
     author = {Afanasjew, M. and Eiermann, M. and Ernst, O.G. and G\"uttel, S.},
     title = {A generalization of the steepest descent method for matrix functions},
     journal = {Electronic transactions on numerical analysis},
     publisher = {mathdoc},
     volume = {28},
     year = {2008},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ETNA_2008__28__a0/}
}
TY  - JOUR
AU  - Afanasjew, M.
AU  - Eiermann, M.
AU  - Ernst, O.G.
AU  - Güttel, S.
TI  - A generalization of the steepest descent method for matrix functions
JO  - Electronic transactions on numerical analysis
PY  - 2008
VL  - 28
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ETNA_2008__28__a0/
LA  - en
ID  - ETNA_2008__28__a0
ER  - 
%0 Journal Article
%A Afanasjew, M.
%A Eiermann, M.
%A Ernst, O.G.
%A Güttel, S.
%T A generalization of the steepest descent method for matrix functions
%J Electronic transactions on numerical analysis
%D 2008
%V 28
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ETNA_2008__28__a0/
%G en
%F ETNA_2008__28__a0
Afanasjew, M.; Eiermann, M.; Ernst, O.G.; Güttel, S. A generalization of the steepest descent method for matrix functions. Electronic transactions on numerical analysis, Tome 28 (2008). http://geodesic.mathdoc.fr/item/ETNA_2008__28__a0/