New block quadrature rules for the approximation of matrix functions
RODRIGUEZ, GIUSEPPE;
2016-01-01
Abstract
Golub and Meurant have shown how to use the symmetric block Lanczos algorithm to compute block Gauss quadrature rules for the approximation of certain matrix functions. We describe new block quadrature rules that can be computed by the symmetric or nonsymmetric block Lanczos algorithms and yield higher accuracy than standard block Gauss rules after the same number of steps of the symmetric or nonsymmetric block Lanczos algorithms. The new rules are block generalizations of the generalized averaged Gauss rules introduced by Spalevi´c. Applications to network analysis are presentedFile | Size | Format | |
---|---|---|---|
newbquad16.pdf Solo gestori archivio
Type: versione editoriale
Size 616.01 kB
Format Adobe PDF
|
616.01 kB | Adobe PDF | & nbsp; View / Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.