On the computational complexity of the solution of linear systems with moduli

DOI10.1007/BF02425914zbMath0853.65040OpenAlexW395333906MaRDI QIDQ1916984

Anatoly V. Lakeyev

Publication date: 8 December 1996

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

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

zbMATH Keywords

computational complexityinterval arithmeticpolynomial-time algorithmlinear interval equationsNP-completelinear systems with moduli

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

Formal solution of an interval system of linear equations with an application in static responses of structures with interval forces

Cites Work

• Systems of linear interval equations
• Inner estimation of the united solution set of interval linear algebraic system
• Algebraic approach to the interval linear static identification, tolerance, and control problems, or one more application of Kaucher arithmetic
• Interval Methods for Systems of Equations
• Unnamed Item
• Unnamed Item

This page was built for publication: On the computational complexity of the solution of linear systems with moduli