Abbruch beim Intervall-Gauß-Algorithmus

DOI10.1007/BF02265315zbMath0409.65019OpenAlexW1590312268MaRDI QIDQ1259139

K. Reichmann

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02265315

zbMATH Keywords

CounterexampleInterval ArithmeticDirect MethodsInterval Gauss EliminationInterval Tridiagonal MatricesNumerical Linear Algebra

Mathematics Subject Classification ID

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

Related Items (8)

Enclosing solutions of linear interval equations is NP-hard ⋮ Direct methods for linear systems with inexact input data ⋮ A new subclass of \(P\)-matrices ⋮ Sharpening interval computations ⋮ New techniques for the analysis of linear interval equations ⋮ Interval iteration for zeros of systems of equations ⋮ The Cholesky method for interval data ⋮ A contribution to the feasibility of the interval Gaussian algorithm

Cites Work

• Optimale Lösung von Intervallgleichungssystemen
• Ein hinreichendes Kriterium für die Durchführbarkeit des Intervall-Gauss-Algorithmus bei Intervall-Hessenberg-Matrizen ohne Pivotsuche
• Unnamed Item
• Unnamed Item

This page was built for publication: Abbruch beim Intervall-Gauß-Algorithmus