A Computational Method for Eigenvalues and Eigenvectors of a Matrix with Real Eigenvalues.
A Conjugate Gradient Method and a Multigrid Algorithm for Morley' s Finite Element Approximation of the Biharmonic Equation.
A Constructive Method of Solving the Liapounov Equation for Complex Matrices.
A Continuous Selection of the Metric Projection in Matrix Spaces, Addendum.
A contribution to Collatz's eigenvalue inclusion theorem for nonnegative irreducible matrices.
A contribution to the successive over-relaxation method
A Contribution to the Theory of Condition.
A convergence analysis of SOR iterative methods for linear systems with weakH-matrices
It is well known that SOR iterative methods are convergent for linear systems, whose coefficient matrices are strictly or irreducibly diagonally dominant matrices and strong H-matrices (whose comparison matrices are nonsingular M-matrices). However, the same can not be true in case of those iterative methods for linear systems with weak H-matrices (whose comparison matrices are singular M-matrices). This paper proposes some necessary and sufficient conditions such that SOR iterative methods are...
A Convergent Gradient Method for Matrix Eigenvector-Eigentuple Problems.
A Convergent Jacobi Method for Solving the Eigenproblem of Arbitrary Real Matrices.
A counterexample for characterizing an invariant subspace of a matrix.
A deflation formula for tridiagonal matrices
An explicit formula for the deflation of a tridiagonal matrix is presented. The resulting matrix is again tridiagonal.
A Direct Method for Sparse Least Squares Problems with Lower and Upper Bounds.
A Divide and Conquer Method for the Symmetric Tridiagonal Eigenproblem.
A Divide and Conquer Method for Unitary and Orthogonal Eigenproblems.
A domain decomposition algorithm for elliptic problems in three dimensions.
A domain embedding method for Dirichlet problems in arbitrary space dimension
A dual-parameter double-step splitting iteration method for solving complex symmetric linear equations
We multiply both sides of the complex symmetric linear system by to obtain a new equivalent linear system, then a dual-parameter double-step splitting (DDSS) method is established for solving the new linear system. In addition, we present an upper bound for the spectral radius of iteration matrix of the DDSS method and obtain its quasi-optimal parameter. Theoretical analyses demonstrate that the new method is convergent when some conditions are satisfied. Some tested examples are given to illustrate...
A Factorization Method for the Solution of Constrained Linear Least Squares Problems Allowing Subsequent Data Changes.
A fast algorithm for blind channel identification.