On the decay of the inverse of matrices that are sum of Kronecker products

DOI10.1016/j.laa.2014.03.029zbMath1291.65144arXiv1312.6631OpenAlexW2088666624MaRDI QIDQ2451660

Claudio Canuto, Valeria Simoncini, Marco Verani

Publication date: 4 June 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.6631

zbMATH Keywords

Kronecker productsnumerical experimentexponential decaybanded matricesmatrix inversesparsity pattern

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Theory of matrix inversion and generalized inverses (15A09)

Related Items (17)

Efficient approximation of functions of some large matrices by partial fraction expansions ⋮ 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 ⋮ Solving multi-linear systems with \(\mathcal {M}\)-tensors ⋮ Sparse solution of the Lyapunov equation for large-scale interconnected systems ⋮ Decay Bounds for Functions of Hermitian Matrices with Banded or Kronecker Structure ⋮ Inexact rational Krylov Subspace methods for approximating the action of functions of matrices ⋮ Localization in Matrix Computations: Theory and Applications ⋮ Inexact methods for the low rank solution to large scale Lyapunov equations ⋮ On the decay of the off-diagonal singular values in cyclic reduction ⋮ Solving mixed classical and fractional partial differential equations using short-memory principle and approximate inverses ⋮ Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices ⋮ Efficient solution of time-fractional differential equations with a new adaptive multi-term discretization of the generalized Caputo-Dzherbashyan derivative ⋮ Decay bounds for the numerical quasiseparable preservation in matrix functions ⋮ Resolvents of operators on tensor products of Euclidean spaces ⋮ High-Order Adaptive Galerkin Methods ⋮ Contraction and optimality properties of an adaptive Legendre-Galerkin method: the multi-dimensional case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
• Quadrature rule-based bounds for functions of adjacency matrices
• On computing INV block preconditionings for the conjugate gradient method
• Bounds for the entries of matrix functions with applications to preconditioning
• Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients
• Preconditioning techniques for large linear systems: A survey
• Contraction and optimality properties of an adaptive Legendre-Galerkin method: the multi-dimensional case
• Decay in Functions of Multiband Matrices
• A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
• Discrete maximum principle for higher-order finite elements in 1D
• Decay Rates for Inverses of Band Matrices
• A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
• Decay Rates of the Inverse of Nonsymmetric Tridiagonal and Band Matrices
• Orderings for Factorized Sparse Approximate Inverse Preconditioners
• Decay Properties of Spectral Projectors with Applications to Electronic Structure
• Pointwise Bounds for Discrete Green’s Functions
• Discrete Green's Functions

This page was built for publication: On the decay of the inverse of matrices that are sum of Kronecker products