Sparse approximations of matrix functions via numerical integration of ODEs
Journal Title: Bulletin of Computational Applied Mathematics (Bull CompAMa) - Year 2016, Vol 4, Issue 2
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.
Authors and Affiliations
Jean-Paul Chehab
Keywords
Related Articles
- EP ID EP240517
- DOI -
- Views 130
- Downloads 0
Redox reactions as experimental examples of ternary weak algebraic hyperstructures
A ternary hyperoperation on a set H is a 3-ary hyperoperation, which associates a subset of H with any three elements of H. In this paper, we give examples of ternary hyperoperations associated with redox reactions. We...
Evaluation of the Von Rosenberg's method for the convection-diffusion equation
An explicit numerical scheme developed by Von Rosenberg for the convection-diffusion equation in one spatial dimension is reviewed and analyzed. The convergence of this scheme is outlined and a comparative study was esta...
Simulation of the oxygen distribution in a tumor tissue using residual algorithms
In this paper the use of recent residual algorithms for the simulation of the oxygen distribution in a tumor tissue in 2-D is proposed. The oxygen distribution in a tumor is considered a reaction-diffusion problem in ste...
A deterministic optimization approach for solving the rainfall disaggregation problem
One of the main problems in hydrology is the time scale of the historical rainfall data, available from many meteorological data bases. Most of the rainfall data is given at a time scale coarser than the one needed for...
A convex optimization approach for solving large scale linear systems
The well-known Conjugate Gradient (CG) method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this wo...