On the applicability of the interval Gaussian algorithm

DOI10.1023/A:1009997411503zbMATH Open0933.65027OpenAlexW33808975MaRDI QIDQ1276141FDOQ1276141

Authors: Günter Mayer, Jiří Rohn 

Publication date: 17 January 1999

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009997411503

Recommendations

• A New Criterion to Guarantee the Feasibility of the Interval Gaussian Algorithm
• Systems of linear interval equations
• A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
• On Optimal Solution of Interval Linear Equations

zbMATH Keywords

system of linear interval equationsinterval Gaussian algorithminterval Newton algorithm

Mathematics Subject Classification ID

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

Cited In (13)

• A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
• The feasibility of the interval Gaussian algorithm for arrowhead matrices
• A contribution to the feasibility of the interval Gaussian algorithm
• An approach to overcome division by zero in the interval Gauss algorithm
• Highly accurate verified error bounds for Krylov type linear system solvers
• Linear systems with \(\Omega\)-diagonally dominant matrices and related ones
• Direct methods for linear systems with inexact input data
• Interval analysis: Theory and applications
• Interval-affine Gaussian algorthm for constrained systems
• Interval linear systems: the state of the art
• On regular and singular interval systems
• Interval mathematics, algebraic equations and optimization
• How strong is strong regularity?

This page was built for publication: On the applicability of the interval Gaussian algorithm

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