Solving cubics by polynomial fitting
نویسندگان
چکیده
منابع مشابه
Curve Fitting with Bézier Cubics
1. An image’s outline cannot be fitted by a single cubic Bézier curve piece if it contains corners. Corners are points In this paper, a new curve-fitting algorithm is presented. This algorithm can automatically fit a set of data points with at which the outline’s directions take a sharp turn, or the piecewise geometrically continuous (G) cubic Bézier curves. outlines have discontinuous tangent ...
متن کاملSolving Parametric Polynomial Systems by RealComprehensiveTriangularize
In the authors’ previous work, the concept of comprehensive triangular decomposition of parametric semi-algebraic systems (RCTD for short) was introduced. For a given parametric semi-algebraic system, say S, an RCTD partitions the parametric space into disjoint semialgebraic sets, above each of which the real solutions of S are described by a finite family of triangular systems. Such a decompos...
متن کاملSolving Polynomial Systems by Matrix Computations
Two main approaches are used, nowadays, to compute the roots of a zero-dimensional polynomial system. The rst one involves Grrbner basis computation, and applies to any zero-dimensional system. But, it is performed with exact arithmetic and, usually, big numbers appear during the computation. The other approach is based on resultant formulations and can be performed with oating point arithmetic...
متن کاملSolving Polynomial Systems Equation by Equation∗
By a numerical continuation method called a diagonal homotopy, one can compute the intersection of two irreducible positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure to intersect general solution sets that are not necessarily irreducible or even equidimensional. Of particular interest is the special case whe...
متن کاملPolynomial Systems Solving by Fast Linear Algebra
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to stick to the most general case, we consider a representation of the solutions from which one can easily recover the exact solutions or a certified approximatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2011
ISSN: 0377-0427
DOI: 10.1016/j.cam.2010.12.025