A class of problems that can be solved using interval algorithms

DOI10.1007/s00607-011-0173-9zbMath1235.65043OpenAlexW2059278501MaRDI QIDQ411419

Bartłomiej Jacek Kubica

Publication date: 4 April 2012

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-011-0173-9

zbMATH Keywords

data structurespredicate logicinterval branch-and-bound methodsinterval algorithmsmultithreaded programmingshared-memory parallelization

Mathematics Subject Classification ID

Related Items (1)

Distributed networked set-membership filtering with ellipsoidal state estimations

Uses Software

• INTOPT_90
• Intel TBB

Cites Work

• Efficient task scheduling in the parallel result-verifying solution of nonlinear systems
• Rigorous global search: continuous problems
• A surprising approach in interval global optimization
• A new technique in systems analysis under interval uncertainty and ambiguity
• Algebraic approach to the interval linear static identification, tolerance, and control problems, or one more application of Kaucher arithmetic
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
• The Shape of the Solution Set for Systems of Interval Linear Equations with Dependent Coefficients
• On maximal inner estimation of the solution sets of linear systems with interval parameters
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of problems that can be solved using interval algorithms