On the solvability of derived matrix problems, including completions and duals

DOI10.1016/J.LAA.2016.08.026MaRDI QIDQ347496zbMATH OpenOpenAlexFDO

Authors Charles R. Johnson, António Leal Duarte

Publication date 30 November 2016

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2016.08.026

zbMATH Keywords

matrix completion problemHadamard dualqunantifier eliminationreal-algebraic geometrysemi-algebraic matrix class

Mathematics Subject Classification ID

Basic linear algebra (15A99) Semialgebraic sets and related spaces (14P10)

Recommendations

• Matrix completion problems with arbitrary locations of prescribed entries
• scientific article; zbMATH DE number 523915
• Uniqueness of the solutions of some completion problems
• A completion problem over the field of real numbers
• Matrix completion problems for pairs of related classes of matrices.

Cites work

• scientific article; zbMATH DE number 3887879 (Why is no real title available?)
• scientific article; zbMATH DE number 4158856 (Why is no real title available?)
• scientific article; zbMATH DE number 4029737 (Why is no real title available?)
• scientific article; zbMATH DE number 47926 (Why is no real title available?)
• scientific article; zbMATH DE number 1793704 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• A new decision method for elementary algebra
• Algorithms in real algebraic geometry
• Complete solution to the \(TP_{2}\) completion problem
• Hadamard duals, retractability and Oppenheim's inequality
• Matrix Analysis
• Numerical range of a matrix: Some effective criteria
• Positive definite completions of partial Hermitian matrices
• The Hadamard core of the totally nonnegative matrices
• The completion problem for \(M\)-matrices and inverse \(M\)-matrices
• Totally nonnegative matrices

Cited in

(4)

• Complex symmetric completions of partial operator matrices
• The totally positive completion problem: the 3-by-n case
• Completion of TP and TN border patterns
• Matrix Fejér-Riesz theorem with gaps

This page was built for publication: On the solvability of derived matrix problems, including completions and duals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347496)