Efficient interval linear equality solving in constraint logic programming (Q1597646)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Efficient interval linear equality solving in constraint logic programming
scientific article

    Statements

    Efficient interval linear equality solving in constraint logic programming (English)
    0 references
    0 references
    0 references
    30 May 2002
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    preconditioning
    0 references
    linear interval constraint solver
    0 references
    interval Gauss-Seidel method
    0 references
    logic programming language
    0 references
    interval constrained arithmetic language
    0 references
    0 references