bokomslag Formal Algorithmic Elimination for PDEs
Vetenskap & teknik

Formal Algorithmic Elimination for PDEs

Daniel Robertz

Pocket

749:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 10-15 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 283 sidor
  • 2014
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.
  • Författare: Daniel Robertz
  • Illustratör: Bibliographie 2 schwarz-weiße und 1 farbige Abbildungen
  • Format: Pocket/Paperback
  • ISBN: 9783319114446
  • Språk: Engelska
  • Antal sidor: 283
  • Utgivningsdatum: 2014-10-22
  • Förlag: Springer International Publishing AG