scientific article; zbMATH DE number 3273447
From MaRDI portal
Publication:5558176
zbMath0171.35703MaRDI QIDQ5558176
Publication date: 1958
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (31)
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 ⋮ Preconditioning complex symmetric linear systems ⋮ The development of Runge-Kutta methods for partial differential equations ⋮ Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration ⋮ Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis ⋮ Convergence estimates for solution of integral equations with GMRES ⋮ Hybrid Bi-CG methods with a Bi-CG formulation closer to the IDR approach ⋮ 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 ⋮ Converting BiCR method for linear equations with complex symmetric matrices ⋮ The use of the generalized extended to the limit sparse factorization techniques for the solution of non-linear elliptic and parabolic difference equations ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ Quasi-kernel polynomials and their use in non-Hermitian matrix iterations ⋮ BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices ⋮ 45 years of orthogonal polynomials: A view from the wings ⋮ 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 ⋮ Unnamed Item ⋮ The Tchebychev iteration for nonsymmetric linear systems ⋮ A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems ⋮ Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II ⋮ Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm ⋮ Polynomial Preconditioned Arnoldi with Stability Control ⋮ Iterative solution of linear systems in the 20th century ⋮ Analysis of acceleration strategies for restarted minimal residual methods ⋮ 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
This page was built for publication:
