Theorems on Schur complement of block diagonally dominant matrices and their application in reducing the order for the solution of large scale linear systems

We firstly consider the block dominant degree for I-(II-)block strictly diagonally dominant matrix and their Schur complements, showing that the block dominant degree for the Schur complement of an I-(II-)block strictly diagonally dominant matrix is greater than that of the original grand block matrix. Then, as application, we present some disc theorems and some bounds for the eigenvalues of the Schur complement by the elements of the original matrix. Further, by means of matrix partition and the Schur complement of block matrix, based on the derived disc theorems, we give a kind of iteration called the Schur-based iteration, which can solve large scale linear systems though reducing the order by the Schur complement and the numerical example illustrates that the iteration can compute out the results faster. (C) 2011 Elsevier Inc. All rights reserved.