Pages that link to "Item:Q1326402"
From MaRDI portal
The following pages link to A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations (Q1326402):
Displayed 18 items.
- Preconditioned Galerkin and minimal residual methods for solving Sylvester equations (Q856113) (← links)
- The degree of approximation by polynomials on some disjoint intervals in the complex plane (Q865375) (← links)
- Krylov-subspace methods for the Sylvester equation (Q1194527) (← links)
- An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK (Q1208566) (← links)
- Experiments with Krylov subspace methods on a massively parallel computer (Q1321613) (← links)
- A generalized ADI iterative method (Q1326479) (← links)
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (Q1372035) (← links)
- A priori error bounds on invariant subspace approximations by block Krylov subspaces (Q1611877) (← links)
- A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices (Q1861982) (← links)
- A note on the tau-method approximations for the Bessel functions \(Y_ 0(z)\) and \(Y_ 1(z)\) (Q1921221) (← links)
- A strategy for detecting extreme eigenvalues bounding gaps in the discrete spectrum of self-adjoint operators (Q2468909) (← links)
- Wave packet propagation by the Faber polynomial approximation in electrodynamics of passive media (Q2495782) (← links)
- Symbolic and numerical computation on Bessel functions of complex argument and large magnitude (Q2564285) (← links)
- THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES (Q2769526) (← links)
- The Faber Polynomials for Annular Sectors (Q4325723) (← links)
- Convergence analysis of Krylov subspace methods (Q4681595) (← links)
- Approximation on disjoint intervals and its applicability to matrix preconditioning (Q5443488) (← links)
- An interpolatory approximation of the matrix exponential based on Faber polynomials (Q5939879) (← links)