scientific article; zbMATH DE number 802414
From MaRDI portal
Publication:4849581
zbMath0829.65039MaRDI QIDQ4849581
Publication date: 4 October 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityoptimal solutionsinterval linear algebraic systemssequentially guaranteeing algorithms
Interval and finite arithmetic (65G30) Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20)
Related Items (4)
Inner estimation of the united solution set of interval linear algebraic system ⋮ Applications of interval computations to earthquake-resistant engineering: How to compute derivatives of interval functions fast ⋮ Approximate linear algebra is intractable ⋮ Solving interval linear least squares problems by PPS-methods
This page was built for publication: