An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix
Contribuinte(s) |
P. M. A. Sloot D. Abramson |
---|---|
Data(s) |
01/01/2003
|
Resumo |
The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors. |
Identificador | |
Idioma(s) |
eng |
Publicador |
Springer-Verlag |
Palavras-Chave | #Computer Science, Theory & Methods #Exponential Operator #C1 #230116 Numerical Analysis #780101 Mathematical sciences |
Tipo |
Journal Article |