Formal algorithmic elimination for PDEs
Author(s)
Bibliographic Information
Formal algorithmic elimination for PDEs
（Lecture notes in mathematics, 2121）
Springer, c2014
Available at / 41 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNM||2121200032295606
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 259-271) and indexes
Description and Table of Contents
Description
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.
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.
by "Nielsen BookData"
