Testing regularity of functional equations with computer

One of the standard methods of solving functional equations is reducing the equations to a form which is easily handled by the methods of analysis, for example differential equations, partial differential equations, integral equations, etc. For the reduction we must know some “strong” regularity pro...

Full description

Saved in:
Bibliographic Details
Published inAequationes mathematicae Vol. 84; no. 3; pp. 271 - 283
Main Author Czirbusz, Sándor
Format Journal Article
LanguageEnglish
Published Basel SP Birkhäuser Verlag Basel 01.12.2012
Springer Nature B.V
Subjects
Analysis
Applied mathematics
Combinatorics
Computer algebra
Computers
Differential equations
Integral equations
Mathematical analysis
Mathematical models
Mathematics
Mathematics and Statistics
Partial differential equations
Regularity
Theorems
39B52
39-04
39B22
39B72
Online AccessGet full text

Cover

More Information
Summary:One of the standard methods of solving functional equations is reducing the equations to a form which is easily handled by the methods of analysis, for example differential equations, partial differential equations, integral equations, etc. For the reduction we must know some “strong” regularity properties of the unknown functions, which regularity follows from the “week” properties of the known functions. Our long-term plan is to create a method not only for specialists in research but for professionals in other areas using functional equations—for example engineers, economists. As a first attempt we worked out a program for some particular, but fairly general type of equations in the Computer Algebra System Maple © , which enables an easy detection of the applicability of known regularity theorems.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0001-9054
1420-8903
DOI:10.1007/s00010-012-0157-7