In this work we present a new simple but efficient scheme -- Subsquares approach -- for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this scheme and discuss their features.
We start with a simple algorithm as a motivation, then we continue with an improved algorithm. Both algorithms can be easily parallelized.
The features of both algorithms will be discussed and numerically tested.