In this paper, the finite element method is applied to solve the unsteady elastic equations, C-Bézier basis functions are used to construct the shape function spaces, the semi-discrete scheme of the unsteady elastic equations is obtained by Galerkin finite element method and then the fully discretized Galerkin method is obtained by further discretizing the time variable with θ-scheme finite difference. Furthermore, for several numerical examples, the accuracy of approximate solutions are improved by 1–3 order-of magnitudes compared with the Lagrange basis function in L∞ norm, L2 norm and H1 semi-norm, and the numerical examples show that the method proposed possesses a faster convergence rate. It is fully demonstrated that the C-Bézier basis functions have a better approximation effect in simulating unsteady elastic equations.
Citation: Lanyin Sun, Kunkun Pang. Numerical solution of unsteady elastic equations with C-Bézier basis functions[J]. AIMS Mathematics, 2024, 9(1): 702-722. doi: 10.3934/math.2024036
[1] | Jamalud Din, Muhammad Shabir, Nasser Aedh Alreshidi, Elsayed Tag-eldin . Optimistic multigranulation roughness of a fuzzy set based on soft binary relations over dual universes and its application. AIMS Mathematics, 2023, 8(5): 10303-10328. doi: 10.3934/math.2023522 |
[2] | Rukchart Prasertpong . Roughness of soft sets and fuzzy sets in semigroups based on set-valued picture hesitant fuzzy relations. AIMS Mathematics, 2022, 7(2): 2891-2928. doi: 10.3934/math.2022160 |
[3] | R. Mareay, Radwan Abu-Gdairi, M. Badr . Soft rough fuzzy sets based on covering. AIMS Mathematics, 2024, 9(5): 11180-11193. doi: 10.3934/math.2024548 |
[4] | Mostafa K. El-Bably, Radwan Abu-Gdairi, Mostafa A. El-Gayar . Medical diagnosis for the problem of Chikungunya disease using soft rough sets. AIMS Mathematics, 2023, 8(4): 9082-9105. doi: 10.3934/math.2023455 |
[5] | Feng Feng, Zhe Wan, José Carlos R. Alcantud, Harish Garg . Three-way decision based on canonical soft sets of hesitant fuzzy sets. AIMS Mathematics, 2022, 7(2): 2061-2083. doi: 10.3934/math.2022118 |
[6] | José Sanabria, Katherine Rojo, Fernando Abad . A new approach of soft rough sets and a medical application for the diagnosis of Coronavirus disease. AIMS Mathematics, 2023, 8(2): 2686-2707. doi: 10.3934/math.2023141 |
[7] | Dhuha Saleh Aldhuhayyan, Kholood Mohammad Alsager . Multi-criteria evaluation of tree species for afforestation in arid regions using a hybrid cubic bipolar fuzzy soft rough set framework. AIMS Mathematics, 2025, 10(5): 11813-11841. doi: 10.3934/math.2025534 |
[8] | Rehab Alharbi, S. E. Abbas, E. El-Sanowsy, H. M. Khiamy, K. A. Aldwoah, Ismail Ibedou . New soft rough approximations via ideals and its applications. AIMS Mathematics, 2024, 9(4): 9884-9910. doi: 10.3934/math.2024484 |
[9] | Jamalud Din, Muhammad Shabir, Samir Brahim Belhaouari . A novel pessimistic multigranulation roughness by soft relations over dual universe. AIMS Mathematics, 2023, 8(4): 7881-7898. doi: 10.3934/math.2023397 |
[10] | T. M. Athira, Sunil Jacob John, Harish Garg . A novel entropy measure of Pythagorean fuzzy soft sets. AIMS Mathematics, 2020, 5(2): 1050-1061. doi: 10.3934/math.2020073 |
In this paper, the finite element method is applied to solve the unsteady elastic equations, C-Bézier basis functions are used to construct the shape function spaces, the semi-discrete scheme of the unsteady elastic equations is obtained by Galerkin finite element method and then the fully discretized Galerkin method is obtained by further discretizing the time variable with θ-scheme finite difference. Furthermore, for several numerical examples, the accuracy of approximate solutions are improved by 1–3 order-of magnitudes compared with the Lagrange basis function in L∞ norm, L2 norm and H1 semi-norm, and the numerical examples show that the method proposed possesses a faster convergence rate. It is fully demonstrated that the C-Bézier basis functions have a better approximation effect in simulating unsteady elastic equations.
The need for theories that cope with uncertainty emerges from daily experiences with complicated challenges requiring ambiguous facts. In 1999, the theory of soft sets (S-sets) was given by the Russian mathematician Molodtsov [1] as a tool for modeling mathematical problems that deal with uncertainties. Molodtsov's [1] S-set is a contemporary mathematical approach to coping with these difficulties. Soft collection logic is founded on the parametrization principle, which argues that complex things must be seen from several perspectives, with each aspect providing only a partial and approximate representation of the full item. Also, Molodtsov [1] studied several applications of S-sets theory in solving different practical problems in medical science, economics, mathematics, engineering, etc. Thereafter, Maji et al. [2] focused on abstract research of S-set operators with applications in decision-making problems. Moreover, the concept of soft topological spaces (STSs) defined over an initial universe with a predetermined set of parameters was proposed by Shabir and Naz [3]; their work centered on the theoretical studies of STSs. Majumdar and Samanta [4] presented mappings on S-sets and their application in medical diagnosis. Kharal and Ahmed [5] brought up the view of soft mapping with properties; subsequently, soft continuity of soft mappings was instigated by Aygunoglu and Aygun [6]. Many works devoted to studying soft continuity and its characterizations can be found in the literature reviews provided [7,8,9]. Overall, many researchers have successfully generalized the theory of general topology to the soft setting; see [10,11,12,13].
The generalization of soft open sets (S-open sets) plays an effective role in a soft topology through their ability to improve on many results, or to open the door to explore and discuss several soft topological notions such as soft continuity [10,11], soft separation and regularity axioms [12], soft connectedness [11,13], etc. Moreover, the notions of S-α-open sets and S-β-open sets were defined and studied in STSs by the authors of [14,15,16]. Al-shami et al. [17] introduced and discussed the concepts of weakly S-β-open sets and weakly S-β-continuous functions. Furthermore, Kaur et al. [18] initiated a novel approach to discussing soft continuity. In addition, many researchers have contributed to the theory of S-sets in several fields such as topology and algebra, see [19,20].
The concept of a fuzzy set (F-set) of a nonempty set Q is a mapping μ:Q→I (where I=[0,1]). This concept was first defined in 1965 by Zadeh [21]. The concept of fuzzy topological spaces (FTSs) was presented in 1968 by Chang [22]. Several authors have successfully generalized the theory of general topology to the fuzzy setting with crisp methods. According to Šostak [23], the notion of a fuzzy topology being a crisp subclass of the class of F-sets and fuzziness in the notion of openness of an F-set have not been considered, which seems to be a drawback in the process of fuzzification of a topological space. Therefore, Šostak [23] defined a novel definition of a fuzzy topology as the concept of openness of F-sets. It is an extension of a fuzzy topology introduced by Chang. Many researchers (see [24,25,26,27]) have redefined the same notion and studied FTSs being unaware of Šostak's work.
The notion of fuzzy soft sets (FS-sets) was first defined in 2001 by Maji et al. [28], which combines the S-set [1] and F-set [21]. The concept of FSTSs was introduced and many of its properties such as FS-continuity, FS-closure operators, FS-interior operators, and FS-subspaces were studied [29,30] based on fuzzy topologies in the sense of Šostak [23]. Also, a novel approach to discussing FS-regularity axioms and FS-separation axioms using FS-sets was explored by Taha [31,32]. The notions of r-FS-regularly-open sets, r-FS-pre-open sets, r-FS-semi-open sets, r-FS-α-open sets, and r-FS-β-open sets were introduced by the authors of [33,34,35,36]. Furthermore, Alshammari et al. [37] defined and investigated the concepts of r-FS-δ-open sets and FS-δ-continuous functions based on fuzzy topologies in the sense of Šostak [23]. Overall, Alshammari et al. [37] introduced and discussed the concepts of FS-weak (resp. FS-almost) continuity, which are weaker forms of FS-continuity [29].
We lay out the remainder of this paper as follows. Section 2 contains some basic definitions that help in understanding the obtained results. In Section 3, we display a new class of FS-open sets, called r-FS-γ-open sets in FSTSs based on fuzzy topologies in the sense of Šostak. The class of r-FS-γ-open sets is contained in the class of r-FS-β-open sets, and contains all r-FS-α-open, r-FS-semi-open, and r-FS-pre-open sets. Some properties of r-FS-γ-open sets along with their mutual relationships were specified with the help of some illustrative examples. Thereafter, we introduce the closure and interior operators with respect to the classes of r-FS-γ-closed and r-FS-γ-open sets, and study some of their properties. In Section 4, we explore and characterize some new FS-functions using r-FS-γ-open and r-FS-γ-closed sets, called FS-γ-continuous (resp. FS-γ-irresolute, FS-γ-open, FS-γ-irresolute open, FS-γ-closed, and FS-γ-irresolute closed) functions between FSTSs (Q,TM) and (S,T∗N). Also, the relationships between these classes of functions are discussed with the help of some illustrative examples. In Section 5, we define and discuss the notions of FS-weakly (resp. FS-almost) γ-continuous functions, which are weaker forms of FS-γ-continuous functions. We also show that FS-γ-continuity ⟹ FS-almost γ-continuity ⟹ FS-weak γ-continuity, but the converse may not be true. However, we present some new types of FS-separation axioms, called r-FS-γ-regular and r-FS-γ-normal spaces using r-FS-γ-closed sets, and investigate some properties of them. Moreover, we introduce a new type of FS-connectedness, called r-FS-γ-connected sets using r-FS-γ-closed sets. In the last section, we close this paper with conclusions and proposed future researches.
In this study, nonempty sets will be denoted by Q, S, W, etc. Also, M is the family of each parameter for Q and C⊆M. Moreover, IQ is the family of all F-sets on Q and for u∈I, u_(q)=u, for every q∈Q. The following notions will be used in the next sections.
Definition 2.1. [29,38,39] An FS-set tC on Q is a function from M to IQ, such that tC(m) is an F-set on Q, for every m∈C and tC(m)=0_, if m∉C. On Q, ~(Q,M) is the family of all FS-sets.
Definition 2.2. [40] An FS-point mqu on Q is defined as follows:
mqu(k)={qu,ifk=m,0_,ifk∈M−{m}, |
where qu is an F-point on Q. Moreover, we say that mqu belongs to tC (mqu˜∈tC) if u≤tC(m)(q). On Q, ~Pu(Q) is the family of all FS-points.
Definition 2.3. [41] On Q, mqu∈~Pu(Q) is called an S-quasi-coincident with tC∈~(Q,M) and is denoted by mqu∇tC, if u+tC(m)(q)>1. An FS-set tC∈~(Q,M) is called an S-quasi-coincident with hD∈~(Q,M) and is denoted by tC∇hD, if there is m∈M and q∈Q, such that tC(m)(q)+hD(m)(q)>1. If tC is not an S-quasi-coincident with hD, tC¯∇hD.
Definition 2.4. [29] A function T:M⟶I~(Q,M) is called a fuzzy soft topology (FST) on Q if it satisfies the following statements, for every m∈M:
(ⅰ) Tm(Φ)=Tm(˜M)=1.
(ⅱ) Tm(tC⊓hD)≥Tm(tC)∧Tm(hD), for every tC,hD∈~(Q,M).
(ⅲ) Tm(⨆i∈Θ(tC)i)≥⋀i∈ΘTm((tC)i), for every (tC)i∈~(Q,M),i∈Θ.
Thus, (Q,TM) is called an FSTS based on fuzzy topologies in the sense of Šostak [23].
Definition 2.5. [30,33] In an FSTS (Q,TM), for each hC∈~(Q,M), m∈M, and r∈I∘ (where I∘=(0,1]), we define FS-operators CT and IT :M×~(Q,M)×I∘→~(Q,M) as follows:
CT(m,tC,r)=⊓{hD∈~(Q,M):tC⊑hD,Tm(hcD)≥r}. |
IT(m,tC,r)=⊔{hD∈~(Q,M):hD⊑tC,Tm(hD)≥r}. |
Definition 2.6. [33,34,35] Let (Q,TM) be an FSTS and r∈I∘. An FS-set tC is said to be an r-FS-regularly-open (resp. r-FS-pre-open, r-FS-β-open, r-FS-semi-open, r-FS-α-open, and r-FS-open) set if tC=IT(m,CT(m,tC,r),r) (resp. tC⊑IT(m,CT(m,tC,r),r), tC⊑CT(m,IT(m,CT(m,tC,r),r),r), tC⊑CT(m,IT(m,tC,r),r), tC⊑IT(m,CT(m,IT(m,tC,r),r),r), and tC⊑IT(m,tC,r)) ∀ m∈M.
Definition 2.7. [29,30,33] Let (Q,TM) and (S,T∗N) be FSTSs, m∈M, and (n=ψ(m))∈N. An FS-function φψ:~(Q,M)⟶~(S,N) is called
(ⅰ) FS-continuous if Tm(φ−1ψ(hD))≥T∗n(hD), for every hD∈~(S,N), m∈M;
(ⅱ) FS-open if T∗n(φψ(tC))≥Tm(tC), for every tC∈~(Q,M), m∈M;
(ⅲ) FS-closed if T∗n((φψ(tC))c)≥Tm(tcC), for every tC∈~(Q,M), m∈M.
Definition 2.8. [35,36] Let (Q,TM) and (S,T∗N) be FSTSs. An FS-function φψ:~(Q,M)⟶~(S,N) is called FS-α-continuous (resp. FS-semi-continuous, FS-pre-continuous, and FS-β-continuous) if φ−1ψ(hD) is an r-FS-α-open (resp. r-FS-semi-open, r-FS-pre-open, and r-FS-β-open) set, for every hD∈~(S,N) with T∗n(hD)≥r, m∈M, and (n=ψ(m))∈N.
The basic results and notations that we need in the sequel are found in previous studies [29,30,33,35,36].
In this section, we introduce the notion of r-FS-γ-open sets in an FSTS. Some properties of r-FS-γ-open sets along with their mutual relationships are studied using some problems. The notions of FS-γ-closure operators and FS-γ-interior operators are defined and investigated.
Definition 3.1. Let (Q,TM) be an FSTS and r∈I∘. An FS-set tC∈~(Q,M) is said to be an
(ⅰ) r-FS-γ-open set if tC⊑CT(m,IT(m,tC,r),r)⊔IT(m,CT(m,tC,r),r) for every m∈M;
(ⅱ) r-FS-γ-closed set if tC⊒CT(m,IT(m,tC,r),r)⊓IT(m,CT(m,tC,r),r) for every m∈M.
Remark 3.1. The complement of r-FS-γ-open sets (resp. r-FS-γ-closed sets) are r-FS-γ-closed sets (resp. r-FS-γ-open sets).
Proposition 3.1. Let (Q,TM) be an FSTS and r∈I∘. Then
(ⅰ) each r-FS-semi-open set is an r-FS-γ-open set;
(ⅱ) each r-FS-γ-open set is an r-FS-β-open set;
(ⅲ) each r-FS-pre-open set is an r-FS-γ-open set.
Proof. (ⅰ) Let tC be an r-FS-semi-open set. Then
tC⊑CT(m,IT(m,tC,r),r) |
⊑CT(m,IT(m,tC,r),r)⊔IT(m,tC,r) |
⊑CT(m,IT(m,tC,r),r)⊔IT(m,CT(m,tC,r),r). |
Thus, tC is an r-FS-γ-open set.
(ⅱ) Let tC be an r-FS-γ-open set. Then
tC⊑CT(m,IT(m,tC,r),r)⊔IT(m,CT(m,tC,r),r) |
⊑CT(m,IT(m,CT(m,tC,r),r),r)⊔IT(m,CT(m,tC,r),r) |
⊑CT(m,IT(m,CT(m,tC,r),r),r). |
Thus, tC is an r-FS-β-open set.
(ⅲ) Let tC be an r-FS-pre-open set. Then
tC⊑IT(m,CT(m,tC,r),r) |
⊑IT(m,CT(m,tC,r),r)⊔IT(m,tC,r) |
⊑IT(m,CT(m,tC,r),r)⊔CT(m,IT(m,tC,r),r). |
Thus, tC is an r-FS-γ-open set.
Remark 3.2. From the previous discussions and definitions, we have the following diagram.
![]() |
Remark 3.3. The converse of the above diagram fails as Examples 3.1–3.3 will show.
Example 3.1. Let Q={q1,q2}, M={m1,m2}, and define hM,fM,tM∈~(Q,M) as follows: hM={(m1,{q10.4,q20.3}),(m2,{q10.4,q20.3})}, fM={(m1,{q10.2,q20.6}),(m2,{q10.2,q20.6})}, tM={(m1,{q10.5,q20.7}), (m2,{q10.5,q20.7})}. Define TM:M⟶I~(Q,M) as follows:
Tm1(lM)={1,iflM∈{Φ,˜M},12,iflM=hM,12,iflM=fM,23,iflM=hM⊓fM,12,iflM=hM⊔fM,0,otherwise, Tm2(lM)={1,iflM∈{Φ,˜M},14,iflM=hM,14,iflM=fM,12,iflM=hM⊓fM,14,iflM=hM⊔fM,0,otherwise. |
Thus, tM is a 14-FS-γ-open set, but it is neither 14-FS-pre-open nor 14-FS-α-open.
Example 3.2. Let Q={q1,q2}, M={m1,m2}, and define hM,fM,tM∈~(Q,M) as follows: hM={(m1,{q10.3,q20.2}),(m2,{q10.3,q20.2})}, fM={(m1,{q10.7,q20.8}), (m2,{q10.7,q20.8})},tM={(m1,{q10.5,q20.4}), (m2,{q10.5,q20.4})}. Define TM:M⟶I~(Q,M) as follows:
Tm1(lM)={1,iflM∈{Φ,˜M},12,iflM=hM,14,iflM=fM,0,otherwise, Tm2(lM)={1,iflM∈{Φ,˜M},13,iflM=hM,14,iflM=fM,0,otherwise. |
Thus, tM is a 14-FS-γ-open set, but it is not 14-FS-semi-open.
Example 3.3. Let Q={q1,q2}, M={m1,m2}, and define hM,tM∈~(Q,M) as follows: hM={(m1,{q10.5,q20.4}),(m2,{q10.5,q20.4})}, tM={(m1,{q10.4,q20.5}),(m2,{q10.4,q20.5})}. Define TM:M⟶I~(Q,M) as follows:
Tm1(lM)={1,iflM∈{Φ,˜M},13,iflM=hM,0,otherwise, Tm2(lM)={1,iflM∈{Φ,˜M},12,iflM=hM,0,otherwise. |
Thus, tM is a 13-FS-β-open set, but it is not 13-FS-γ-open.
Corollary 3.1. Let tC be an r-FS-γ-open set in an FSTS (Q,TM), m∈M, and r∈I∘.
(ⅰ) If tC is an r-FS-regularly-open set, then tC is r-FS-semi-open.
(ⅱ) If tC is an r-FS-regularly-closed set, then tC is r-FS-pre-open.
(ⅲ) If IT(m,tC,r)=Φ, then tC is r-FS-pre-open.
(ⅳ) If CT(m,tC,r)=Φ, then tC is r-FS-semi-open.
Proof. The proof follows by Definitions 2.6 and 3.1.
Corollary 3.2. Let tC be an r-FS-γ-closed set in an FSTS (Q,TM), m∈M, and r∈I∘.
(ⅰ) If tC is an r-FS-regularly-open set, then tC is r-FS-pre-closed.
(ⅱ) If tC is an r-FS-regularly-closed set, then tC is r-FS-semi-closed.
(ⅲ) If IT(m,tC,r)=Φ, then tC is r-FS-semi-closed.
(ⅳ) If CT(m,tC,r)=Φ, then tC is r-FS-pre-closed.
Proof. The proof follows by Definitions 2.6 and 3.1.
Corollary 3.3. Let (Q,TM) be an FSTS and r∈I∘. Then
(ⅰ) the union of r-FS-γ-open sets is r-FS-γ-open;
(ⅱ) the intersection of r-FS-γ-closed sets is r-FS-γ-closed.
Proof. This is easily proved by Definition 3.1.
Definition 3.2. In an FSTS (Q,TM), for each tC∈~(Q,M), m∈M, and r∈I∘, we define an FS-γ-closure operator γCT :M×~(Q,M)×I∘→~(Q,M) as follows: γCT(m,tC,r)=⊓{hD∈~(Q,M):tC⊑hD,hDisr-FS-γ-closed}.
Proposition 3.2. Let (Q,TM) be an FSTS, tC∈~(Q,M), m∈M, and r∈I∘. Then tC is an r-FS-γ-closed set iff γCT(m,tC,r)=tC.
Proof. The proof follows by Definition 3.2.
Theorem 3.1. In an FSTS (Q,TM), for each tC,hD∈~(Q,M), m∈M, and r∈I∘, an FS-operator γCT :M×~(Q,M)×I∘→~(Q,M) satisfies the following properties.
(ⅰ) γCT(m,Φ,r)=Φ.
(ⅱ) tC⊑γCT(m,tC,r)⊑CT(m,tC,r).
(ⅲ) γCT(m,tC,r)⊑γCT(m,hD,r) if tC⊑hD.
(ⅳ) γCT(m,γCT(m,tC,r),r)=γCT(m,tC,r).
(ⅴ) γCT(m,tC⊔hD,r)⊒γCT(m,tC,r)⊔γCT(m,hD,r).
(ⅵ) γCT(m,CT(m,tC,r),r)=CT(m,tC,r).
Proof. (ⅰ)–(ⅲ) are easily proved by Definition 3.2.
(ⅳ) From (ⅱ) and (ⅲ), we have γCT(m,tC,r)⊑γCT(m,γCT(m,tC,r),r).
Now, we show that γCT(m,tC,r)⊒γCT(m,γCT(m,tC,r),r). If γCT(m,tC,r) does not contain γCT(m,γCT(m,tC,r),r), then there is q∈Q and u∈(0,1) such that
γCT(m,tC,r)(m)(q)<u<γCT(m,γCT(m,tC,r),r)(m)(q). | (K) |
Since γCT(m,tC,r)(m)(q)<u, by Definition 3.2, there exists hD that is r-FS-γ-closed and tC⊑hD such that γCT(m,tC,r)(m)(q)≤hD(m)(q)<u. Since tC⊑hD, then γCT(m,tC,r)⊑hD. Again, by Definition 3.2, we have γCT(m,γCT(m,tC,r),r)⊑hD.
Hence, γCT(m,γCT(m,tC,r),r)(m)(q)≤hD(m)(q)<u, which is a contradiction for (K). Thus, γCT(m,tC,r)⊒γCT(m,γCT(m,tC,r),r), so γCT(m,γCT(m,tC,r),r)=γCT(m,tC,r).
(ⅴ) Since tC⊑tC⊔hD and hD⊑tC⊔hD, hence by (ⅲ), γCT(m,tC,r)⊑γCT(m,tC⊔hD,r) and γCT(m,hD,r)⊑γCT(m,tC⊔hD,r). Thus, γCT(m,tC⊔hD,r)⊒γCT(m,tC,r)⊔γCT(m,hD,r).
(ⅵ) From Proposition 3.2 and the fact that CT(m,tC,r) is r-FS-γ-closed, then γCT(m,CT(m,tC,r),r)=CT(m,tC,r).
Definition 3.3. In an FSTS (Q,TM), for each tC∈~(Q,M), m∈M, and r∈I∘, we define an FS-γ-interior operator γIT :M×~(Q,M)×I∘→~(Q,M) as follows: γIT(m,tC,r)=⊔{hD∈~(Q,M):hD⊑tC,hDisr-FS-γ-open}.
Proposition 3.3. Let (Q,TM) be an FSTS, tC∈~(Q,M), m∈M, and r∈I∘. Then tC is an r-FS-γ-open set iff γIT(m,tC,r)=tC.
Proof. The proof follows by Definition 3.3.
Theorem 3.2. In an FSTS (Q,TM), for each tC,hD∈~(Q,M), m∈M, and r∈I∘, an FS-operator γIT :M×~(Q,M)×I∘→~(Q,M) satisfies the following properties.
(ⅰ) γIT(m,˜M,r)=˜M.
(ⅱ) IT(m,tC,r)⊑γIT(m,tC,r)⊑tC.
(ⅲ) γIT(m,tC,r)⊑γIT(m,hD,r) if tC⊑hD.
(ⅳ) γIT(m,γIT(m,tC,r),r)=γIT(m,tC,r).
(ⅴ) γIT(m,tC,r)⊓γIT(m,hD,r)⊒γIT(m,tC⊓hD,r).
Proof. The proof is similar to that of Theorem 3.1.
Proposition 3.4. Let (Q,TM) be an FSTS, tC∈~(Q,M), m∈M, and r∈I∘. Then
(ⅰ) γIT(m,tcC,r)=(γCT(m,tC,r))c;
(ⅱ) γCT(m,tcC,r)=(γIT(m,tC,r))c.
Proof. (ⅰ) For each tC∈~(Q,M) and m∈M, we have γIT(m,tcC,r)=⊔{hD∈~(Q,M):hD⊑tcC,hDisr-FS-γ-open} = [⊓{hcD∈~(Q,M):tC⊑hcD,hcDisr-FS-γ-closed}]c = (γCτ(m,tC,r))c.
(ⅱ) This is similar to that of (ⅰ).
In this section, we introduce and study some new FS-functions using r-FS-γ-open sets and r-FS-γ-closed sets, called FS-γ-continuous (resp. FS-γ-irresolute, FS-γ-open, FS-γ-irresolute open, FS-γ-closed, and FS-γ-irresolute closed) functions between FSTSs (Q,TM) and (S,T∗N). However, the relationships between these classes of functions are discussed.
Definition 4.1. Let (Q,TM) and (S,T∗N) be FSTSs, tC∈~(Q,M), hD∈~(S,N), m∈M, (n=ψ(m))∈N, and r∈I∘. An FS-function φψ:~(Q,M)⟶~(S,N) is called
(ⅰ) FS-γ-continuous if φ−1ψ(hD) is an r-FS-γ-open set, for every hD with T∗n(hD)≥r;
(ⅱ) FS-γ-open if φψ(tC) is an r-FS-γ-open set, for every tC with Tm(tC)≥r;
(ⅲ) FS-γ-closed if φψ(tC) is an r-FS-γ-closed set, for every tC with Tm(tcC)≥r;
(ⅳ) FS-γ-irresolute if φ−1ψ(hD) is an r-FS-γ-open set, for every r-FS-γ-open set hD;
(ⅴ) FS-γ-irresolute open if φψ(tC) is an r-FS-γ-open set, for every r-FS-γ-open set tC;
(ⅵ) FS-γ-irresolute closed if φψ(tC) is an r-FS-γ-closed set, for every r-FS-γ-closed set tC.
Remark 4.1. From the previous definitions, we have the following diagram.
![]() |
Remark 4.2. The converse of the above diagram fails as Examples 4.1–4.3 will show.
Example 4.1. Let Q={q1,q2}, M={m1,m2}, and define hM,fM,tM∈~(Q,M) as follows: hM={(m1,{q10.4,q20.3}),(m2,{q10.4,q20.3})}, fM={(m1,{q10.2,q20.6}),(m2,{q10.2,q20.6})}, tM={(m1,{q10.5,q20.7}), (m2,{q10.5,q20.7})}. Define TM,T∗M:M⟶I~(Q,M) as follows: ∀m∈M,
Tm(lM)={1,iflM∈{Φ,˜M},12,iflM=hM,12,iflM=fM,23,iflM=hM⊓fM,12,iflM=hM⊔fM,0,otherwise, T∗m(lM)={1,iflM∈{Φ,˜M},12,iflM=tM,0,otherwise. |
Then, the identity FS-function φψ:(Q,TM)⟶(Q,T∗M) is FS-γ-continuous, but it is neither FS-pre-continuous nor FS-α-continuous.
Example 4.2. Let Q={q1,q2}, M={m1,m2}, and define hM,fM,tM∈~(Q,M) as follows: hM={(m1,{q10.3,q20.2}),(m2,{q10.3,q20.2})}, fM={(m1,{q10.7,q20.8}),(m2,{q10.7,q20.8})}, tM={(m1,{q10.5,q20.4}), (m2,{q10.5,q20.4})}. Define TM,T∗M:M⟶I~(Q,M) as follows: ∀m∈M,
Tm(lM)={1,iflM∈{Φ,˜M},12,iflM=hM,14,iflM=fM,0,otherwise, T∗m(lM)={1,iflM∈{Φ,˜M},14,iflM=tM,0,otherwise. |
Then, the identity FS-function φψ:(Q,TM)⟶(Q,T∗M) is FS-γ-continuous, but it is not FS-semi-continuous.
Example 4.3. Let Q={q1,q2}, M={m1,m2}, and define hM,tM∈~(Q,M) as follows: hM={(m1,{q10.5,q20.4}),(m2,{q10.5,q20.4})}, tM={(m1,{q10.4,q20.5}),(m2,{q10.4,q20.5})}. Define TM,T∗M:M⟶I~(Q,M) as follows: ∀m∈M,
Tm(lM)={1,iflM∈{Φ,˜M},12,iflM=hM,0,otherwise, T∗m(lM)={1,iflM∈{Φ,˜M},13,iflM=tM,0,otherwise. |
Then, the identity FS-function φψ:(Q,TM)⟶(Q,T∗M) is FS-β-continuous, but it is not FS-γ-continuous.
Theorem 4.1. Let (Q,TM) and (S,T∗N) be FSTSs, m∈M, (n=ψ(m))∈N, and r∈I∘. An FS-function φψ:~(Q,M)⟶~(S,N) is FS-γ-continuous iff for any mqu∈~Pu(Q) and any hD∈~(S,N) with T∗n(hD)≥r containing φψ(mqu), there exists tC∈~(Q,M) that is an r-FS-γ-open set containing mqu with φψ(tC)⊑hD.
Proof. (⇒) Let mqu∈~Pu(Q) and hD∈~(S,N) with T∗n(hD)≥r containing φψ(mqu), and then φ−1ψ(hD)⊑γIT(m,φ−1ψ(hD),r). Since mqu˜∈φ−1ψ(hD), then we obtain mqu˜∈γIT(m,φ−1ψ(hD),r)=tC (say). Hence, tC∈~(Q,M) is an r-FS-γ-open set containing mqu with φψ(tC)⊑hD.
(⇐) Let mqu∈~Pu(Q) and hD∈~(S,N) with T∗n(hD)≥r such that mqu˜∈φ−1ψ(hD). According to the assumption there exists tC∈~(Q,M) that is an r-FS-γ-open set containing mqu, such that φψ(tC)⊑hD. Hence, mqu˜∈tC⊑φ−1ψ(hD) and mqu˜∈γIT(m,φ−1ψ(hD),r). Thus, φ−1ψ(hD)⊑γIT(m,φ−1ψ(hD),r), so φ−1ψ(hD) is an r-FS-γ-open set. Thus, φψ is FS-γ-continuous.
Theorem 4.2. Let (Q,TM) and (S,T∗N) be FSTSs and φψ:~(Q,M)⟶~(S,N) be an FS-function. Then the following statements are equivalent for every tC∈~(Q,M), hD∈~(S,N), m∈M, (n=ψ(m))∈N, and r∈I∘:
(ⅰ) φψ is FS-γ-continuous.
(ⅱ) φ−1ψ(hD) is r-FS-γ-closed, for every hD∈~(S,N) with T∗n(hcD)≥r.
(ⅲ) φψ(γCT(m,tC,r))⊑CT∗(n,φψ(tC),r).
(ⅳ) γCT(m,φ−1ψ(hD),r)⊑φ−1ψ(CT∗(n,hD,r)).
(ⅴ) φ−1ψ(IT∗(n,hD,r))⊑γIT(m,φ−1ψ(hD),r).
Proof. (ⅰ) ⇔ (ⅱ) The proof follows from Definition 4.1 and φ−1ψ(hcD)=(φ−1ψ(hD))c.
(ⅱ) ⇒ (ⅲ) Let tC∈~(Q,M); then by (ⅱ), φ−1ψ(CT∗(n,φψ(tC),r)) is r-FS-γ-closed, hence
γCT(m,tC,r)⊑γCT(m,φ−1ψ(φψ(tC)),r)⊑γCT(m,φ−1ψ(CT∗(n,φψ(tC),r)),r)=φ−1ψ(CT∗(n,φψ(tC),r)). |
Thus, φψ(γCT(m,tC,r))⊑CT∗(n,φψ(tC),r).
(ⅲ) ⇒ (ⅳ) Let hD∈~(S,N); hence by (ⅲ), φψ(γCT(m,φ−1ψ(hD),r))⊑CT∗(n,φψ(φ−1ψ(hD)),r) ⊑CT∗(n,hD,r). Thus, γCT(m,φ−1ψ(hD),r)⊑φ−1ψ(φψ(γCT(m,φ−1ψ(hD),r)))⊑φ−1ψ(CT∗(n,hD,r)).
(ⅳ) ⇔ (ⅴ) The proof follows from Proposition 3.4 and φ−1ψ(hcD)=(φ−1ψ(hD))c.
(ⅴ) ⇒ (ⅰ) Let hD∈~(S,N) with T∗n(hD)≥r. By (ⅴ), we obtain φ−1ψ(hD)=φ−1ψ(IT∗(n,hD,r))⊑γIT(m,φ−1ψ(hD),r)⊑φ−1ψ(hD). Then, γIT(m,φ−1ψ(hD),r)=φ−1ψ(hD). Thus, φ−1ψ(hD) is r-FS-γ-open, so φψ is FS-γ-continuous.
Lemma 4.1. Every FS-γ-irresolute function is FS-γ-continuous.
Proof. The proof follows from Definition 4.1.
Remark 4.3. The converse of Lemma 4.1 fails as Example 4.4 will show.
Example 4.4. Let Q={q1,q2}, M={m1,m2}, and define hM,tM∈~(Q,M) as follows: hM={(m1,{q10.5,q20.5}),(m2,{q10.5,q20.5})}, tM={(m1,{q10.5,q20.4}),(m2,{q10.5,q20.4})}. Define TM,T∗M:M⟶I~(Q,M) as follows: ∀m∈M,
Tm(lM)={1,iflM∈{Φ,˜M},12,iflM=tM,0,otherwise, T∗m(lM)={1,iflM∈{Φ,˜M},13,iflM=hM,0,otherwise. |
Then, the identity FS-function φψ:(Q,TM)⟶(Q,T∗M) is FS-γ-continuous, but it is not FS-γ-irresolute.
Theorem 4.3. Let (Q,TM) and (S,T∗N) be FSTSs and φψ:~(Q,M)⟶~(S,N) be an FS-function. Then the following statements are equivalent for every tC∈~(Q,M), hD∈~(S,N), m∈M, (n=ψ(m))∈N, and r∈I∘:
(ⅰ) φψ is FS-γ-irresolute.
(ⅱ) φ−1ψ(hD) is r-FS-γ-closed, for every r-FS-γ-closed set hD.
(ⅲ) φψ(γCT(m,tC,r))⊑γCT∗(n,φψ(tC),r).
(ⅳ) γCT(m,φ−1ψ(hD),r)⊑φ−1ψ(γCT∗(n,hD,r)).
(ⅴ) φ−1ψ(γIT∗(n,hD,r))⊑γIT(m,φ−1ψ(hD),r).
Proof. (ⅰ) ⇔ (ⅱ) The proof follows from Definition 4.1 and φ−1ψ(hcD)=(φ−1ψ(hD))c.
(ⅱ) ⇒ (ⅲ) Let tC∈~(Q,M); then by (ⅱ), φ−1ψ(γCT∗(n,φψ(tC),r)) is r-FS-γ-closed, hence
γCT(m,tC,r)⊑γCT(m,φ−1ψ(φψ(tC)),r)⊑γCT(m,φ−1ψ(γCT∗(n,φψ(tC),r)),r)=φ−1ψ(γCT∗(n,φψ(tC),r)). |
Thus, φψ(γCT(m,tC,r))⊑γCT∗(n,φψ(tC),r).
(ⅲ) ⇒ (ⅳ) Let hD∈~(S,N); hence by (ⅲ), φψ(γCT(m,φ−1ψ(hD),r))⊑γCT∗(n,φψ(φ−1ψ(hD)),r) ⊑γCT∗(n,hD,r). Thus, γCT(m,φ−1ψ(hD),r)⊑φ−1ψ(φψ(γCT(m,φ−1ψ(hD),r)))⊑φ−1ψ(γCT∗(n,hD,r)).
(ⅳ) ⇔ (ⅴ) The proof follows from Proposition 3.4 and φ−1ψ(hcD)=(φ−1ψ(hD))c.
(ⅴ) ⇒ (ⅰ) Let hD be an r-FS-γ-open set. By (ⅴ),
φ−1ψ(hD)=φ−1ψ(γIT∗(n,hD,r))⊑γIT(m,φ−1ψ(hD),r)⊑φ−1ψ(hD). |
Thus, γIT(m,φ−1ψ(hD),r)=φ−1ψ(hD). Therefore, φ−1ψ(hD) is r-FS-γ-open, so φψ is FS-γ-irresolute.
Proposition 4.1. Let (Q,TM), (W,ℑH), and (S,T∗N) be FSTSs, and φψ:~(Q,M)⟶~(W,H), φ∗ψ∗:~(W,H)⟶~(S,N) be two FS-functions. Then the composition φ∗ψ∗∘φψ is FS-γ-continuous (resp. FS-γ-irresolute) if φψ is FS-γ-irresolute and φ∗ψ∗ is FS-γ-continuous (resp. FS-γ-irresolute).
Proof. The proof follows from Definition 4.1.
Lemma 4.2. (ⅰ) Every FS-γ-irresolute open function is FS-γ-open.
(ⅱ) Every FS-γ-irresolute closed function is FS-γ-closed.
Proof. The proof follows from Definition 4.1.
Remark 4.4. The converse of Lemma 4.2 fails as Example 4.5 will show.
Example 4.5. Let Q={q1,q2}, M={m1,m2}, and define hM,tM∈~(Q,M) as follows: hM={(m1,{q10.5,q20.5}),(m2,{q10.5,q20.5})}, tM={(m1,{q10.5,q20.4}),(m2,{q10.5,q20.4})}. Define TM,T∗M:M⟶I~(Q,M) as follows: ∀m∈M,
Tm(lM)={1,iflM∈{Φ,˜M},12,iflM=hM,0,otherwise, T∗m(lM)={1,iflM∈{Φ,˜M},12,iflM=tM,0,otherwise. |
Then, the identity FS-function φψ:(Q,TM)⟶(Q,T∗M) is FS-γ-open, but it is not FS-γ-irresolute open.
Theorem 4.4. Let (Q,TM) and (S,T∗N) be FSTSs and φψ:~(Q,M)⟶~(S,N) be an FS-function. Then the following statements are equivalent for every tC∈~(Q,M), hD∈~(S,N), m∈M, and (n=ψ(m))∈N:
(ⅰ) φψ is FS-γ-open.
(ⅱ) φψ(IT(m,tC,r))⊑γIT∗(n,φψ(tC),r).
(ⅲ) IT(m,φ−1ψ(hD),r)⊑φ−1ψ(γIT∗(n,hD,r)).
(ⅳ) For every hD and every tC with Tm(tcC)≥r and φ−1ψ(hD)⊑tC, there exists gB∈~(S,N) that is r-FS-γ-closed with hD⊑gB such that φ−1ψ(gB)⊑tC.
Proof. (ⅰ) ⇒ (ⅱ) Since φψ(IT(m,tC,r))⊑φψ(tC), hence by (ⅰ), φψ(IT(m,tC,r)) is r-FS-γ-open. Then, φψ(IT(m,tC,r))⊑γIT∗(n,φψ(tC),r).
(ⅱ) ⇒ (ⅲ) Set tC=φ−1ψ(hD) and hence by (ⅱ), φψ(IT(m,φ−1ψ(hD),r))⊑γIT∗(n,φψ(φ−1ψ(hD)),r)⊑γIT∗(n,hD,r). Then, IT(m,φ−1ψ(hD),r)⊑φ−1ψ(γIT∗(n,hD,r)).
(ⅲ) ⇒ (ⅳ) Let hD∈~(S,N) and tC∈~(Q,M) with Tm(tcC)≥r such that φ−1ψ(hD)⊑tC. Since tcC⊑φ−1ψ(hcD), tcC=IT(m,tcC,r)⊑IT(m,φ−1ψ(hcD),r). Hence by (ⅲ), tcC⊑IT(m,φ−1ψ(hcD),r)⊑φ−1ψ(γIT∗(n,hcD,r)). Thus, we have tC⊒(φ−1ψ(γIT∗(n,hcD,r)))c=φ−1ψ(γCT∗(n,hD,r)). Then, there exists γCT∗(n,hD,r)∈~(S,N) that is r-FS-γ-closed such that hD⊑γCT∗(n,hD,r) and
φ−1ψ(γCT∗(n,hD,r))⊑tC. |
(ⅳ) ⇒ (ⅰ) Let fA∈~(Q,M) with Tm(fA)≥r. Set hD=(φψ(fA))c and tC=fcA, φ−1ψ(hD)=φ−1ψ((φψ(fA))c)⊑tC. Hence by (ⅳ), there exists gB∈~(S,N) that is r-FS-γ-closed with hD⊑gB such that φ−1ψ(gB)⊑tC=fcA. Thus, φψ(fA)⊑φψ(φ−1ψ(gcB))⊑gcB. On the other hand, since hD⊑gB, φψ(fA)=hcD⊒gcB. Hence, φψ(fA)=gcB and φψ(fA) is an r-FS-γ-open set. This shows that φψ is an FS-γ-open function.
Theorem 4.5. Let (Q,TM) and (S,T∗N) be FSTSs and φψ:~(Q,M)⟶~(S,N) be an FS-function. Then the following statements are equivalent for every tC∈~(Q,M), hD∈~(S,N), m∈M, and (n=ψ(m))∈N:
(ⅰ) φψ is FS-γ-closed.
(ⅱ) γCT∗(n,φψ(tC),r)⊑φψ(CT(m,tC,r)).
(ⅲ) φ−1ψ(γCT∗(n,hD,r))⊑CT(m,φ−1ψ(hD),r).
(ⅳ) For every hD and every tC with Tm(tC)≥r and φ−1ψ(hD)⊑tC, there exists gB∈~(S,N) that is r-FS-γ-open with hD⊑gB such that φ−1ψ(gB)⊑tC.
Proof. The proof is similar to that of Theorem 4.4.
Theorem 4.6. Let (Q,TM) and (S,T∗N) be FSTSs and φψ:~(Q,M)⟶~(S,N) be an FS-function. Then the following statements are equivalent for every tC∈~(Q,M), hD∈~(S,N), m∈M, and (n=ψ(m))∈N:
(ⅰ) φψ is FS-γ-irresolute open.
(ⅱ) φψ(γIT(m,tC,r))⊑γIT∗(n,φψ(tC),r).
(ⅲ) γIT(m,φ−1ψ(hD),r)⊑φ−1ψ(γIT∗(n,hD,r)).
(ⅳ) For every hD and every r-FS-γ-closed set tC with φ−1ψ(hD)⊑tC, there exists gB∈~(S,N) that is r-FS-γ-closed with hD⊑gB such that φ−1ψ(gB)⊑tC.
Proof. The proof is similar to that of Theorem 4.4.
Theorem 4.7. Let (Q,TM) and (S,T∗N) be FSTSs and φψ:~(Q,M)⟶~(S,N) be an FS-function. Then the following statements are equivalent for every tC∈~(Q,M), hD∈~(S,N), m∈M, and (n=ψ(m))∈N:
(ⅰ) φψ is FS-γ-irresolute closed.
(ⅱ) γCT∗(n,φψ(tC),r)⊑φψ(γCT(m,tC,r)).
(ⅲ) φ−1ψ(γCT∗(n,hD,r))⊑γCT(m,φ−1ψ(hD),r).
(ⅳ) For every hD and every r-FS-γ-open set tC with φ−1ψ(hD)⊑tC, there exists gB∈~(S,N) that is r-FS-γ-open with hD⊑gB such that φ−1ψ(gB)⊑tC.
Proof. The proof is similar to that of Theorem 4.4.
Proposition 4.2. Let (Q,TM) and (S,T∗N) be FSTSs, and φψ:~(Q,M)⟶~(S,N) be a bijective FS-function. Then φψ is FS-γ-irresolute open iff φψ is FS-γ-irresolute closed.
Proof. The proof follows from:
φ−1ψ(γCT∗(n,hD,r))⊑γCT(n,φ−1ψ(hD),r) ⟺ φ−1ψ(γIT∗(n,hcD,r))⊒γIT(m,φ−1ψ(hcD),r).
Definition 4.2. Let (Q,TM) and (S,T∗N) be FSTSs. A bijective FS-function φψ:~(Q,M)⟶~(S,N) is called an FS-γ-irresolute homeomorphism if φψ and φ−1ψ are FS-γ-irresolute.
The proof of the following corollary is easy and so is omitted.
Corollary 4.1. Let (Q,TM) and (S,T∗N) be FSTSs, and φψ:~(Q,M)⟶~(S,N) be an FS-function and bijective. Then the following statements are equivalent for every tC∈~(Q,M), hD∈~(S,N), m∈M, (n=ψ(m))∈N, and r∈I∘:
(ⅰ) φψ is an FS-γ-irresolute homeomorphism.
(ⅱ) φψ is FS-γ-irresolute closed and FS-γ-irresolute.
(ⅲ) φψ is FS-γ-irresolute open and FS-γ-irresolute.
(ⅳ) φψ(γIT(m,tC,r))=γIT∗(n,φψ(tC),r).
(ⅴ) φψ(γCT(m,tC,r))=γCT∗(n,φψ(tC),r).
(ⅵ) γIT(m,φ−1ψ(hD),r)=φ−1ψ(γIT∗(n,hD,r)).
(ⅶ) γCT(m,φ−1ψ(hD),r)=φ−1ψ(γCT∗(n,hD,r)).
In this section, the notions of FS-weak γ-continuity and FS-almost γ-continuity, which are weaker forms of FS-γ-continuity and are introduced and investigated between FSTSs. Furthermore, we defined and discussed new types of FS-separation axioms, called r-FS-γ-regular spaces and FS-γ-normal spaces using r-FS-γ-closed sets. In addition, the notion of r-FS-γ-connected sets is defined and studied.
● Fuzzy soft weak and almost γ-continuity:
Definition 5.1. Let (Q,TM) and (S,T∗N) be FSTSs, m∈M, (n=ψ(m))∈N, and r∈I∘. An FS-function φψ:~(Q,M)⟶~(S,N) is called FS-weakly γ-continuous if
φ−1ψ(hD)⊑γIT(m,φ−1ψ(CT∗(n,hD,r)),r), |
for each hD∈~(S,N) with T∗n(hD)≥r.
Lemma 5.1. Every FS-γ-continuity is an FS-weak γ-continuity.
Proof. The proof follows from Definitions 4.1 and 5.1.
Remark 5.1. The converse of Lemma 5.1 fails as Example 5.1 will show.
Example 5.1. Let Q={q1,q2,q3}, M={m1,m2}, and define hM,fM,tM∈~(Q,M) as follows: hM={(m1,{q10.4,q20.2,q30.4}),(m2,{q10.4,q20.2,q30.4})}, fM={(m1,{q10.5,q20.5,q30.4}),(m2,{q10.5,q20.5,q30.4})}, tM={(m1,{q10.3,q20.2,q30.6}),(m2,{q10.3,q20.2,q30.6})}. Define TM,T∗M:M⟶I~(Q,M) as follows: ∀m∈M,
Tm(lM)={1,iflM∈{Φ,˜M},12,iflM=hM,13,iflM=fM,0,otherwise, T∗m(lM)={1,iflM∈{Φ,˜M},14,iflM=tM,0,otherwise. |
Then, the identity FS-function φψ:(Q,TM)⟶(Q,T∗M) is FS-weakly γ-continuous, but it is not FS-γ-continuous.
Theorem 5.1. Let (Q,TM) and (S,T∗N) be FSTSs, m∈M, (n=ψ(m))∈N, and r∈I∘. An FS-function φψ:~(Q,M)⟶~(S,N) is FS-weakly γ-continuous iff for any mqu∈~Pu(Q) and any hD∈~(S,N) with T∗n(hD)≥r containing φψ(mqu), there exists tC∈~(Q,M) that is an r-FS-γ-open set containing mqu with φψ(tC)⊑CT∗(n,hD,r).
Proof. (⇒) Let mqu∈~Pu(Q) and hD∈~(S,N) with T∗n(hD)≥r containing φψ(mqu), and then φ−1ψ(hD)⊑γIT(m,φ−1ψ(CT∗(n,hD,r)),r). Since mqu˜∈φ−1ψ(hD), then mqu˜∈γIT(m,φ−1ψ(CT∗(n,hD,r)),r)=tC (say). Hence, tC∈~(Q,M) is an r-FS-γ-open set containing mqu with φψ(tC)⊑CT∗(n,hD,r).
(⇐) Let mqu∈~Pu(Q) and hD∈~(S,N) with T∗n(hD)≥r such that mqu˜∈φ−1ψ(hD). According to the assumption there exists tC∈~(Q,M) that is an r-FS-γ-open set containing mqu with φψ(tC)⊑CT∗(n,hD,r). Hence, mqu˜∈tC⊑φ−1ψ(CT∗(n,hD,r)) and mqu˜∈γIT(m,φ−1ψ(CT∗(n,hD,r)),r). Thus, φ−1ψ(hD)⊑γIT(m,φ−1ψ(CT∗(n,hD,r)),r), so φψ is FS-weakly γ-continuous.
Theorem 5.2. Let (Q,TM) and (S,T∗N) be FSTSs and φψ:~(Q,M)⟶~(S,N) be an FS-function. Then the following statements are equivalent for every hD∈~(S,N), m∈M, and (n=ψ(m))∈N:
(ⅰ) φψ is FS-weakly γ-continuous.
(ⅱ) φ−1ψ(hD)⊒γCT(m,φ−1ψ(IT∗(n,hD,r)),r), if T∗n(hcD)≥r.
(ⅲ) γIT(m,φ−1ψ(CT∗(n,hD,r)),r)⊒φ−1ψ(IT∗(n,hD,r)).
(ⅳ) γCT(m,φ−1ψ(IT∗(n,hD,r)),r)⊑φ−1ψ(CT∗(n,hD,r)).
Proof. (ⅰ) ⇔ (ⅱ) The proof follows from Definition 5.1, Proposition 3.4, and φ−1ψ(hcD)=(φ−1ψ(hD))c.
(ⅱ) ⇒ (ⅲ) Let hD∈~(S,N). Hence, by (ⅱ),
γCT(m,φ−1ψ(IT∗(n,CT∗(n,hcD,r),r)),r)⊑φ−1ψ(CT∗(n,hcD,r)). |
Thus, φ−1ψ(IT∗(n,hD,r))⊑γIT(m,φ−1ψ(CT∗(n,hD,r)),r).
(ⅲ) ⇔ (ⅳ) The proof follows from Proposition 3.4 and φ−1ψ(hcD)=(φ−1ψ(hD))c.
(ⅳ) ⇒ (ⅰ) Let hD∈~(S,N) with T∗n(hD)≥r. Hence, by (ⅳ), γCT(m,φ−1ψ(IT∗(n,hcD,r)),r)⊑φ−1ψ(CT∗(n,hcD,r))=φ−1ψ(hcD). Thus, φ−1ψ(hD)⊑γIT(m,φ−1ψ(CT∗(n,hD,r)),r), so φψ is FS-weakly γ-continuous.
Definition 5.2. Let (Q,TM) and (S,T∗N) be FSTSs, m∈M, (n=ψ(m))∈N, and r∈I∘. An FS-function φψ:~(Q,M)⟶~(S,N) is called FS-almost γ-continuous if
φ−1ψ(hD)⊑γIT(m,φ−1ψ(IT∗(n,CT∗(n,hD,r),r)),r), |
for each hD∈~(S,N) with T∗n(hD)≥r.
Lemma 5.2. Every FS-almost γ-continuity is an FS-weak γ-continuity.
Proof. The proof follows from Definitions 5.1 and 5.2.
Remark 5.2. The converse of Lemma 5.2 fails as Example 5.2 will show.
Example 5.2. Let Q={q1,q2,q3}, M={m1,m2}, and define hM,fM,tM∈~(Q,M) as follows: hM={(m1,{q10.6,q20.2,q30.4}),(m2,{q10.6,q20.2,q30.4})}, fM={(m1,{q10.3,q20.2,q30.5}),(m2,{q10.3,q20.2,q30.5})}, tM={(m1,{q10.3,q20.2,q30.4}),(m2,{q10.3,q20.2,q30.4})}. Define TM,T∗M:M⟶I~(Q,M) as follows: ∀m∈M,
Tm(lM)={1,iflM∈{Φ,˜M},12,iflM=hM,13,iflM=tM,0,otherwise, T∗m(lM)={1,iflM∈{Φ,˜M},13,iflM=fM,0,otherwise. |
Then, the identity FS-function φψ:(Q,TM)⟶(Q,T∗M) is FS-weakly γ-continuous, but it is not FS-almost γ-continuous.
Remark 5.3. From the previous discussions and definitions, we have the following diagram.
![]() |
Theorem 5.3. Let (Q,TM) and (S,T∗N) be FSTSs, m∈M, (n=ψ(m))∈N, and r∈I∘. An FS-function φψ:~(Q,M)⟶~(S,N) is FS-almost γ-continuous iff for any mqu∈~Pu(Q) and any hD∈~(S,N) with T∗n(hD)≥r containing φψ(mqu), there exists tC∈~(Q,M) that is an r-FS-γ-open set containing mqu with φψ(tC)⊑IT∗(n,CT∗(n,hD,r),r).
Proof. The proof is similar to that of Theorem 5.1.
Theorem 5.4. Let (Q,TM) and (S,T∗N) be FSTSs and φψ:~(Q,M)⟶~(S,N) be an FS-function. Then the following statements are equivalent for every hD∈~(S,N), m∈M, and (n=ψ(m))∈N:
(ⅰ) φψ is FS-almost γ-continuous.
(ⅱ) φ−1ψ(hD) is r-FS-γ-open, for every r-FS-regularly-open set hD.
(ⅲ) φ−1ψ(hD) is r-FS-γ-closed, for every r-FS-regularly-closed set hD.
(ⅳ) γCT(m,φ−1ψ(hD),r)⊑φ−1ψ(CT∗(n,hD,r)), for every r-FS-γ-open set hD.
(ⅴ) γCT(m,φ−1ψ(hD),r)⊑φ−1ψ(CT∗(n,hD,r)), for every r-FS-semi-open set hD.
Proof. (ⅰ) ⇒ (ⅱ) Let mqu∈~Pu(Q) and hD be an r-FS-regularly-open set such that mqu˜∈φ−1ψ(hD). Hence, by Theorem 5.3, there exists tC∈~(Q,M) that is r-FS-γ-open with mqu˜∈tC and φψ(tC)⊑IT∗(n,CT∗(n,hD,r),r). Thus, tC⊑φ−1ψ(IT∗(n,CT∗(n,hD,r),r))=φ−1ψ(hD) and mqu˜∈γIT(n,φ−1ψ(hD),r). Then, φ−1ψ(hD)⊑γIT(n,φ−1ψ(hD),r), so φ−1ψ(hD) is r-FS-γ-open.
(ⅱ) ⇒ (ⅲ) Let hD be r-FS-regularly-closed. Then, by (ⅱ), φ−1ψ(hcD)=(φ−1ψ(hD))c is r-FS-γ-open, hence φ−1ψ(hD) is an r-FS-γ-closed set.
(ⅲ) ⇒ (ⅳ) Let hD be r-FS-γ-open and since CT∗(n,hD,r) is r-FS-regularly-closed, then by (ⅲ), φ−1ψ(CT∗(n,hD,r)) is r-FS-γ-closed. Since φ−1ψ(hD)⊑φ−1ψ(CT∗(n,hD,r)), hence we have
γCT(m,φ−1ψ(hD),r)⊑φ−1ψ(CT∗(n,hD,r)). |
(ⅳ) ⇒ (ⅴ) The proof follows from the fact that any r-FS-semi-open set is an r-FS-γ-open set.
(ⅴ) ⇒ (ⅲ) Let hD be r-FS-regularly-closed, and then hD is r-FS-semi-open, hence by (ⅴ), γCT(m,φ−1ψ(hD),r)⊑φ−1ψ(CT∗(n,hD,r))=φ−1ψ(hD). Thus, φ−1ψ(hD) is an r-FS-γ-closed set.
(ⅲ) ⇒ (ⅰ) Let mqu∈~Pu(Q) and hD∈~(S,N) with T∗n(hD)≥r such that mqu˜∈φ−1ψ(hD), and then we have mqu˜∈φ−1ψ(IT∗(n,CT∗(n,hD,r),r)). Since [IT∗(n,CT∗(n,hD,r),r)]c is r-FS-regularly-closed, by (ⅲ), φ−1ψ([IT∗(n,CT∗(n,hD,r),r)]c) is r-FS-γ-closed. Hence, φ−1ψ(IT∗(n,CT∗(n,hD,r),r)) is r-FS-γ-open and mqu˜∈γIT(m,φ−1ψ(IT∗(n,CT∗(n,hD,r),r)),r). So,
φ−1ψ(hD)⊑γIT(m,φ−1ψ(IT∗(n,CT∗(n,hD,r),r)),r). |
Hence, φψ is FS-almost γ-continuous.
Proposition 5.1. Let (Q,TM), (W,ℑH), and (S,T∗N) be FSTSs, and φψ:~(Q,M)⟶~(W,H), φ∗ψ∗:~(W,H)⟶~(S,N) be two FS-functions. Then the composition φ∗ψ∗∘φψ is FS-almost γ-continuous if φψ is FS-γ-continuous (resp. FS-γ-irresolute) and φ∗ψ∗ is FS-continuous (resp. FS-almost γ-continuous).
Proof. The proof follows from the previous definitions.
● r-fuzzy soft γ-regular and γ-normal spaces:
Definition 5.3. Let tC,hD∈~(Q,M), mqu∈~Pu(Q), and r∈I∘. An FSTS (Q,TM) is called an (ⅰ) r-FS-γ-regular space iff mqu¯∇tC for each r-FS-γ-closed set tC, there is gBj∈~(Q,M) with T(gBj)≥r for j∈{1,2}, such that mqu˜∈gB1, tC⊑gB2, and gB1¯∇gB2;
(ⅱ) r-FS-γ-normal space iff tC¯∇hD for each r-FS-γ-closed sets tC and hD, there is gBj∈~(Q,M) with T(gBj)≥r for j∈{1,2}, such that tC⊑gB1, hD⊑gB2, and gB1¯∇gB2.
Theorem 5.5. Let (Q,TM) be an FSTS, mqu∈~Pu(Q), tC,hD∈~(Q,M), and r∈I∘. The following statements are equivalent.
(ⅰ) (Q,TM) is an r-FS-γ-regular space.
(ⅱ) If mqu˜∈tC for each r-FS-γ-open set tC, there is hD with T(hD)≥r, such that mqu˜∈hD⊑CT(m,hD,r)⊑tC.
(ⅲ) If mqu¯∇tC for each r-FS-γ-closed set tC, there is gBj∈~(Q,M) with T(gBj)≥r for j∈{1,2}, such that mqu˜∈gB1, tC⊑gB2, and CT(m,gB1,r)¯∇CT(m,gB2,r).
Proof. (ⅰ) ⇒ (ⅱ) Let mqu˜∈tC for each r-FS-γ-open set tC, then mqu¯∇tcC. Since (Q,TM) is r-FS-γ-regular, there is hD,gB∈~(Q,M) with T(hD)≥r and T(gB)≥r, such that mqu˜∈hD, tcC⊑gB, and hD¯∇gB. Thus, mqu˜∈hD⊑gcB⊑tC, so mqu˜∈hD⊑CT(m,hD,r)⊑tC.
(ⅱ) ⇒ (ⅲ) Let mqu¯∇tC for each r-FS-γ-closed set tC, then mqu˜∈tcC. By (ⅱ), there is hD with T(hD)≥r, such that mqu˜∈hD⊑CT(m,hD,r)⊑tcC. Since T(hD)≥r, then hD is an r-FS-γ-open set and mqu˜∈hD. Again, by (ⅱ), there is gB with T(gB)≥r such that mqu˜∈gB⊑CT(m,gB,r)⊑hD⊑CT(m,hD,r)⊑tcC. It implies tC⊑(CT(m,hD,r))c=IT(m,hcD,r)⊑hcD. Set fA=IT(m,hcD,r), and then T(fA)≥r. So, CT(m,fA,r)⊑hcD⊑(CT(m,gB,r))c, that is, CT(m,fA,r)¯∇CT(m,gB,r).
(ⅲ) ⇒ (ⅰ) The proof is obvious.
Theorem 5.6. Let (Q,TM) be an FSTS, fA,tC,hD,∈~(Q,M), and r∈I∘. The following statements are equivalent.
(ⅰ) (Q,TM) is an r-FS-γ-normal space.
(ⅱ) If fA⊑tC for each r-FS-γ-closed set fA and r-FS-γ-open set tC, there is hD with T(hD)≥r, such that fA⊑hD⊑CT(m,hD,r)⊑tC.
(ⅲ) If fA¯∇tC for each r-FS-γ-closed sets fA and tC, there is gBj∈~(Q,M) with T(gBj)≥r for j∈{1,2}, such that fA⊑gB1, tC⊑gB2, and CT(m,gB1,r)¯∇CT(m,gB2,r).
Proof. The proof is similar to that of Theorem 5.5.
Theorem 5.7. Let φψ:~(Q,M)⟶~(S,N) be a bijective FS-γ-irresolute and FS-open function. If (Q,TM) is an r-FS-γ-regular (resp. r-FS-γ-normal) space, then (S,T∗N) is an r-FS-γ-regular (resp. r-FS-γ-normal) space.
Proof. Let nsu¯∇tC for each r-FS-γ-closed set tC∈~(S,N) and FS-γ-irresolute function φψ, then φ−1ψ(tC) is an r-FS-γ-closed set. Set nsu=φψ(mqu), and then mqu¯∇φ−1ψ(tC). Since (Q,TM) is an r-FS-γ-regular space, there is gBj∈~(Q,M) with T(gBj)≥r for j∈{1,2}, such that mqu˜∈gB1, φ−1ψ(tC)⊑gB2, and gB1¯∇gB2. Since φψ is an FS-open and bijective function, nsu˜∈φψ(gB1), tC=φψ(φ−1ψ(tC))⊑φψ(gB2), and φψ(gB1)¯∇φψ(gB2). Hence, (S,T∗N) is an r-FS-γ-regular space. The other case also follows similar lines.
Theorem 5.8. Let φψ:~(Q,M)⟶~(S,N) be an injective FS-continuous and FS-γ-irresolute closed function. If (S,T∗N) is an r-FS-γ-regular (resp. r-FS-γ-normal) space, then (Q,TM) is an r-FS-γ-regular (resp. r-FS-γ-normal) space.
Proof. Let mqu¯∇tC for each r-FS-γ-closed set tC∈~(Q,M) and injective FS-γ-irresolute closed function φψ, and then φψ(tC) is an r-FS-γ-closed set and φψ(mqu)¯∇φψ(tC). Since (S,T∗N) is an r-FS-γ-regular space, there is gBj∈~(S,N) with T∗(gBj)≥r for j∈{1,2}, such that φψ(mqu)˜∈gB1, φψ(tC)⊑gB2, and gB1¯∇gB2. Since φψ is an FS-continuous function, we have mqu˜∈φ−1ψ(gB1), tC⊑φ−1ψ(gB2) with T(φ−1ψ(gBi))≥r for i∈{1,2}, and φ−1ψ(gB1)¯∇φ−1ψ(gB2). Hence, (Q,TM) is an r-FS-γ-regular space. The other case also follows similar lines.
Theorem 5.9. Let φψ:~(Q,M)⟶~(S,N) be a surjective FS-γ-irresolute, FS-open, and FS-closed function. If (Q,TM) is an r-FS-γ-regular (resp. r-FS-γ-normal) space, then (S,T∗N) is an r-FS-γ-regular (resp. r-FS-γ-normal) space.
Proof. The proof is similar to that of Theorem 5.7.
● r-fuzzy soft γ-separated and γ-connected sets:
Definition 5.4. Let (Q,TM) be an FSTS, r∈I∘, and tC,hD∈~(Q,M), and then we have:
(ⅰ) Two FS-sets tC and hD are said to be r-FS-γ-separated sets iff hD¯∇γCT(m,tC,r) and tC¯∇γCT(m,hD,r) for each m∈M.
(ⅱ) Every FS-set which can not be expressed as the union of two r-FS-γ-separated sets is said to be an r-FS-γ-connected set.
Theorem 5.10. Let (Q,TM) be an FSTS, r∈I∘, and tC,hD∈~(Q,M), and then we have:
(ⅰ) If tC and hD are r-FS-γ-separated sets and fA, gB ∈~(Q,M) with fA⊑tC and gB⊑hD, then fA and gB are r-FS-γ-separated sets.
(ⅱ) If tC¯∇hD and either both are r-FS-γ-closed sets or both r-FS-γ-open sets, then tC and hD are r-FS-γ-separated sets.
(ⅲ) If tC and hD are either both r-FS-γ-closed sets or both r-FS-γ-open sets, then tC⊓hcD and hD⊓tcC are r-FS-γ-separated sets.
Proof. The proofs of (ⅰ) and (ⅱ) are obvious.
(ⅲ) Let tC and hD be r-FS-γ-open sets, and since tC⊓hcD⊑hcD, γCT(m,tC⊓hcD,r)⊑hcD. Hence, γCT(m,tC⊓hcD,r)¯∇hD. Thus, γCT(m,tC⊓hcD,r)¯∇(hD⊓tcC).
Again, since hD⊓tcC⊑tcC, γCT(m,hD⊓tcC,r)⊑tcC. Hence, γCT(m,hD ⊓tcC,r)¯∇tC. Thus, γCT(m,hD⊓tcC,r)¯∇(tC⊓hcD). Therefore, tC⊓hcD and hD⊓tcC are r-FS-γ-separated sets. The other case also follows similar lines.
Theorem 5.11. Two FS-sets tC and hD are r-FS-γ-separated sets in an FSTS (Q,TM) iff there exist two r-FS-γ-open sets fA and gB such that tC⊑fA, hD⊑gB, tC¯∇gB, and hD¯∇fA.
Proof. (⇒) Let tC and hD be r-FS-γ-separated sets in an FSTS (Q,TM), tC⊑(γCT(m,hD,r))c=fA, and hD⊑(γCT(m,tC,r))c=gB, where gB and fA are r-FS-γ-open sets. Thus, gB¯∇γCT(m,tC,r) and fA¯∇γCT(m,hD,r). Therefore, hD¯∇fA and tC¯∇gB.
(⇐) Let fA and gB be r-FS-γ-open sets such that hD⊑gB, tC⊑fA, hD¯∇fA, and tC¯∇gB. Then, hD⊑fcA and tC⊑gcB. Thus, γCT(m,hD,r)⊑fcA and γCT(m,tC,r)⊑gcB. Hence, γCT(m,hD,r)¯∇tC and γCT(m,tC,r)¯∇hD. Therefore, tC and hD are r-FS-γ-separated sets.
Theorem 5.12. In an FSTS (Q,TM), if hD∈~(Q,M) is an r-FS-γ-connected set such that hD⊑tC⊑γCT(m,hD,r), then tC is an r-FS-γ-connected set.
Proof. If tC is not an r-FS-γ-connected set, then there exists r-FS-γ-separated sets f∗A and g∗B ∈~(Q,M) such that tC=f∗A⊔g∗B. Let fA=hD⊓f∗A and gB=hD⊓g∗B, and then hD=gB⊔fA. Since fA⊑f∗A and gB⊑g∗B, hence by Theorem 5.10, fA and gB are r-FS-γ-separated sets. This is a contradiction. This shows that tC is an r-FS-γ-connected set.
In this study, a new class of FS-open sets, called r-FS-γ-open sets, has been defined in FSTSs based on fuzzy topologies in the sense of Šostak. The class of r-FS-γ-open sets is contained in the class of r-FS-β-open sets, and contains all r-FS-α-open, r-FS-semi-open, and r-FS-pre-open sets. Some characterizations of r-FS-γ-open sets along with their mutual relationships have been specified with the help of some illustrative examples. Overall, the notions of FS-γ-closure and FS-γ-interior operators have been introduced and studied. Thereafter, we defined and characterized some new FS-functions using r-FS-γ-open and r-FS-γ-closed sets, called FS-γ-continuous (resp. FS-γ-irresolute, FS-γ-open, FS-γ-irresolute open, FS-γ-closed, and FS-γ-irresolute closed) functions between FSTSs (Q,TM) and (S,T∗N). The relationships between these classes of functions have been discussed with the help of some illustrative examples. Moreover, the notions of FS-weakly (resp. FS-almost) γ-continuous functions, which are weaker forms of FS-γ-continuous functions, have been introduced and studied between FSTSs (Q,TM) and (S,T∗N). We also showed that FS-γ-continuity ⟹ FS-almost γ-continuity ⟹ FS-weak γ-continuity, but the converse may not be true. However, we defined new types of FS-separation axioms, called r-FS-γ-regular and r-FS-γ-normal spaces, and some properties have been obtained. In the end, the notion of an r-FS-γ-connected set has been introduced via r-FS-γ-closed sets. In the next articles, we intend to explore the following topics:
● Introducing r-FS-γ-compact (resp. r-FS-nearly γ-compact and r-FS-almost γ-compact) sets.
● Defining upper and lower γ-continuous (resp. weakly γ-continuous) FS-multifunctions.
● Extending these new notions given here to include FS-r-minimal spaces as defined in [34,42].
● Finding a use for these new notions given here in the frame of fuzzy ideals as defined in [43,44,45].
Fahad Alsharari: Conceptualization, writing original draft preparation, investigation, formal analysis; Ahmed O. M. Abubaker: Conceptualization, formal analysis, investigation, writing review and editing; Islam M. Taha: Supervision, conceptualization, formal analysis, writing original draft preparation, investigation, writing review and editing. All authors have reviewed and consented to the finalized version of the manuscript for publication.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This research is funded by the Deanship of Graduate Studies and Scientific Research at Jouf University through the Fast-Track Research Funding Program.
The authors declare that they have no conflict of interest.
[1] |
S. Patnaik, S. Sidhardh, F. Semperlotti, A Ritz-based finite element method for a fractional-order boundary value problem of nonlocal elasticity, Int. J. Solids Struct., 202 (2020), 398–417. https://doi.org/10.1016/j.ijsolstr.2020.05.034 doi: 10.1016/j.ijsolstr.2020.05.034
![]() |
[2] |
O. A. González-Estrada, S. Natarajan, J. J. Ródenas, S. P. A. Bordas, Error estimation for the polygonal finite element method for smooth and singular linear elasticity, Comput. Math. Appl., 92 (2021), 109–119. https://doi.org/10.1016/j.camwa.2021.03.017 doi: 10.1016/j.camwa.2021.03.017
![]() |
[3] |
A. M. Vargas, Finite difference method for solving fractional differential equations at irregular meshes, Math. Comput. Simulat., 193 (2022), 204–216. https://doi.org/10.1016/j.matcom.2021.10.010 doi: 10.1016/j.matcom.2021.10.010
![]() |
[4] |
T. A. Bullo, G. A. Degla, G. F. Duressa, Parameter-uniform finite difference method for singularly perturbed parabolic problem with two small parameters, Int. J. Comput. Methods Eng. Sci. Mech., 23 (2022), 210–218. https://doi.org/10.1080/15502287.2021.1948148 doi: 10.1080/15502287.2021.1948148
![]() |
[5] |
J. Jeon, J. Lee, S. J. Kim, Finite volume method network for the acceleration of unsteady computational fluid dynamics: Non‐reacting and reacting flows, Int. J. Energy Res., 46 (2022), 10770–10795. https://doi.org/10.1002/er.7879 doi: 10.1002/er.7879
![]() |
[6] |
U. S. Fjordholm, M. Musch, N. H. Risebro, Well-posedness and convergence of a finite volume method for conservation laws on networks, SIAM J. Numer. Anal., 60 (2022), 606–630. https://doi.org/10.1137/21M145001X doi: 10.1137/21M145001X
![]() |
[7] |
S. Sengupta, N. A. Sreejith, P. Mohanamuraly, G. Staffelbach, L. Gicquel, Global spectral analysis of the Lax-Wendroff-central difference scheme applied to convection-diffusion equation, Comput. Fluids, 242 (2022), 105508. https://doi.org/10.1016/j.compfluid.2022.105508 doi: 10.1016/j.compfluid.2022.105508
![]() |
[8] | R. Courant, Variational methods for the solution of problems of equilibrium and vibrations, Bull. Amer. Math. Soc., 49 (1943), 1–23. |
[9] |
R. W. Clough, Y. Rashid, Finite element analysis of axi-symmetric solids, J. Eng. Mech. Div., 91 (1965), 71–85. https://doi.org/10.1061/JMCEA3.0000585 doi: 10.1061/JMCEA3.0000585
![]() |
[10] | K. Feng, Difference scheme based on variational principle, Appl. Math. Comput., 2 (1965), 238–262. |
[11] |
M. I. Ivanov, I. A. Kremer, Y. M. Laevsky, Solving the pure Neumann problem by a mixed finite element method, Numer. Anal. Appl., 15 (2022), 316–330. https://doi.org/10.1134/S1995423922040048 doi: 10.1134/S1995423922040048
![]() |
[12] |
H. D. Gao, W. W. Sun, Optimal analysis of non-uniform Galerkin-mixed finite element approximations to the Ginzburg-Landau equations in superconductivity, SIAM J. Numer. Anal., 61 (2023), 929–951. https://doi.org/10.1137/22M1483670 doi: 10.1137/22M1483670
![]() |
[13] |
X. L. Wang, X. L. Meng, S. Y. Zhang, H. F. Zhou, A modified weak Galerkin finite element method for the linear elasticity problem in mixed form, J. Comput. Appl. Math., 420 (2023), 114743. https://doi.org/10.1016/j.cam.2022.114743 doi: 10.1016/j.cam.2022.114743
![]() |
[14] |
B. Deka, N. Kumar, A systematic study on weak Galerkin finite element method for second‐order parabolic problems, Numer. Methods Partial Differ. Equ., 39 (2023), 2444–2474. https://doi.org/10.1002/num.22973 doi: 10.1002/num.22973
![]() |
[15] |
E. Chung, Y. Efendiev, Y. B. Li, Q. Li, Generalized multiscale finite element method for the steady state linear Boltzmann equation, Multiscale Model. Simul., 18 (2020), 475–501. https://doi.org/10.1137/19M1256282 doi: 10.1137/19M1256282
![]() |
[16] |
J. H. Yue, G. R. Liu, M. Li, R. P. Niu, A cell-based smoothed finite element method for multi-body contact analysis using linear complementarity formulation, Int. J. Solids Struct., 141–142 (2018), 110–126. https://doi.org/10.1016/j.ijsolstr.2018.02.016 doi: 10.1016/j.ijsolstr.2018.02.016
![]() |
[17] |
Y. Cheng, Q. Zhang, Local analysis of the fully discrete local discontinuous Galerkin method for the time-dependent singularly perturbed problem, J. Comput. Math., 35 (2017), 265–288. https://doi.org/10.4208/jcm.1605-m2015-0398 doi: 10.4208/jcm.1605-m2015-0398
![]() |
[18] |
J. B. Lin, H. Li, Z. M. Dong, Z. H. Zhao, Error estimations of SUPC stabilized space-time finite element approximations for convection-diffusion-reaction equations (Chinese), Math. Appl., 33 (2020), 275–294. https://doi.org/10.13642/j.cnki.42-1184/o1.2020.02.002 doi: 10.13642/j.cnki.42-1184/o1.2020.02.002
![]() |
[19] |
V. D. Varma, S. K. Nadupuri, N. Chamakuri, A posteriori error estimates and an adaptive finite element solution for the system of unsteady convection-diffusion-reaction equations in fluidized beds, Appl. Numer. Math., 163 (2021), 108–125. https://doi.org/10.1016/j.apnum.2021.01.012 doi: 10.1016/j.apnum.2021.01.012
![]() |
[20] |
Z. C. Shi, On spline finite element method, Math. Numer. Sin., 1 (1979), 50–72. https://doi.org/10.12286/jssx.1979.1.50 doi: 10.12286/jssx.1979.1.50
![]() |
[21] |
T. J. R. Hughes, J. A. Cottrell, Y. Bazilevs, Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement, Comput. Methods Appl. Mech. Eng., 194 (2005), 4135–4195. https://doi.org/10.1016/j.cma.2004.10.008 doi: 10.1016/j.cma.2004.10.008
![]() |
[22] |
X. Li, F. Chen, On the instability in the dimension of splines spaces over T-meshes, Comput. Aided Geom. D., 28 (2011), 420–426. https://doi.org/10.1016/j.cagd.2011.08.001 doi: 10.1016/j.cagd.2011.08.001
![]() |
[23] |
X. Peng, H. J. Lian, Z. W. Ma, C. Zheng, Intrinsic extended isogeometric analysis with emphasis on capturing high gradients or singularities, Eng. Anal. Bound. Elem., 134 (2022), 231–240. https://doi.org/10.1016/j.enganabound.2021.09.022 doi: 10.1016/j.enganabound.2021.09.022
![]() |
[24] |
M. J. Peake, J. Trevelyan, G. Coates, Extended isogeometric boundary element method (XIBEM) for three-dimensional medium-wave acoustic scattering problems, Comput. Methods Appl. Mech. Eng., 284 (2015), 762–780. https://doi.org/10.1016/j.cma.2014.10.039 doi: 10.1016/j.cma.2014.10.039
![]() |
[25] |
Y. P. Zhu, X. L. Han, New cubic rational basis with tension shape parameters, Appl. Math. J. Chin. Univ., 30 (2015), 273–298. https://doi.org/10.1007/s11766-015-3232-8 doi: 10.1007/s11766-015-3232-8
![]() |
[26] |
Q. Y. Chen, G. Z. Wang, A class of Bézier-like curves, Comput. Aided Geom. D., 20 (2003), 29–39. https://doi.org/10.1016/S0167-8396(03)00003-7 doi: 10.1016/S0167-8396(03)00003-7
![]() |
[27] |
C. Y. Li, C. Zhu, Designing developable C-Bézier surface with shape parameters, Mathematics, 8 (2020), 1–21. https://doi.org/10.3390/math8030402 doi: 10.3390/math8030402
![]() |
[28] |
L. Y. Sun, F. M. Su, Application of C-Bézier and H-Bézier basis functions to numerical solution of convection-diffusion equations, Bound. Value. Probl., 2022 (2022), 66. https://doi.org/10.1186/s13661-022-01647-5 doi: 10.1186/s13661-022-01647-5
![]() |