Formal Algorithmic Elimination for PDEs by Daniel RobertzFormal Algorithmic Elimination for PDEs by Daniel Robertz

Formal Algorithmic Elimination for PDEs

byDaniel Robertz

Paperback | October 22, 2014

Pricing and Purchase Info


Earn 415 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


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.

Title:Formal Algorithmic Elimination for PDEsFormat:PaperbackDimensions:283 pages, 23.5 × 15.5 × 0.01 inPublished:October 22, 2014Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3319114441

ISBN - 13:9783319114446


Table of Contents

Introduction.- Formal Methods for PDE Systems.- Differential Elimination for Analytic Functions.- Basic Principles and Supplementary Material.- References.- List of Algorithms.- List of Examples.- Index of Notation.- Index.