scholarly journals Smoothing of weights in the Bernstein approximation problem

2017 ◽  
Vol 146 (2) ◽  
pp. 653-667
Author(s):  
Andrew Bakan ◽  
Jürgen Prestin



2013 ◽  
Vol 12 (4) ◽  
pp. 879-899 ◽  
Author(s):  
Anton Baranov ◽  
Harald Woracek

AbstractThe Bernstein approximation problem is to determine whether or not the space of all polynomials is dense in a given weighted ${C}_{0} $-space on the real line. A theorem of de Branges characterizes non-density by existence of an entire function of Krein class being related with the weight in a certain way. An analogous result holds true for weighted sup-norm approximation by entire functions of exponential type at most $\tau $ and bounded on the real axis ($\tau \gt 0$ fixed).We consider approximation in weighted ${C}_{0} $-spaces by functions belonging to a prescribed subspace of entire functions which is solely assumed to be invariant under division of zeros and passing from $F(z)$ to $ \overline{F( \overline{z} )} $, and establish the precise analogue of de Branges’ theorem. For the proof we follow the lines of de Branges’ original proof, and employ some results of Pitt.





2001 ◽  
Vol 45 (1) ◽  
pp. 167-185 ◽  
Author(s):  
Alexander Borichev ◽  
Mikhail Sodin


1983 ◽  
Vol 130 (4) ◽  
pp. 161
Author(s):  
vančo B. Litovski ◽  
Dragiša P. Milovanovi




2020 ◽  
Vol 18 (1) ◽  
pp. 653-661 ◽  
Author(s):  
Hongxing Wang ◽  
Xiaoyan Zhang

Abstract In this article, we study the constrained matrix approximation problem in the Frobenius norm by using the core inverse: ||Mx-b|{|}_{F}=\hspace{.25em}\min \hspace{1em}\text{subject}\hspace{.25em}\text{to}\hspace{1em}x\in {\mathcal R} (M), where M\in {{\mathbb{C}}}_{n}^{\text{CM}} . We get the unique solution to the problem, provide two Cramer’s rules for the unique solution and establish two new expressions for the core inverse.





Sign in / Sign up

Export Citation Format

Share Document