AbstractWe investigate certain inverse problems involving symmetric matrices. In particular, given a finite list of numbers and a symmetric matrix, how many changes to the diagonal entries will suffice for the numbers in the list to be eigenvalues
AbstractThe following inverse eigenvalue problem was introduced and discussed in [J. Peng, X.Y. Hu, ...
Let G be a simple undirected graph on n vertices and let S(G) be the class of real symmetric n by n ...
AbstractThe symmetric nonnegative inverse eigenvalue problem (SNIEP) asks when a list σ=(λ1,λ2,…,λn)...
AbstractWe investigate certain inverse problems involving symmetric matrices. In particular, given a...
AbstractThe classical inverse additive and multiplicative inverse eigenvalue problems for matrices a...
In this paper we study the inverse eigenvalue problem for symmetric special matrices and introduce s...
In this paper we study the inverse eigenvalue problem for symmetric special matrices and introduce s...
AbstractThis paper deals with the following inverse eigenvalue problem: Given an n by n real symmetr...
AbstractThe inverse eigenvalue problem for real symmetric matrices of the form000⋯00∗000⋯0∗∗000⋯∗∗0·...
AbstractThis paper gives new bounds for the relationship between the diagonal elements of a square m...
AbstractIn this paper, a special kind of matrices which are symmetric, all elements are equal to zer...
AbstractThe paper ios concerned with the problem of finding a real, diagonal matrix M such that A + ...
AbstractA numerical algorithm for the inverse eigenvalue problem for symmetric matrices is developed...
AbstractSome new sufficient conditions are found for n real numbers to be the spectrum of some n × n...
Abstract. Let G be a simple undirected graph on n vertices and let S(G) be the class of real symmetr...
AbstractThe following inverse eigenvalue problem was introduced and discussed in [J. Peng, X.Y. Hu, ...
Let G be a simple undirected graph on n vertices and let S(G) be the class of real symmetric n by n ...
AbstractThe symmetric nonnegative inverse eigenvalue problem (SNIEP) asks when a list σ=(λ1,λ2,…,λn)...
AbstractWe investigate certain inverse problems involving symmetric matrices. In particular, given a...
AbstractThe classical inverse additive and multiplicative inverse eigenvalue problems for matrices a...
In this paper we study the inverse eigenvalue problem for symmetric special matrices and introduce s...
In this paper we study the inverse eigenvalue problem for symmetric special matrices and introduce s...
AbstractThis paper deals with the following inverse eigenvalue problem: Given an n by n real symmetr...
AbstractThe inverse eigenvalue problem for real symmetric matrices of the form000⋯00∗000⋯0∗∗000⋯∗∗0·...
AbstractThis paper gives new bounds for the relationship between the diagonal elements of a square m...
AbstractIn this paper, a special kind of matrices which are symmetric, all elements are equal to zer...
AbstractThe paper ios concerned with the problem of finding a real, diagonal matrix M such that A + ...
AbstractA numerical algorithm for the inverse eigenvalue problem for symmetric matrices is developed...
AbstractSome new sufficient conditions are found for n real numbers to be the spectrum of some n × n...
Abstract. Let G be a simple undirected graph on n vertices and let S(G) be the class of real symmetr...
AbstractThe following inverse eigenvalue problem was introduced and discussed in [J. Peng, X.Y. Hu, ...
Let G be a simple undirected graph on n vertices and let S(G) be the class of real symmetric n by n ...
AbstractThe symmetric nonnegative inverse eigenvalue problem (SNIEP) asks when a list σ=(λ1,λ2,…,λn)...
DOI
Add to ORKG