Found 3 document(s)
Page 1 of 1
-
We study the problem of computing the L1-distance between two piecewise-linear bivariate functions f and g, defined over a common bounded domain M ā R 2 , that is, computing the quantity ā„f -gā„1 = M |f (x, y)-g(x, y)| dx...
-
Given a polynomial $p$ of degree $d$ and a bound $\kappa$ on a condition number of $p$, we present the first root-finding algorithms that return all its real and complex roots with a number of bit operations quasi-linear...
-
Computing efficiently the singularities of surfaces embedded in R^3 is a difficult problem, and most state-of-the-art approaches only handle the case of surfaces defined by polynomial equations. Let F and G be Cā functio...