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

DOI10.1007/S10492-007-0005-6zbMATH Open1164.15310OpenAlexW2045042368MaRDI QIDQ954610FDOQ954610

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

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

zbMATH Keywords

positive definitenessnonsingularityfixed-point roundingpositive invertibility

Mathematics Subject Classification ID

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

Cites Work

• Checking robust nonsingularity is NP-hard
• Systems of linear interval equations
• Computational complexity and feasibility of data processing and interval computations
• Positive Definiteness and Stability of Interval Matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonsingularity under data rounding
• Computing the norm ∥A∥∞,1 is NP-hard^∗

Cited In (1)

• Decision problems and round-off machines

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)