Using noncommutative Gröbner bases in solving partially prescribed matrix inverse completion problems

DOI10.1016/S0024-3795(01)00382-2MaRDI QIDQ5955656zbMATH OpenOpenAlexFDO

Authors F. Dell Kronewitter

Publication date 25 September 2002

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

Full work available at URL https://arxiv.org/abs/math/0101245

zbMATH Keywords

matrix completionmatrix inverse completionnoncommutative Gröbner bases

Mathematics Subject Classification ID

Inverse problems in linear algebra (15A29) Computational aspects of associative rings (general theory) (16Z05)

Abstract: We investigate the use of noncommutative Groebner bases in solving partially prescribed matrix inverse completion problems. The types of problems considered here are similar to those in [BLJW]. There the authors gave necessary and sufficient conditions for the solution of a two by two block matrix completion problem. Our approach is quite different from theirs and relies on symbolic computer algebra. Here we describe a general method by which all block matrix completion problems of this type may be analyzed if sufficient computational power is available. We also demonstrate our method with an analysis of all three by three block matrix inverse completion problems with eleven blocks known and seven unknown. We discover that the solutions to all such problems are of a relatively simple form. We then perform a more detailed analysis of a particular problem from the 31,824 three by three block matrix completion problems with eleven blocks known and seven unknown. A solution to this problem of the form derived in [BLJW] is presented. Not only do we give a proof of our detailed result, but we describe the strategy used in discovering our theorem and proof, since it is somewhat unusual for these types of problems.

Review text

The author investigates the use of noncommutative Gröbner bases in solving partially prescribed matrix inverse completion problems. The author describes a general method by which all block matrix completion problems may be analyzed if sufficient computational power is available. The method is demonstrated with an analysis of all \(3\times 3\) block matrix inverse completion problems with 11 blocks known and 7 unknown. The solutions to all such problems are of a relatively simple form.NEWLINENEWLINENEWLINEA more detailed analysis of a particular problem from the 31824 \(3\times 3\) block matrix completion problems with 11 blocks known and 7 unknown is also performed. A solution to this problem is presented.

Recommendations

• Inverse completion for partial matrices
• Completing a block diagonal matrix with a partially prescribed inverse
• Matrix completion problems with arbitrary locations of prescribed entries
• Matrix completion problems
• On the construction of explicit solutions to the matrix equation \(X^{2}AX = AXA\)

Cites work

• Completing a block diagonal matrix with a partially prescribed inverse
• Computer assistance for ``discovering formulas in system engineering and operator theory
• scientific article; zbMATH DE number 4077463 (Why is no real title available?)
• scientific article; zbMATH DE number 4098590 (Why is no real title available?)
• scientific article; zbMATH DE number 108068 (Why is no real title available?)
• Matrix inequalities
• Opal: a system for computing noncommutative Gröbner bases

Cited in

(3)

• Formal proofs of operator identities by a single formal computation
• Gröbner finite path algebras.
• Solving Linear Boundary Value Problems Via Non-commutative Gröbner Bases

Describes a project that uses

Uses Software

• Opal
• Mathematica
• NCAlgebra
• NCGB

This page was built for publication: Using noncommutative Gröbner bases in solving partially prescribed matrix inverse completion problems

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