English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We take an algebraic approach to the problem of approximation by dilated shifts of basis functions. Given a finite collection      Φ  \Phi       of compactly supported functions in      L p ( R s ) ( 1 ⩽  p ⩽  ∞  ) {L_p}({\mathbb {R}^s})\quad (1 \leqslant p \leqslant \infty )      , we consider the shift-invariant space      S S       generated by      Φ  \Phi       and the family      ( S h : h &gt; 0 ) ({S^h}:h &gt; 0)      , where      S h {S^h}       is the      h h      -dilate of      S S      . We prove that      ( S h : h &gt; 0 ) ({S^h}:h &gt; 0)       provides      L p {L_p}      -approximation order      r r       only if      S S       contains all the polynomials of total degree less than      r r      . In particular, in the case where      Φ  \Phi       consists of a single function      φ  \varphi       with its moment      ∫  φ  ≠  0 \int {\varphi \ne 0}      , we characterize the approximation order of      ( S h : h &gt; 0 ) ({S^h}:h &gt; 0)       by showing that the above condition on polynomial containment is also sufficient. The above results on approximation order are obtained through a careful analysis of the structure of shift-invariant spaces. It is demonstrated that a shiftinvariant space can be described by a certain system of linear partial difference equations with constant coefficients. Such a system then can be reduced to an infinite system of linear equations, whose solvability is characterized by an old theorem of Toeplitz. Thus, the Toeplitz theorem sheds light into approximation theory. It is also used to give a very simple proof for the well-known Ehrenpreis principle about the solvability of a system of linear partial differential equations with constant coefficients.

The Toeplitz theorem and its applications to approximation theory and linear PDEs