Low-Rank Updates of Matrix Functions
From MaRDI portal
Publication:5373925
DOI10.1137/17M1140108zbMath1390.15024arXiv1707.03045OpenAlexW2734832723MaRDI QIDQ5373925
Daniel Kressner, Marcel Schweitzer, Bernhard Beckermann
Publication date: 6 April 2018
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.03045
Markov functionKrylov subspace methodmatrix exponentialmatrix functionlow-rank updatetensorized Krylov subspacegraph communicability
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Computing the Square Root of a Low-Rank Perturbation of the Scaled Identity Matrix ⋮ Matrix functions in network analysis ⋮ Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds ⋮ Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM ⋮ A Krylov Subspace Method for the Approximation of Bivariate Matrix Functions ⋮ Norm and Trace Estimation with Random Rank-one Vectors ⋮ On the Stability of Network Indices Defined by Means of Matrix Functions ⋮ Multi-fidelity meta modeling using composite neural network with online adaptive basis technique ⋮ Low-Rank Updates of Matrix Functions II: Rational Krylov Methods ⋮ Mittag--Leffler Functions and their Applications in Network Science ⋮ Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices ⋮ Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
- A mixed-precision algorithm for the solution of Lyapunov equations on hybrid CPU-GPU platforms
- Numerical range and functional calculus in Hilbert space
- Quadrature rule-based bounds for functions of adjacency matrices
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- The block conjugate gradient algorithm and related methods
- Bounds for the entries of matrix functions with applications to preconditioning
- Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
- The computation of bounds for the norm of the error in the conjugate gradient algorithm
- Ranking hubs and authorities using matrix functions
- On Faber polynomials and Faber expansions
- Rational Matrix Functions and Rank-1 Updates
- Krylov Subspace Methods for Linear Systems with Tensor Product Structure
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Network Properties Revealed through Matrix Functions
- Computational Methods for Linear Matrix Equations
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Updating and Downdating Techniques for Optimizing Network Communicability
- On the Faber Transform and Efficient Numerical Rational Approximation
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- On the Stability of Network Indices Defined by Means of Matrix Functions
- The Kreiss Matrix Theorem on a General Complex Domain
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- The Numerical Range is a $(1+\sqrt{2})$-Spectral Set
- Functions of Matrices
- On Improving Linear Solver Performance: A Block Variant of GMRES
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Low-Rank Updates of Matrix Functions