For EDITORS

For READERS

All Issues

Vol.7, 2017
Vol.6, 2016
Vol.5, 2015
Vol.4, 2014
Vol.3, 2013
Vol.2, 2012
Vol.1, 2011
Construction of full H-matrices with the given eigenvalues based on the Givens matrices
Keywords:Full matrix; H-matrix; Strictly diagonally dominant matrix; $\alpha$-strictly diagonally dominant matrix; $\alpha$-double strictly diagonally dominant matrix, Givens matrix.
Abstract:
      The inverse eigenvalue problem is about how to construct a desired matrix whose spectrum is the given number set. In this paper, in view of the Givens matrices, we prove that there exist three classes of full H-matrices which include strictly diagonally dominant full matrix, $\alpha$-strictly diagonally dominant full matrix and $\alpha$-double strictly diagonally dominant full matrix, and their spectrum are all the given number set. In addition, we design some numerical algorithms to explain how to construct the above-mentioned full H-matrices.