Efficient and stable Arnoldi restarts for matrix functions based on quadrature
From MaRDI portal
Publication:2923364
DOI10.1137/13093491XzbMATH Open1309.65050OpenAlexW2010196418MaRDI QIDQ2923364FDOQ2923364
Authors: Andreas Frommer, Stefan Güttel, Marcel Schweitzer 
Publication date: 15 October 2014
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/13093491x
Recommendations
- New matrix function approximations and quadrature rules based on the Arnoldi process
- Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems
- Implicitly restarted generalized second-order Arnoldi type algorithms for the quadratic eigenvalue problem
- Implicitly restarted Arnoldi methods and subspace iteration
- Krylov-Schur-type restarts for the two-sided Arnoldi method
- An iterated shift-and-invert Arnoldi algorithm for quadratic matrix eigenvalue problems
- Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
- scientific article; zbMATH DE number 5232223
- Multiple Explicitly Restarted Arnoldi Method for Solving Large Eigenproblems
- Matrix-free \(W\)-methods using a multiple Arnoldi iteration
Gaussian quadraturenumerical test[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Pad%EF%BF%BD%EF%BF%BD+approximation&go=Go Pad�� approximation]polynomial interpolationrestartmatrix functionKrylov subspace approximationrestarted Arnoldi methodrestarted Lanczos methoddeflated restartingintegral expression of the error
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cited In (60)
- Inexact rational Krylov Subspace methods for approximating the action of functions of matrices
- Polynomial preconditioning for the action of the matrix square root and inverse square root
- Krylov Subspace Restarting for Matrix Laplace Transforms
- A sketch-and-select Arnoldi process
- Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization
- Error estimates for quadrature rules based on the Arnoldi process
- Krylov subspace recycling with randomized sketching for matrix functions
- Coarse Grid Corrections in Krylov Subspace Evaluations of the Matrix Exponential
- Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices
- Matrix-free \(W\)-methods using a multiple Arnoldi iteration
- Acceleration of contour integration techniques by rational Krylov subspace methods
- Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions
- Exponent Splitting Schemes for Evolution Equations with Fractional Powers of Operators
- ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations
- Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
- Approximation of the matrix exponential for matrices with a skinny field of values
- Error Bounds for Lanczos-Based Matrix Function Approximation
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
- New matrix function approximations and quadrature rules based on the Arnoldi process
- A study of defect-based error estimates for the Krylov approximation of \(\varphi\)-functions
- An estimate of approximation of a matrix-valued function by an interpolation polynomial
- Computation of matrix functions with deflated restarting
- On the construction and properties of \(m\)-step methods for FDEs
- A framework of the harmonic Arnoldi method for evaluating \(\varphi\)-functions with applications to exponential integrators
- Exponential Krylov time integration for modeling multi-frequency optical response with monochromatic sources
- Factorized schemes for first and second order evolution equations with fractional powers of operators
- A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions
- Exponential Time Integrators for Unsteady Advection–Diffusion Problems on Refined Meshes
- Splitting schemes for non-stationary problems with a rational approximation for fractional powers of the operator
- Rational Krylov for Stieltjes matrix functions: convergence and pole selection
- A comparison of limited-memory Krylov methods for Stieltjes functions of Hermitian matrices
- Limited‐memory polynomial methods for large‐scale matrix functions
- An accurate restarting for shift-and-invert Krylov subspaces computing matrix exponential actions of nonsymmetric matrices
- Block Krylov subspace methods for functions of matrices. II: Modified block FOM
- Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
- Decay bounds for Bernstein functions of Hermitian matrices with applications to the fractional graph Laplacian
- Quadrature Rules Based on the Arnoldi Process
- Rational approximations to fractional powers of self-adjoint positive operators
- Parallel matrix function evaluation via initial value ODE modeling
- Efficient implementation of rational approximations to fractional differential operators
- The Radau-Lanczos method for matrix functions
- Rational approximation to the fractional Laplacian operator in reaction-diffusion problems
- Computing performability measures in Markov chains by means of matrix functions
- Multigrid preconditioning for the overlap operator in lattice QCD
- Estimating the largest elements of a matrix
- Multigrid approach in shifted linear systems for the non-degenerated twisted mass operator
- Some methods for solving equations with an operator function and applications for problems with a fractional power of an operator
- Approximation of functions of large matrices with Kronecker structure
- A shifted block FOM algorithm with deflated restarting for matrix exponential computations
- Numerical solution of time-dependent problems with fractional power elliptic operator
- Integral representations for higher-order Fréchet derivatives of matrix functions: quadrature algorithms and new results on the level-2 condition number
- Iterative low-rank approximation solvers for the extension method for fractional diffusion
- High order numerical schemes for solving fractional powers of elliptic operators
- Approximation of the linear combination of \(\varphi \)-functions using the block shift-and-invert Krylov subspace method
- Block Gram-Schmidt algorithms and their stability properties
- Block Krylov subspace methods for approximating the linear combination of \(\varphi\)-functions arising in exponential integrators
- Title not available (Why is that?)
- An approximate representation of a solution to fractional elliptical BVP via solution of parabolic IVP
- Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions
- Residual and restarting in Krylov subspace evaluation of the \(\varphi\) function
This page was built for publication: Efficient and stable Arnoldi restarts for matrix functions based on quadrature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2923364)
