A network programming approach in solving Darcy's equations by mixed finite-element methods.
A new block triangular preconditioner for three-by-three block saddle-point problem
In this paper, to solve the three-by-three block saddle-point problem, a new block triangular (NBT) preconditioner is established, which can effectively avoid the solving difficulty that the coefficient matrices of linear subsystems are Schur complement matrices when the block preconditioner is applied to the Krylov subspace method. Theoretical analysis shows that the iteration method produced by the NBT preconditioner is unconditionally convergent. Besides, some spectral properties are also discussed....
A new optimized iterative method for solving -matrix linear systems
In this paper, we present a new iterative method for solving a linear system, whose coefficient matrix is an -matrix. This method includes four parameters that are obtained by the accelerated overrelaxation (AOR) splitting and using the Taylor approximation. First, under some standard assumptions, we establish the convergence properties of the new method. Then, by minimizing the Frobenius norm of the iteration matrix, we find the optimal parameters. Meanwhile, numerical results on test examples...
A Note on Comparison Theorems for Nonnegative Matrices.
A Note on the SSOR and USSOR Iterative Methods Applied to p-Cyclic Matrices.
A numerical solution using an adaptively preconditioned Lanczos method for a class of linear systems related with the fractional Poisson equation.
A numerical study on Neumann-Neumann methods for hp approximations on geometrically refined boundary layer meshes II. Three-dimensional problems
In this paper, we present extensive numerical tests showing the performance and robustness of a Balancing Neumann-Neumann method for the solution of algebraic linear systems arising from hp finite element approximations of scalar elliptic problems on geometrically refined boundary layer meshes in three dimensions. The numerical results are in good agreement with the theoretical bound for the condition number of the preconditioned operator derived in [Toselli and Vasseur, IMA J. Numer. Anal.24 (2004)...
A one parameter method for the matrix inverse square root
This paper is motivated by the paper [3], where an iterative method for the computation of a matrix inverse square root was considered. We suggest a generalization of the method in [3]. We give some sufficient conditions for the convergence of this method, and its numerical stabillity property is investigated. Numerical examples showing that sometimes our generalization converges faster than the methods in [3] are presented.
A parallel AMG for overlapping and non-overlapping domain decomposition.
A parallel GMRES version for general sparse matrices.
A parallel iterative procedure applicable to the approximate solution of second order partial differential equations by mixed finite element methods.
A parallel projection method for linear algebraic systems
A direct projection method for solving systems of linear algebraic equations is described. The algorithm is equivalent to the algorithm for minimization of the corresponding quadratic function and can be generalized for the minimization of a strictly convex function.
A Parallel Projection Method for Solving Generalized Linear Least-Squares Problems.
A polynomial preconditioner for the CMRH algorithm.
A posteriori error estimators for the Stokes equations II non-conforming discretizations.
A rank-one updating approach for solving systems of linear equations in the least squares sense.
A real-valued block conjugate gradient type method for solving complex symmetric linear systems with multiple right-hand sides
We consider solving complex symmetric linear systems with multiple right-hand sides. We assume that the coefficient matrix has indefinite real part and positive definite imaginary part. We propose a new block conjugate gradient type method based on the Schur complement of a certain 2-by-2 real block form. The algorithm of the proposed method consists of building blocks that involve only real arithmetic with real symmetric matrices of the original size. We also present the convergence property of...
A reduction method for approximate solving large elliptic systems
A Relaxation Procedure for Domain Decomposition Methods Using Finite Elements.
A Schwarz auditive method with high order interface conditions and nonoverlapping subdomains