No label defined (Q3217070)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3882942
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3882942

      Statements

      1984
      0 references
      Favard's problem
      0 references
      iterative algorithm
      0 references
      [For the entire collection see Zbl 0529.00005.] Let \(x_ 0<x_ 1<...<x_ N\) be a set of nodes on \({\mathbb{R}}\) and let \(y_ 0,y_ 1,...,\in {\mathbb{R}}\) be such that the kth divided difference of this data on the nodes is \(> 0\). Let the class of all functions \(f\in C^{(k-1)}[x_ 0,x_ N]\) such that \(f(x_ i)=y_ i\), \(i=0,...,N\) and \(f^{(k)}\in L_ p\), \(1<p<\infty\), \(f^{(k)}\geq 0\), be denoted by \({\mathcal F}^ k_ p\). The main question addressed by the authors is to find \(f\in {\mathcal F}^ k_ p\) with minimal \(\| f^{(k)}\|_ p\). For \(p=2\), their results give the results of \textit{U. Hornung} [J. Approximation Theory 28, 227-237 (1980; Zbl 0432.41001)]. This kind of problem generally goes by the name Favard's problem. The authors also given an iterative algorithm for the solution of the problem for \(k=2\) and propose a number of unsolved problems.
      0 references
      0 references
      0 references

      Identifiers