Formal Algorithmic Elimination for PDEs

Formal Algorithmic Elimination for PDEs
Author :
Publisher : Springer
Total Pages : 291
Release :
ISBN-10 : 9783319114453
ISBN-13 : 331911445X
Rating : 4/5 (53 Downloads)

Book Synopsis Formal Algorithmic Elimination for PDEs by : Daniel Robertz

Download or read book Formal Algorithmic Elimination for PDEs written by Daniel Robertz and published by Springer. This book was released on 2014-10-13 with total page 291 pages. Available in PDF, EPUB and Kindle. Book excerpt: Investigating the correspondence between systems of partial differential equations and their analytic solutions using a formal approach, this monograph presents algorithms to determine the set of analytic solutions of such a system and conversely to find differential equations whose set of solutions coincides with a given parametrized set of analytic functions. After giving a detailed introduction to Janet bases and Thomas decomposition, the problem of finding an implicit description of certain sets of analytic functions in terms of differential equations is addressed. Effective methods of varying generality are developed to solve the differential elimination problems that arise in this context. In particular, it is demonstrated how the symbolic solution of partial differential equations profits from the study of the implicitization problem. For instance, certain families of exact solutions of the Navier-Stokes equations can be computed.


Formal Algorithmic Elimination for PDEs Related Books