Abstract:Given a list of real numbers , we determine the conditions under which will form the spectrum of a dense n × n singular symmetric matrix. Based on a solvability lemma, an algorithm to compute the elements of the matrix is derived for a given list and dependency parameters. Explicit computations are performed for 5 n and to illustrate the result.
“…The free variables are a 13 , a 14 , a 15 , a 34 , a 35 and a 45 trA (5,4) = λ 1 + λ 2 + λ 3 + λ 4 = a 11 (1 + |k| 2 ) + a 33 + a 44 + a 55 . Thus a 11 =λ 1 /(1 + |k| 2 ), λ 2 = a 33 , λ 3 = a 44 and λ 4 = a 55 .…”
Section: Resultsmentioning
confidence: 99%
“…For instance, given λ 1 = 5, λ 2 = 2, λ 3 = -1, λ 4 = 3, k = -2i, a 13 = 1 + i, a 14 = i, a 15 = 2i, a 34 = 1-2i, a 35 = 1 + 2i, and a 45 = 1 + 3i, a singular Hermitian matrix A (5,4) is generated below:…”
Section: Resultsmentioning
confidence: 99%
“…A (4,3) = Case 4: Lastly we present 5 × 5 singular Hermitian matrices of rank 3. Then A (5,3) will be of the form: tr(A (5,3) ) = λ 1 + λ 2 + λ 3 = a 11 (1 + |k 1 | 2 + |k 1 | 2 |k 2 | 2 ) + a 44 + a 55 . This implies that a 11 = λ 1 /1 + |k 1 | 2 + |k 1 | 2 |k 2 | 2 , λ 2 = a 44 and λ 3 = a 55 .…”
In this article, we discuss singular Hermitian matrices of rank greater or equal to four for an inverse eigenvalue problem. Specifically, we look into how to generate n by n singular Hermitian matrices of ranks four and five from a prescribed spectrum. Numerical examples are presented in each case to illustrate these scenarios. It was established that given a prescribed spectral datum and it multiplies, then the solubility of the inverse eigenvalue problem for n by n singular Hermitian matrices of rank r exists.
“…The free variables are a 13 , a 14 , a 15 , a 34 , a 35 and a 45 trA (5,4) = λ 1 + λ 2 + λ 3 + λ 4 = a 11 (1 + |k| 2 ) + a 33 + a 44 + a 55 . Thus a 11 =λ 1 /(1 + |k| 2 ), λ 2 = a 33 , λ 3 = a 44 and λ 4 = a 55 .…”
Section: Resultsmentioning
confidence: 99%
“…For instance, given λ 1 = 5, λ 2 = 2, λ 3 = -1, λ 4 = 3, k = -2i, a 13 = 1 + i, a 14 = i, a 15 = 2i, a 34 = 1-2i, a 35 = 1 + 2i, and a 45 = 1 + 3i, a singular Hermitian matrix A (5,4) is generated below:…”
Section: Resultsmentioning
confidence: 99%
“…A (4,3) = Case 4: Lastly we present 5 × 5 singular Hermitian matrices of rank 3. Then A (5,3) will be of the form: tr(A (5,3) ) = λ 1 + λ 2 + λ 3 = a 11 (1 + |k 1 | 2 + |k 1 | 2 |k 2 | 2 ) + a 44 + a 55 . This implies that a 11 = λ 1 /1 + |k 1 | 2 + |k 1 | 2 |k 2 | 2 , λ 2 = a 44 and λ 3 = a 55 .…”
In this article, we discuss singular Hermitian matrices of rank greater or equal to four for an inverse eigenvalue problem. Specifically, we look into how to generate n by n singular Hermitian matrices of ranks four and five from a prescribed spectrum. Numerical examples are presented in each case to illustrate these scenarios. It was established that given a prescribed spectral datum and it multiplies, then the solubility of the inverse eigenvalue problem for n by n singular Hermitian matrices of rank r exists.
“…Most research effort have been directed at solving the inverse eigenvalue problem for nonsingular symmetric matrices (Chu & Golub, 2005;Gladwell, 2004;Deakin & Luke, 1992;Chu, 1995). Recently, however, the case of singular symmetric matrices of arbitrary order and rank has been virtually solved provided linear dependency relations are specified Aidoo, Gyamfi, Ackora-Prah, & Oduro, 2013). It is plausible to expect solutions of the inverse eigenvalue problem in a sufficiently small neighborhood of any such Hermitian matrix.…”
Using distinct non zero diagonal elements of a Hermitian (or anti Hermitian) matrix as independent variables of the characteristic polynomial function, a Newton's algorithm is developed for the solution of the inverse eigenproblem given distinct nonzero eigenvalues. It is found that if a 2×2 singular Hermitian (or singular anti Hermitian) matrix of rank one is used as the initial matrix, convergence to an exact solution is achieved in only one step. This result can be extended to n × n matrices provided the target eigenvalues are respectively of multiplicities p and q with p + q = n and 1 ≤ p, q < n. Moreover, the initial matrix would be of rank one and would have only two distinct corresponding nonzero diagonal elements, the rest being repeated. To illustrate the result, numerical examples are given for the cases n = 2, 3 and 4.
In this article, we discuss singular Hermitian matrices of rank greater or equal to four for an inverse eigenvalue problem. Specifically, we look into how to generate n by n singular Hermitian matrices of ranks four and five from a prescribed spectrum. Numerical examples are presented in each case to illustrate these scenarios. It was established that given a prescribed spectral datum and it multiplies, then the solubility of the inverse eigenvalue problem for n by n singular Hermitian matrices of rank r exists.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.