Approximation of functions of large matrices with Kronecker structure

From MaRDI portal
Publication:504162

DOI10.1007/S00211-016-0799-9zbMATH Open1365.65134arXiv1503.02615OpenAlexW1540455107MaRDI QIDQ504162FDOQ504162


Authors: Michele Benzi, Valeria Simoncini Edit this on Wikidata


Publication date: 25 January 2017

Published in: Numerische Mathematik (Search for Journal in Brave)

Abstract: We consider the numerical approximation of f(calA)b where binmathbbRN and calA is the sum of Kronecker products, that is calA=M2otimesI+IotimesM1inmathbbRNimesN. Here f is a regular function such that f(calA) is well defined. We derive a computational strategy that significantly lowers the memory requirements and computational efforts of the standard approximations, with special emphasis on the exponential function, for which the new procedure becomes particularly advantageous. Our findings are illustrated by numerical experiments with typical functions used in applications.


Full work available at URL: https://arxiv.org/abs/1503.02615




Recommendations




Cites Work


Cited In (18)

Uses Software





This page was built for publication: Approximation of functions of large matrices with Kronecker structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504162)