Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
DOI10.1016/j.jsc.2007.10.013zbMath1177.13065OpenAlexW2115204962MaRDI QIDQ1006657
Publication date: 25 March 2009
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2007.10.013
numerical linear algebrapartial differential equationsjet spacesinvolutive basesnumeric eliminationnumeric jet geometrysolving approximate polynomial systems
Symbolic computation and algebraic computation (68W30) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isolated points, duality and residues
- Involutive bases of polynomial ideals
- Fast algorithm for solving the Hankel/Toeplitz structured total least squares problem
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- Gröbner deformations of hypergeometric differential equations
- On E. Cartan's Prolongation Theorem of Exterior Differential Systems
- Solving projective complete intersection faster
- Géométrie des points épais
- On the numerical solution of involutive ordinary differential systems
- Differential Elimination–Completion Algorithms for DAE and PDAE
- Geometric completion of differential systems using numeric-symbolic continuation
- Numerical Polynomial Algebra
- Total Least Norm Formulation and Solution for Structured Problems
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Fast differential eleminination in C: The CDiffElim environment
This page was built for publication: Solving polynomial systems via symbolic-numeric reduction to geometric involutive form