Sparse approximations of matrix functions via numerical integration of ODEs
Summary: 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.
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Parallel matrix function evaluation via initial value ODE modeling
- scientific article; zbMATH DE number 2232742
- Efficient approximation of functions of some large matrices by partial fraction expansions
- Matrix functions
- A second-order gradient-like dissipative dynamical system with Hessian-driven damping. Application to optimization and mechanics.
- An implicit preconditioning strategy for large-scale generalized Sylvester equations
- Convergence to equilibrium for the backward Euler scheme and applications
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Differential equations and solution of linear systems
- Geometrical inverse preconditioning for symmetric positive definite matrices
- scientific article; zbMATH DE number 49110 (Why is no real title available?)
- scientific article; zbMATH DE number 3484411 (Why is no real title available?)
- scientific article; zbMATH DE number 1324524 (Why is no real title available?)
- Implicit and adaptive inverse preconditioned gradient methods for nonlinear problems
- Implicitly preconditioned and globalized residual method for solving steady fluid flows
- Incremental incomplete LU factorizations with applications
- Inexact Newton's method with inner implicit preconditioning for algebraic Riccati equations
- Isospectral Flows
- Matrix differential equations and inverse preconditioners
- New updates of incomplete LU factorizations and applications to large nonlinear systems
- Nonlinear hybrid procedures and fixed point iterations
- Numerical Gradient Algorithms for Eigenvalue and Singular Value Calculations
- Orderings for Factorized Sparse Approximate Inverse Preconditioners
- Parallel matrix function evaluation via initial value ODE modeling
- 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)
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- Steepest descent with momentum for quadratic functions is a version of the conjugate gradient method
- Parallel matrix function evaluation via initial value ODE modeling
- Compact sparse symbolic Jacobian computation in large systems of ODEs
- Time-stepping and preserving orthonormality
- Geometrical inverse matrix approximation for least-squares problems and acceleration strategies
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
This page was built for publication: Sparse approximations of matrix functions via numerical integration of ODEs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653963)
