Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Numerical algebraic geometry and algebraic kinematics
CW Wampler, AJ Sommese - Acta Numerica, 2011 - cambridge.org
In this article, the basic constructs of algebraic kinematics (links, joints, and mechanism
spaces) are introduced. This provides a common schema for many kinds of problems that …
spaces) are introduced. This provides a common schema for many kinds of problems that …
[LIVRE][B] The Numerical solution of systems of polynomials arising in engineering and science
AJ Sommese, CW Wampler - 2005 - books.google.com
Written by the founders of the new and expanding field of numerical algebraic geometry, this
is the first book that uses an algebraic-geometric approach to the numerical solution of …
is the first book that uses an algebraic-geometric approach to the numerical solution of …
[LIVRE][B] Solving polynomial equations
A Dickenstein - 2005 - Springer
The subject of this book is the solution of polynomial equations, that is, systems of
(generally) non-linear algebraic equations. This study is at the heart of several areas of …
(generally) non-linear algebraic equations. This study is at the heart of several areas of …
Algorithm 921: alphaCertified: certifying solutions to polynomial systems
JD Hauenstein, F Sottile - ACM Transactions on Mathematical Software …, 2012 - dl.acm.org
Smale's α-theory uses estimates related to the convergence of Newton's method to certify
that Newton iterations will converge quadratically to solutions to a square polynomial …
that Newton iterations will converge quadratically to solutions to a square polynomial …
[HTML][HTML] Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
G Lecerf - Journal of Complexity, 2003 - Elsevier
We present a new probabilistic method for solving systems of polynomial equations and
inequations. Our algorithm computes the equidimensional decomposition of the Zariski …
inequations. Our algorithm computes the equidimensional decomposition of the Zariski …
Symmetric functions applied to decomposing solution sets of polynomial systems
Many polynomial systems have solution sets comprised of multiple irreducible components,
possibly of different dimensions. A fundamental problem of numerical algebraic geometry is …
possibly of different dimensions. A fundamental problem of numerical algebraic geometry is …
Numerically computing real points on algebraic sets
JD Hauenstein - Acta applicandae mathematicae, 2013 - Springer
Given a polynomial system f, a fundamental question is to determine if f has real roots. Many
algorithms involving the use of infinitesimal deformations have been proposed to answer …
algorithms involving the use of infinitesimal deformations have been proposed to answer …
Using monodromy to decompose solution sets of polynomial systems into irreducible components
To decompose solution sets of polynomial systems into irreducible components, homotopy
continuation methods generate the action of a natural monodromy group which partially …
continuation methods generate the action of a natural monodromy group which partially …
Advances in polynomial continuation for solving problems in kinematics
AJ Sommese, J Verschelde… - J. Mech. Des …, 2004 - asmedigitalcollection.asme.org
For many mechanical systems, including nearly all robotic manipulators, the set of possible
configurations that the links may assume can be described by a system of polynomial …
configurations that the links may assume can be described by a system of polynomial …
A numerical local dimension test for points on the solution set of a system of polynomial equations
The solution set V of a polynomial system, ie, the set of common zeroes of a set of
multivariate polynomials with complex coefficients, may contain several components, eg …
multivariate polynomials with complex coefficients, may contain several components, eg …