scientific article; zbMATH DE number 714524
From MaRDI portal
Publication:4321544
zbMath0810.65025MaRDI QIDQ4321544
Publication date: 25 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityinterval arithmeticpolynomial-time algorithminterval matricesmatrix inversionNP-hardnesssystems of linear equationschecking nonsingularity
Analysis of algorithms and problem complexity (68Q25) Interval and finite arithmetic (65G30) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (5)
Fast verified solutions of linear systems ⋮ Algebraic approach to the interval linear static identification, tolerance, and control problems, or one more application of Kaucher arithmetic ⋮ Calculation of exact bounds for the solution set of linear interval systems ⋮ Solving interval linear systems with linear programming techniques ⋮ Perron-Frobenius theory for complex matrices
This page was built for publication:
