Numerical recipes: the art of scientific computing
Numerical recipes: the art of scientific computing
Algebraic decomposition of regular curves
Journal of Symbolic Computation
The algebraic eigenvalue problem
The algebraic eigenvalue problem
Geometric and solid modeling: an introduction
Geometric and solid modeling: an introduction
Motion from point matches: multiple of solutions
International Journal of Computer Vision
Kinematic analysis of the 6R manipulator of general geometry
The fifth international symposium on Robotics research
Geometric Hermite approximation of surface patch intersection curves
Computer Aided Geometric Design
Direct kinematics and assembly modes of parallel manipulators
International Journal of Robotics Research
Multipolynomial resultant algorithms
Journal of Symbolic Computation
Algebraic and numeric techniques in modeling and robotics
Algebraic and numeric techniques in modeling and robotics
Computing selected solutions of polynomial equations
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Numeric-symbolic algorithms for evaluating one-dimensional algebraic sets
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
LAPACK Users' guide (third ed.)
LAPACK Users' guide (third ed.)
Robot Dynamics and Control
Solving Systems of Polynomial Equations
IEEE Computer Graphics and Applications
An Efficient Algorithm for the Sparse Mixed Resultant
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Computations with Algebraic Curves
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Topologically reliable display of algebraic curves
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
The sorting of points along an algebraic curve
The sorting of points along an algebraic curve
Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)
Gröbner bases and matrix eigenproblems
ACM SIGSAM Bulletin
A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Implicit Polynomials, Orthogonal Distance Regression, and the Closest Point on a Curve
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parametrization of approximate algebraic curves by lines
Theoretical Computer Science - Algebraic and numerical algorithm
Parametrization of approximate algebraic surfaces by lines
Computer Aided Geometric Design
A numerical elimination method for polynomial computations
Theoretical Computer Science
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Parametrization of approximate algebraic surfaces by lines
Computer Aided Geometric Design
| Hi-index | 0.00 |
Finding zeros of algebraic sets is a fundamental problem in scientific and geometric computation. It arises in symbolic and numeric techniques used to manipulate sets of polynomial equations. In this paper, we outline algorithms and applications for solving zero and one dimensional algebraic sets using matrix computations. These algorithms make use of techniques from elimination theory and reduce the problem to finding singular sets of matrix polynomials. We make use of algorithms for eigen-decomposition, singular value decomposition and Gaussian elimination to compute the singular sets. These algorithms have been implemented and perform very well in practice. We describe their application to computing conformations of molecular chains, inverse kinematics of serial robots, solid modeling and manufacturing.