A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices

DOI10.21136/am.1993.104547zbMath0782.65044OpenAlexW2737128477MaRDI QIDQ686058

Lars Pieper, Günter Mayer

Publication date: 9 November 1993

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

Full work available at URL: https://eudml.org/doc/15747

zbMATH Keywords

interval analysislinear equationsinterval Gaussian algorithm

Mathematics Subject Classification ID

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

Related Items (4)

Direct methods for linear systems with inexact input data ⋮ On regular and singular interval systems ⋮ Linear systems with \(\Omega\)-diagonally dominant matrices and related ones ⋮ A contribution to the feasibility of the interval Gaussian algorithm

Uses Software

• PASCAL-XSC

Cites Work

• New techniques for the analysis of linear interval equations
• Interval Methods for Systems of Equations
• A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices