The following pages link to (Q5558176):
Displaying 28 items.
- Hybrid Bi-CG methods with a Bi-CG formulation closer to the IDR approach (Q387455) (← links)
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration (Q598774) (← links)
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II (Q773817) (← links)
- BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices (Q970386) (← links)
- Solving elliptic boundary-value problems on parallel processors by approximate inverse matrix semi-direct methods based on the multiple explicit Jacobi iteration (Q1058831) (← links)
- Orthogonal polynomials - Constructive theory and applications (Q1069264) (← links)
- Approximate root-free factorization techniques for solving elliptic difference equations in three space variables (Q1086996) (← links)
- On the application of orthogonal polynomials to the iterative solution of linear systems of equations with indefinite or non-Hermitian matrices (Q1090062) (← links)
- Leapfrog variants of iterative methods for linear algebraic equations (Q1112547) (← links)
- On generalized Stieltjes-Wigert and related orthogonal polynomials (Q1135416) (← links)
- Roundoff-error analysis of a new class of conjugate-gradient algorithms (Q1138343) (← links)
- The rate of convergence of an approximate matrix factorization semi- direct method (Q1141458) (← links)
- The use of the generalized extended to the limit sparse factorization techniques for the solution of non-linear elliptic and parabolic difference equations (Q1157678) (← links)
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations (Q1195726) (← links)
- Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix (Q1230353) (← links)
- Computation of Padé approximants and continued fractions (Q1231745) (← links)
- Numerical stability of the Chebyshev method for the solution of large linear systems (Q1231755) (← links)
- The Tchebychev iteration for nonsymmetric linear systems (Q1239581) (← links)
- Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm (Q1301301) (← links)
- Iterative solution of linear systems in the 20th century (Q1591173) (← links)
- Analysis of acceleration strategies for restarted minimal residual methods (Q1591186) (← links)
- Preconditioning complex symmetric linear systems (Q1665980) (← links)
- The development of Runge-Kutta methods for partial differential equations (Q1917459) (← links)
- Convergence estimates for solution of integral equations with GMRES (Q1924075) (← links)
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives (Q1954336) (← links)
- Converting BiCR method for linear equations with complex symmetric matrices (Q2423078) (← links)
- Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis (Q2665948) (← links)
- A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems (Q2818245) (← links)
