On the realizability of open nonnegative inverse eigenvalue problems
From MaRDI portal
Publication:419101
DOI10.1016/J.AML.2011.09.041zbMATH Open1239.15012OpenAlexW1971951732MaRDI QIDQ419101FDOQ419101
Authors: Junliang Wu
Publication date: 18 May 2012
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2011.09.041
Recommendations
Cites Work
- Eigenvalues of nonnegative symmetric matrices
- On the nonnegative eigenvalue problem
- Spectral properties of doubly-stochastic matrices
- Matrices similar to a positive or essentially positive matrix
- Matrix theory
- Row Stochastic Matrices Similar to Doubly Stochastic Matrices
- The spectra of nonnegative matrices via symbolic dynamics
- Eigenvalues of nonnegative matrices
- The nonnegative inverse eigenvalue problem.
- Methods of constructing certain stochastic matrices
- The real and the symmetric nonnegative inverse eigenvalue problems are different
- Title not available (Why is that?)
- A note on an inverse problem for nonnegative matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- An inverse eigenvalue problem for symmetric and normal matrices
- Title not available (Why is that?)
- A characterization of trace zero nonnegative \(5\times 5\) matrices
- A note on the convexity of the realizable set of eigenvalues for nonnegative symmetric matrices
- An inequality for nonnegative matrices and the inverse eigenvalue problem
- A refinement of an inequality of Johnson, Loewy and London on nonnegative matrices and some applications
- Title not available (Why is that?)
- REALIZABILITY BY SYMMETRIC NONNEGATIVE MATRICES<A HREF="#tit">*</A>
- Title not available (Why is that?)
Cited In (6)
- On open problems of nonnegative inverse eigenvalues problem
- Title not available (Why is that?)
- An efficient algorithm based on Lanczos type of BCR to solve constrained quadratic inverse eigenvalue problems
- A unified view on compensation criteria in the real nonnegative inverse eigenvalue problem
- Diagonal realizability in the Nonnegative Inverse Eigenvalue Problem
- The real nonnegative inverse eigenvalue problem is NP-hard
This page was built for publication: On the realizability of open nonnegative inverse eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419101)