2014
DOI: 10.1016/j.jmaa.2014.01.002
|View full text |Cite
|
Sign up to set email alerts
|

On a functional equation connected to Hermite quadrature rule

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
12
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 7 publications
(12 citation statements)
references
References 10 publications
0
12
0
Order By: Relevance
“…The case of p > 2 can be investigated in a similar way because of the inductive argument as follows. The first equation of system (8) …”
Section: The Case Of Higher Transcendence Degreementioning
confidence: 99%
See 1 more Smart Citation
“…The case of p > 2 can be investigated in a similar way because of the inductive argument as follows. The first equation of system (8) …”
Section: The Case Of Higher Transcendence Degreementioning
confidence: 99%
“…It is spanned by the so-called exponential monomials which can be given in terms of automorphisms of C and differential operators. We apply the general theory to some inhomogeneous problems motivated by quadrature rules of approximate integration [6], see also [7] and [8]. …”
mentioning
confidence: 99%
“…The foundation of the theory can be found in M. Laczkovich and G. Kiss [2], see also G. Kiss and A. Varga [1]. We are going to adopt the main theoretical tools to solve some inhomogeneous problems due to T. Szostok [5], see also [6] and [7]. They are motivated by quadrature rules of approximate integration.…”
mentioning
confidence: 99%
“…Szostok AEM Equation (1.1) was inspired by the quadrature rules of numerical integration. Functional equations inspired by numerical integration were studied among others in [3][4][5][6][7][8][9].…”
mentioning
confidence: 99%
“…It can be proved (under some assumptions) that solutions of (1.1) are polynomial functions (see [4]). By a polynomial function of order n we mean any solution of the functional equation Δ n+1 h f (x) = 0, where Δ n h stands for the nth iterate of the difference operator Δ h f (x) = f (x + h) − f (x).…”
mentioning
confidence: 99%