Interval Systems of Linear Equations

Milan Hladík
Additional contact information
Milan Hladík: Charles University

Chapter Chapter 3 in Interval Linear Programming and Extensions, 2025, pp 45-74 from Springer

Abstract: Abstract Solving systems of linear equations is a basic problem in linear algebra, but it is also essential for many other disciplines, including optimization. Not surprisingly, problems related to interval linear equations are fundamental in interval computation and interval linear programming. In interval problems, there is no natural definition of a solution. So, we begin with an introduction to the quite usual concept of (weak) solutions that the chapter is devoted to. We present the characterization of the solution set, its geometry (nonconvex polyhedra), and its computational complexity (NP-hard). To solve interval linear equations, we discuss several enclosure (both direct and iterative) methods and also some exact methods. As a related problem, we address the regularity of interval matrices.

Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-85096-7_3

Ordering information: This item can be ordered from
http://www.springer.com/9783031850967

DOI: 10.1007/978-3-031-85096-7_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().