An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks

We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of points. First, the amount of purely symbolic operations is significantly reduced, that is, only resultant computation and square-free factorization is still needed. Second, our algorithm neither assumes generic position of the input system nor demands for any change of the coordinate system. The latter is due to a novel inclusion predicate to certify that a certain region is isolating for a solution. Our implementation exploits graphics hardware to expedite the resultant computation. Furthermore, we integrate a number of filtering techniques to improve the overall performance. Efficiency of the proposed method is proven by a comparison of our implementation with two state-of-the-art implementations, that is, LPG and Maple's isolate. For a series of challenging benchmark instances, experiments show that our implementation outperforms both contestants.Comment: 16 pages with appendix, 1 figure, submitted to ALENEX 201

Extending a serial 3D two-phase CFD code to parallel execution over MPI by using the PETSc library for domain decomposition

To leverage the last two decades' transition in High-Performance Computing (HPC) towards clusters of compute nodes bound together with fast interconnects, a modern scalable CFD code must be able to efficiently distribute work amongst several nodes using the Message Passing Interface (MPI). MPI can enable very large simulations running on very large clusters, but it is necessary that the bulk of the CFD code be written with MPI in mind, an obstacle to parallelizing an existing serial code. In this work we present the results of extending an existing two-phase 3D Navier-Stokes solver, which was completely serial, to a parallel execution model using MPI. The 3D Navier-Stokes equations for two immiscible incompressible fluids are solved by the continuum surface force method, while the location of the interface is determined by the level-set method. We employ the Portable Extensible Toolkit for Scientific Computing (PETSc) for domain decomposition (DD) in a framework where only a fraction of the code needs to be altered. We study the strong and weak scaling of the resulting code. Cases are studied that are relevant to the fundamental understanding of oil/water separation in electrocoalescers.Comment: 8 pages, 6 figures, final version for to the CFD 2014 conferenc

Numerical relativity with characteristic evolution, using six angular patches

The characteristic approach to numerical relativity is a useful tool in evolving gravitational systems. In the past this has been implemented using two patches of stereographic angular coordinates. In other applications, a six-patch angular coordinate system has proved effective. Here we investigate the use of a six-patch system in characteristic numerical relativity, by comparing an existing two-patch implementation (using second-order finite differencing throughout) with a new six-patch implementation (using either second- or fourth-order finite differencing for the angular derivatives). We compare these different codes by monitoring the Einstein constraint equations, numerically evaluated independently from the evolution. We find that, compared to the (second-order) two-patch code at equivalent resolutions, the errors of the second-order six-patch code are smaller by a factor of about 2, and the errors of the fourth-order six-patch code are smaller by a factor of nearly 50.Comment: 12 pages, 5 figures, submitted to CQG (special NFNR issue