We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear Multilinear Algebra, 1 (1973), pp. 163-171]. Our algorithms are based on Gaussian quadrature and Golub Kahan bidiagonalization. Block variants are also investigated. Numerical experiments are performed to illustrate the effectiveness and efficiency of our techniques in computing generalized matrix functions arising in the analysis of networks.
Computation of generalized matrix functions
Fenu, Caterina
2016-01-01
Abstract
We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear Multilinear Algebra, 1 (1973), pp. 163-171]. Our algorithms are based on Gaussian quadrature and Golub Kahan bidiagonalization. Block variants are also investigated. Numerical experiments are performed to illustrate the effectiveness and efficiency of our techniques in computing generalized matrix functions arising in the analysis of networks.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
gen_fun.pdf
Solo gestori archivio
Descrizione: Articolo principale
Tipologia:
versione editoriale (VoR)
Dimensione
513.08 kB
Formato
Adobe PDF
|
513.08 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I metadati presenti in IRIS UNICA sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono protetti da diritto d'autore, salvo diversa indicazione.
