scientific article; zbMATH DE number 3273447

Cited in

(31)

Solving elliptic boundary-value problems on parallel processors by approximate inverse matrix semi-direct methods based on the multiple explicit Jacobi iteration
Orthogonal polynomials - Constructive theory and applications
Approximate root-free factorization techniques for solving elliptic difference equations in three space variables
On the application of orthogonal polynomials to the iterative solution of linear systems of equations with indefinite or non-Hermitian matrices
Leapfrog variants of iterative methods for linear algebraic equations
On generalized Stieltjes-Wigert and related orthogonal polynomials
Roundoff-error analysis of a new class of conjugate-gradient algorithms
The rate of convergence of an approximate matrix factorization semi- direct method
The use of the generalized extended to the limit sparse factorization techniques for the solution of non-linear elliptic and parabolic difference equations
Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix
Computation of Padé approximants and continued fractions
Numerical stability of the Chebyshev method for the solution of large linear systems
The Tchebychev iteration for nonsymmetric linear systems
Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
Iterative solution of linear systems in the 20th century
Analysis of acceleration strategies for restarted minimal residual methods
Preconditioning complex symmetric linear systems
The development of Runge-Kutta methods for partial differential equations
Convergence estimates for solution of integral equations with GMRES
Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
Converting BiCR method for linear equations with complex symmetric matrices
Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis
A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
Hybrid Bi-CG methods with a Bi-CG formulation closer to the IDR approach
scientific article; zbMATH DE number 3385171 (Why is no real title available?)
Polynomial preconditioned Arnoldi with stability control
45 years of orthogonal polynomials: A view from the wings
Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5558176)