An approach to overcome division by zero in the interval Gauss algorithm

DOI10.1023/A:1015565313636MaRDI QIDQ1611216zbMATH OpenFDO

Authors Jan Mayer

Publication date 21 August 2002

Published in Reliable Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1015565313636

zbMATH Keywords

interval arithmeticinterval Gauss algorithmlinear interval equationstotally non-negative interval matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Interval and finite arithmetic (65G30)

Review text

This work is devoted to certain modifications of the usual interval Gauss algorithm aiming at widening the scope of its applicability. In particular the proposed modified algorithm can be used to solve systems of linear interval equations with totally non-negative interval matrices.

Recommendations

• Interval Gaussian Elimination with Pivot Tightening
• On the applicability of the interval Gaussian algorithm
• A contribution to the feasibility of the interval Gaussian algorithm
• scientific article; zbMATH DE number 714513
• A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm

Cited in

(4)

• Interval Gaussian Elimination with Pivot Tightening
• A contribution to the feasibility of the interval Gaussian algorithm
• Direct methods for linear systems with inexact input data
• On regular and singular interval systems

This page was built for publication: An approach to overcome division by zero in the interval Gauss algorithm

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