Efficient approximation of functions of some large matrices by partial fraction expansions
From MaRDI portal
Abstract: Some important applicative problems require the evaluation of functions of large and sparse and/or emph{localized} matrices . Popular and interesting techniques for computing and , where is a vector, are based on partial fraction expansions. However, some of these techniques require solving several linear systems whose matrices differ from by a complex multiple of the identity matrix for computing or require inverting sequences of matrices with the same characteristics for computing . Here we study the use and the convergence of a recent technique for generating sequences of incomplete factorizations of matrices in order to face with both these issues. The solution of the sequences of linear systems and approximate matrix inversions above can be computed efficiently provided that shows certain decay properties. These strategies have good parallel potentialities. Our claims are confirmed by numerical tests.
Recommendations
Cites work
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
- Acceleration Techniques for Approximating the Matrix Exponential Operator
- Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Approximate inverse preconditioning for shifted linear systems
- Chebyshev rational approximations to \(e^{-x}\) in \([0,+\infty)\) and applications to heat-conduction problems
- Computing A^\alpha, \log(A), and Related Matrix Functions by Contour Integrals
- Computing exp(- A) b with Laguerre polynomials
- Computing the logarithm of a symmetric positive definite matrix
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Decay Rates for Inverses of Band Matrices
- Decay Rates of the Inverse of Nonsymmetric Tridiagonal and Band Matrices
- Efficient approximation of the exponential operator for discrete 2D advection–diffusion problems
- Efficient preconditioning for sequences of parametric complex symmetric linear systems
- Expokit
- Functions of Matrices
- scientific article; zbMATH DE number 3881232 (Why is no real title available?)
- scientific article; zbMATH DE number 5297089 (Why is no real title available?)
- scientific article; zbMATH DE number 19228 (Why is no real title available?)
- Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
- Interpolating preconditioners for the solution of sequence of linear systems
- Iterative methods and preconditioning for large and sparse linear systems with applications
- Localization in matrix computations: theory and applications
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- Nonsymmetric preconditioner updates in Newton-Krylov methods for nonlinear systems
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- On the decay of the elements of inverse triangular Toeplitz matrices
- On the decay of the inverse of matrices that are sum of Kronecker products
- On the use of matrix functions for fractional partial differential equations
- Orderings for Factorized Sparse Approximate Inverse Preconditioners
- Padé error estimates for the logarithm of a matrix
- Parallel iterative methods for sparse linear systems
- Preconditioning Lanczos Approximations to the Matrix Exponential
- Preconditioning techniques for large linear systems: A survey
- Propriétés des matrices ``bien localisées près de leur diagonale et quelques applications. (Properties of matrices ``well localized near the diagonal and some applications)
- Rational Lanczos approximations to the matrix square root and related functions.
- RD-rational approximations of the matrix exponential
- Scalable Parallel Preconditioning with the Sparse Approximate Inverse of Triangular Matrices
- Sparse approximate inverse preconditioners on high performance GPU platforms
- The restarted shift-and-invert Krylov method for matrix functions.
- The University of Florida sparse matrix collection
- Updating preconditioners for nonlinear deblurring and denoising image restoration
Cited in
(9)- Sparse approximations of matrix functions via numerical integration of ODEs
- Incomplete partial fractions for parallel evaluation of rational matrix functions
- Highly accurate global Padé approximations of generalized Mittag-Leffler function and its inverse
- Localization in matrix computations: theory and applications
- scientific article; zbMATH DE number 3927567 (Why is no real title available?)
- New algorithms for approximating -functions and their condition numbers for large sparse matrices
- scientific article; zbMATH DE number 2232742 (Why is no real title available?)
- Efficient inversion of matrix -functions of low order
- Massively parallel sparse matrix function calculations with NTPoly
This page was built for publication: Efficient approximation of functions of some large matrices by partial fraction expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031745)
