We introduce the concepts of multiple attribute decision-making (MADM) using square root neutrosophic normal interval-valued sets (SRNSNIVS). The square root neutrosophic (SRNS), interval-valued NS, and neutrosophic normal interval-valued (NSNIV) sets are extensions of SRNSNIVS. A historical analysis of several aggregating operations is presented in this article. In this article, we discuss a novel idea for the square root NSNIV weighted averaging (SRNSNIVWA), NSNIV weighted geometric (SRNSNIVWG), generalized SRNSNIV weighted averaging (GSRNSNIVWA), and generalized SRNSNIV weighted geometric (GSRNSNIVWG). Examples are provided for the use of Euclidean distances and Hamming distances. Various algebraic operations will be applied to these sets in this communication. This results in more accurate models and is closed to an integer Δ. A medical robotics system is described as combining computer science and machine tool technology. There are five types of robotics such as Pharma robotics, Robotic-assisted biopsy, Antibacterial nano-materials, AI diagnostics, and AI epidemiology. A robotics system should be selected based on four criteria, including robot controller features, affordable off-line programming software, safety codes, and the manufacturer's experience and reputation. Using expert judgments and criteria, we will be able to decide which options are the most appropriate. Several of the proposed and current models are also compared in order to demonstrate the reliability and usefulness of the models under study. Additionally, the findings of the study are fascinating and intriguing.
Citation: Murugan Palanikumar, Nasreen Kausar, Harish Garg, Aiyared Iampan, Seifedine Kadry, Mohamed Sharaf. Medical robotic engineering selection based on square root neutrosophic normal interval-valued sets and their aggregated operators[J]. AIMS Mathematics, 2023, 8(8): 17402-17432. doi: 10.3934/math.2023889
[1] | Zehba Raizah, Arshad Khan, Saadat Hussain Awan, Anwar Saeed, Ahmed M. Galal, Wajaree Weera . Time-dependent fractional second-grade fluid flow through a channel influenced by unsteady motion of a bottom plate. AIMS Mathematics, 2023, 8(1): 423-446. doi: 10.3934/math.2023020 |
[2] | Yong-Ki Ma, Marimuthu Mohan Raja, Kottakkaran Sooppy Nisar, Anurag Shukla, Velusamy Vijayakumar . Results on controllability for Sobolev type fractional differential equations of order 1<r<2 with finite delay. AIMS Mathematics, 2022, 7(6): 10215-10233. doi: 10.3934/math.2022568 |
[3] | Yudhveer Singh, Devendra Kumar, Kanak Modi, Vinod Gill . A new approach to solve Cattaneo-Hristov diffusion model and fractional diffusion equations with Hilfer-Prabhakar derivative. AIMS Mathematics, 2020, 5(2): 843-855. doi: 10.3934/math.2020057 |
[4] | Rongbo Wang, Qiang Feng, Jinyi Ji . The discrete convolution for fractional cosine-sine series and its application in convolution equations. AIMS Mathematics, 2024, 9(2): 2641-2656. doi: 10.3934/math.2024130 |
[5] | Yue Liang . Study on the controllability of delayed evolution inclusions involving fractional derivatives. AIMS Mathematics, 2024, 9(7): 17984-17996. doi: 10.3934/math.2024876 |
[6] | Ahmed Salem, Kholoud N. Alharbi . Fractional infinite time-delay evolution equations with non-instantaneous impulsive. AIMS Mathematics, 2023, 8(6): 12943-12963. doi: 10.3934/math.2023652 |
[7] | Anumanthappa Ganesh, Swaminathan Deepa, Dumitru Baleanu, Shyam Sundar Santra, Osama Moaaz, Vediyappan Govindan, Rifaqat Ali . Hyers-Ulam-Mittag-Leffler stability of fractional differential equations with two caputo derivative using fractional fourier transform. AIMS Mathematics, 2022, 7(2): 1791-1810. doi: 10.3934/math.2022103 |
[8] | Kehong Zheng, Fuzhang Wang, Muhammad Kamran, Rewayat Khan, Ali Sikandar Khan, Sadique Rehman, Aamir Farooq . On rate type fluid flow induced by rectified sine pulses. AIMS Mathematics, 2022, 7(2): 1615-1627. doi: 10.3934/math.2022094 |
[9] | Li Chen, Dmitry V. Dolgy, Taekyun Kim, Dae San Kim . Probabilistic type 2 Bernoulli and Euler polynomials. AIMS Mathematics, 2024, 9(6): 14312-14324. doi: 10.3934/math.2024696 |
[10] | J. Kayalvizhi, A. G. Vijaya Kumar, Ndolane Sene, Ali Akgül, Mustafa Inc, Hanaa Abu-Zinadah, S. Abdel-Khalek . An exact solution of heat and mass transfer analysis on hydrodynamic magneto nanofluid over an infinite inclined plate using Caputo fractional derivative model. AIMS Mathematics, 2023, 8(2): 3542-3560. doi: 10.3934/math.2023180 |
We introduce the concepts of multiple attribute decision-making (MADM) using square root neutrosophic normal interval-valued sets (SRNSNIVS). The square root neutrosophic (SRNS), interval-valued NS, and neutrosophic normal interval-valued (NSNIV) sets are extensions of SRNSNIVS. A historical analysis of several aggregating operations is presented in this article. In this article, we discuss a novel idea for the square root NSNIV weighted averaging (SRNSNIVWA), NSNIV weighted geometric (SRNSNIVWG), generalized SRNSNIV weighted averaging (GSRNSNIVWA), and generalized SRNSNIV weighted geometric (GSRNSNIVWG). Examples are provided for the use of Euclidean distances and Hamming distances. Various algebraic operations will be applied to these sets in this communication. This results in more accurate models and is closed to an integer Δ. A medical robotics system is described as combining computer science and machine tool technology. There are five types of robotics such as Pharma robotics, Robotic-assisted biopsy, Antibacterial nano-materials, AI diagnostics, and AI epidemiology. A robotics system should be selected based on four criteria, including robot controller features, affordable off-line programming software, safety codes, and the manufacturer's experience and reputation. Using expert judgments and criteria, we will be able to decide which options are the most appropriate. Several of the proposed and current models are also compared in order to demonstrate the reliability and usefulness of the models under study. Additionally, the findings of the study are fascinating and intriguing.
The fractional Fourier transform (FrFT), a broader version of the traditional Fourier transform (FT), was introduced seven decades ago by Namias [13]. However, it has only recently gained traction in fields such as signal processing, optics, and quantum mechanics [3,11,26]. Notably, it can be employed with real-world data such as one-dimensional signals (e.g., electrocardiogram or ECG data) and two-dimensional signals like geographical information (e.g., satellite images) [10]. Many scientists defined FrFT differently and enriched its theory properties [14]. Specially, in [7], FrFT of real order has been introduced using the Mittag-Leffler function. This transform plays the same role for the fractional derivatives as FT plays for the ordinary derivatives and is reduced into the FT, particularly for α=1 in the usual sense. FrFT is parameterized by α and effectively rotates a signal by an angle α within the time-frequency plane. Offering versatility, the FrFT facilitates the transformation of functions into various intermediate domains lying between time and frequency.
Alongside the FT, cosine (CT) and sine (ST) transforms play crucial roles in signal processing by expanding functions over cosine and sine basis functions, despite some differences compared to the FT. The idea of fractionalization of the CT and ST was proposed in [9]. There, authors selected the real and imaginary components of the FrFT kernel to function as the kernels for the fractional Fourier cosine transform (FrFCT) and the fractional Fourier sine transform (FrFST), respectively. However, they acknowledged that their fractional transforms lack index additivity and do not qualify as genuine fractional versions of CT and ST. In [2], FrFCT and FrFST that are additive on the index and preserve the similar relationships with the fractional FT were introduced. Their fractional FT corresponds to a rotation of the Wigner distribution and the ambiguity function. Subsequently, in [16] the discrete version of the FrFCT and FrFST based on the eigen decomposition of discrete CT and discrete ST kernels are defined. Since then, FrFST and FrFSTs have significantly evolved, expanded to spaces of generalized functions [18], and became powerful tools in mathematical analysis, physics, signal processing, etc. [1,20,21].
Distribution theory is a power tool in applied mathematics and the extension of integral transforms to generalized function spaces is an important subject, especially recently, when new transforms have been discovered and their connection with the old ones has been established. When studying the theory of distributions, one quickly learns that distributions do not have point values, which naturally imposes the idea of incorporating the asymptotic analysis to the field of generalized functions. The concept of quasi-asymptotics, as introduced in [25], serves to extend classical asymptotic methods within the framework of Schwartz distributions, finding applications across various fields, particularly in mathematical physics. There are many results where the asymptotic behavior of distributions is analyzed true to the behavior of various integral transforms in a form of the Abel and Tauberian type theorems, see [8,19,22,23] and references therein.
The primary objective of this paper is to employ the FrFCT (FrFST) for a thorough investigation into the quasi-asymptotic properties of even (odd) distributions. Our study is structured around several theorems of the Abelian and Tauberian type, utilizing the asymptotic behavior of the FrFCT (FrFST) to investigate the quasi-asymptotic behavior of even (odd) distributions. The first section introduces the spaces of even (odd) tempered distributions. Subsequently, the FrFCT and FrFST are introduced through the FrFT and the Fourier cosine (sine) transform, establishing connections between all three transforms. The main result, presented in Section 2 with Theorem 2.3, asserts that if an even (odd) tempered distribution exhibits quasi-asymptotics at zero, then its FrFCT (FrFST) quasi-asymptotically oscillates at infinity. With an additional boundedness assumption, we demonstrate the converse. The second result, presented in Theorem 2.10, establishes the boundedness of the FrFCT (FrFST) of a distribution, assuming the distribution is quasi-asymptotically bounded.
We employ the standard notation S(R) to denote the space of rapidly decreasing smooth functions f satisfying the condition:
ρ(f)k=supt∈R,p≤k(1+|t|2)k/2|f(p)(t)|<∞,k∈N0=N∪0. | (1.1) |
The dual space of S(R) is the space of tempered distributions, denoted by S′(R). The subsets Se(R) and So(R) consist of all even and odd functions, respectively, within S(R).
An example of an element in Se(R) is given by e−x2, as e−x2∈S(R) and is even. Conversely, xex2 belongs to So(R) since, according to [12], if φ is an even differentiable function, then Cφ′ is odd for any constant C.
An even (odd) tempered distribution is defined as a continuous linear functional on the vector space Se(R) (So(R)). The spaces of such distributions are denoted as S′e(R) and S′o(R), respectively. It is noteworthy that S′e(R) and S′o(R) constitute broader classes than S′(R), and specifically, S′e(R)⊃S′(R) and S′o(R)⊃S′(R). Moreover,
S′e(R)∩S′o(R)=S′(R). |
The FT of a function f∈S(R) is defined:
ˆf(ξ)=F(f)(ξ)=1√2π∫Rf(x)e−ixξdx. | (1.2) |
The map f→ˆf is a continuous bijection from S(R) to S(R), and can be extended by duality to S′(R).
For an even function f, the Fourier cosine transform (FCT) is given by
ˆfc(ξ)=Fc(f)(ξ)=√2π∫∞0f(t)cos(tξ)dt, ξ∈R, |
and for an odd function f, the Fourier sine transform (FST) is given by
ˆfs(ξ)=Fs(f)(ξ)=√2π∫∞0f(t)sin(tξ)dt, ξ∈R. |
If ϕ∈Se(R)(So(R)), then Fc(ϕ)∈Se(R)(Fs(ϕ)∈So(R)). The mapping Fc(Fs) is a continuous isomorphism from Se(R)(So(R)) to Se(R)(So(R)) [5].
The development of the FrFCT and FrFST of distributions follows the conventional approach employed in FTs. Consequently, it is necessary to highlight certain fundamental properties of the FrFCT and FrFST for functions (refer to [12,Chapter 3]).
The FrFCT (FrFST) of an even (odd) tempered distribution f can be defined by
⟨Fcf,φ⟩=⟨f,Fcφ⟩,(⟨Fsf,φ⟩=⟨f,Fsφ⟩) |
for arbitrary φ∈Se(R)(So(R)). Thus, Fc(Fs) is a continuous mapping from S′e(R)(S′o(R)) to S′e(R)(S′o(R)).
Let f∈L1(R). Recall from [13] that the FrFT of order α is defined by
Fα(f(x))(ξ)={∫Rf(x)Kα(x,ξ)dx,ξ∈R,α≠kπ,k∈N, f(ξ),α=2kπ, f(−ξ),α=(2k+1)π, | (1.3) |
where
Kα(x,ξ)=Cαei(x2+ξ22a−xξb) | (1.4) |
is the kernel of FrFT, a=cotα, b=cscα, and Cα=√1−ia2π. The kernel Kα(x,ξ) is a continuously differentiable function in both variables, x and ξ. The function Fαf exhibits 2π periodicity with respect to α, and, thus, we will consistently consider α within the interval [0,2π). Notice that when n∈Z, Fnπ/2f=Fnf, where Fn is the n-th power of the FT (1.2), i.e., Fα is the sth power of the FT for s=2α/π, for α within the interval [0,2π), [13]. So, the FT is of order 1, while the identity operator is of order 0. Negative orders correspond to inverse transforms. For instance, applying the FrFT of order 1/2 twice yields the FT.
In the research conducted by Pathak [15,Thrm. 3.1], it has been established that the FrFT constitutes a continuous mapping from the Schwartz space S(R) to itself. Furthermore, this mapping can be extended to the space of tempered distributions. Specifically, according to the definition provided in [15,Def. 3.1], the generalized FrFT, denoted as Fαf for f∈S′(R), is expressed as follows:
⟨Fαf,φ⟩=⟨f,Fαφ⟩,φ∈S(R). | (1.5) |
For f∈S(R), the inverse FrFT F−α is given with [3]
f(x)=∫RFαf(ξ)K−α(x,ξ)dξ,x∈R. | (1.6) |
From the linearity of the FrFT and the reversion property Fα(f(−x))(ξ)=Fα(f(x))(−ξ), we have
Fα(f(x)±f(−x))(ξ)=Fα(f(x))(ξ)±Fα(f(x))(−ξ), |
and we conclude that the FrFT of an even function is even, while the FrFT of an odd function is odd.
In [6], the FrFCT is denoted as Fcα(f(x))(ξ)=∫∞−∞f(x)Kcα(x,ξ)dx, and the FrFST is represented as Fsα(f(x))(ξ)=∫∞−∞f(x)Kcα(x,ξ)dx. It is important to observe that if the function f is odd, then Fcα(f(x))(ξ)=0. Similarly, if f is an even function, then the corresponding FrFCT simplifies to the one-sided FrFCT, given by:
Fcα(f(x))(ξ)=∫∞0f(x)Kcα(x,ξ)dx. |
A similar consideration can also be repeated for the FrFST.
Here, we follow the notion from [3,18], and the definitions from there. This means that if we restrict ourself to one-sided functions (f(x)=0 for x<0), we can define the FrFCT of a function f∈L1(R) as
Fcα(f(x))(ξ)=Fα(f(x)+f(−x))(ξ)=∫∞0f(x)Kcα(x,ξ)dx, | (1.7) |
where
Kcα(x,ξ)={Cαeix2+ξ22acos(xξb),α≠kπ,k∈Z=N0∪(−N), √2πcos(xξ),α=π/2, δ(x−ξ),α=kπ, | (1.8) |
and a=cotα, b=cscα, and Cα=√2(1−ia)π.
The inverse FrFCT is given by
f(x)=∫∞0Fcαf(ξ)Kc−α(x,ξ)dξ,x∈R. | (1.9) |
Similarly, the FrFST of a function f∈L1(R) is defined as
Fsα(f(x))(ξ)=Fα(f(x)−f(−x))(ξ)=∫∞0f(x)Ksα(x,ξ)dx, | (1.10) |
where
Ksα(x,ξ)={Cαei(α−π/2)x2+ξ22asin(xξb),α≠kπ,k∈Z=N0∪(−N), √2πsin(xξ),α=π/2, δ(x−ξ),α=kπ, | (1.11) |
with the same constants as above. The corresponding inverse FrFST is given by
f(x)=∫∞0Fsαf(ξ)Ks−α(x,ξ)dξ,x∈R. | (1.12) |
The kernel Kcα(x,ξ)(Ksα(x,ξ)) is a continuously differentiable function in both variables, x and ξ. For α=(2k−1)π2, the FrFCT and FrFST are reduced to the FCT and FST, respectively.
To establish the connection between the FrFT of a causal, one-sided function f(x), where f(x)=0 for x<0, and the FrFCT and FrFST of this function in an alternative manner, we can formulate the following expression.
2Fαf(±ξ)=Fcαf(ξ)±eiαFsαf(ξ). |
The expression Fcαf(ξ) can be associated with the even component of Fαf(ξ), while Fsαf(ξ) is linked to its odd component. In a broader context, it can be concluded that for determining the FrFCT of a causal, one-sided function f(x), one can equivalently determine the FrFT of the symmetrically extended two-sided function f(x)+f(−x). Similarly, to ascertain the FrFST of such a function, one can alternatively determine the FrFT of the anti-symmetrically extended two-sided function ejα(f(x)−f(−x)). Both cases involve restricting the analysis to ξ≥0. Moreover, Fcαf(ξ) and Fαf(ξ) are periodic with period π [2].
In [6], authors studied the FrFCT (resp., FrFST) for the space Se(R) (resp., So(R)). They demonstrated a Parseval-type relationship, an inversion formula, and the continuity properties of the FrFCT and FrFST. They, and also Prasad and Sihgh in [18]HY__HY, Thrm 3.1 and Thrm 3.2], have shown that the FrFCT is the continuous linear mapping of Se(R) onto itself, and that the FrFST is the continuous linear mapping of So(R) onto itself. This allows them to define the generalized FrFCT (FrFST) of distribution f from S′e(R) (S′o(R)) by
⟨Fcαf,φ⟩=⟨f,Fcαφ⟩,(⟨Fsαf,φ⟩=⟨f,Fsαφ⟩) | (1.13) |
for all φ∈Se(R)(So(R))). Moreover, the FrFCT (FrFST) of a distribution f∈S′e(R)(S′o(R)) is a continuous linear map of S′e(R)(S′o(R)) onto itself.
We need the relation between the FrFCT and the FCT:
Fcαf(ξ)=∫∞0f(x)Kcα(x,ξ)dx=Cαeiξ2a/2∫∞0eix2a/2cos(xξb)f(x)dx | (1.14) |
=√1−iaeiξ2a/2Fc(eix2a/2f(x))(ξb). |
Similarly, it holds for the FrFST and the FST.
We will analyze the properties of a distribution by comparing it to regularly varying functions, specifically focusing on the quasi-asymptotic behavior outlined in [17,22,23]. A real-valued function, measurable, defined, and positive within an interval (0,D] (or [D,∞)), where D>0, is termed "a slowly varying function" at the origin (or at infinity) if it satisfies:
limε→0+L(dε)L(ε)=1( resp.limh→∞L(dh)L(h)=1)for each d>0. | (2.1) |
If L is a slowly varying function at zero, then ˜L(⋅)=L(1/⋅) is also a slowly varying function in a neighborhood of ∞, and vice versa.
Considering L as a function exhibiting slow variation at the origin, it is relevant to recall the definition from [4] that a distribution f∈S′(R) manifests quasi-asymptotic behavior, or quasi-asymptotics, of degree m∈R at the point x0∈R concerning L. This characterization is established if there exists u∈S′(R) such that, for every φ∈S(R), the following condition is satisfied:
limε→0+⟨f(x0+εx)εmL(ε), φ(x)⟩=⟨u(x),φ(x)⟩. | (2.2) |
The quasi-asymptotic behavior is conveniently denoted as:
f(x0+εx)∼εmL(ε)u(x)asε→0+inS′(R), |
and should be consistently interpreted within the framework of the weak topology S′(R), i.e., in the sense of (2.2).
The form of u is not arbitrary; it must exhibit homogeneity with a degree of homogeneity m, i.e., u(dx)=dmu(x), for all d>0 [17,25]. Additionally, if (2.2) holds for each φ∈D(R), it must also hold for each φ∈S(R) [22,Thrm. 6.1]. Consequently, the quasi-asymptotic behavior at finite points is considered a local property. The quasi-asymptotics of distributions at infinity concerning a slowly varying function L at infinity is similarly defined. The notation f(hx)∼hmL(h)u(x) as h→∞ in S′(R) is employed in this case.
Furthermore, we may explore quasi-asymptotics within alternative distribution spaces. The relationship f(x0+εx)∼εmL(ε)u(x) as ε→0+ in B′(R) implies that (2.2) holds for each φ∈B(R). Similarly, the quasi-asymptotics at infinity in B′(R) satisfy this condition, where B(R) denotes any space of test functions on R, and B′(R) represents their dual.
The next lemma, as presented in [4,Lemma 3.1], establishes a connection between quasi-asymptotic behavior at the point and the corresponding oscillation at that same point.
Lemma 2.1. If
⟨f(εx)/(εmL(ε)),φ(x)⟩,converges as ε→0+,∀φ∈S, | (2.3) |
then,
⟨eiC(εx)2/2f(εx)/(εmL(ε)),φ(x)⟩, converges as ε→0+,∀φ∈S, | (2.4) |
where C∈R and ε∈(0,1). On the contrary, if condition (2.4) is satisfied and there exists ε0∈(0,ε) such that the family
{f(εx)/(εmL(ε)):ε∈(0,ε0)} is bounded in S′(R), | (2.5) |
then (2.4)⇒(2.3).
Moreover, (2.3) is equivalent to
⟨e−ih2ξ22C∗ˆf(hξ)/(h−m−2˜L(h)),γ(ξ)⟩,converges as h→∞,∀γ∈S, | (2.6) |
where h>h0>0.
Theorem 2.2. Let f∈S′e(R)(S′o(R)). The statements below are equivalent:
f(x/ε)∼εmL(ε)u(x)asε→∞inS′e(R+)(S′o(R)), | (2.7) |
and
ˆfc(hξ)∼h−m−1˜L(h)ˆuc(ξ)ash→∞inS′e(R+),(ˆfs(hξ)∼h−m−1˜L(h)ˆus(ξ)ash→∞inS′o(R+)), | (2.8) |
where ˜L(h) is slowly varying at ∞, (˜L(⋅)=L(1⋅)).
Proof. Let φ∈Se(R). The relation obtained by using the Parseval identity
⟨ˆfc(hξ)h−m−1˜L(h),φ(ξ)⟩=⟨ˆfc(ξ)h−m˜L(h),φ(ξh)⟩=⟨f(x)h−m˜L(h),ˆφc(xh)⟩=⟨f(xh)h−m˜L(h),ˆφc(x)⟩, |
immediately implies the assertion.
The following theorem asserts that if f∈S′e(R)(f∈S′o(R)) has quasi-asymptotics at zero, then Fcαf(Fsαf) quasi-asymptotically oscillates as it approaches infinity. The reverse is true, with the additional assumption (2.5).
Theorem 2.3. Let f∈S′e(R)(S′o(R)), L be of the form (2.1) at 0+, u∈S′e(R)(S′o(R)) be a homogeneous function, and m∈R. If
f(εx)∼εmL(ε)u(x) as ε→0+ in S′e(R)(S′o(R)), | (2.9) |
then
e−ia(hξ)2/2Fcαf(hξ)∼√1−iabm+1h−m−1˜L(h)ˆuc(ξ) as h→∞,(e−ia(hξ)2/2Fsαf(hξ)∼√1−iabm+1h−m−1˜L(h)ˆus(ξ) as h→∞), | (2.10) |
in S′e(R)(S′o(R)). Conversely, if (2.5) holds, then (2.10) ⇒ (2.9).
Proof. The notation with 1/ε will be maintained in the proof instead of using h. We will present the proof for the FrFCT, since the proof for the FrFST is analogous.
Let φ∈Se(R). Using (1.13) and (1.14), we obtain:
⟨e−ia(ξε)2/2Fcαf(ξε),φ(ξ)⟩=ε⟨e−iaξ2/2(Fcαf)(ξ),φ(εξ)⟩ |
=εCα√2πb⟨Fc(eiax2/2f(x))(ξ),φ(εξb)⟩=√1−ia⟨eiax2/2f(x),ˆφc(xbε)⟩ |
=√1−iaεb⟨eia(εtb)2/2f(εtb),ˆφc(t)⟩. |
The essential relation is the next one (see [4]):
1εm+1L(ε)⟨e−ia(ξε)2/2Fcαf(ξε),φ(ξ)⟩=L(εb)L(ε)√1−iabm+1(εb)mL(εb)⟨eia(εtb)2/2f(εtb),ˆφc(t)⟩. | (2.11) |
From (2.1), we obtain:
limε→0+⟨e−ia(ξε)2/2Fcαf(ξε)εm+1L(ε),φ(ξ)⟩= |
=√1−iabm+1limε→0+1(εb)mL(εb)⟨eia(εtb)2/2f(εtb),ˆφc(t)⟩ |
=√1−iabm+1(limε→0+1(εb)mL(εb)⟨f(εtb),ˆφc(t)⟩+limε→0+1(εb)mL(εb)⟨f(εtb),(eia(εtb)2/2−1)ˆφc(t)⟩). |
The second limit is zero because
limε→0+(eia(εtb)2/2−1)ˆφc(t)=0, |
and {f(εtb)(εb)mL(εb):ε∈(0,ε0)} is bounded in S′e(R).
Now, by (2.9) and the Banach Steinhaus theorem, we have
limε→0+⟨e−ia(ξε)2/2Fcαf(ξε)εm+1L(ε),φ(ξ)⟩=√1−iabm+1limε→0+⟨f(εt)εmL(ε),ˆφc(t)⟩ |
=√1−iabm+1⟨u(x),ˆφc(x)⟩=√1−iabm+1⟨ˆuc(ξ),φ(ξ)⟩. |
This proves (2.9)⇒(2.10).
For the opposite implication, we assume that (2.10) holds and we use (2.11).
limε→0+⟨1εm+1L(ε)f(εx),φ(x)⟩ |
=limε→0+⟨1εm+1L(ε)e−ia(xε)2/2f(εx),φ(x)⟩−limε→0+⟨1εm+1L(ε)(e−ia(xε)2/2−1)f(εx),φ(x)⟩. |
Now, by the boundedness condition (2.5), we have that
⟨1εm+1L(ε)(e−ia(xε)2/2−1)f(εx),φ(x)⟩→0,asε→0+,φ∈Se. |
For the last part, we note that for any p>0:
Fc(eipx22)(ξ)=eiπ4√pe−iξ22p,ξ∈R+. |
Applying the FT to Eq (2.3), we find that there exists a suitable constant ˜C∈C such that:
⟨Fc(eiC(εx)2)(ξ)∗Fc(f(εx))(ξ)/(εmL(ε)),(ˆφc)(ξ)⟩ |
=˜C1εm+2L(ε)⟨e−iξ2/(2ε2C)∗Fc(f)(ξ/ε),(ˆφc)(ξ)⟩. |
If we put h=1/ε and γ=ˆφc, we obtain (2.6). The implication (2.6)⇒(2.4) follows in the same way. The result is now obvious by (2.11).
Remark 2.4. Now, we take tanβ=ε2tanα, and ε>0, with Cα,β defined as:
Cα,β(ξ)=√cosβcosαeiα2eiβ2exp(iξ22cotα(1−cos2βcos2α)). |
We have the following scalar property for the FrFCT (FrFST):
Fcα(f(εx))(ξ)=Cα,β(ξ)Fcβ(f(x))(sξε), | (2.12) |
and
Fsα(f(εx))(ξ)=Cα,β(ξ)e−iβFsβ(f(x))(sξε), | (2.13) |
where s=sinβsinα, [2], then, we can obtain the same result with very few modifications.
Example 2.5. It is known that every bounded function in R defines a tempered distribution, so the function f(x)=H(x)(2+sin1x)∈S′(R), where H(x) is Heviside's function. It is known that it does not have regular asymptotics at 0, but f(εx)∼2asε→0+ (m=0, L(ϵ)=1 and u(x)=2). Since ˆus(ξ)=2ξ√2π, by Theorem 2.3 we have
e−ia(hξ)2/2Fsαf(hξ)∼1hξ2√2(1−ia)√πb as h→∞ |
with respect to ˜L(ξ)≡1.
Example 2.6. For f(x)=sinx∈S′0(R), it is known that f(εx)∼ε−1δ(x)asε→0+, for m=1,L(ε)≡1,u(x)=δ(x), then by ˆus(ξ)=ˆδs(ξ)=0 and Theorem 2.3, we have
e−ia(hξ)2/2Fsαf(hξ)∼0 as h→∞ |
with respect to ˜L(ξ)≡1.
Example 2.7. Let f(x)=2πδ(x−1), so it follows that f(εx)∼ε2πδ(x−1) as ε→0+, then by ˆus(ξ)=Fs(2πδ(ξ−1))=√2πeiξ and Theorem 2.3, we have
e−ia(hξ)2/2Fsαf(hξ)∼√2π√(1−ia)b2h−2eiξ as h→∞ |
with respect to ˜L(ξ)≡1.
We require an additional concept from quasi-asymptotic analysis, specifically the idea of quasi-asymptotic boundedness as in [24]. Recall from [24] that the distribution f∈S′(R) is quasi-asymptotically bounded at x0∈R of degree m∈R, in relation to the slowly varying function L at the origin if
f(x0+εx)=O(εmL(ε))asε→0+inS′(R). |
The above relation should be interpreted in the sense of the weak topology of S′(R), namely,
⟨f(x0+εx),φ(x)⟩=O(εmL(ε))asε→ 0+, | (2.14) |
for every φ∈S(R). This means there exists a constant C>0 such that
|⟨f(x0+εx),φ(x)⟩|≤C|εmL(ε)|, |
for x sufficiently close to x0.
The notion of quasi-asymptotic boundedness, with respect to a degree m∈R in correlation with the slowly varying function at infinity L, is explicated in an analogous manner. Concurrently, our examination extends to the contemplation of quasi-asymptotic boundedness within a designated mathematical space: S′e(R), φ∈Se(R) (S′o(R), φ∈So(R)).
Please note that L exhibits slow variation at the origin if, and only if, there exist measurable functions u and w defined on an interval (0,A], where u is bounded and possesses a finite limit at 0. Additionally, ω is continuous on [0,A] with ω(0)=0, such that the following representation holds for L(x) within the interval (0,A]:
L(x)=exp(u(x)+∫Axω(ξ)ξdξ),x∈(0,A]. |
In the context of our exploration for suitable modifications of L concerning quasi-asymptotics, it is reasonable to assume that L is defined across the entire interval (0,∞) and maintains nonnegativity or even positivity throughout. The analysis entails extending the functions u and ω to (0,∞) through a chosen method.
For example, when addressing functions with slow variation at the origin, the condition ξ−1ω(ξ)∈L1([1,∞)) implies the existence of positive constants ˜C and C such that the following inequalities hold for x>1:
˜C<L(x)<C. |
Remark 2.8. It is readily apparent that when f belongs to the space S′c(R) (f belonging to S′o(R)) and exhibits quasi-asymptotic boundedness at zero concerning εmL(ε), then eiC(x)2f(x) also demonstrates quasi-asymptotic boundedness at zero, considering the same slowly varying function. Here, x is a real number, and the condition |eiC(x)2|=1 holds.
Remark 2.9. It is clear that for φ∈Se(R), it follows that xpφ∈Se(R),p∈N, and
ˆφ(p)c(t)={(−1)p/2Fc(xpφ(x))(t),pis even; (−1)(p−1)/2Fc(xpφ(x))(t),pis odd. |
Similar remark holds for ˆφs(t) in So(R).
We have the following result.
Theorem 2.10. Let f∈S′c(R) (f∈S′o(R)) be a quasi-asymptotically bounded at zero with respect to a slowly varying function at infinity L, that is,
|⟨f(εx),φ(x)⟩|≤CφεmL(ε),ε→0, |
where φ∈Sc(R) (φ∈So(R)), and Cφ>0 depends of φ, then the FrFCT (FrFST) for f is a bounded function at 0, i.e., there exists a constant C>0 such that
|⟨e−ia(ξε)2/2Fcαf(ξε),φ(ξ)⟩|εm+1L(ε)≤C(|⟨e−ia(ξε)2/2Fsαf(ξε),φ(ξ)⟩|εm+1L(ε)≤C). |
Proof. Let f be a quasi-asymptotically bounded at zero with respect to L. From (2.11) and Remarks 2.8 and 2.9, we have that there exist k∈N0 and M>0 such that
1εm+1L(ε)|⟨e−ia(ξε)2/2Fcαf(ξε),φ(ξ)⟩|=|√1−iabL(ε)εm⟨e−ia(εtb)2/2f(εtb),ˆφc(t)⟩| |
≤M⋅Cα‖ˆφc(t)‖k<≤M⋅Cαsupx∈R,p≤k(1+|t|2)k/2|ˆφ(p)c(t)|<∞. |
In conclusion, in this research we extended recent inquiries into the analysis of integral transforms within specific distributional spaces. Our approach integrates the concept of quasi-asymptotic behavior, as introduced by Zavialov in [27], and we quantify the scaling asymptotic properties of distributions by asymptotic comparisons with Karamata regularly varying functions. In this paper, we characterized the quasi-asymptotic behavior of even (resp., odd) distributions within the context of a Tauberian theorem applied to the FrFCT (resp., FrFST), and by Thrm. 2.3, we established that distributions exhibiting quasi-asymptotic behavior at zero manifest quasi-asymptotic oscillations at infinity through their corresponding FrFCT or FrFST. Additionally, our second result presented by Thrm. 2.10 sheds light on the boundedness of these transforms concerning quasi-asymptotically bounded distributions.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
The authors S. Haque and N. Mlaiki would like to thank Prince Sultan University for paying the publication fees for this work through TAS LAB.
The authors declare no conflict of interest.
[1] |
L. A. Zadeh, Fuzzy sets, Inf. Control, 8 (1965), 338–353. https://doi.org/10.1016/S0019-9958(65)90241-X doi: 10.1016/S0019-9958(65)90241-X
![]() |
[2] |
K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Set. Syst., 20 (1986), 87–96. https://doi.org/10.1016/S0165-0114(86)80034-3 doi: 10.1016/S0165-0114(86)80034-3
![]() |
[3] |
R. R. Yager, Pythagorean membership grades in multi criteria decision-making, IEEE T. Fuzzy Syst., 22 (2014), 958–965. https://doi.org/10.1109/TFUZZ.2013.2278989 doi: 10.1109/TFUZZ.2013.2278989
![]() |
[4] | F. Smarandache, A unifying field in logics, Neutrosophy neutrosophic probability, set and logic, American Research Press, Rehoboth, 1999. |
[5] | H. A. Yazbek, F. Surriya, S. U. Khan, N. Jan, D. Marinkovic, A novel approach to model the economic characteristics of an organization by interval-valued complex Pythagorean fuzzy information, J. Comput. Cogn. Eng., 2 (2023), 75–87. |
[6] |
M. Akram, W. A. Dudek, F. Ilyas, Group decision making based on Pythagorean fuzzy TOPSIS method, Int. J. Intell. Syst., 34 (2019), 1455–1475. https://doi.org/10.1002/int.22103 doi: 10.1002/int.22103
![]() |
[7] |
M. Akram, W. A. Dudek, J. M. Dar, Pythagorean Dombi fuzzy aggregation operators with application in multi-criteria decision-making, Int. J. Intell. Syst., 34 (2019), 3000–3019. https://doi.org/10.1002/int.22183 doi: 10.1002/int.22183
![]() |
[8] |
M. Akram, X. Peng, A. N. Al-Kenani, A. Sattar, Prioritized weighted aggregation operators under complex Pythagorean fuzzy information, J. Intell. Fuzzy Syst., 39 (2020), 4763–4783. https://doi.org/10.3233/JIFS-200684 doi: 10.3233/JIFS-200684
![]() |
[9] |
K. Rahman, S. Abdullah, M. Shakeel, M. S. A. Khan, M. Ullah, Interval valued Pythagorean fuzzy geometric aggregation operators and their application to group decision-making problem, Cogent Math., 4 (2017), 1–19. https://doi.org/10.1080/23311835.2017.1338638 doi: 10.1080/23311835.2017.1338638
![]() |
[10] |
X. Peng, Y. Yang, Fundamental properties of interval valued Pythagorean fuzzy aggregation operators, Int. J. Intell. Syst., 2015, 1–44. https://doi.org/10.1002/int.21790 doi: 10.1002/int.21790
![]() |
[11] |
K. Rahman, A. Ali, S. Abdullah, F. Amin, Approaches to multi attribute group decision-making based on induced interval valued Pythagorean fuzzy Einstein aggregation operator, New Math. Nat. Comput., 14 (2018), 343–361. https://doi.org/10.1142/S1793005718500217 doi: 10.1142/S1793005718500217
![]() |
[12] |
Z. Yang, J. Chang, Interval-valued Pythagorean normal fuzzy information aggregation operators for multiple attribute decision making approach, IEEE Access, 8 (2020), 51295–51314. https://doi.org/10.1109/ACCESS.2020.2978976 doi: 10.1109/ACCESS.2020.2978976
![]() |
[13] |
T. M. Al-shami, H. Z. Ibrahim, A. A. Azzam, A. I. EL-Maghrabi, square root-fuzzy sets and their weighted aggregated operators in application to decision-making, J. Func. Space., 2022, 1–14. https://doi.org/10.1155/2022/3653225 doi: 10.1155/2022/3653225
![]() |
[14] | R. Jansi, K. Mohana, F. Smarandache, Correlation measure for Pythagorean neutrosophic sets with T and F as dependent neutrosophic components, Neutrosophic Sets Sy., 30 (2019), 202–212. |
[15] | G. Shahzadi, M. Akram, A. B. Saeid, An application of single-valued neutrosophic sets in medical diagnosis, Neutrosophic Sets Sy., 18 (2017), 80–88. |
[16] |
P. A. Ejegwa, Distance and similarity measures for Pythagorean fuzzy sets, Granular Comput., (2018), 1–17. doi: 10.1007/s40314-022-01791-9
![]() |
[17] |
M. Palanikumar, K. Arulmozhi, C. Jana, Multiple attribute decision-making approach for Pythagorean neutrosophic normal interval-valued aggregation operators, Comp. Appl. Math., 41 (2022), 1–27. https://doi.org/10.1007/s40314-022-01791-9 doi: 10.1007/s40314-022-01791-9
![]() |
[18] | R. N. Xu, C. L. Li, Regression prediction for fuzzy time series, Appl. Math. J. Chinese Univ., 16 (2001), 451–461. |
[19] |
M. S Yang, C. H. Ko, On a class of fuzzy c-numbers clustering procedures for fuzzy data, Fuzzy Set. Syst., 84 (1996), 49–60. https://doi.org/10.1016/0165-0114(95)00308-8 doi: 10.1016/0165-0114(95)00308-8
![]() |
[20] |
X. D. Peng, J. Dai, Approaches to single-valued neutrosophic MADM based on MABAC, TOPSIS and new similarity measure with score function, Neural Comput. Appl., 29 (2018), 939–954. https://doi.org/10.1007/s00521-016-2607-y doi: 10.1007/s00521-016-2607-y
![]() |
[21] |
X. Zhang, Z. Xu, Extension of TOPSIS to multiple criteria decision-making with Pythagorean fuzzy sets, Int. J. Intell. Syst., 29 (2014), 1061–1078. https://doi.org/10.1002/int.21676 doi: 10.1002/int.21676
![]() |
[22] | C. L. Hwang, K. Yoon, Multiple attributes decision-making methods and applications, Springer, Berlin Heidelberg, 1981. https://doi.org/10.1007/978-3-642-48318-9_3 |
[23] |
C. Jana, M. Pal, Application of bipolar intuitionistic fuzzy soft sets in decision-making problem, Int. J. Fuzzy Syst. Appl., 7 (2018), 32–55. https://doi.org/10.4018/IJFSA.2018070103 doi: 10.4018/IJFSA.2018070103
![]() |
[24] | C. Jana, Multiple attribute group decision-making method based on extended bipolar fuzzy MABAC approach, Comp. Appl. Math., 40 (2021), 1–17. |
[25] |
C. Jana, M. Pal, A robust single valued neutrosophic soft aggregation operators in multi criteria decision-making, Symmetry, 11 (2019), 1–19. https://doi.org/10.3390/sym11010110 doi: 10.3390/sym11010110
![]() |
[26] |
C. Jana, T. Senapati, M. Pal, Pythagorean fuzzy Dombi aggregation operators and its applications in multiple attribute decision-making, Int. J. Intell. Syst., 34 (2019), 2019–2038. https://doi.org/10.1002/int.22125 doi: 10.1002/int.22125
![]() |
[27] | K. Ullah, T. Mahmood, Z. Ali, N. Jan, On some distance measures of complex Pythagorean fuzzy sets and their applications in pattern recognition, Comp. Intell. Syst., (2019), 1–13. |
[28] | C. Jana, M. Pal, F. Karaaslan, J. Q. Wang, Trapezoidal neutrosophic aggregation operators and their application to the multi-attribute decision-making process, Sci. Iran., 27 (2020), 1655–1673. |
[29] | C. Jana, M. Pal, Multi criteria decision-making process based on some single valued neutrosophic dombi power aggregation operators, Soft Comput., 25 (2021), 5055–5072. |
[30] |
C. Jana, G. Muhiuddin, M. Pal, Multi criteria decision-making approach based on SVTrN Dombi aggregation functions, Artif. Intell. Rev., 54 (2021), 3685–3723. https://doi.org/10.1007/s10462-020-09936-0 doi: 10.1007/s10462-020-09936-0
![]() |
[31] |
V. Torra, Hesitant fuzzy sets, Int. J. Intell. Syst., 25 (2010), 529–539. https://doi.org/10.1002/int.20418 doi: 10.1002/int.20418
![]() |
[32] | R. M. Rodrguez, L. Martnez, F. Herrera, Hesitant fuzzy linguistic term sets for decision making, IEEE T. Fuzzy Syst., 20 (2012). |
[33] |
Y. Lu, Y. Xu, E. H. Viedma, Consensus progress for large-scale group decision making in social networks with incomplete probabilistic hesitant fuzzy information, Appl. Soft Comput., 126 (2022), 109249. https://doi.org/10.1016/j.asoc.2022.109249 doi: 10.1016/j.asoc.2022.109249
![]() |
[34] |
Y. Xu, M. Li, F. Chiclana, E. H. Viedma, Multiplicative consistency ascertaining, inconsistency repairing, and weights derivation of hesitant multiplicative preference relations, IEEE T. Syst. Man Cy.-S., 52 (2022), 6806–6821. https://doi.org/10.1109/TSMC.2021.3099862 doi: 10.1109/TSMC.2021.3099862
![]() |
[35] | M. Yazdi, T. Saner, M. Darvishmotevali, Application of an artificial intelligence decision-making method for the selection of maintenance strategy, 10th International Conference on Theory and Application of Soft Computing, 2019,246–253. https://doi.org/10.1007/978-3-030-35249-3_31 |
[36] |
I. Rojek, M. J. Kaczmarek, M. Piechowski, D. Mikolajewski, An artificial intelligence approach for improving maintenance to supervise machine failures and support their repair, Appl. Sci., 13 (2023), 1–16. https://doi.org/10.3390/app13084971 doi: 10.3390/app13084971
![]() |
[37] |
G. Huang, L. Xiao, W. Pedrycz, D. Pamucar, G. Zhang, L. Martinez, Design alternative assessment and selection: A novel Z-cloud rough number-based BWM-MABAC model, Inform. Sci., 603 (2022), 149–189. https://doi.org/10.1016/j.ins.2022.04.040 doi: 10.1016/j.ins.2022.04.040
![]() |
[38] |
L. Xiao, G. Huang, W. Pedrycz, D. Pamucar, L. Martinez, G. Zhang, A q-rung orthopair fuzzy decision-making model with new score function and best-worst method for manufacturer selection, Inform. Sci., 608 (2022), 153–177. https://doi.org/10.1016/j.ins.2022.06.061 doi: 10.1016/j.ins.2022.06.061
![]() |
[39] |
G. Huang, L. Xiao, W. Pedrycz, G. Zhang, L. Martinez, Failure mode and effect analysis using T-spherical fuzzy maximizing deviation and combined comparison solution methods, IEEE T. Reliab., 2022, 1–22. https://doi.org/10.1109/TR.2022.3194057 doi: 10.1109/TR.2022.3194057
![]() |
[40] | T. Mahmood, Z. Ali, Prioritized muirhead mean aggregation operators under the complex single-valued neutrosophic settings and their application in multi-attribute decision-making, J. Comput. Cogn. Eng., 2 (2022), 56–73. |
1. | Yannan Sun, Wenchao Qian, Fast algorithms for nonuniform Chirp-Fourier transform, 2024, 9, 2473-6988, 18968, 10.3934/math.2024923 |