Efficient interval linear equality solving in constraint logic programming

From MaRDI portal
Publication:1597646





The implementation of an efficient linear interval constraint solver is proposed. The solver is based on the preconditioned interval Gauss-Seidel method. It is shown how the solver can be adapted into a constrained logic programming language already equipped with a nonlinear solver. The two solvers result in an interval constrained arithmetic language. Prototypes are compared with several other constraint logic programming languages.





Describes a project that uses

Uses Software






This page was built for publication: Efficient interval linear equality solving in constraint logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1597646)