Approximation of functions of large matrices with Kronecker structure
DOI10.1007/s00211-016-0799-9zbMath1365.65134arXiv1503.02615OpenAlexW1540455107MaRDI QIDQ504162
Valeria Simoncini, Michele Benzi
Publication date: 25 January 2017
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.02615
convergencenumerical experimentssparse matricesnumerical approximationKrylov methodsstructured matricesKronecker structurematrix function approximationmatrix inverse functionmatrix sine and cosine functions
Computational methods for sparse matrices (65F50) Algorithms for approximation of functions (65D15) Numerical computation of matrix exponential and similar matrix functions (65F60)
Related Items (12)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix-equation-based strategies for convection-diffusion equations
- Convergence analysis of the extended Krylov subspace method for the Lyapunov equation
- Calculation of functions of unsymmetric matrices using Arnoldi's method
- On a conjecture concerning spanning tree invariants and loop systems
- Low-rank Kronecker-product approximation to multi-dimensional nonlocal operators II. HKT representation of certain operators
- \(\mathcal H\)-matrix approximation for the operator exponential with applications
- Hierarchical tensor-product approximation to the inverse and related operators for high-dimensional elliptic problems
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- Exponential integrators for quantum-classical molecular dynamics
- Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
- Exponential integrators
- Efficient and Stable Arnoldi Restarts for Matrix Functions Based on Quadrature
- Decay Bounds for Functions of Hermitian Matrices with Banded or Kronecker Structure
- Krylov Subspace Methods for Linear Systems with Tensor Product Structure
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- Analysis of the Rational Krylov Subspace and ADI Methods for Solving the Lyapunov Equation
- An Error Analysis for Rational Galerkin Projection Applied to the Sylvester Equation
- Solution of Large Scale Evolutionary Problems Using Rational Krylov Subspaces with Optimized Shifts
- Computational Methods for Linear Matrix Equations
- Deblurring Images
- Reliability of interconnection networks modeled by Cartesian product digraphs
- Convergence Analysis of Projection Methods for the Numerical Solution of Large Lyapunov Equations
- Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
- Numerical tensor calculus
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- An Error Analysis of Galerkin Projection Methods for Linear Systems with Tensor Product Structure
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- Functions of Matrices
- What is the Laplace Transform?
This page was built for publication: Approximation of functions of large matrices with Kronecker structure