Nonsingularity, positive definiteness, and positive invertibility under fixed-point data rounding.

DOI10.1007/S10492-007-0005-6MaRDI QIDQ954610zbMATH OpenOpenAlexFDO

Authors Jiří Rohn

Publication date 24 November 2008

Published in Applications of Mathematics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/33279, http://hdl.handle.net/10338.dmlcz/134666

zbMATH Keywords

fixed-point roundingnonsingularitypositive definitenesspositive invertibility

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Conditioning of matrices (15A12) Positive matrices and their generalizations; cones of matrices (15B48) Roundoff error (65G50)

Recommendations

• Matrix rounding with respect to small submatrices
• Verification of positive definiteness
• Unbiased Matrix Rounding
• Computing a nearest symmetric positive semidefinite matrix
• Fast verification of solutions of matrix equations

Cites work

• Checking robust nonsingularity is NP-hard
• Computational complexity and feasibility of data processing and interval computations
• Computing the norm ∥A∥∞,1 is NP-hard^∗
• scientific article; zbMATH DE number 4022477 (Why is no real title available?)
• scientific article; zbMATH DE number 846277 (Why is no real title available?)
• Nonsingularity under data rounding
• Positive Definiteness and Stability of Interval Matrices
• Systems of linear interval equations

Cited in

(1)

• Decision problems and round-off machines

Describes a project that uses

Uses Software

• mctoolbox

This page was built for publication: Nonsingularity, positive definiteness, and positive invertibility under fixed-point data rounding.

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