Solving polynomial systems using numeric Gröbner bases

DOI10.1007/978-3-319-96418-8_40zbMATH Open1395.13029OpenAlexW2883147807MaRDI QIDQ1662267FDOQ1662267

Daniel A. Lichtblau

Publication date: 17 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96418-8_40

Recommendations

• Symbolic-numeric methods for solving polynomial equations and applications
• Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
• Efficient polynomial system solving by numerical methods
• scientific article; zbMATH DE number 1827070
• scientific article; zbMATH DE number 953044

zbMATH Keywords

polynomial systemseigensystemendomorphism matrixnumeric Gröbner bases

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical computation of solutions to systems of equations (65H10) Solving polynomial systems; resultants (13P15)

Cited In (6)

• A general method of finding new symplectic schemes for Hamiltonian mechanics
• Title not available (Why is that?)
• \textsc{MultivariateResidues} : a Mathematica package for computing multivariate residues
• A Gröbner free alternative for polynomial system solving
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• Mathematica
• NSolve

This page was built for publication: Solving polynomial systems using numeric Gröbner bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662267)