Computation of the solutions of nonlinear polynomial systems

DOI10.1016/0167-8396(93)90019-YzbMath0817.65035OpenAlexW1984063983MaRDI QIDQ1315815

Evan C. Sherbrooke, Nicholas M. Patrikalakis

Publication date: 24 March 1994

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(93)90019-y

zbMATH Keywords

computer aided design local convergence geometric modeling solid modeling intersections worst-case complexity engineering design Bernstein basis distance computation system of nonlinear polynomial equations

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Real polynomials: location of zeros (26C10) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items

NUMERICAL AND GEOMETRIC PROPERTIES OF INTERVAL B-SPLINES, A test, based on conversion to the Bernstein polynomial basis, for an interval to be free of zeros applicable to polynomials in Chebyshev form and to transcendental functions approximated by Chebyshev series, Gaussian quadrature rules for \(C^1\) quintic splines with uniform knot vectors, Detection of critical points of multivariate piecewise polynomial systems, Topologically reliable approximation of composite Bézier curves, Umbilics and lines of curvature for shape interrogation, Robustness and Randomness, Linear perturbation methods for topologically consistent representations of free-form surface intersections, Certified numerical real root isolation for bivariate nonlinear systems, A New Approach Based on Interval Analysis and B-splines Properties for Solving Bivariate Nonlinear Equations Systems, RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS, Verified Solutions of Systems of Nonlinear Polynomial Equations, Optimal quadrature rules for odd-degree spline spaces and their application to tensor-product-based isogeometric analysis, COMPLEXITY REDUCTION FOR SYMBOLIC COMPUTATION WITH RATIONAL B-SPLINES, Numerical approach to solve imprecisely defined systems using inner outer direct search optimization technique, Interval-Krawczyk Approach for Solving Nonlinear Equations Systems in B-spline Form, Polytope-based computation of polynomial ranges, The Bernstein polynomial basis: a centennial retrospective, Improved subdivision scheme for the root computation of univariate polynomial equations, GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems, Constructing and exploring wells of energy landscapes, A quadratic clipping step with superquadratic convergence for bivariate polynomial systems, On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers, A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves, CONSTRAINT MODELING FOR CURVES AND SURFACES IN CAGD: A SURVEY, Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme, Computing roots of polynomials by quadratic clipping, Topology and arrangement computation of semi-algebraic planar curves, Subdivision methods for solving polynomial equations, Interface handling for three-dimensional higher-order XFEM-computations in fluid-structure interaction, BÉZIER SUBDIVISION FOR INVERSE MOLECULAR KINEMATICS, Modeling uncertain data with fuzzy \(B\)-splines, Computation of the solutions of nonlinear polynomial systems, Computation of singularities and intersections of offsets of planar curves, Analysis and applications of pipe surfaces

Cites Work