Efficient task scheduling in the parallel result-verifying solution of nonlinear systems

DOI10.1007/s11155-006-4872-4zbMath1083.65051OpenAlexW2074889702MaRDI QIDQ811943

Thomas Beelitz, Bruno Lang, Christian H. Bischof

Publication date: 23 January 2006

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11155-006-4872-4

zbMATH Keywords

numerical resultsnonlinear systemsinterval arithmeticparallelization

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30) Parallel numerical computation (65Y05)

Related Items (2)

A class of problems that can be solved using interval algorithms ⋮ Subdivision strategies for boxes in branch-and-bound nonlinear solvers and verification

Uses Software

• C-XSC
• C-XSC 2.0
• INTOPT_90
• filib++
• GlobSol
• SONIC

Cites Work

• Unnamed Item
• Unnamed Item
• Singularities and groups in bifurcation theory. Volume I
• The NX message passing interface
• Rigorous global search: continuous problems
• A Hybrid Subdivision Strategy for Result-Verifying Nonlinear Solvers
• A Hybrid Approach for Efficient Robust Design of Dynamic Systems
• FILIB++, a fast interval library supporting containment computations
• Interval Methods for Systems of Equations
• Verified Determination of Singularities in Chemical Processes
• Numerical Software with Result Verification
• Efficient and Safe Global Constraints for Handling Numerical Constraint Systems

This page was built for publication: Efficient task scheduling in the parallel result-verifying solution of nonlinear systems