Pages that link to "Item:Q2864805"
From MaRDI portal
The following pages link to Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection (Q2864805):
Displaying 34 items.
- A framework of the harmonic Arnoldi method for evaluating \(\varphi\)-functions with applications to exponential integrators (Q295370) (← links)
- Adaptive model order reduction for the Jacobian calculation in inverse multi-frequency problem for Maxwell's equations (Q311658) (← links)
- A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions (Q369405) (← links)
- Adaptive-order rational Arnoldi-type methods in computational electromagnetism (Q398619) (← links)
- Convergence rates for inverse-free rational approximation of matrix functions (Q501246) (← links)
- Approximation of functions of large matrices with Kronecker structure (Q504162) (← links)
- Krylov iterative methods for the geometric mean of two matrices times a vector (Q509648) (← links)
- Approximating the leading singular triplets of a large matrix function (Q729984) (← links)
- Estimating the condition number of \(f(A)b\) (Q747727) (← links)
- Krylov subspace exponential time domain solution of Maxwell's equations in photonic crystal modeling (Q747911) (← links)
- A comparison of approaches for the construction of reduced basis for stochastic Galerkin matrix equations. (Q778547) (← links)
- Krylov subspace methods for functions of fractional differential operators (Q4683167) (← links)
- Reduced order models for spectral domain inversion: embedding into the continuous problem and generation of internal data (Q5000606) (← links)
- Computation of generalized matrix functions with rational Krylov methods (Q5058654) (← links)
- A conjugate-gradient-type rational Krylov subspace method for ill-posed problems (Q5210434) (← links)
- Approximate residual-minimizing shift parameters for the low-rank ADI iteration (Q5218393) (← links)
- Rational Krylov methods in exponential integrators for European option pricing (Q5502425) (← links)
- Calculating the divided differences of the exponential function by addition and removal of inputs (Q6044778) (← links)
- Optimal parameters for numerical solvers of PDEs (Q6053017) (← links)
- Matrix functions in network analysis (Q6068264) (← links)
- A literature survey of matrix methods for data science (Q6068265) (← links)
- Limited‐memory polynomial methods for large‐scale matrix functions (Q6068267) (← links)
- An Elliptic Local Problem with Exponential Decay of the Resonance Error for Numerical Homogenization (Q6109134) (← links)
- A Newton method for best uniform rational approximation (Q6109898) (← links)
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions (Q6116663) (← links)
- Adaptive Rational Krylov Methods for Exponential Runge–Kutta Integrators (Q6130650) (← links)
- Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction (Q6144046) (← links)
- Inexact rational Krylov Subspace methods for approximating the action of functions of matrices (Q6146162) (← links)
- Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods (Q6153360) (← links)
- Calculating elements of matrix functions using divided differences (Q6156982) (← links)
- Adaptively restarted block Krylov subspace methods with low-synchronization skeletons (Q6157451) (← links)
- Randomized Low-Rank Approximation of Monotone Matrix Functions (Q6166056) (← links)
- Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization (Q6195017) (← links)
- A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks (Q6489304) (← links)