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

DOI10.1007/S10492-007-0005-6zbMath1164.15310OpenAlexW2045042368MaRDI QIDQ954610

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

zbMATH Keywords

positive definitenessnonsingularityfixed-point roundingpositive invertibility

Mathematics Subject Classification ID

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

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Systems of linear interval equations
• Nonsingularity under data rounding
• Computational complexity and feasibility of data processing and interval computations
• Checking robust nonsingularity is NP-hard
• Positive Definiteness and Stability of Interval Matrices
• Computing the norm ∥A∥∞,1 is NP-hard^∗

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