Numerical irreducible decomposition
algebraic geometryhomotopy continuation methodsinterfacesMaple procedurenumerical algorithmspolynomial systemssoftware
Polynomials, factorization in commutative rings (13P05) Computational aspects of higher-dimensional varieties (14Q15) Numerical computation of solutions to systems of equations (65H10) Packaged methods for numerical algorithms (65Y15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Symbolic computation and algebraic computation (68W30)
The authors give a dictionary for translating the key concepts of algebraic geometry to define an irreducible decomposition into data structures used by numerical algorithms. Homotopy continuation methods are efficient to approximate all isolated solutions of polynomial systems. This involves the use of computational geometry techniques to compute a homotopy with start points combined with numerical methods to follow the solution paths defined by the homotopies. The authors show how can be used this capability as a blackbox device to solve systems which have positive-dimensional components of solutions and they describe a simple Maple procedure to call the blackbox solver of PHCpack. Via sampling and projecting they obtain a numerical elimination procedure and they illustrate this sampling on three-dimensional spatial mechanical linkage, using Maple as a plotting tool. They also develop a low level interface to call the Ada routines from C programs. Finally, they list some of their major benchmark applications. For the entire collection see [Zbl 1008.00013].
- Tensor decomposition and homotopy continuation
- A blackbox polynomial system solver on parallel shared memory computers
- Decomposing algebraic sets using Gröbner bases
- Cell decomposition of almost smooth real algebraic surfaces
- Sampling algebraic sets in local intrinsic coordinates
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Using monodromy to decompose solution sets of polynomial systems into irreducible components
- Numerical local irreducible decomposition
- Numerical decomposition of affine algebraic varieties
- A numerical local dimension test for points on the solution set of a system of polynomial equations
- Regeneration homotopies for solving systems of polynomials
- Numerical-symbolic exact irreducible decomposition of cyclic-12
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- Regularization and matrix computation in numerical polynomial algebra
- scientific article; zbMATH DE number 1736023 (Why is no real title available?)
- Numerical irreducible decomposition over a number field
- scientific article; zbMATH DE number 1860649 (Why is no real title available?)
- A numerical toolkit for multiprojective varieties
- Recovering exact results from inexact numerical data in algebraic geometry
- Introduction to numerical algebraic geometry
- Finite precision representation of the Conley decomposition
- Numerical factorization of multivariate complex polynomials
This page was built for publication: Numerical irreducible decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418124)
