Parallel Interval Newton Method on CUDA

  title={Parallel Interval Newton Method on CUDA},
  author={P. Beck and Marco Nehmeier},
In this paper we discuss a parallel variant of the interval Newton method for root finding of non linear continuously differentiable functions on the CUDA architecture. For this purpose we have investigated different dynamic load balancing methods to get an evenly balanced workload during the parallel computation. We tested the functionality, correctness and performance of our implementation in different case studies and compared it with other implementations. 
9 Citations
Parallelization of B&BT Algorithms
CUIRRE: An open-source library for load balancing and characterizing irregular applications on GPUs
  • 8
  • PDF
An efficient algorithm for global interval solution of nonlinear algebraic equations and its GPGPU implementation
  • PDF
Characterizing and Optimizing Irregular Applications on Graphics Processing Units
Toward Efficient Transparent Computing for IoT Apps by On-Chip Kernel Offload
  • 3


Parallel Interval-Newton Using Message Passing: Dynamic Load Balancing Strategies
  • 4
On dynamic load balancing on graphics processors
  • 104
  • PDF
Thread Scheduling for Multiprogrammed Multiprocessors
  • 447
  • PDF
The Boost Interval Arithmetic Library
  • 41
  • PDF
Fragment‐Parallel Composite and Filter
  • 32
  • PDF
CUDA by Example: An Introduction to General-Purpose GPU Programming
  • J. Cheng
  • Computer Science
  • Scalable Comput. Pract. Exp.
  • 2010
  • 939
  • PDF