Next Article in Journal
Existence of Positive Solutions to Singular Boundary Value Problems Involving φ-Laplacian
Previous Article in Journal
The Impact of Viscous Dissipation on the Thin Film Unsteady Flow of GO-EG/GO-W Nanofluids
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Functions of Minimal Norm with the Given Set of Fourier Coefficients

N.I. Lobachevsky Institute of Mathematics and Mechanics, Kazan Federal University, 420008 Kazan, Russia
Mathematics 2019, 7(7), 651; https://doi.org/10.3390/math7070651
Submission received: 17 June 2019 / Revised: 13 July 2019 / Accepted: 19 July 2019 / Published: 20 July 2019

Abstract

:
We prove the existence and uniqueness of the solution of the problem of the minimum norm function · with a given set of initial coefficients of the trigonometric Fourier series c j , j = 0 , 1 , , 2 n . Then, we prove the existence and uniqueness of the solution of the nonnegative function problem with a given set of coefficients of the trigonometric Fourier series c j , j = 1 , , 2 n for the norm · 1 .

1. Introduction

The problem of the optimal continuation of a trigonometric polynomial in various spaces has been considered in many papers. This research began in the work of S. N. Bernstein [1]. One of the main questions here is to estimate the norm of a Fourier polynomial with some of its coefficients fixed. Here, we note the results of Schur [2] and Rahman and Schmeisser [3] on polynomials of minimal norm with some zero coefficients, leading to Chebyshev polynomials.
The problem of finding a Fourier polynomial with fixed coefficients with minimal norm f 2 is trivial. In [4], the problem of finding a Fourier polynomial of bounded degree with fixed coefficients with a minimum norm f was solved. There are upper bounds for the norm · of trigonometric polynomials [5]. Estimates in the normalized spaces L p , p [ 1 , + ] were found in [6,7] by optimization methods in finite-dimensional spaces. In [5,8], it is shown that the optimal extension of an arbitrary trigonometric polynomial in the space L [ 0 , 2 π ] is unique and represents a step function of a constant modulus, but the proof was based on purely functional analytic methods and there was no indication of the way to construct the solutions. Thus, the first theorem of this paper presents another proof of this fact. The main purpose of our work is to introduce geometrical methods to solve these problems. This technique seems to be more illustrative than the purely analytic existence theorems in [8]. A rather large review of the results for polynomials and their derivatives with the fixed finite degree (trigonometric and power ones) of the minimum possible norm is given in [9]. For example, there exist numerous estimates of the polynomials norms through the norms of their derivatives in spaces L r ( a , b ) and L ( a , b ) , a , b R , r > 1 .
In connection with the above results, one can note related problems of approximation by a polynomial bounded in the norm · of an analytic function in the unit circle of the complex plane [10,11]. When solving a number of problems, for example, the inverse problem of aerohydrodynamics, one has to use other norms [12,13,14]. Note that purely integral norms of the spaces L r ( a , b ) produce large pointwise values of the solution [13] and discontinuities result in singularities of the reconstructed contours [14].
In this paper, we generalize the results in [12,13], where the problems of the existence and uniqueness of the solution of the problem of the minimum norm function f = ess   sup t [ 0 , 2 π ] | f ( t ) | , f 1 = 0 2 π | f ( t ) | d t and f + λ f (here, λ is a fixed positive number) on the subclass of functions C 1 ( [ 0 , 2 π ] ) , with a given three first Fourier coefficients by a method other than the method in [4]. In the present paper, in a similar way, it is shown that the number of discontinuity points of the optimal function ϕ * for the norm · in [8] is not more than the double order of the original polynomial examples of finding the functions of the minimum norm and the solution of one such problem in the space of non-negative functions is constructed. This problem is naturally related to the classical moment problem (see, e.g., [15]). The last construction implies the uniqueness of the solution of the problem of the minimum norm function f 1 with the given three first Fourier coefficients, which clarifies the result in [4].

2. Results

2.1. The Function of the Minimum Norm · with a Given Set of Fourier Coefficients

Consider the following problem:
Find the function of the minimum norm · on the class of integrable functions f : [ 0 , 2 π ] R with the given first 2 n + 1 Fourier coefficients
c 2 j + 1 = 1 2 π 0 2 π f ( t ) sin ( j t ) d t , c 2 j = 1 2 π 0 2 π f ( t ) cos ( j t ) d t , j = 0 , 1 , , n .
Define the points ϕ 1 ϕ 2 n on the interval [ 0 , 2 π ) and for an arbitrary constant C R consider the vector function
F ( C , ϕ 1 , ϕ 2 , , ϕ 2 n ) = 2 C ( k = 1 n ( ϕ 2 k ϕ 2 k 1 ) π ) C ( k = 1 n ( sin ( ϕ 2 k ) sin ( ϕ 2 k 1 ) ) ) C n ( j = 1 n ( sin ( n ϕ 2 k ) sin ( n ϕ 2 k 1 ) ) ) C ( k = 1 n ( cos ( ϕ 2 k ) cos ( ϕ 2 k 1 ) ) 1 ) C n ( k = 1 n ( cos ( n ϕ 2 k ) cos ( n ϕ 2 k 1 ) ) 1 ) .
Note that the coordinates of F are the Fourier coefficients of the locally constant function. Thus, the question is whether we can find the constant C and the angles ϕ 1 , , ϕ 2 n so that F tr = ( c 0 , c 1 , , c 2 n ) .
We introduce on R + × [ 0 , 2 π ) 2 n the equivalence relation ( C , ϕ 1 , , ϕ j 1 , ϕ , ϕ , ϕ j + 2 , , ϕ 2 n ) ( C , ϕ 1 , , ϕ j 1 , ψ , ψ , ϕ j + 2 , , ϕ 2 n ) with ϕ j 1 < ϕ < ϕ j + 2 and ϕ j 1 < ψ < ϕ j + 2 . The function F takes the same value on elements of the same equivalence class. Consider the factor space V = R + × [ 0 , 2 π ) 2 n / .
Theorem 1.
The mapping F : V R 2 n + 1 is a surjection.
Proof. 
Put d 0 = 2 j = 1 n ϕ 2 j 2 j = 1 n ϕ 2 j 1 2 π , d k = 2 j = 1 n sin ( k ϕ 2 j ) 2 j = 1 n sin ( k ϕ 2 j 1 ) , d n + k = 2 n j = 1 n cos ( k ϕ 2 j ) + 2 n j = 1 n cos ( k ϕ 2 j 1 ) 1 , j = 1 , , n . Then, the Jacobi matrix of the mapping F takes the form
J = ( c 0 , c 1 , , c 2 n ) ( C , ϕ 1 , , ϕ 2 n ) =
d 0 2 C 2 C 2 C d 1 2 C cos ( ϕ 1 ) 2 C cos ( ϕ 2 ) 2 C cos ( ϕ 2 n ) d 2 n 2 C n sin ( n ϕ 1 ) 2 C n sin ( n ϕ 2 ) 2 C n sin ( n ϕ 2 n )
Note that C is a constant that scales an image of F 1 ( ϕ 1 , , ϕ 2 n ) = F ( 1 , ϕ 1 , , ϕ 2 n ) .
For C = 1 , the Jacobi matrix of the mapping F 1 is
J 1 = ( c 0 , c 1 , , c 2 n ) ( ϕ 1 , , ϕ 2 n ) =
= 2 1 1 1 cos ( ϕ 1 ) cos ( ϕ 2 ) cos ( ϕ 2 n ) 1 n cos ( n ϕ 1 ) 1 n cos ( n ϕ 2 ) 1 n cos ( n ϕ 2 n ) sin ( ϕ 1 ) sin ( ϕ 2 ) sin ( ϕ 2 n ) 1 n sin ( n ϕ 1 ) 1 n sin ( n ϕ 2 ) 1 n sin ( n ϕ 2 n ) .
Since an arbitrary string of n real elements sets the values of a trigonometric polynomial of order n at points ϕ 1 < < ϕ 2 n , and the rows of this matrix form the basis values at the same points, the rank of this map is 2 n when ϕ 1 < < ϕ 2 n .
In the space R 2 n + 1 , we consider the hypersurface F 1 ( [ 0 , 2 π ) 2 n / ) . We show that in each direction u = ( u 0 , u 1 , , u 2 n ) in space R 2 n + 1 there exist no more than two sets
{ ϕ 1 , , ϕ 2 n } , { ψ 1 = ϕ 2 , , ψ 2 n 1 = ϕ 2 n , ψ 2 n = ϕ 1 + 2 π } ,
for which D u F = ( 0 , , 0 ) . Consider the trigonometric polynomial j = 0 n u 2 j cos j ϕ + j = 1 n u 2 j 1 sin j ϕ , corresponding to the derivative in the direction u , and find the roots of this polynomial. There exist at most 2 n such roots.
Let there be exactly 2 n of such roots. In this case, the set { ϕ 1 , , ϕ 2 n } corresponds to a trigonometric polynomial of order n with roots ϕ 1 , , ϕ 2 n . The set { ψ 1 , , ψ 2 n 1 , ψ 2 n } represents the roots of a new polynomial obtained from the first polynomial by a change of sign.
If there exist fewer than 2 n roots, then we get the roots { ϕ 1 , , ϕ 2 n 2 k } of the given polynomial and { ψ 1 , , ψ 2 n 2 k } are the roots of a polynomial obtained from the first one by change of sign.
This means that in any direction the derivative of the function F 1 has no more than two zeros. Thus, F 1 ( [ 0 , 2 π ) 2 n / ) is a convex hypersurface.
Note that the hypersurface F 1 ( [ 0 , 2 π ) 2 n / ) is symmetric about the origin by construction, because F 1 ( ϕ 1 , , ϕ 2 n ) = F 1 ( ϕ 2 , , ϕ 2 n , ϕ 1 + 2 π ) and compact, since each coordinate is bounded in R 2 n + 1 .
Thus, we have the following:
  • The Jacobian F 1 is not zero on the hypersurface F 1 ( [ 0 , 2 π ) 2 n / ) with ϕ 1 < ϕ 2 < < ϕ 2 n and C 0 .
  • The Jacobian F 1 is zero on the hypersurface F 1 ( [ 0 , 2 π ) 2 n / ) on a subset of dimension 2 n 1 = dim ( V ) 2 , and the degeneration of the map occurs with ϕ j = ϕ j + 1 .
Since the mapping F 1 is continuous, its image is closed on the hypersurface F 1 ( [ 0 , 2 π ) 2 n / ) . Item 1 implies that this hypersurface has dimension 2 n . Item 2 yields that the dimension of the boundary of this image is 2 n 2 . Consequently, the image of F 1 is a manifold of dimension 2 n without an edge.
Consequently, the image of F 1 is a convex surface that is homotopy equivalent to the sphere S 2 n R 2 n + 1 .
Therefore, for any point w R 2 n + 1 exist a number C R + and a set ϕ 1 ϕ 2 n such that w = F ( C , ϕ 1 , , ϕ 2 n ) = C F ( 1 , ϕ 1 , , ϕ 2 n ) . □
Corollary 1.
For each set of Fourier coefficients, there exists a piecewise constant, constant modulo function with a given set of first coefficients.
Proof. 
Since the components of the vector function F ( C , ϕ 1 , , ϕ 2 n ) introduced in Theorem 1 are the Fourier coefficients of the piecewise constant function
f ( t ) = C , t ( ϕ 2 j , ϕ 2 j + 1 ] , C , t ( ϕ 2 j 1 , ϕ 2 j ] j = 1 , , n , ϕ 2 n + 1 = ϕ 1 ,
in accordance with Theorem 1, we obtain the proof of this statement. □
Theorem 2.
For any set ( c 0 , , c 2 n ) R 2 n + 1 there exists a unique function (Equation (1)) that minimizes the norm · .
Proof. 
In accordance with Corollary 1, for a given set of Fourier coefficients ( c 0 , , c 2 n ) , we choose a piecewise constant, where C 1 is the minimal possible number from the preimages F 1 ( c 0 , , c 2 n ) .
Assume that there exists a function f 2 less than or equal to the norm of · , with the same set of coefficients.
Consider the difference of two functions f 1 , f 2 with a given set of first Fourier coefficients. Since the first 2 n + 1 Fourier coefficients are 0, this function has the form f 2 ( t ) f 1 ( t ) = Re [ e i ( n + 1 ) t h ( e i t ) ] , where h ( z ) is a function that is holomorphic in the unit circle. Consequently, in accordance with the principle of the argument, the difference f 2 ( t ) f 1 ( t ) changes sign not fewer than 2 n + 2 times. Since f 2 ( t ) f 1 ( t ) , we have f 2 ( t ) f 1 ( t ) 0 , t [ ϕ 2 j 1 , ϕ 2 j ) , f 2 ( t ) f 1 ( t ) 0 , t [ ϕ 2 j , ϕ 2 j + 1 ) , j = 1 , , n , ϕ 2 j + 1 = ϕ 1 . That is, the difference f 2 ( t ) f 1 ( t ) changes sign no more than 2 n times. The contradiction confirms that the function f 1 has a minimal norm.
Uniqueness of this function on the class of functions of the form of Equation (1) follows from the same considerations. Let there be another piecewise-constant function with a constant module f 2 with the same first Fourier coefficients in accordance with Corollary 1. Then, C 2 = C 1 and from the already proved, it follows that the set { ϕ 1 , , ϕ 2 n } for the function f 2 coincides with the corresponding set for f 1 . □
From Theorems 1 and 2, it follows that F is a global homeomorphism and C is the minimum norm of the function, the first 2 n + 1 of the Fourier coefficients of which are c 0 , , c 2 n .
Let us give examples illustrating the results of Theorem 2 for the case n = 2 . We construct piecewise constant functions that provide the minimum norm for given trigonometric polynomials. The examples are constructed by selecting the values ϕ k , k = 1 , , 4 so that the ratio of the Fourier coefficients of a constant modulo function is the same as that of the original polynomial. Figure 1 and Figure 2 show the graphs of both approximate and corresponding constant modulo functions with C = 1.538 and C = 3.713 , respectively.
Consider the function g C ( [ 0 , 2 π ) ) and the sequence c 2 j 1 = 1 2 π 0 2 π g ( t ) sin ( j t ) d t , c 2 j = 1 2 π 0 2 π g ( t ) cos ( j t ) d t , j N . Then, we have functions of the type (1) f n ( t ) , t [ 0 , 2 π ] of minimal norm f n for polynomials g n ( t ) = j = 0 n [ c 2 j cos ( j t ) + c 2 j + 1 sin ( j t ) ] .
This leads us to the following statements.
Corollary 2.
f n g , ( n ).
Proof. 
Assume the contrary. Since, for each n, f n ( t ) is a function of the minimum possible norm for a given set of Fourier coefficients of the function g, the sequence of norms { f n } n = 1 is marorized by the sequence of norms { g n } n = 1 . In addition, since f n + 1 ( t ) is constructed according to a larger number of given Fourier coefficients than f n ( t ) , f n f n + 1 . Consequently, the sequence { f n } n = 1 is monotone and bounded above, that is, converges. Let f n D , ( n ). By assumption, D < g . Consider
h ( t ) = g ( t ) D , g ( t ) > D , g ( t ) + D , g ( t ) < D , 0 , | g ( t ) | < D .
The function h ( t ) realizes the minimal distance from the function g ( t ) to a convex set of functions modulo less than D. Consider the finite sum of the Fourier series h 0 ( t ) for h ( t ) , h 0 2 = ε 0 . Then, there is K N such that for any n > K , g f n 2 h 0 2 = ε 0 . Consequently, any finite-dimensional subset of a convex set of functions modulo less than D is at a distance not less than ε 0 from h 0 . Therefore, the Fourier coefficients f n ( t ) are separated from the coefficients g ( t ) starting from a certain number. This contradicts the assumption that the first 2 n + 1 Fourier coefficients for f n ( t ) and g n ( t ) coincide. □
We now easily infer the following.
Corollary 3.
f n ( t ) g ( t ) by the norm · , ( n ) ⇔ g = { ± C } .
Examples from [4] show the convergence of polynomials to step functions, which are solutions to the problem as the degree of polynomials tends to .

2.2. The Function of the Minimum Norm f + λ f with a Given Set of Fourier Coefficients

Consider the sequence of functions of the form
f ( t ) = C ( 1 e t ϕ 2 k λ ) , t [ ϕ 2 k , ϕ 2 k + ϕ 2 k + 1 2 ] , C ( 1 e t ϕ 2 k + 1 λ ) , t [ ϕ 2 k + ϕ 2 k + 1 2 , ϕ 2 k + 1 ] , C ( 1 e t ϕ 2 k 1 λ ) , t [ ϕ 2 k 1 , ϕ 2 k + ϕ 2 k 1 2 ] , C ( 1 e t ϕ 2 k λ ) , t [ ϕ 2 k + ϕ 2 k 1 2 , ϕ 2 k ] j = 1 , , n , ϕ 2 n + 1 = ϕ 1 ,
where, for any k ϕ 2 k ϕ 2 k + 2 , ϕ 2 k 1 ϕ 2 k + 1 .
Then, again, similar to the previous section, we have a diffeomorphism of the set M = { ( C , ϕ 1 , , ϕ 2 n ) } / onto R 2 n + 1 . Once again, existence follows from the fact that the dimension of the boundary of M is 2 n 1 . The mapping Jacobian is equal to the mapping Jacobian from the previous item multiplied by ( 1 ) n C n k = 1 2 n ( 1 e ϕ k λ ) . Indeed, the Jacobi matrix of the mapping equals
J 2 = ( c 0 , c 1 , , c 2 n ) ( ϕ 1 , , ϕ 2 n ) =
= 2 π ( 1 e ϕ 1 λ ) ( 1 e ϕ 2 λ ) ( 1 e ϕ 2 n λ ) ( 1 e ϕ 1 λ ) sin ( ϕ 1 ) ( 1 e ϕ 2 λ ) sin ( ϕ 2 ) ( 1 e ϕ 2 n λ ) sin ( ϕ 2 n ) 1 e ϕ 1 λ n sin ( n ϕ 1 ) 1 e ϕ 2 λ n sin ( n ϕ 2 ) 1 e ϕ 2 n λ n sin ( n ϕ 2 n ) ( 1 e ϕ 1 λ ) cos ( ϕ 1 ) ( 1 e ϕ 2 λ ) cos ( ϕ 2 ) ( 1 e ϕ 2 n λ ) cos ( ϕ 2 n ) 1 e ϕ 1 λ n cos ( n ϕ 1 ) 1 e ϕ 2 λ n cos ( n ϕ 2 ) 1 e ϕ 2 n λ ) n cos ( n ϕ 2 n ) .

2.3. The Function of the Minimum Norm · 1 with a Given Set of Fourier Coefficients

Consider the following problem.
On the class of non-negative integrable functions f : [ 0 , 2 π ] R + with the given 2 n Fourier coefficients
c 2 j + 1 = 1 2 π 0 2 π f ( t ) sin ( j t ) d t , c 2 j = 1 2 π 0 2 π f ( t ) cos ( j t ) d t , j = 0 , , n ,
find the function of the minimum norm · 1 .
Consider the function
g ( t ) = k = 1 n a k δ ϕ k ( t ) , a k 0 , ϕ k [ 0 , 2 π ) .
Here, δ ϕ k ( t ) is the Kronecker δ -function.
Theorem 3.
For any set ( c 1 , , c 2 n ) R 2 n , there is a unique function g ( t ) of the form in Equation (2), which is a solution of the formulated problem.
Proof. 
The proof of the statement is based on the same considerations as in the case of the problem for the norm · .
Existence. As in Theorem 1, we show the degeneration of the mapping image boundary.
G 1 ( a 1 , , a n , ϕ 1 , ϕ 2 , , ϕ n ) = j = 1 n a j e i ϕ j j = 1 n a j e i 2 ϕ j j = 1 n a j e i n ϕ j .
For ϕ 1 < < ϕ n , the map Jacobian is non-degenerate, since it is a multiple of the determinant of the Vandermond matrix V ( e i ϕ 1 , , e i ϕ n ) . The Jacobi matrix of the mapping G 1 is a block matrix of the form
J = c 1 , , c 2 n ϕ 1 , , ϕ n , a 1 , , a n = A B B A .
Here,
A = sin ϕ 1 sin ϕ n sin n ϕ 1 sin n ϕ n , A = a 1 sin ϕ 1 a n sin ϕ n n a 1 sin n ϕ 1 n a n sin n ϕ n .
B = cos ϕ 1 cos ϕ n cos n ϕ 1 cos n ϕ n , B = a 1 cos ϕ 1 a n cos ϕ n n a 1 cos n ϕ 1 n a n cos n ϕ n .
This matrix is non-degenerate if and only if the Jacobi matrix n ! j = 1 n a j ( A + i B ) : C n C n of the mapping J : R 2 n R 2 n complexified with the affinor I = 0 I n I n 0 is degenerate. This is true for a j = 0 , j { 1 , , n } or for ϕ j = ϕ k , j k { 1 , , n } . The image of G 1 ( ( R + ) n × [ 0 , 2 π ) n ) is a subset of dimension 2 n with boundary of dimension 2 n 2 of space R 2 n . Then, G 1 ( ( R + ) n × [ 0 , 2 π ) n ) = R 2 n .
Further, similar to the proof of Theorem 2, we prove the uniqueness of the pre-image for the mapping G 1 .
Assume that there exist two different solutions g 1 ( t ) and g 2 ( t ) . Consider g 3 ( t , K ) = g 1 ( t ) g 2 ( t ) + K , K R . On the one hand, for some K 0 , the function g 3 ( t , K 0 ) has at least 2 n + 2 sign changes. On the other hand, g 3 ( t , K ) has at most 2 n sign changes for any K. We arrive at a contradiction. □
We now consider the problem of finding the function of the minimum norm · 1 satisfying the conditions
(1)
f ( t ) L 2 ( [ 0 , 2 π ] ) ; and
(2)
0 2 π f ( t ) e i j t d t = c j , c j C , j = 0 , , n , c 0 R .
Consider the function
H ( t ) = k = 1 2 n a k δ ϕ k ( t ) , a k R , ϕ k [ 0 , 2 π ) .
Corollary 4.
For any set ( c 0 , c 1 , c n ) R × C n , there exists a function of the form in Equation (3) satisfying Conditions (1) and (2).
We construct the function g 1 ( t ) from Theorem 3 by the set of coefficients ( c 1 , c n ) and the function g 2 ( t ) by the set of coefficients ( c 1 , c n ) and select λ R so that 0 2 π g 3 ( t ) d t = 0 2 π λ g 1 ( t ) + ( 1 λ ) ( g 2 ( t ) ) d t = c 0 .
Note that for n = 1 the solution to the last problem is H ( t ) [12].
Example. Consider the polynomial 1 + 2 cos t . Then, the first term in Corollary 4 is of the form 4 π δ 0 ( t ) , and the second equals 4 π δ π ( t ) . We have k = 5 / 8 and H ( t ) = 5 π 2 δ 0 ( t ) 3 π 2 δ π ( t ) .

2.4. Figures, Tables and Schemes

The Figure 1 and Figure 2 are as follows:

3. Discussion

The results presented here may be applied for constructing multi-connected wing profiles in aerohydrodynamics as well as in the study of cavitation diagrams. In addition, we introduce a new technique for solution of similar problems.

4. Materials and Methods

All the constructions of examples were performed in Maxima and are available on the first request.

5. Conclusions

Here, we solved some problems of conditional approximation introducing new proof methods. Note that the problem of uniqueness of nonnegative solution for the space L 1 ( 0 , 2 π ) in the general case is yet unsolved.
These results can be applied to different optimization problems of mathematical physics. For example, in aerohydrodynamics, a wing may be considered as the set of parallel profiles [16], thus, to optimize the wing contour, we need to simultaneously optimize the contours bounding these profiles. Recall that the problem for the norm f + λ f appeared due to the following reasons: (1) the integral norms generate solutions too different from the initial velocity distribution; and (2) discontinuous solutions involve reconstruction of contours with singularities.
These methods are applicable to not necessarily one-dimensional problems. Again, to include in our considerations the air shift along the wing blade, we do not need to optimize the wing sections in two mutually orthogonal directions. It also seems possible to prove certain inequalities of complex analysis with the help of these methods.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Bernstein, S.; de la Vallée Poussin, C. L’approximation; Chelsea Publishing Comp: Bronx, NY, USA, 1970. [Google Scholar]
  2. Schur, I. Uber das Maximum des absoluten Betrages ernes Polynoms in einem gegebenen Interval. Math. Z. 1919, 4, 271–287. [Google Scholar] [CrossRef]
  3. Rahman, Q.I.; Schmeisser, G. Les inégalités de Markoff et de Bernstein; Presses Univ. Montreal: Montreal, QC, Canada, 1983. [Google Scholar]
  4. Dette, H.; Melas, V.B. A note on some extremal problems for trigonometric polynomials, No 2005, 20. In Technical Reports from Technische Universitaet Dortmund, Sonderforschungsbereich 475: Komplexitaetsreduktion in multivariaten Datenstrukturen; EconStor: Kiel, Germany, 2005; pp. 1–17. [Google Scholar]
  5. Taikov, L.V. On the best approximation of Dirichlet kernels. Math. Notes 1993, 53, 640–643. [Google Scholar] [CrossRef]
  6. Hesse, K.; Sloan, I.H. Hyperinterpolation on the Sphere. In Frontiers in Interpolation and Approximation; Govil, N.K., Mhaskar, H.N., Mohapatra, R.N., Nashed, Z., Szabados, J., Eds.; Taylor and Frances: Didcot, UK, 2007; pp. 213–248. [Google Scholar]
  7. Ash, J.M.; Ganzburg, M. An extremal problem for trigonometric polynomials. Proc. AMS 1999, 127, 211–216. [Google Scholar] [CrossRef]
  8. Taikov, L.V. On a group of extremal problems for trigonometric polynomials. Usp. Mat. Nauk 1965, 20, 205–211. [Google Scholar]
  9. Milovanovic, G.V.; Rassias, T.M.; Mitrinovic, D.S. Topics in Polynomials: Extremal Problems, Inequalities, Zeros; World Scientific: Singapore, 1999. [Google Scholar]
  10. Babenko, K.I. Ueber die besten Approximationen einer Klasse analytischer Funktionen. Izv. Akad. Nauk SSSR Ser. Mat. 1958, 22, 631–640. (In Russian) [Google Scholar]
  11. Goluzin, G.M. Geometric Theory of Functions of a Complex Variable; Translations of Mathematical Monographs; American Mathematical Society: Providence, RI, USA, 1969; Volume 26. [Google Scholar]
  12. Ivanshin, P.N. Quasisolutions of one inverse boundary-value problem of aerohydromechanics. Russ. Math. 2013, 57, 9–19. [Google Scholar] [CrossRef]
  13. Ivanshin, P.N. Conditional Optimization and One Inverse Boundary Value Problem. Math. Probl. Eng. 2015, 2015, 949703. [Google Scholar] [CrossRef]
  14. Avkhadiev, F.G.; Elizarov, A.M. Exact bounds of solution to a variation inverse boundary value problem in a countable-connected domain. Russ. Math. 1996, 40, 1–11. [Google Scholar]
  15. Berg, C.; Szwarc, R. A determinant characterization of moment sequences with finitely many mass points. Linear Multilinear Algebra 2015, 63, 1568–1576. [Google Scholar] [CrossRef]
  16. Sadrehaghighi, I. Aerodynamic Design & Optimization; ResearchGate: Berlin, Germany, 2019. [Google Scholar] [CrossRef]
Figure 1. The function sin ( ϕ ) + sin ( 2 ϕ ) + cos ( 2 ϕ ) and the function of the minimum norm · with the same set of first five Fourier coefficients.
Figure 1. The function sin ( ϕ ) + sin ( 2 ϕ ) + cos ( 2 ϕ ) and the function of the minimum norm · with the same set of first five Fourier coefficients.
Mathematics 07 00651 g001
Figure 2. The function 4 sin ( ϕ ) + sin ( 2 ϕ ) + cos ( 2 ϕ ) and the function of the minimum norm · with the same set of first five Fourier coefficients.
Figure 2. The function 4 sin ( ϕ ) + sin ( 2 ϕ ) + cos ( 2 ϕ ) and the function of the minimum norm · with the same set of first five Fourier coefficients.
Mathematics 07 00651 g002

Share and Cite

MDPI and ACS Style

Ivanshin, P. Functions of Minimal Norm with the Given Set of Fourier Coefficients. Mathematics 2019, 7, 651. https://doi.org/10.3390/math7070651

AMA Style

Ivanshin P. Functions of Minimal Norm with the Given Set of Fourier Coefficients. Mathematics. 2019; 7(7):651. https://doi.org/10.3390/math7070651

Chicago/Turabian Style

Ivanshin, Pyotr. 2019. "Functions of Minimal Norm with the Given Set of Fourier Coefficients" Mathematics 7, no. 7: 651. https://doi.org/10.3390/math7070651

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop