Bounds for the entries of matrix functions with applications to preconditioning
From MaRDI portal
Publication:1307237
DOI10.1023/A:1022362401426zbMath0934.65054MaRDI QIDQ1307237
Publication date: 1 December 1999
Published in: BIT (Search for Journal in Brave)
numerical examplesmatrix functionsRiemann-Stieltjes integralsGaussian quadrature rulesbounds to preconditioningdecay resultssymmetric banded matrix
Computational methods for sparse matrices (65F50) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Related Items
Refined decay bounds on the entries of spectral projectors associated with sparse Hermitian matrices ⋮ Block diagonal dominance of matrices revisited: bounds for the norms of inverses and eigenvalue inclusion sets ⋮ Updating and Downdating Techniques for Optimizing Network Communicability ⋮ 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 ⋮ Quantum states on harmonic lattices ⋮ Solving multi-linear systems with \(\mathcal {M}\)-tensors ⋮ Sparse solution of the Lyapunov equation for large-scale interconnected systems ⋮ Predicting Triadic Closure in Networks Using Communicability Distance Functions ⋮ Decay Bounds for Functions of Hermitian Matrices with Banded or Kronecker Structure ⋮ Error Bounds for the Krylov Subspace Methods for Computations of Matrix Exponentials ⋮ The Short-Term Rational Lanczos Method and Applications ⋮ A Preconditioned MINRES Method for Optimal Control of Wave Equations and its Asymptotic Spectral Distribution Theory ⋮ Parameter estimation in high dimensional Gaussian distributions ⋮ Localization of matrix factorizations ⋮ Ranking hubs and authorities using matrix functions ⋮ Inexact rational Krylov Subspace methods for approximating the action of functions of matrices ⋮ Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods ⋮ Massively parallel sparse matrix function calculations with NTPoly ⋮ A block Toeplitz preconditioner for all-at-once systems from linear wave equations ⋮ A sine transform based preconditioned MINRES method for all-at-once systems from constant and variable-coefficient evolutionary PDEs ⋮ Vertex-frequency analysis on graphs ⋮ Numerical Structure of the Hessian of the Lagrange Dual Function for a Class of Convex Problems ⋮ Localization in Matrix Computations: Theory and Applications ⋮ Low-Rank Updates of Matrix Functions ⋮ 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 ⋮ Exploring the “Middle Earth” of network spectra via a Gaussian matrix function ⋮ Sparsity preserving optimal control of discretized PDE systems ⋮ Spatially Dependent Polya Tree Modeling for Survival Data ⋮ Non-Toeplitz decay bounds for inverses of Hermitian positive definite tridiagonal matrices ⋮ Decay properties for functions of matrices over \(C^\ast\)-algebras ⋮ Entrywise relative perturbation bounds for exponentials of essentially non-negative matrices ⋮ A probing method for computing the diagonal of a matrix inverse ⋮ Monotone convex sequences and Cholesky decomposition of symmetric Toeplitz matrices ⋮ Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices ⋮ New updates of incomplete LU factorizations and applications to large nonlinear systems ⋮ Quadrature rule-based bounds for functions of adjacency matrices ⋮ On the inverses of general tridiagonal matrices ⋮ Some uses of the field of values in numerical analysis ⋮ Modified iterations for data-sparse solution of linear systems ⋮ Colloquium: Area laws for the entanglement entropy ⋮ Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions ⋮ Computing the reciprocal of a \(\phi\)-function by rational approximation ⋮ Computing exponentials of essentially non-negative matrices entrywise to high relative accuracy ⋮ Making almost commuting matrices commute ⋮ 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
