New Criteria for the Feasibility of the Cholesky Method with Interval Data

DOI10.1137/070711232zbMath1176.65023OpenAlexW1997683498MaRDI QIDQ3642838

Günter Mayer, G. E. Alefeld

Publication date: 6 November 2009

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000007862/246175

zbMATH Keywords

linear interval equationssystem of linear equationsinterval Gaussian algorithmcriteria of feasibilityinterval Cholesky algorithm

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Direct numerical methods for linear systems and matrix inversion (65F05) Algorithms with automatic result verification (65G20)

Related Items (5)

Direct methods for linear systems with inexact input data ⋮ Enclosures for the solution set of parametric interval linear systems ⋮ Generalized eigenvalue problem for interval matrices ⋮ Pivot tightening for direct methods for solving symmetric positive definite systems of linear interval equations ⋮ On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data

This page was built for publication: New Criteria for the Feasibility of the Cholesky Method with Interval Data