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.
2016
Generalized matrix functions; Gauss quadrature; Golub-Kahan bidiagonalization; Network communicability
Files in This Item:
File Size Format  
gen_fun.pdf

Solo gestori archivio

Description: Articolo principale
Type: versione editoriale
Size 513.08 kB
Format Adobe PDF
513.08 kB Adobe PDF & nbsp; View / Open   Request a copy

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Questionnaire and social

Share on:
Impostazioni cookie