On the Convergence of the Conjugate Gradient Method for Singular Capacitance Matrix Equations from the Neumann Problem of the Poisson Equation.
On the Convergence of the Symmetric SOR Method for Matrices with Red-Black Ordering.
On the convergence rate of the conjugate gradients in presence of rounding errors.
On the convergence theory of double -weak splittings of type II
Recently, Wang (2017) has introduced the -nonnegative double splitting using the notion of matrices that leave a cone invariant and studied its convergence theory by generalizing the corresponding results for the nonnegative double splitting by Song and Song (2011). However, the convergence theory for -weak regular and -nonnegative double splittings of type II is not yet studied. In this article, we first introduce this class of splittings and then discuss the convergence theory for these sub-classes...
On the Distribution of Errors in the Iterative Solution of a System of Linear Equations. II..
On the Eigenvalue Distribution of a Class of Preconditioning Methods.
On the global and cubic convergence of a quasi-cyclic Jacobi method.
On the local convergence of Kung-Traub's two-point method and its dynamics
In this paper, the local convergence analysis of the family of Kung-Traub's two-point method and the convergence ball for this family are obtained and the dynamical behavior on quadratic and cubic polynomials of the resulting family is studied. We use complex dynamic tools to analyze their stability and show that the region of stable members of this family is vast. Numerical examples are also presented in this study. This method is compared with several widely used solution methods by solving test...
On the Monotonity of Incomplete Factorization.
On the Multigrid Solution of Finite Element Equations With Isoparametric Elements.
On the Multi-Level Splitting of Finite Element Squares.
On the Numerical Errors in One Step Algorithms for Time Dependent Problems.
On the preconditioned biconjugate gradients for solving linear complex equations arising from finite elements
The paper analyses the biconjugate gradient algorithm and its preconditioned version for solving large systems of linear algebraic equations with nonsingular sparse complex matrices. Special emphasis is laid on symmetric matrices arising from discretization of complex partial differential equations by the finite element method.
On the Quadratic Convergence of the Special Cyclic Jacobi Method.
On the Rate of Convergence of the Preconditioned Conjugate Gradient Method.
On the set of weighted least squares solutions of systems of convex inequalities
On the Sharpness of Some Upper Bounds for the Spectral Radii of S.O.R. Iteration Matrices.
On the Solution of Singular Linear Systems of Algebraic Equations by Semiiterative Methods.
On the subspace projected approximate matrix method
We provide a comparative study of the Subspace Projected Approximate Matrix method, abbreviated SPAM, which is a fairly recent iterative method of computing a few eigenvalues of a Hermitian matrix . It falls in the category of inner-outer iteration methods and aims to reduce the costs of matrix-vector products with within its inner iteration. This is done by choosing an approximation of , and then, based on both and , to define a sequence of matrices that increasingly better approximate...
On the worst-case convergence of MR and CG for symmetric positive definite tridiagonal Toeplitz matrices.