The following pages link to Marcel Schweitzer (Q288639):
Displaying 27 items.
- Any finite convergence curve is possible in the initial iterations of restarted FOM (Q288640) (← links)
- Monotone convergence of the extended Krylov subspace method for Laplace-Stieltjes functions of Hermitian positive definite matrices (Q306481) (← links)
- Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions (Q329011) (← links)
- Non-Toeplitz decay bounds for inverses of Hermitian positive definite tridiagonal matrices (Q1990905) (← links)
- Integral representations for higher-order Fréchet derivatives of matrix functions: quadrature algorithms and new results on the level-2 condition number (Q2093515) (← links)
- Decay bounds for Bernstein functions of Hermitian matrices with applications to the fractional graph Laplacian (Q2153944) (← links)
- A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching (Q2408146) (← links)
- Efficient and stable Arnoldi restarts for matrix functions based on quadrature (Q2923364) (← links)
- Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions (Q3382786) (← links)
- Bounds for the decay of the entries in inverses and Cauchy–Stieltjes functions of certain sparse, normal matrices (Q4684538) (← links)
- Low-Rank Updates of Matrix Functions II: Rational Krylov Methods (Q4989950) (← links)
- Computing low‐rank approximations of the Fréchet derivative of a matrix function using Krylov subspace methods (Q5033214) (← links)
- A Comparison of Limited-memory Krylov Methods for Stieltjes Functions of Hermitian Matrices (Q5150832) (← links)
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices (Q5246497) (← links)
- The Radau--Lanczos Method for Matrix Functions (Q5348226) (← links)
- Low-Rank Updates of Matrix Functions (Q5373925) (← links)
- Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds (Q6094748) (← links)
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions (Q6116663) (← links)
- Krylov Subspace Restarting for Matrix Laplace Transforms (Q6158488) (← links)
- The Fréchet derivative of the tensor t-function (Q6166087) (← links)
- Structured level-2 condition numbers of matrix functions (Q6198237) (← links)
- Computing low-rank approximations of the Fr\'echet derivative of a matrix function using Krylov subspace methods (Q6347962) (← links)
- Analysis of probing techniques for sparse approximation and trace estimation of decaying matrix functions (Q6348319) (← links)
- Polynomial Preconditioning for the Action of the Matrix Square Root and Inverse Square Root (Q6517179) (← links)
- Challenges in computing matrix functions (Q6519364) (← links)
- Polynomial preconditioning for the action of the matrix square root and inverse square root (Q6572621) (← links)
- Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices (Q6657191) (← links)
