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

The authors consider three problems of a I-(II-)strictly diagonally dominant matrix (SDDM) as follows: (1) Consider the block dominant degree for the Schur complement of the I-(II-)block SDDM compared with that of the original matrix. It is shown that the block dominant degree for the Schur complement of a I-(II-)block SDDM is greater than that of the original grand block matrix, thus extending results of Berman and Plemmons. (2) Give some disc theorems and show some bounds for the eigenvalues of the Schur complement of I-(II-)block SDDM by the elements of the original matrix. (3) Give an iteration, called Schur-based iteration, which can solve large scale linear systems through reducing the order by the Schur complement; a numerical example illustrates that the iteration can compute the results faster.