Efficient and stable Arnoldi restarts for matrix functions based on quadrature
From MaRDI portal
Publication:2923364
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
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
Cited in
(60)- Exponential Krylov time integration for modeling multi-frequency optical response with monochromatic sources
- Approximation of the linear combination of \(\varphi \)-functions using the block shift-and-invert Krylov subspace method
- Quadrature Rules Based on the Arnoldi Process
- Parallel matrix function evaluation via initial value ODE modeling
- The Radau-Lanczos method for matrix functions
- Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
- Acceleration of contour integration techniques by rational Krylov subspace methods
- scientific article; zbMATH DE number 5232223 (Why is no real title available?)
- Limited‐memory polynomial methods for large‐scale matrix functions
- A shifted block FOM algorithm with deflated restarting for matrix exponential computations
- Numerical solution of time-dependent problems with fractional power elliptic operator
- Error Bounds for Lanczos-Based Matrix Function Approximation
- An accurate restarting for shift-and-invert Krylov subspaces computing matrix exponential actions of nonsymmetric matrices
- Integral representations for higher-order Fréchet derivatives of matrix functions: quadrature algorithms and new results on the level-2 condition number
- An approximate representation of a solution to fractional elliptical BVP via solution of parabolic IVP
- Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
- An estimate of approximation of a matrix-valued function by an interpolation polynomial
- Computation of matrix functions with deflated restarting
- Splitting schemes for non-stationary problems with a rational approximation for fractional powers of the operator
- Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions
- Rational approximation to the fractional Laplacian operator in reaction-diffusion problems
- Factorized schemes for first and second order evolution equations with fractional powers of operators
- Approximation of the matrix exponential for matrices with a skinny field of values
- Decay bounds for Bernstein functions of Hermitian matrices with applications to the fractional graph Laplacian
- A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions
- Multigrid approach in shifted linear systems for the non-degenerated twisted mass operator
- A comparison of limited-memory Krylov methods for Stieltjes functions of Hermitian matrices
- Residual and restarting in Krylov subspace evaluation of the \(\varphi\) function
- Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions
- Multigrid preconditioning for the overlap operator in lattice QCD
- Block Krylov subspace methods for functions of matrices. II: Modified block FOM
- Block Gram-Schmidt algorithms and their stability properties
- Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices
- New matrix function approximations and quadrature rules based on the Arnoldi process
- High order numerical schemes for solving fractional powers of elliptic operators
- Exponential Time Integrators for Unsteady Advection–Diffusion Problems on Refined Meshes
- Iterative low-rank approximation solvers for the extension method for fractional diffusion
- Exponent Splitting Schemes for Evolution Equations with Fractional Powers of Operators
- Some methods for solving equations with an operator function and applications for problems with a fractional power of an operator
- Matrix-free \(W\)-methods using a multiple Arnoldi iteration
- A study of defect-based error estimates for the Krylov approximation of \(\varphi\)-functions
- Block Krylov subspace methods for approximating the linear combination of \(\varphi\)-functions arising in exponential integrators
- Computing performability measures in Markov chains by means of matrix functions
- Approximation of functions of large matrices with Kronecker structure
- On the construction and properties of \(m\)-step methods for FDEs
- Efficient implementation of rational approximations to fractional differential operators
- A framework of the harmonic Arnoldi method for evaluating \(\varphi\)-functions with applications to exponential integrators
- Rational Krylov for Stieltjes matrix functions: convergence and pole selection
- Estimating the largest elements of a matrix
- ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
- Rational approximations to fractional powers of self-adjoint positive operators
- Error estimates for quadrature rules based on the Arnoldi process
- Inexact rational Krylov Subspace methods for approximating the action of functions of matrices
- Krylov Subspace Restarting for Matrix Laplace Transforms
- Polynomial preconditioning for the action of the matrix square root and inverse square root
- Coarse Grid Corrections in Krylov Subspace Evaluations of the Matrix Exponential
- Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization
- A sketch-and-select Arnoldi process
- Krylov subspace recycling with randomized sketching for matrix functions
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)
