Search Results - "Symbolic- Numeric Algorithms"

Certified simultaneous isotopic approximation of algebraic curves via subdivision by Burr, Michael, Byrd, Michael

“…We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of algebraic curves in the plane. Our algorithm is…”
Get full text

Exact symbolic–numeric computation of planar algebraic curves by Berberich, Eric, Emeliyanenko, Pavel, Kobel, Alexander, Sagraloff, Michael

“…We present a certified and complete algorithm to compute arrangements of real planar algebraic curves. It computes the decomposition of the plane induced by a…”
Get full text

A new method to compute the singularities of offsets to rational plane curves by Alcázar, Juan Gerardo, Caravantes, Jorge, Diaz-Toca, Gema M.

“…Given a planar curve defined by means of a real rational parametrization, we prove that the affine values of the parameter generating the real singularities of…”
Get full text

Symbolic-numeric integration of rational functions by Moir, Robert H. C., Corless, Robert M., Maza, Marc Moreno, Xie, Ning

“…We consider the problem of symbolic-numeric integration of symbolic functions, focusing on rational functions. Using a hybrid method allows the reliable yet…”
Get full text

Approximate Polynomial GCD by Approximate Syzygies by Lichtblau, Daniel

“…One way to compute a GCD of a pair of multivariate polynomials is by finding a certain syzygy. We can weaken this to create an “approximate syzygy”, for the…”
Get full text

A regularization approach for estimating the type of a plane curve singularity by Hodorog, Mădălina, Schicho, Josef

“…We address the algebraic problem of analyzing the local topology of each singularity of a plane complex algebraic curve defined by a squarefree polynomial with…”
Get full text

Good reduction of Puiseux series and applications by Poteaux, Adrien, Rybowicz, Marc

“…We have designed a new symbolic–numeric strategy for computing efficiently and accurately floating point Puiseux series defined by a bivariate polynomial over…”
Get full text

A robust and efficient method for solving point distance problems by homotopy by Imbach, Rémi, Mathis, Pascal, Schreck, Pascal

“…The goal of Point Distance Solving Problems is to find 2D or 3D placements of points knowing distances between some pairs of points. The common guideline is to…”
Get full text