Computer algebra and bifurcations
From MaRDI portal
The authors investigate implicit linear and nonlinear differential equations using methods from computer algebra. They derive conditions under which these equations admit polynomial solutions. Moreover, the result is constructive, and the construction of the solution can be seen as quadratic Newton iteration. Finally, they apply their techniques to the equation \[ \dot y= -y^3+ ay+ b \] which is of relevance as a normal form of a simple bifurcation.
Recommendations
Cited in
(9)- Computational algebra for bifurcation theory
- Verification of bifurcation diagrams for polynomial-like equations
- scientific article; zbMATH DE number 4017392 (Why is no real title available?)
- scientific article; zbMATH DE number 3886307 (Why is no real title available?)
- scientific article; zbMATH DE number 3976328 (Why is no real title available?)
- scientific article; zbMATH DE number 67112 (Why is no real title available?)
- scientific article; zbMATH DE number 1253998 (Why is no real title available?)
- Literal resolution of affected equations by Isaac Newton
- Computer algebra and problems of motion stability
This page was built for publication: Computer algebra and bifurcations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1418826)