Formal algorithmic elimination for PDEs
DOI10.1007/978-3-319-11445-3zbMath1339.35007OpenAlexW4378105013MaRDI QIDQ468363
Publication date: 6 November 2014
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11445-3
implicitizationcompatibility conditionsdifferential polynomialsdifferential algebraeliminationJanet basespolynomial nonlinearitiesformal theoryfully nonlinear systemsOre algebrasThomas decomposition
Symbolic computation and algebraic computation (68W30) Ordinary and skew polynomial rings and semigroup rings (16S36) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Syzygies, resolutions, complexes in associative algebras (16E05) Differential algebra (12H05) Research exposition (monographs, survey articles) pertaining to partial differential equations (35-02) Software, source code, etc. for problems pertaining to partial differential equations (35-04)
Related Items (26)
Uses Software
This page was built for publication: Formal algorithmic elimination for PDEs