02536cam a2200385 i 4500991002946179707536m o d cr cnu 160715s2014 sz a ob 001 0 eng d9783319114453b14258390-39ule_instBibl. Dip.le Aggr. Matematica e Fisica - Sez. Matematicaeng512.9423AMS 12H05AMS 13P10AMS 16S36AMS 35-02LC QA192.R62Robertz, Daniel716368Formal algorithmic elimination for PDEs[e-book] /Daniel RobertzCham [Switzerland] :Springer,20141 online resource (viii, 283 pages)Lecture notes in mathematics,1617-9692 ;2121Includes bibliographical references and indexIntroduction -- 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 -- IndexInvestigating 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 computedDifferential equations, PartialEliminationPrinted edition:9783319114446http://link.springer.com/chapter/10.1007/978-3-319-11445-3_2An electronic book accessible through the World Wide Web.b1425839003-03-2215-07-16991002946179707536Formal algorithmic elimination for PDEs1388028UNISALENTOle01315-07-16m@ -engsz 00