A multigrid method for a Petrov-Galerkin discretization of the Stokes equations.
A multilevel method with correction by aggregation for solving discrete elliptic problems
The author studies the behaviour of a multi-level method that combines the Jacobi iterations and the correction by aggragation of unknowns. Our considerations are restricted to a simple one-dimensional example, which allows us to employ the technique of the Fourier analysis. Despite of this restriction we are able to demonstrate differences between the behaviour of the algorithm considered and of multigrid methods employing interpolation instead of aggregation.
A multilevel preconditioner for the mortar method for nonconforming P1 finite element
A multilevel preconditioner based on the abstract framework of the auxiliary space method, is developed for the mortar method for the nonconforming P1 finite element or the lowest order Crouzeix-Raviart finite element on nonmatching grids. It is shown that the proposed preconditioner is quasi-optimal in the sense that the condition number of the preconditioned system is independent of the mesh size, and depends only quadratically on the number of refinement levels. Some numerical results confirming...
A multishift algorithm for the numerical solution of algebraic Riccati equations.
A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
A necessary and sufficient to guarantee feasibility of the interval Gaussian algorithms for a class of matrices. We apply the interval Gaussian algorithm to an interval matrix the comparison matrix of which is irreducible and diagonally dominant. We derive a new necessary and sufficient criterion for the feasibility of this method extending a recently given sufficient criterion.
A nested decomposition algorithm for parallel computations of very large sparse systems.
A network programming approach in solving Darcy's equations by mixed finite-element methods.
A new algorithm for the SVD of a long product of matrices and the stability of products.
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 Geršgorin-type eigenvalue inclusion set.
A new inclusion interval for the real eigenvalues of real matrices
By properties of Cvetković-Kostić-Varga-type (or, for short, CKV-type) B-matrices, a new class of nonsingular matrices called CKV-type -matrices is given, and a new inclusion interval of the real eigenvalues of real matrices is presented. It is shown that the new inclusion interval is sharper than those provided by J. M. Peña (2003), and by H. B. Li et al. (2007). We also propose a direct algorithm for computing the new inclusion interval. Numerical examples are included to illustrate the effectiveness...
A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices.
A New Method for the Solution of A x = b.
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 new source of structured singular value decomposition problems.
A new Variant of an Iterative Method for Solving the Complete Eigenvalue of Matrices
A Newton Iteration Process for Inverse Eigenvalue Problems.
A Note on a One-sided Jacobi Algorithm.
A note on algorithms for determining the copositivity of a given symmetric matrix.
A note on certain ergodicity coeflcients
We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized version have been shown so far.We provide a further result concerning the limit of its powers. Then we propose a generalization of the second coefficient τ n−1 and we show that, under mild conditions, it can be used to recast the eigenvector problem...