Decay bounds and $O(n)$ algorithms for approximating functions of sparse matrices

Publication date: 8 September 2009

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130625

zbMATH Keywords

decay rates Chebyshev polynomials numerical examples trace density matrix determinant Faber polynomials matrix functions linear time algorithms sparse and banded matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40) Matrices over function rings in one or more variables (15A54)

Related Items

Efficient approximation of functions of some large matrices by partial fraction expansions ⋮ Aitken's method for estimating bilinear forms arising in applications ⋮ Refined decay bounds on the entries of spectral projectors associated with sparse Hermitian matrices ⋮ Numerical stability in the presence of variable coefficients ⋮ Block diagonal dominance of matrices revisited: bounds for the norms of inverses and eigenvalue inclusion sets ⋮ Numerical Methods for Large-Scale Lyapunov Equations with Symmetric Banded Data ⋮ Solvers for $\mathcal{O} (N)$ Electronic Structure in the Strong Scaling Limit ⋮ Decay bounds for Bernstein functions of Hermitian matrices with applications to the fractional graph Laplacian ⋮ Decay estimates of discretized Green's functions for Schrödinger type operators ⋮ Sparse approximations of matrix functions via numerical integration of ODEs ⋮ Sparse solution of the Lyapunov equation for large-scale interconnected systems ⋮ Decay Bounds for Functions of Hermitian Matrices with Banded or Kronecker Structure ⋮ Error Bounds for the Krylov Subspace Methods for Computations of Matrix Exponentials ⋮ Matrix Structures and Matrix Functions ⋮ Parameter estimation in high dimensional Gaussian distributions ⋮ Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds ⋮ Localization of matrix factorizations ⋮ hm-toolbox: MATLAB Software for HODLR and HSS Matrices ⋮ Inexact rational Krylov Subspace methods for approximating the action of functions of matrices ⋮ Recursion relations for the extended Krylov subspace method ⋮ Rational approximation to the Fermi-Dirac function with applications in density functional theory ⋮ Vertex-frequency analysis on graphs ⋮ Matrices with Hierarchical Low-Rank Structures ⋮ Localization in Matrix Computations: Theory and Applications ⋮ Localized spectrum slicing ⋮ On the finite section method for computing exponentials of doubly-infinite skew-Hermitian matrices ⋮ On the decay of the inverse of matrices that are sum of Kronecker products ⋮ Sparsity preserving optimal control of discretized PDE systems ⋮ Non-Toeplitz decay bounds for inverses of Hermitian positive definite tridiagonal matrices ⋮ Decay properties for functions of matrices over $C^\ast$-algebras ⋮ Extended and rational Hessenberg methods for the evaluation of matrix functions ⋮ A probing method for computing the diagonal of a matrix inverse ⋮ Parallel matrix function evaluation via initial value ODE modeling ⋮ Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices ⋮ Quadrature rule-based bounds for functions of adjacency matrices ⋮ Some uses of the field of values in numerical analysis ⋮ A heuristic independent particle approximation to determinantal point processes ⋮ On the Stability of Network Indices Defined by Means of Matrix Functions ⋮ Functions of rational Krylov space matrices and their decay properties ⋮ Numerical methods for differential linear matrix equations via Krylov subspace methods ⋮ Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions ⋮ The extended Krylov subspace method and orthogonal Laurent polynomials ⋮ Sublinear Column-wise Actions of the Matrix Exponential on Social Networks ⋮ An exact formulation of the time-ordered exponential using path-sums ⋮ High-Performance Computation of the Exponential of a Large Sparse Matrix ⋮ Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure

Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices