Next Article in Journal
To Google or Not: Differences on How Online Searches Predict Names and Faces
Next Article in Special Issue
Approximation of Generalized Ovals and Lemniscates towards Geometric Modeling
Previous Article in Journal
Inventory Management at a Chilean Hospital Pharmacy: Case Study of a Dynamic Decision-Aid Tool
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Some Intrinsic Properties of Tadmor–Tanner Functions: Related Problems and Possible Applications

by
Nikolay Kyurkchiev
Faculty of Mathematics and Informatics, University of Plovdiv Paisii Hilendarski, 24, Tzar Asen Str., 4000 Plovdiv, Bulgaria
Submission received: 24 September 2020 / Revised: 11 October 2020 / Accepted: 12 October 2020 / Published: 5 November 2020
(This article belongs to the Special Issue Numerical Analysis and Computational Science)

Abstract

:
In this paper, we study some properties of an exponentially optimal filter proposed by Tadmor and Tanner. More precisely, we consider the problem for approximating the function of rectangular type F ( t ) by the class of exponential functions σ a d a p t ( t ) about the Hausdorff metric. We prove upper and lower estimates for “saturation”—d (in the case q = 2 ). New activation and “semi-activation” functions based on σ a d a p t ( t ) are defined. Some related problems are discussed. We also consider modified families of functions with “polynomial variable transfer”. Numerical examples, illustrating our results using CAS MATHEMATICA are given.

1. Introduction

In antenna-feeder techniques, the most often occurred signals F ( t ) are of rectangular type, as shown in Figure 1. In [1,2], the authors construct a new class of accurate filters for processing piecewise smooth spectral data.
Definition 1.
The exponentially optimal filter is defined as [1,2]:
σ a d a p t ( t ) : = e c q t q t 2 1 ; | t | < 1 , 0 , | t | 1 c q = 2 q . 3 8 . 18 q 2 + 3 q + 14 9 q 2 + 6 q + 2 .
Various modifications of this “powerful” class of functions have been proposed and studied by a number of researchers. This study represents a certain interesting problem for approximating the function F ( t ) with the specified class of exponential functions σ a d a p t ( t ) in the Hausdorff sense.
Definition 2
([3,4]). The Hausdorff distance (the H–distance) [3] ρ ( f , g ) between two interval functions f , g on Ω R , is the distance between their completed graphs F ( f ) and F ( g ) considered as closed subsets of Ω × R . More precisely,
ρ ( f , g ) = max { sup A F ( f ) inf B F ( g ) | | A B | | , sup B F ( g ) inf A F ( f ) | | A B | | } ,
wherein | | . | | is any norm in R 2 —e. g. the maximum norm | | ( t , x ) | | = max { | t | , | x | } —hence, the distance between the points A = ( t A , x A ) , B = ( t B , x B ) in R 2 is | | A B | | = m a x ( | t A t B | , | x A x B | ) .
The basic approaches for approximation of functions and point sets of the plane by algebraic and trigonometric polynomials in respect to Hausdorff distance (H–distance) are connected to the work and achievements of Bl. Sendov who established a Bulgarian school in Approximation theory, particularly for developing the theory of Hausdorff approximations.
For some basic results, see [5,6].
In this paper we consider some intrinsic properties of function (1). A number of modified adaptive functions have also been proposed that can find application in the field of antenna-feeder analysis. Of course, the specialists working in this direction will assess which of the new models have the right to exist.

2. Main Results

2.1. Some Intrinsic Properties

We will consider only the case q–even (see, Figure 2). Let t 0 be the value for which σ a d a p t ( t 0 ) = 1 2 —i.e., t 0 is the solution of the nonlinear equation:
e c q t 0 q t 0 2 1 1 2 = 0 .
The Hausdorff distance d between F ( t ) and σ a d a p t ( t ) satisfies the relation:
e c q ( t 0 d ) q ( t 0 d ) 2 1 = 1 d .
Some computational examples using relations (3) and (4) are depicted on Figure 3. Equations (3) and (4) are nonlinear equations for solving t 0 and d. For large values of q, the coefficient c q grows very rapidly, which severely limits the computational calculations and visualization of the results in any Computer Algebraic Platform. The same remark remains valid when solving the nonlinear Equation (4) for the magnitude of the best Hausdorff approximation—d. This requires obtaining precise two-sided estimates for d. We will sketch the idea, for example, for q = 2 . Let (see (4))
G ( d ) = c 2 ( t 0 d ) 2 ( t 0 d ) 2 1 ln ( 1 d ) .
The following theorem gives upper and lower bounds for d.
Theorem 1.
Let q = 2 . The “saturation”-d satisfies the following inequalities
d l : = 1 2 p 2 < d < ln ( 2 p 2 ) 2 p 2 : = d r .
where
p 2 = 1 + 2 c 2 t 0 2 t 0 2 + t 0 4 ( t 0 2 1 ) 2 .
Proof. 
From G ( d ) > 0 , we conclude that the function G is strictly monotonically increasing. Consider the function
G 1 ( d ) = c 2 t 0 2 t 0 2 1 + 1 + 2 c 2 t 0 2 t 0 2 + t 0 4 ( t 0 2 1 ) 2 d = p 1 + p 2 d .
From Taylor expansion, we obtain G ( d ) G 1 ( d ) = O ( d 2 ) . Hence, G 1 ( d ) approximates G ( d ) with d 0 as O ( d 2 ) (see, Figure 4). In addition, G 1 ( d ) > 0 . Further, we have
G 1 1 2 p 2 = p 1 + 1 2 = 0.193147 < 0 , G 1 ln ( 2 p 2 ) 2 p 2 = p 1 + 1 2 ln 2 p 2 = 0.445106 > 0 .
This completes the proof of the theorem. □
From (5), we see that for q = 2 , d l = 0.102642 < d = 0.185197 < d r = 0.233665 .
The reader may formulate the corresponding approximation problem for arbitrary q following the ideas given in this note, and this will be omitted. Some techniques for obtaining accurate two-sided estimates can be found in [7].

2.2. Some Remarks

The basic problems considered in [8,9,10]) are an approximation of functions and point sets by algebraic and trigonometric polynomials in the Hausdorff metric as well as their applications in the field of antenna-feeder techniques, analysis and the synthesis of antenna patterns and filters, including noise minimization by the suitable approximation of impulse functions.
The application of Fourier analysis for the approximation of impulse and transmitting functions is compared to this, which can be obtained using the elements of the best Hausdorff approximation.
The advantage of the Hausdoorff metric is the removal of “Gibbs’ phenomenon” [11] (see, Figure 5).
  • Modified Families with ”Polynomial Variable Transfer”
    Following the ideas formally given by us, we consider the following modified families of functions based on σ a d a p t ( t ) with “polynomial variable transfer”:
    F 1 ( t ) : = e c q f ( t ) q t 2 1 , f ( t ) = i = 0 n a i t i , a 0 = 0
    and
    F 2 ( t ) : = e c q f ( t ) q f ( t ) 2 1 , f ( t ) = i = 0 n a i t i , a 0 = 0 .
    The modified families: F 1 ( t ) for q = 2 , n = 3 , a 0 = 0 , a 1 = 3.96 , a 2 = 18.9 , a 3 = 5.7 and F 2 ( t ) for q = 2 , n = 4 , a 0 = 0 , a 1 = 1.96 , a 2 = 8.9 , a 3 = 6.7 , a 4 = 2 are depicted in Figure 6.
    Let t = b 0 ( π cos ( θ ) + a ) , where θ is azimuthal angle and a is the phase difference.
    Then, for example, typical radiation patterns with “restrictions” using F 1 ( θ ) for
    (a) q = 2 , n = 3 , a 0 = 0 , a 1 = 1 , a 2 = 3.9 , b 0 = 0.5 , a = 3.2 ;
    (b) q = 2 , n = 3 , a 0 = 0 , a 1 = 1 , a 2 = 3.9 , b 0 = 1.8 , a = 2.4
    are plotted on Figure 7 and Figure 8.
    Numerical examples are presented using CAS MATHEMATICA.
  • The New Activation Function
    We define the following activation function based on σ a d a p t ( t ) (1):
    F 3 ( t ) = 1 e c q t q t 2 1 1 + e c q t q t 2 1 .
    In antenna-feeder technique most often occurred signals are of types shown in Figure 9 and Figure 10. For q even, the corresponding approximation using model (9) is shown in Figure 9. For q odd, the corresponding approximation using new activation function F 3 ( t ) is shown in Figure 10.
    The reader may formulate the corresponding approximation problem following the ideas given in this article, and this will be omitted. The results have important role in the fields of Population Dynamics, Biostatistics, Signal Theory, Reliability Analysis and Life testing experiments. For other results, see [12,13,14,15]. Another application of the Hausdorff metric can be found in [16].
  • New ”semi-activation” function
    We define the following “semi-activation” function
    F 4 ( t ) = 1 e c q t q ( a 0 + a 1 t + a 2 t 2 ) 2 1 1 + e c q ( a 0 + a 1 t + a 2 t 2 ) q ( a 0 + a 1 t + a 2 t 2 ) 2 1 .
    The problem of approximating the “point set” depicted in Figure 11 is also of independent interest (in the limiting case, the “point set CROSS”—see, for instance, [17]).
    The modified family F 4 ( t ) for q = 7 :
    (a) a 0 = 0 , a 1 = 0.04 , a 2 = 7.2 ;
    (b) a 0 = 0 , a 1 = 0.01 , a 2 = 9.01
    is depicted in Figure 11.
  • Another activation function
    Formally, we define the following activation function
    F 5 ( t ) = e a t q t 2 1 e a t q t 2 1 e a t q t 2 1 + e a t q t 2 1 , t ( 0.1 )
    where a > 0 .
    The shifted Heaviside step function is defined by
    h t 0 ( t ) = c l l 0 , i f t < t 0 , [ 0 , 1 ] , i f t = t 0 , 1 , i f t > t 0
    Obviously, the new function F 5 ( t ) can be used successfully to approximate the Heaviside step function (see Figure 12).
    Approximation of shifted Heaviside step function h t 0 ( t ) by sigmoidal function F 5 ( t ) for:
    (a) q = 6 : a = 1000 , t 0 = 0.282245 ; Hausdorff distance d = 0.0580217 ;
    (b) q = 3 a = 700 , t 0 = 0.0919762 ; Hausdorff distance d = 0.0460022
    is visualized on Figure 12.
    The function F 5 ( t ) can be used in the field of population dynamics and biostatistics [7].
  • The new function
    Formally, we define the following function:
    F 6 ( t ) = 1 e H ( t ) G ( t )
    where H ( t ) and G ( t ) are polynomials.
    In some cases, the function F 6 ( t ) can be used for analysis of “rectangular signals”.
    For example, see Figure 13 for fixed
    G ( t ) = 1.17755 t 10 51.87041 * t 9 + 2.85984 * t 8 + 123.85465 * t 7 14.21173 * t 6 100.59484 * t 5 + 16.45178 * t 4 + 30.42548 * t 3 7.39353 * t 2 0.95663 * t + 1.1 and
    H ( t ) = t 8 + t 6 + t 4 + t 2 + 2.9 .
    Remark 1.
    G ( t ) is the polynomial of best one–sided Hausdorff distance of the function
    κ ( t ) = c l l 1 , i f 1 t 1 3 , 1 , i f 1 3 < t 1 .
    by polynomial of degree 10 (see, for example, [4]).
    Let t = b 0 ( π cos ( θ ) + a ) .
    A “typical radiation pattern” F 6 ( θ ) for b = 0.132 and a = 4.263 is depicted on Figure 14 and Figure 15.
    Unfortunately, these diagrams cannot always be realized in practice.
  • Application to the ”cut-off function”
    The analysis presented in this article can also be applied to the “cut-off function”, see (1):
    F 7 ( t ) = e C t p t 2 π 2
    where C > 0 and p is even.
  • Approximation with restrictions
    Often some restrictions must be imposed on the main lobe of the radiation pattern—for example, see Figure 16
    The polynomial
    f ( t ) = 133.123786 t 10 251.561221 t 8 + 107.004415 t 6 + 36.476971 t 4 30.804320 t 2 + 6.189054
    computed by Remez’s algorithm from [18] and shown in Figure 17, provides a reliable approximation of the window (Figure 16).
    We note that the “adaptive function” with c 1 = 6.9
    F 8 ( t ) = 1 1 e c 1 t 2 t 2 1 2
    based on function of Tadmor and Tanner (1) is of the form shown in Figure 17.
    Unfortunately, these diagrams cannot always be realized in practice.
    Specialists working in these scientific fields have the final word.
    We will look at another instructive example.
    A typical diagram function R ( t ) with imposed constraints at the median level is shown in Figure 18.
    After serious analysis, it turned out that the function by Tadmor and Tanner could be modified in such a way as to obtain the following “differential analogue with step h”:
    σ a d a p t * ( t ) : = ( σ a d a p t ( t ) + σ a d a p t ( t h ) ) / 2
    where
    σ a d a p t ( t ) : = e c q t q t 2 1
    and
    c q = 2 q . 3 8 . 18 q 2 + 3 q + 14 9 q 2 + 6 q + 2 .
    From the attached visualization (see Figure 19 and Figure 20) it can be seen that the proposed new modification can be used successfully for the approximation of functions of type R ( t ) .
    Obviously, higher order differential analogues can be obtained, which we leave to the readers’ attention.

3. Concluding Remarks

The aim of the present research is to define families of “adaptive functions” that could be used in various branches of scientific knowledge, in particular in the approximation of a number of classical impulse signals, point sets in the plane and supplemented graphs of discontinuous functions.
Questions related to the synthesis and analysis of transfer functions, radiation diagrams with algebraic and trigonometric polynomials about Hausdorff distance are elaborated in detail in the monograph in [8].
In this article we consider only some aspects related to the disclosure of intrinsic properties of some of the proposed families of “adaptive functions” in a purely methodological aspect.
Many of the proposed new models could not be used as “feasible models–diagrams” in practice.
In this connection, the specialists working in the indicated field have the floor. For some results, see [19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39].

Funding

This research received no external funding.

Acknowledgments

This work has been accomplished with the financial support by the Grant No BG05M2OP001-1.001-0003, financed by the Science and Education for Smart Growth Operational Program (2014–2020) and co-financed by the European Union through the European structural and Investment funds.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Tadmor, E.; Tanner, J. Adaptive filters for piecewise smooth spectral data. SIMA J. Numer. Alg. 2005, 25, 535–547. [Google Scholar]
  2. Tanner, J. Optimal filter and mollifier for piecewise smooth spectral data. Math. Comput. 2006, 75, 767–790. [Google Scholar] [CrossRef] [Green Version]
  3. Hausdorff, F. Set Theory, 2nd ed.; Chelsea Publ.: New York, NY, USA, 1962. [Google Scholar]
  4. Sendov, B. Hausdorff Approximations; Kluwer: Boston, MA, USA, 1990. [Google Scholar]
  5. Sendov, B.; Popov, V. The exact asymptotic behavior of the best approximation by algebraic and trigonometric polynomials in the Hausdorff metric. Math. USSR-Sb 1972, 89, 138–147. (In Russian) [Google Scholar] [CrossRef]
  6. Anguelov, R.; Markov, S.; Sendov, B. On the Normed Linear Space of Hausdorff Continuous Functions. Lecture Notes Comput. Sci. 2006, 3743, 281–288. [Google Scholar]
  7. Kyurkchiev, N.; Markov, S. On the Hausdorff distance between the Heaviside step function and Verhulst logistic function. J. Math. Chem. 2016, 54, 109–119. [Google Scholar] [CrossRef]
  8. Kyurkchiev, N.; Andreev, A. Approximation and Antenna and Filter Synthesis: Some Moduli in Programming Environment Mathematica; Lap Lambert Academic Publishing: Saarbrucken, Germany, 2014. [Google Scholar]
  9. Andreev, A.; Kyurkchiev, N. Approximation of some impulse functions—implementation in programming environment MATHEMATICA. In Proceedings of the 43 Spring Conference of the Union of Bulgarian Mathematicians, Borovetz, Bulgaria, 2–6 April 2014; pp. 111–117. [Google Scholar]
  10. Golev, A.; Djamiykov, T.; Kyurkchiev, N. Sigmoidal Functions in Antenna-feeder Technique. Int. J. Pure Appl. Math. 2017, 116, 1081–1092. [Google Scholar]
  11. Gelb, A.; Tanner, J. Robust reprojection methods for the resolution of the Gibbs phenomenon. Appl. Comput. Harmon. Anal. 2006, 20, 3–25. [Google Scholar] [CrossRef]
  12. Kyurkchiev, N.; Iliev, A.; Rahnev, A. On the Half-Logistic Model with “polynomial variable transfer”. Application to approximate the specific “data CORONA VIRUS”. Int. J. Differ. Equations Appl. 2020, 19, 45–61. [Google Scholar]
  13. Kyurkchiev, N. Selected Topics in Mathematical Modeling: Some New Trends (Dedicated to Academician Blagovest Sendov (1932–2020)); Lap Lambert Academic Publishing: Saarbrucken, Germany, 2020. [Google Scholar]
  14. Costarelli, D.; Spigler, R. Constructive Approximation by Superposition of Sigmoidal Functions. Anal. Theory Appl. 2013, 2013 29, 169–196. [Google Scholar]
  15. Kyurkchiev, N.; Nikolov, G. Comments on some new classes of sigmoidal and activation functions. Applications. Dyn. Syst. Appl. 2019, 28, 789–808. [Google Scholar]
  16. Peters, J. Foundations of Computer Vision: Computational Geometry, Visual Image Structures and Object Shape Detection; Springer: Cham, Switzerland, 2017. [Google Scholar]
  17. Kyurkchiev, N.; Markov, S. On the numerical approximation of the “cross” set. Ann. Univ. Sofia Fac. Math. 1974, 66, 19–25. (In Bulgarian) [Google Scholar]
  18. Tashev, S. Approximation of bounded sets on the plane in Hausdorff metric. CR Acad. Bulg. Sci. 1976, 29, 465–468. (In Russian) [Google Scholar]
  19. Petrushev, P.; Popov, V. Rational Approximation of Real Functions; Cambridge University Press: Cambridge, UK, 1987. [Google Scholar]
  20. Ivanov, K.; Totik, V. Fast Decreasing Polynomials. Constr. Approx. 1990, 6, 1–20. [Google Scholar] [CrossRef]
  21. Kyurkchiev, N.; Andreev, A. Hausdorff approximation of functions different from zero at one point—implementation in programming environment MATHEMATICA. Serdica J. Comput. 2013, 7, 135–142. [Google Scholar]
  22. Kyurkchiev, N.; Andreev, A. Synthesis of slot aerial grids with Hausdorff–type directive patterns–implementation in programming environment Mathematica. CR Acad. Bulg. Sci. 2013, 66, 1521–1528. [Google Scholar]
  23. Kyurkchiev, N. Synthesis of Slot Aerial Grids with Hausdorff Type Directive Patterns. Ph.D. Thesis, VMEI, Sofia, Bulgaria, 1979. (In Bulgarian). [Google Scholar]
  24. Sendov, B.L.; Schinev, H.; Kjurkchiev, N. Hausdorff-synthesis of aerial grids in scanning the directive diagram. Electropromishlenost Prib. 1984, 16, 203–205. (In Bulgarian) [Google Scholar]
  25. Schinev, H.; Kjurkchiev, N.; Gachev, M. Experimental investigations of slot aerial grids with Hausdorff type directive patterns. Electropromishlenost Prib. 1979, 14, 223–224. (In Bulgarian) [Google Scholar]
  26. Shinev, H.; Kyurkchiev, N.; Gachev, M.; Markov, S. Application of a class of polynomials of best approximation to linear antenna array synthesis. Izv. Vmei Sofia 1975, 34, 1–6. (In Bulgarian) [Google Scholar]
  27. Kyurkchiev, N.; Sendov, B.L. Approximation of a class of functions by algebraic polynomials with respect to Hausdorff distance. Ann. Univ. Sofia Fac. Math. 1975, 67, 573–579. (In Bulgarian) [Google Scholar]
  28. Appostolov, P. General theory, approximation method and design of electrical filters based on Hausdorff polynomials. Mech. Transp. Commun. 2007, 2, 1–8. (In Bulgarian) [Google Scholar]
  29. Kyurkchiev, N.; Iliev, A.; Rahnev, A. A Look at the New Logistic Models with “Polynomial Variable Transfer”; Lap Lambert Academic Publishing: Saarbrucken, Germany, 2020. [Google Scholar]
  30. Kyurkchiev, N.; Iliev, A.; Golev, A.; Rahnev, A. Some Non-standard Models in “Debugging and Test Theory” (Part 4); Plovdiv University Press: Plovdiv, Bulgaria, 2020. [Google Scholar]
  31. Costarelli, D.; Vinti, G. Pointwise and uniform approximation by multivariate neural network operators of the max-product type. Neural Netw. 2016, 81, 81–90. [Google Scholar] [CrossRef]
  32. Guliyev, N.; Ismailov, V. A single hidden layer feed forward network with only one neuron in the hidden layer san approximate any univariate function. Neural Comput. 2016, 28, 1289–1304. [Google Scholar]
  33. Iris, C.; Pacino, D.; Ropke, S.; Larsen, A. Integrated berth allocation and quay crane assignment problem: Set partitioning models and computational results. Transp. Res. Part Logist. Transp. Rev. 2015, 81, 75–97. [Google Scholar] [CrossRef] [Green Version]
  34. Mauri, G.R.; Ribeiro, G.M.; Lorena, L.A.N.; Laporte, G. An adaptive large neighborhood search for the discrete and continuous berth allocation problem. Comput. Oper. Res. 2016, 70, 140–154. [Google Scholar] [CrossRef]
  35. Kyurkchiev, N. A new class of activation functions. Some related problems and applications. Biomath 2020, 9, 10. [Google Scholar] [CrossRef]
  36. Kyurkchiev, N.; Iliev, A.; Markov, S. Some Techniques for Recurrence Generating of Activation Functions: Some Modeling and Approximation Aspects; Lap Lambert Academic Publishing: Saarbrucken, Germany, 2017. [Google Scholar]
  37. Iliev, A.; Kyurkchiev, N.; Markov, S. A Note on the New Activation Function of Gompertz Type. Biomath Commun. 2017, 4, 20. [Google Scholar] [CrossRef] [Green Version]
  38. Kyurkchiev, N.; Iliev, A.; Rahnev, A. A new class of activation functions based on the correcting amendments of Gompertz-Makeham type. Dyn. Syst. Appl. 2019, 28, 243–257. [Google Scholar] [CrossRef] [Green Version]
  39. Kyurkchiev, N. Comments on the Yun’s algebraic activation function. Some extensions in the trigonometric case. Dyn. Syst. Appl. 2019, 28, 533–543. [Google Scholar]
Figure 1. Signal of rectangular type— F ( t ) .
Figure 1. Signal of rectangular type— F ( t ) .
Mathematics 08 01963 g001
Figure 2. The exponentially optimal filter σ a d a p t ( t ) for q = 4 , 8 , 16 .
Figure 2. The exponentially optimal filter σ a d a p t ( t ) for q = 4 , 8 , 16 .
Mathematics 08 01963 g002
Figure 3. Approximation of F ( t ) by σ a d a p t ( t ) : (a) q = 2 , c q = 2.76 , t 0 = 0.448028 ; Hausdorff distance d = 0.185197 ; (b) q = 8 , c q = 182.492 , t 0 = 0.482049 ; Hausdorff distance d = 0.0974479 ; (c) q = 16 , c q = 47781 , t 0 = 0.489945 ; Hausdorff distance d = 0.0646479 ; (d) q = 30 , c q = 7.9266 × 10 8 , t 0 = 0.494313 ; Hausdorff distance d = 0.0427321 .
Figure 3. Approximation of F ( t ) by σ a d a p t ( t ) : (a) q = 2 , c q = 2.76 , t 0 = 0.448028 ; Hausdorff distance d = 0.185197 ; (b) q = 8 , c q = 182.492 , t 0 = 0.482049 ; Hausdorff distance d = 0.0974479 ; (c) q = 16 , c q = 47781 , t 0 = 0.489945 ; Hausdorff distance d = 0.0646479 ; (d) q = 30 , c q = 7.9266 × 10 8 , t 0 = 0.494313 ; Hausdorff distance d = 0.0427321 .
Mathematics 08 01963 g003
Figure 4. The functions G ( d ) and G 1 ( d ) for q = 2 .
Figure 4. The functions G ( d ) and G 1 ( d ) for q = 2 .
Mathematics 08 01963 g004
Figure 5. A typical application of Fourier transform to analysis of radiation patterns (“Gibbs’ phenomenon”) [8].
Figure 5. A typical application of Fourier transform to analysis of radiation patterns (“Gibbs’ phenomenon”) [8].
Mathematics 08 01963 g005
Figure 6. (a) Modified family F 1 ( t ) for q = 2 , n = 3 , a 0 = 0 , a 1 = 3.96 , a 2 = 18.9 , a 3 = 5.7 ; (b) Modified family F 2 ( t ) for q = 2 , n = 4 , a 0 = 0 , a 1 = 1.96 , a 2 = 8.9 , a 3 = 6.7 , a 4 = 2 .
Figure 6. (a) Modified family F 1 ( t ) for q = 2 , n = 3 , a 0 = 0 , a 1 = 3.96 , a 2 = 18.9 , a 3 = 5.7 ; (b) Modified family F 2 ( t ) for q = 2 , n = 4 , a 0 = 0 , a 1 = 1.96 , a 2 = 8.9 , a 3 = 6.7 , a 4 = 2 .
Mathematics 08 01963 g006
Figure 7. A typical radiation pattern with “restrictions” using F 1 ( θ ) for q = 2 , n = 3 , a 0 = 0 , a 1 = 1 , a 2 = 3.9 , a 3 = 1.7 , b 0 = 0.5 , a = 3.2 .
Figure 7. A typical radiation pattern with “restrictions” using F 1 ( θ ) for q = 2 , n = 3 , a 0 = 0 , a 1 = 1 , a 2 = 3.9 , a 3 = 1.7 , b 0 = 0.5 , a = 3.2 .
Mathematics 08 01963 g007
Figure 8. A typical radiation pattern with “restrictions” using F 1 ( θ ) for q = 2 , n = 3 , a 0 = 0 , a 1 = 1 , a 2 = 3.9 , a 3 = 1.7 , b 0 = 1.82 , a = 2.4 .
Figure 8. A typical radiation pattern with “restrictions” using F 1 ( θ ) for q = 2 , n = 3 , a 0 = 0 , a 1 = 1 , a 2 = 3.9 , a 3 = 1.7 , b 0 = 1.82 , a = 2.4 .
Mathematics 08 01963 g008
Figure 9. Approximation by F 3 ( t ) for q = 4 , 6 , 8 .
Figure 9. Approximation by F 3 ( t ) for q = 4 , 6 , 8 .
Mathematics 08 01963 g009
Figure 10. Approximation by F 3 ( t ) for q = 3 , 7 , 13 .
Figure 10. Approximation by F 3 ( t ) for q = 3 , 7 , 13 .
Mathematics 08 01963 g010
Figure 11. Approximation by F 4 ( t ) , q = 7 : (a) a 0 = 0 , a 1 = 0.04 , a 2 = 7.2 ; (b) a 0 = 0 , a 1 = 0.01 , a 2 = 9.01 .
Figure 11. Approximation by F 4 ( t ) , q = 7 : (a) a 0 = 0 , a 1 = 0.04 , a 2 = 7.2 ; (b) a 0 = 0 , a 1 = 0.01 , a 2 = 9.01 .
Mathematics 08 01963 g011
Figure 12. Approximation of h t 0 ( t ) by F 5 ( t ) : (a) q = 6 : a) a = 1000 , t 0 = 0.282245 ; Hausdorff distance d = 0.0580217 ; (b) q = 3 : a) a = 700 , t 0 = 0.0919762 ; Hausdorff distance d = 0.0460022 .
Figure 12. Approximation of h t 0 ( t ) by F 5 ( t ) : (a) q = 6 : a) a = 1000 , t 0 = 0.282245 ; Hausdorff distance d = 0.0580217 ; (b) q = 3 : a) a = 700 , t 0 = 0.0919762 ; Hausdorff distance d = 0.0460022 .
Mathematics 08 01963 g012
Figure 13. The function F 5 ( t ) -red.
Figure 13. The function F 5 ( t ) -red.
Mathematics 08 01963 g013
Figure 14. A “typical radiation pattern” F 6 ( θ ) for b = 0.132 and a = 4.263 .
Figure 14. A “typical radiation pattern” F 6 ( θ ) for b = 0.132 and a = 4.263 .
Mathematics 08 01963 g014
Figure 15. A “typical radiation pattern” F 6 ( θ ) for b = 0.13 and a = 4.349 .
Figure 15. A “typical radiation pattern” F 6 ( θ ) for b = 0.13 and a = 4.349 .
Mathematics 08 01963 g015
Figure 16. “Typical restrictions”.
Figure 16. “Typical restrictions”.
Mathematics 08 01963 g016
Figure 17. “Typical radiation patterns”.
Figure 17. “Typical radiation patterns”.
Mathematics 08 01963 g017
Figure 18. A typical diagram function R ( t ) with restrictions.
Figure 18. A typical diagram function R ( t ) with restrictions.
Mathematics 08 01963 g018
Figure 19. The function σ a d a p t * ( t ) for q = 8 : (a) h = 0.32 ; (b) h = 0.22 .
Figure 19. The function σ a d a p t * ( t ) for q = 8 : (a) h = 0.32 ; (b) h = 0.22 .
Mathematics 08 01963 g019
Figure 20. The function σ a d a p t * ( t ) for q = 16 : (a) h = 0.32 ; (b) h = 0.22 .
Figure 20. The function σ a d a p t * ( t ) for q = 16 : (a) h = 0.32 ; (b) h = 0.22 .
Mathematics 08 01963 g020
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Kyurkchiev, N. Some Intrinsic Properties of Tadmor–Tanner Functions: Related Problems and Possible Applications. Mathematics 2020, 8, 1963. https://0-doi-org.brum.beds.ac.uk/10.3390/math8111963

AMA Style

Kyurkchiev N. Some Intrinsic Properties of Tadmor–Tanner Functions: Related Problems and Possible Applications. Mathematics. 2020; 8(11):1963. https://0-doi-org.brum.beds.ac.uk/10.3390/math8111963

Chicago/Turabian Style

Kyurkchiev, Nikolay. 2020. "Some Intrinsic Properties of Tadmor–Tanner Functions: Related Problems and Possible Applications" Mathematics 8, no. 11: 1963. https://0-doi-org.brum.beds.ac.uk/10.3390/math8111963

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