- total, algebraic, and discretization errors: guaranteed upper and lower bounds;
- valid for arbitrary iterative algebraic solver;
- estimating the local distribution of the errors over the computational domain;
- safe stopping criteria for iterative algebraic solvers: the algebraic error will lie below the discretization one;
- reliability and efficiency;
- recovering mass balance in any situation.