Matrix completion problems with arbitrary locations of prescribed entries

MaRDI QIDQ5932997zbMATH OpenFDO

Authors Kh. D. Ikramov, V. N. Chugunov

Publication date 5 July 2001

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

characteristic polynomialinverse eigenvalue problemmatrix completionnumerical examples

Mathematics Subject Classification ID

Inverse problems in linear algebra (15A29) Numerical solutions to inverse eigenvalue problems (65F18)

Recommendations

• Matrix completion problems
• A completion problem over the field of real numbers
• Matrix completion problems of block type
• On computer algebra procedures constructing matrices with prescribed eigenvalues and diagonal entries
• scientific article; zbMATH DE number 523915

Cited in

(8)

• Matrix completion from noisy entries
• On the solvability of derived matrix problems, including completions and duals
• scientific article; zbMATH DE number 1413869 (Why is no real title available?)
• Matrix Completion From a Few Entries
• On computer algebra procedures constructing matrices with prescribed eigenvalues and diagonal entries
• Matrix completion problems of block type
• Using noncommutative Gröbner bases in solving partially prescribed matrix inverse completion problems
• A matrix completion problem over integral domains: the case with 2n-3 prescribed entries

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Matrix completion problems with arbitrary locations of prescribed entries

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