Sparse approximations of matrix functions via numerical integration of ODEs
Journal: Bulletin of Computational Applied Mathematics (Bull CompAMa) (Vol.4, No. 2)Publication Date: 2016-12-31
Authors : Jean-Paul Chehab;
Page : 95-131
Keywords : Preconditioning; iterative methods; matrix functions; sparse approximation; Stability; ODEs;
Abstract
We consider the numerical computation of matrix functions f(x) via matrix ODE integration. The solution is modeled as an asymptotic steady state of a proper differential system. The framework we propose, allows to define flows of sparse matrices leading to sparse approximations to f(x). We discuss of this approach giving stability and approximation results in a general case. We apply our method to the factorization of matrices (LU, Cholesky) as well as the computation of the square root. Numerical illustrations are presented.
Other Latest Articles
- Derivative-free method for bound constrained nonlinear monotone equations and its application in solving steady state reaction-diffusion problems
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
- Modified Spectral Projected Subgradient Method: Convergence Analysis and Momentum Parameter Heuristics
- PENSIONS REFORMS IN POLAND – HISTORY AND CURRENT TENDENCIES
- FEATURES OF LABOUR PRODUCTIVITY MANAGEMENT IN HIGH-TECH COMPANIES
Last modified: 2018-08-05 10:13:41