[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2930889.2930941acmconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
tutorial

Formal Algorithmic Elimination for PDEs

Published: 20 July 2016 Publication History

Abstract

Similarly to the correspondence between radical ideals of a polynomial ring and varieties in algebraic geometry, a correspondence between radical differential ideals and their analytic solution sets has been established in differential algebra. This tutorial discusses aspects of this correspondence involving symbolic computation. In particular, an introduction to the Thomas decomposition method is given. It splits a system of polynomially nonlinear partial differential equations into finitely many so-called simple differential systems whose solution sets form a partition of the original solution set. The power series solutions of each simple system can be determined in a straightforward way. Conversely, certain sets of analytic functions admit an implicit description in terms of partial differential equations and inequations. Strategies for solving related differential elimination problems and applications to symbolic solving of differential equations are presented. A Maple implementation of the Thomas decomposition method is freely available.

References

[1]
P. Aubry, D. Lazard, and M. Moreno Maza. On the theories of triangular sets. J. Symb. Comput., 28(1--2):105--124 (1999).
[2]
T. Bachler.Counting Solutions of Algebraic Systems via Triangular Decomposition. Ph.D. thesis, RWTH Aachen University, Germany (2014). Available online at http://publications.rwth-aachen.de/record/444946?ln=en.
[3]
T. Bachler and M. Lange-Hegermann. Algebraic Thomas and Differential Thomas: Thomas decomposition of algebraic and differential systems. Available online at http://wwwb.math.rwth-aachen.de/thomasdecomposition.
[4]
T. Bachler, V. P. Gerdt, M. Lange-Hegermann, and D. Robertz.Thomas Decomposition of Algebraic and Differential Systems.In: V. P. Gerdt, W. Koepf, E. W. Mayr, and E. H. Vorozhtsov, editors, Computer Algebra in Scientific Computing, 12th International Workshop, CASC 2010, Tsakhkadzor, Armenia, Vol. 6244 ofLecture Notes in Computer Science, pp. 31--54. Springer, 2010.
[5]
T. Bachler, V. P. Gerdt, M. Lange-Hegermann, and D. Robertz.Algorithmic Thomas Decomposition of Algebraic and Differential Systems. J. Symb. Comput., 47(10):1233--1266 (2012).
[6]
F. Boulier, D. Lazard, F. Ollivier, and M. Petitot. Computing representations for radicals of finitely generated differential ideals. Appl. Algebra Engrg. Comm. Comput., 20(1):73--121 (2009).
[7]
X. S. Gao. Implicitization of differential rational parametric equations. J. Symb. Comput., 36(5):811--824 (2003).
[8]
V. P. Gerdt. On decomposition of algebraic PDE systems into simple subsystems. Acta Appl. Math., 101(1--3):39--51 (2008).
[9]
V. P. Gerdt and D. Robertz. Lagrangian Constraints and Differential Thomas Decomposition. Adv. in Appl. Math., 72:113--138 (2016).
[10]
E. Hubert. Notes on triangular sets and triangulation-decomposition algorithms. I. Polynomial systems. II. Differential systems.In: F. Winkler and U. Langer, editors, Symbolic and numerical scientific computation (Hagenberg, 2001), pp. 1--39 resp. 40--87,Vol. 2630 ofLecture Notes in Computer Science, Springer, Berlin, 2003.
[11]
E. R. Kolchin. Differential algebra and algebraic groups. Vol. 54 of Pure and Applied Mathematics. Academic Press, New York-London, 1973.
[12]
M. Lange-Hegermann.Counting Solutions of Differential Equations.Ph.D. thesis, RWTH Aachen University, Germany (2014). Available online at http://publications.rwth-aachen.de/record/229056?ln=en.
[13]
F. Lemaire, M. Moreno Maza, and Y. Xie. The RegularChains library in MAPLE. SIGSAM Bull., 39:96--97, September 2005.
[14]
P. J. Olver and P. Rosenau.The construction of special solutions to partial differential equations. Phys. Lett. A, 114(3):107--112 (1986).
[15]
W. Plesken. Counting solutions of polynomial systems via iterated fibrations. Arch. Math. (Basel), 92(1):44--56 (2009).
[16]
W. Plesken and D. Robertz.Elimination for coefficients of special characteristic polynomials. Experiment. Math., 17(4):499--510 (2008).
[17]
W. Plesken and D. Robertz.Linear differential elimination for analytic functions. Math. Comput. Sci., 4(2--3):231--242 (2010).
[18]
T. M. Rassias and J. Simsa. Finite sums decompositions in mathematical analysis. Pure and Applied Mathematics (New York). John Wiley & Sons, Chichester, 1995.
[19]
J. F. Ritt. Differential Algebra. Vol. XXXIII ofAmerican Mathematical Society Colloquium Publications. American Mathematical Society, New York, N. Y., 1950.
[20]
D. Robertz. Formal Algorithmic Elimination for PDEs. Vol. 2121 ofLecture Notes in Mathematics, Springer, Cham, 2014.
[21]
S. L. Rueda and J. R. Sendra.Linear complete differential resultants and the implicitization of linear DPPEs. J. Symb. Comput., 45(3):324--341 (2010).
[22]
A. Seidenberg. An elimination theory for differential algebra. Univ. California Publ. Math. (N.S.) 3, 31--65 (1956).
[23]
J. M. Thomas. Differential Systems. Vol. XXI ofAmerican Mathematical Society Colloquium Publications.American Mathematical Society, New York, N. Y., 1937.
[24]
D. Wang. Decomposing polynomial systems into simple systems. J. Symb. Comput., 25(3):295--314 (1998).
[25]
D. Wang. Elimination methods. Texts and Monographs in Symbolic Computation. Springer-Verlag, Vienna, 2001.
[26]
T. Wolf, A. Brand, and M. Mohammadzadeh. Computer algebra algorithms androutines for the computation of conservation laws and fixing of gauge indifferential expressions. J. Symb. Comput., 27(2):221--238 (1999).

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ISSAC '16: Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation
July 2016
434 pages
ISBN:9781450343800
DOI:10.1145/2930889
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 July 2016

Check for updates

Author Tags

  1. Thomas decomposition
  2. analytic functions
  3. differential eliminiation
  4. nonlinear pdes

Qualifiers

  • Tutorial

Conference

ISSAC '16
Sponsor:

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 78
    Total Downloads
  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Dec 2024

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media