Next Article in Journal
Characterization Results of Extremization Models with Interval Values
Next Article in Special Issue
Numerical Analysis and Optimization
Previous Article in Journal
On the Complete Indeterminacy and the Chaoticity of the Generalized Heun Operator in Bargmann Space
Previous Article in Special Issue
Simultaneous Method for Solving Certain Systems of Matrix Equations with Two Unknowns
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Convergence Analysis for Cayley Variational Inclusion Problem Involving XOR and XNOR Operations

1
Department of Mathematics, Aligarh Muslim University, Aligarh 202002, India
2
Department of Mechanical Engineering, College of Engineering, Qassim University, Buraydah 52571, Saudi Arabia
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(3), 149; https://doi.org/10.3390/axioms14030149
Submission received: 21 January 2025 / Revised: 12 February 2025 / Accepted: 17 February 2025 / Published: 20 February 2025
(This article belongs to the Special Issue Numerical Analysis and Optimization)

Abstract

:
In this article, we introduce and study a generalized Cayley variational inclusion problem incorporating XOR and XNOR operations. We establish an equivalent fixed-point formulation and demonstrate the Lipschitz continuity of the generalized Cayley approximation operator. Furthermore, we analyze the existence and convergence of the proposed problem using an implicit iterative algorithm. The iterative algorithm and numerical results presented in this study significantly enhance previously known findings in this domain. Finally, a numerical result is provided to support our main result and validate the proposed algorithm using MATLAB programming.

1. Introduction

In 1994, Hassouni and Moudafi [1] introduced the concept of variational inclusion, a generalized form of variational inequalities. Since then, variational inclusions have been extensively studied by researchers to address challenges in diverse fields such as finance, economics, transportation, network analysis, engineering and technology.
A further generalization of Wiener–Hopf equations, known as resolvent equations, were introduced by Noor [2]. Various generalized resolvent operators associated with different monotone operators can be found in the literature. Among these, Cayley approximation operators play a significant role in variational analysis, as they are closely related to resolvent operators. These operators have been effectively applied to study wave equations, heat equations, heat flow and coupled linear sound equations.
Additionally, when dealing with two Boolean operands, the XOR operation determines whether they can pass one another or obstruct each other. A practical demonstration of XOR logic can be observed using polarizing filters, such as those found in polarizing sunglasses. If we hold a polarizing filter up to the lenses of these sunglasses and look through both filters in series, light will pass through when the filters are aligned. However, if one filter is rotated by 90 degrees, the combination blocks the light. This process visually demonstrates XOR logic behavior.
The XOR logical operation is a binary operation that takes two Boolean operands and returns true only if the operands differ, yielding a false result when both operands are identical. XOR is commonly employed to test for the simultaneous falsehood of two conditions and is extensively used in cryptography, error detection (producing parity bits) and fault tolerance. Similarly, the XNOR operation compares two input bits and produces one output bit. If the input bits are identical, the result is one; otherwise, it is zero. Like XOR, XNOR is both commutative and associative. These operations are utilized in hardware for generating pseudo-random numbers and are fundamental in digital computing and linear separability applications. For further details on the XOR operation, refer to the resources listed [3,4,5,6,7,8,9].
In this article, we explore a generalized Cayley inclusion problem involving multi-valued operators and the XOR operation, owing to the significance and applications of the previously mentioned concepts. An iterative algorithm is developed based on the fixed-point equation, and we derive results on existence and convergence. This has applications in solving heat, wave and heat flow problems. A numerical result is presented using MATLAB2024b, accompanied by computational tables and convergence graphs for illustration.

2. Elementary Tools

In this paper, we assume that E ˘ is a real-ordered Hilbert space equipped with norm | | . | | and inner product . , . . Again, C E ˘ is a closed convex cone, C ( E ˘ ) is the family of nonempty compact subsets of E ˘ , and 2 E ˘ represents the set of all nonempty subsets of C ( E ˘ ) .
Definition 1 
([10]). Let r and t be two elements in the real-ordered Hilbert space E ˘ . Consider lub { r , t } and glb { r , t } for the set { r , t } to exist, where lub means least upper bound and glb means greatest lower bound for the set { r , t } . Then, some binary operations are defined as follows:
(i) 
r t = i n f { r , t } ;
(ii) 
r t = s u p { r , t } ;
(iii) 
r t = ( r t ) ( r t ) ;
(iv) 
r t = ( r t ) ( t r ) .
Here, ∨ is the least upper bound or inf for the set { r , t } , is the greatest lower bound or s u p for the set { r , t } , is called an XOR operation andis called an XNOR operation.
Definition 2 
([10]). Let r be any element of the set C E ˘ ; then, C E ˘ is said to be a cone which implies λ r C E ˘ for every positive scalar λ.
Definition 3 
([11,12]). A cone C E ˘ is said to be a normal cone if and only if there exists a constant λ Π E ˘ > 0 such that 0 r t implies | | r | | λ Π E ˘ | | t | | .
Definition 4 
([11,12]). Let r and t be two elements in E ˘ ; then, C E ˘ is called a cone, provided r t holds if and only if r t C E ˘ , where r and t are said to be comparable if either r t or t r . The comparable elements are represented by r t .
Proposition 1 
([12]). Letandbe the XOR operation and XNOR operation, respectively. Then, the following conditions hold:
(i) 
r t = 0 , ( r t ) = ( t r ) , ( r t ) = 0 , ( r t ) = ( t r ) , ( r t ) = ( r t ) ;
(ii) 
if r 0 then r 0 r r 0 ;
(iii) 
( λ r ) ( λ t ) = | λ | ( r t ) ;
(iv) 
0 r t , if r t ;
(v) 
if r t then r t = 0 if and only if r = t .
Proposition 2 
([11]). Let C E ˘ be a normal cone in E ˘ with normal constant λ Π E ˘ > 0 , ; then, for each r , t E ˘ the following postulate are holds:
(i) 
| | 0 0 | | = | | 0 | | = 0 ;
(ii) 
| | r t | | = | | r | | | | t | | | | r | | + | | t | | ;
(iii) 
| | r t | | | | r t | | λ Π | | r t | | ;
(iv) 
if r t , then | | r t | | | | r t | | .
Definition 5. 
A single-valued mapping A ˘ : E ˘ E ˘ is called Lipchitz-continuous if there exists a constant λ A ˘ > 0 such that
| | A ˘ ( r ) A ˘ ( t ) | | λ A ˘ | | r t | | , r , t E ˘ .
Definition 6. 
Let us consider Υ : E ˘ × E ˘ × E ˘ E ˘ as a single-valued mapping and D : E ˘ 2 E ˘ as the multi-valued mapping. Then,
(i) 
Υ is called Lipschitz continuous in the first argument if there exists a constant λ Υ 1 > 0 and for any μ 1 D ( r ) , μ 2 D ( t ) such that
| | Υ ( μ 1 , . , . ) Υ ( μ 2 , . , . ) | | λ Υ 1 | | μ 1 μ 2 | | , r , t C ( E ˘ ) .
(ii) 
Υ is called Lipschitz continuous in the second argument if there exists a constant λ Υ 2 > 0 and for any μ 1 D ( r ) , μ 2 D ( t ) such that
| | Υ ( . , μ 1 , . ) Υ ( . , μ 2 , . ) | | λ Υ 2 | | μ 1 μ 2 | | , r , t C ( E ˘ ) .
(iii) 
Υ is called Lipschitz continuous in the third argument if there exists a constant λ Υ 3 > 0 and for any μ 1 D ( r ) , μ 2 D ( t ) such that
| | Υ ( . , . , μ 1 ) Υ ( . , . , μ 2 ) | | λ Υ 3 | | μ 1 μ 2 | | , r , t C ( E ˘ ) .
Definition 7. 
Consider a multi-valued mapping ψ : E ˘ C ( E ˘ ) that is said to be D -Lipschitz continuous. Then, there exists a constant λ D ψ > 0 such that
D ( ψ ( r ) , ψ ( t ) ) λ D ψ | | r t | | , r , t C ( E ˘ ) .
Definition 8. 
Suppose D : E ˘ 2 E ˘ is a multi-valued mapping and A ˘ : E ˘ E ˘ is a single-valued mapping. The resolvent operator R A ˘ , ρ D : E ˘ E ˘ is defined as
R A ˘ , ρ D ( t ) = [ A ˘ + ρ D ] 1 ( t ) , r , t E ˘ .
τ is an identity mapping and ρ > 0 is a constant.
Definition 9. 
Suppose D : E ˘ 2 E ˘ is a multi-valued mapping and A ˘ : E ˘ E ˘ is a single-valued mapping. The Cayley approximation operator C A ˘ , ρ D : E ˘ E ˘ is defined as
C A ˘ , ρ D ( t ) = 2 R A ˘ , ρ D A ˘ ( t ) , r , t E ˘ .
τ is an identity mapping and ρ > 0 is a constant.
Definition 10. 
Let A ˘ : E ˘ E ˘ be a single-valued mapping and D : E ˘ 2 E ˘ be a multi-valued mapping. Then,
(i) 
A ˘ is called strong comparison mapping if A ˘ is comparison mapping and A ˘ ( r ) A ˘ ( t ) if and only if r t , r , t E ˘ .
(ii) 
A ˘ is called ρ-order non-extended mapping if there exists a constant ρ > 0 such that
ρ ( r t ) ( A ˘ ( r ) A ˘ ( t ) ) , r , t E ˘ .
(iii) 
A ˘ is called a comparison mapping if r t , r A ˘ ( r ) and t A ˘ ( t ) , such that
A ˘ ( r ) A ˘ ( t ) , r , t E ˘ .
(iv) 
D is called a comparison mapping if any ϑ r D ( r ) , r ϑ r and if r t , as well as for any ϑ r D ( r ) and ϑ t D ( t ) , such that
ϑ r ϑ t , r , t E ˘ .
(v) 
The comparison mapping D is called an α non-ordinary difference mapping if ϑ r D ( r ) and ϑ t D ( t ) such that
( ϑ r ϑ t ) α A ˘ ( r t ) = 0 , r , t E ˘ .
(vi) 
The comparison mapping D is called ρ-ordered rectangular mapping. If there exists a constant ρ > 0 , then there exists ϑ r D ( r ) and ϑ t D ( t ) such that
( ϑ r ϑ t ) ( r t ) ρ | | r t | | 2 , r , t E ˘ .
(vii) 
D is called a weak comparison mapping if any r , t E ˘ or r t and there exists ϑ r D ( r ) , ϑ t D ( t ) , r ϑ r , and t ϑ t such that
ϑ r ϑ t , r , t E ˘ .
(viii) 
D is called ρ weak-ordered different mapping if there exists a constant ρ > 0 , and there exists ϑ r D ( r ) and ϑ t D ( t ) such that
ρ ( ϑ r ϑ t ) ( r t ) , r , t E ˘ .
(ix) 
A weak comparison mapping D is called ( α A ˘ , ρ ) weak ANODD if it is an α A ˘ weak non-ordinary difference mapping and ρ-order different weak-comparison mapping with respect to A ˘ and
( A ˘ + ρ D ) E ˘ = E ˘ , ρ > 0 .
Lemma 1. 
Suppose a multi-valued mapping D : E ˘ 2 E ˘ is an ordered ( α A ˘ , ρ ) -weak ANODD mapping and A ˘ : E ˘ E ˘ is called ξ-order non-extended mapping with respect to A ˘ such that
R A ˘ , ρ D ( r ) R A ˘ , ρ D ( t ) R θ | | r t | | , r , t E ˘ .
where R θ = 1 ξ ( α A ˘ ρ 1 ) , ρ > 1 ξ , and α A ˘ > 1 ρ .
Thus, the resolvent operator R A ˘ , ρ D is Lipschitz-type-continuous.
Proposition 3. 
Suppose D : E ˘ 2 E ˘ is a multi-valued mapping and a single-valued mapping A ˘ : E ˘ E ˘ is λ A ˘ -Lipschitz continuous. Then, the generalized Cayley approximation operator C A ˘ , ρ D is λ C - Lipschitz continuous, which provides r t , A ˘ ( r ) A ˘ ( t ) , R A ˘ , ρ D ( r ) R A ˘ , ρ D ( t ) and C A ˘ , ρ D ( r ) C A ˘ , ρ D ( t ) such that
C A ˘ , ρ D ( r ) C A ˘ , ρ D ( t ) λ C r t , r , t E ˘ .
where λ C = ξ λ A ˘ ( α A ˘ ρ 1 ) + 2 ξ ( α A ˘ ρ 1 ) .
Proof. 
Using the Lipschitz continuity of A ˘ and R A ˘ , ρ D , we evaluate
C A ˘ , ρ D ( r ) C A ˘ , ρ D ( t ) = [ 2 R A ˘ , ρ D A ˘ ] ( r ) [ 2 R A ˘ , ρ D A ˘ ] ( t ) A ˘ ( r ) A ˘ ( t ) + 2 R A ˘ , ρ D ( r ) R A ˘ , ρ D ( t ) λ A ˘ | | r t | | + 2 ξ ( α A ˘ ρ 1 ) | | r t | | ξ λ A ˘ ( α A ˘ ρ 1 ) + 2 ξ ( α A ˘ ρ 1 ) | | r t | | = λ C | | r t | |
where λ C = ξ λ A ˘ ( α A ˘ ρ 1 ) + 2 ξ ( α A ˘ ρ 1 ) .    □

3. Statement of the Cayley Inclusion Problem

Suppose g , A ˘ , B ˘ : E ˘ E ˘ are the single-valued mappings and also D : E ˘ 2 E ˘ are the multi-valued mapping; again, let us consider Υ : E ˘ × E ˘ × E ˘ E ˘ to be another mapping and ψ , ϕ , φ : E ˘ C ( E ˘ ) to be the multi-valued mappings. Let C A ˘ , ρ D be the generalized Cayley approximation operators for any ρ > 0 .
Find r E ˘ , u ˘ ψ ( r ) , v ˘ ϕ ( r ) and w ˘ φ ( r ) such that
0 C A ˘ , ρ D ( B ˘ ( r ) ) + Υ ( u ˘ , v ˘ , w ˘ ) D ( g ( r ) ) .
If C A ˘ , ρ D ( B ˘ ( r ) ) = 0 , Υ ( u ˘ , v ˘ , w ˘ ) = 0 and D ( g ( r ) ) = D ( r ) , then problem (1) reduces to the problem of finding r E ˘ such that
0 D ( r )
which is the fundamental issue involving the XOR operation and the Cayley approximation operator, represented by Rockafellar [13].

4. Fixed-Point Formulation and Iterative Algorithm

In this section, we demonstrate that problem (1) is equivalent to a fixed-point equation.
Lemma 2. 
Let us consider r E ˘ , u ˘ ψ ( r ) , v ˘ ϕ ( r ) and w ˘ φ ( r ) to be the solutions of Cayley variational inclusion problem (1) involving an XOR operation and an XNOR operation if and only if the following equation is satisfied:
g ( r ) = R A ˘ , ρ D A ˘ ( g ( r ) ) + ρ Υ ( u ˘ , v ˘ , w ˘ ) C A ˘ , ρ D ( B ˘ ( r ) ) .
Proof. 
Suppose r E ˘ , u ˘ ψ ( r ) , v ˘ ϕ ( r ) and w ˘ φ ( r ) satisfy Equation (2). Then, we have
g ( r ) = R A ˘ , ρ D A ˘ ( g ( r ) ) + ρ Υ ( u ˘ , v ˘ , w ˘ ) C A ˘ , ρ D ( B ˘ ( r ) ) = ( A ˘ + ρ D ) 1 A ˘ ( g ( r ) ) + ρ Υ ( u ˘ , v ˘ , w ˘ ) C A ˘ , ρ D ( B ˘ ( r ) ) ( A ˘ + ρ D ) g ( r ) = A ˘ ( g ( r ) ) + ρ ( Υ ( u ˘ , v ˘ , w ˘ ) C A ˘ , ρ D ( B ˘ ( r ) ) = A ˘ ( g ( r ) ) + ρ Υ ( u ˘ , v ˘ , w ˘ ) C A ˘ , ρ D ( B ˘ ( r ) )
D ( g ( r ) ) = Υ ( u ˘ , v ˘ , w ˘ ) C A ˘ , ρ D ( B ˘ ( r ) ) Υ ( u ˘ , v ˘ , w ˘ ) D ( g ( r ) ) = Υ ( u ˘ , v ˘ , w ˘ ) Υ ( u ˘ , v ˘ , w ˘ ) C A ˘ , ρ D ( B ˘ ( r ) ) = C A ˘ , ρ D ( B ˘ ( r ) ) 0 C A ˘ , ρ D ( B ˘ ( r ) ) + Υ ( u ˘ , v ˘ , w ˘ ) D ( g ( r ) ) ,
which is the required Cayley variational inclusion problem (1). Now, we establish the subsequent algorithm utilizing Lemma 2 to solve the Cayley variational inclusion problem (1).    □

5. Main Result

In this section, we establish an existence and convergence result via Algorithm 1 for the generalized Cayley variational inclusion problem, which incorporates XOR and XNOR operations (1).
Algorithm 1 For every r 0 E ˘ , u ˘ ψ ( r 0 ) , v ˘ ϕ ( r 0 ) and w ˘ φ ( r 0 ) , enumerate the sequence { r n } , { u ˘ n } , { v ˘ n } and { w ˘ n } by taking after the iterative algorithm.
g ( r n + 1 ) = ( 1 α ) g ( r n ) + α R A ˘ , ρ D A ˘ ( g ( r n ) ) + ρ Υ ( u ˘ n , v ˘ n , w ˘ n ) C A ˘ , ρ D ( B ˘ ( r n ) ) .
Let us consider u ˘ n + 1 ψ ( r n + 1 ) , v ˘ n + 1 ϕ ( r n + 1 ) and w ˘ n + 1 φ ( r n + 1 ) such that
| | u ˘ n u ˘ n + 1 | | D ( ψ ( r n ) , ψ ( r n 1 ) ) ,
| | v ˘ n v ˘ n + 1 | | D ( ϕ ( r n ) , ϕ ( r n 1 ) ) ,
| | w ˘ n w ˘ n + 1 | | D ( φ ( r n ) , φ ( r n 1 ) ) ,
where 0 α 1 and ρ > 0 are constants and n = 0 , 1 , 2 , 3 , · · ·
Theorem 1. 
Let E ˘ be a real-ordered Hilbert space and C E ˘ be a normal cone in E ˘ . Let us consider g , A ˘ , B ˘ : E ˘ E ˘ as Lipschitz continuous mappings with constants λ g > 0 , λ A ˘ > 0 , and λ B ˘ > 0 , respectively. Also, we consider Υ : E ˘ × E ˘ × E ˘ E ˘ to be a Lipschitz continuous mapping with constants λ Υ 1 > 0 , λ Υ 2 > 0 and λ Υ 3 > 0 , respectively, and D : E ˘ 2 E ˘ to be the multi-valued mapping. Let C A ˘ , ρ D be the generalized Cayley approximation operator with Lipschitz continuous λ C , let the generalized resolvent operator R A ˘ , ρ D be R θ Lipschitz continuous and let ψ , ϕ , φ : E ˘ C ( E ˘ ) be the multi-valued mappings with constants λ D ψ > 0 , λ D ϕ > 0 and λ D φ > 0 , respectively. r t , R A ˘ , ρ D ( r ) R A ˘ , ρ D ( t ) , C A ˘ , ρ D ( A ˘ ( r ) ) C A ˘ , ρ D ( A ˘ ( t ) ) , g ( r n + 1 ) g ( r n ) , Υ ( u ˘ n , v ˘ n , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n 1 ) and A ˘ ( r ) A ˘ ( t ) for all r , t E ˘ , where ρ > 0 is a constant. Suppose that the following conditions are satisfied:
0 < λ Π E ˘ δ g { ( 1 α ) λ g + α R θ λ A ˘ λ g + α ρ R θ λ C λ B ˘ + α ρ R θ λ Υ 1 λ D ψ + α ρ R θ λ Υ 2 λ D ϕ + α ρ R θ λ Υ 3 λ D φ } < 1
where R θ = 1 ξ ( α A ˘ ρ 1 ) , ρ > 1 ξ , α A ˘ > 1 ρ , λ C = ξ λ A ˘ ( α A ˘ ρ 1 ) + 2 ξ ( α A ˘ ρ 1 ) , 0 α 1 , ρ > 0 , n = 0 , 1 , 2 , 3 , · · · Then, ( r , u ˘ , v ˘ , w ˘ ) is the solution of the Cayley variational inclusions problem (1) involving an XOR operation and an XNOR operation, and the sequences { r n } , { u ˘ n } , { v ˘ n } and { w ˘ n } , generated by Algorithm 1, strongly convergence at r , u ˘ , v ˘ and w ˘ , respectively.
Proof. 
We have
0 g ( r n + 1 ) g ( r n ) = { ( 1 α ) g ( r n ) + α R A ˘ , ρ D [ A ˘ ( g ( r n ) ) + ρ { Υ ( u ˘ n , v ˘ n , w ˘ n ) C A ˘ , ρ D ( B ˘ ( r n ) ) } ] } { ( 1 α ) g ( r n 1 ) + α R A ˘ , ρ D [ A ˘ ( g ( r n 1 ) ) + ρ Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n 1 ) C A ˘ , ρ D ( B ˘ ( r n 1 ) ) ] } ( 1 α ) ( g ( r n ) g ( r n 1 ) ) + α { R A ˘ , ρ D [ A ˘ ( g ( r n ) ) + ρ { Υ ( u ˘ n , v ˘ n , w ˘ n ) C A ˘ , ρ D ( B ˘ ( r n ) ) } ] R A ˘ , ρ D [ A ˘ ( g ( r n 1 ) ) + ρ Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n 1 ) C A ˘ , ρ D ( B ˘ ( r n 1 ) ) ] } .
Using (4), (5), (6), (iii) of Proposition 2, and (8), we obtain,
| | g ( r n + 1 ) g ( r n ) | | ( 1 α ) λ Π E ˘ | | g ( r n ) g ( r n 1 ) | | + α λ Π E ˘ | | R A ˘ , ρ D [ A ˘ ( g ( r n ) ) + ρ { Υ ( u ˘ n , v ˘ n , w ˘ n ) C A ˘ , ρ D ( B ˘ ( r n ) ) } ] R A ˘ , ρ D [ A ˘ ( g ( r n 1 ) ) + ρ { Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n 1 ) C A ˘ , ρ D ( B ˘ ( r n 1 ) ) } ] | | ( 1 α ) λ Π E ˘ | | g ( r n ) g ( r n 1 ) | | + α λ Π E ˘ R θ | | [ A ˘ ( g ( r n ) ) + ρ { Υ ( u ˘ n , v ˘ n , w ˘ n ) C A ˘ , ρ D ( B ˘ ( r n ) ) } ] [ A ˘ ( g ( r n 1 ) ) + ρ { Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n 1 ) C A ˘ , ρ D ( B ˘ ( r n 1 ) ) } ] | | ( 1 α ) λ Π E ˘ | | g ( r n ) g ( r n 1 ) | | + α λ Π E ˘ R θ | | A ˘ ( g ( r n ) ) A ˘ ( g ( r n 1 ) ) | | + α ρ R θ λ Π E ˘ | | Υ ( u ˘ n , v ˘ n , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n 1 ) | | + α ρ R θ λ Π E ˘ | | C A ˘ , ρ D ( B ˘ ( r n ) ) C A ˘ , ρ D ( B ˘ ( r n 1 ) ) | | ( 1 α ) λ Π E ˘ λ g | | r n r n 1 | | + α λ Π E ˘ R θ λ A ˘ | | g ( r n ) g ( r n 1 ) | | + α ρ R θ λ Π E ˘ | | Υ ( u ˘ n , v ˘ n , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n 1 ) | | + α ρ R θ λ Π E ˘ λ C | | B ˘ ( r n ) B ˘ ( r n 1 ) | | ( 1 α ) λ Π E ˘ λ g | | r n r n 1 | | + α λ Π E ˘ R θ λ A ˘ λ g | | r n r n 1 | | + α ρ R θ λ Π E ˘ λ C λ B ˘ | | r n r n 1 | | + α ρ R θ λ Π E ˘ | | Υ ( u ˘ n , v ˘ n , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n 1 ) | | .
Now, we have the following from the definition of D -Lipschitz continuity and (i) of Proposition 1.
| | Υ ( u ˘ n , v ˘ n , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n 1 ) | | = | | Υ ( u ˘ n , v ˘ n , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n 1 ) | | = | | Υ ( u ˘ n , v ˘ n , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n , w ˘ n ) | | + | | Υ ( u ˘ n 1 , v ˘ n , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n ) | | + | | Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n ) Υ ( u ˘ n 1 , v ˘ n 1 , w ˘ n 1 ) | | λ Υ 1 | | u ˘ n u ˘ n 1 | | + λ Υ 2 | | v ˘ n v ˘ n 1 | | + λ Υ 3 | | w ˘ n w ˘ n 1 | | λ Υ 1 D ( ψ ( r n ) , ψ ( r n 1 ) ) + λ Υ 2 D ( ϕ ( r n ) , ϕ ( r n 1 ) ) + λ Υ 3 D ( φ ( r n ) , φ ( r n 1 ) ) λ Υ 1 λ D ψ | | r n r n 1 | | + λ Υ 2 λ D ϕ | | r n r n 1 | | + λ Υ 3 λ D φ | | r n r n 1 | | .
Combining (9) and (10), we obtain
| | g ( r n + 1 ) g ( r n ) | | ( 1 α ) λ Π E ˘ λ g | | r n r n 1 | | + α λ Π E ˘ R θ λ A ˘ λ g | | r n r n 1 | | + α ρ R θ λ Π E ˘ λ C λ B ˘ | | r n r n 1 | | + α ρ R θ λ Π E ˘ λ Υ 1 λ D ψ | | r n r n 1 | | + α ρ R θ λ Π E ˘ λ Υ 2 λ D ϕ | | r n r n 1 | | + α ρ R θ λ Π E ˘ λ Υ 3 λ D φ | | r n r n 1 | | { ( 1 α ) λ Π E ˘ λ g + α λ Π E ˘ R θ λ A ˘ λ g + α ρ R θ λ Π E ˘ λ C λ B ˘ + α ρ R θ λ Π E ˘ λ Υ 1 λ D ψ + α ρ R θ λ Π E ˘ λ Υ 2 λ D ϕ + α ρ R θ λ Π E ˘ λ Υ 3 λ D φ } | | r n r n 1 | | .
Using (iv) of Proposition 2 in (11), we have
| | g ( r n + 1 ) g ( r n ) | | { ( 1 α ) λ Π E ˘ λ g + α λ Π E ˘ R θ λ A ˘ λ g + α ρ R θ λ Π E ˘ λ C λ B ˘ + α ρ R θ λ Π E ˘ λ Υ 1 λ D ψ + α ρ R θ λ Π E ˘ λ Υ 2 λ D ϕ + α ρ R θ λ Π E ˘ λ Υ 3 λ D φ } | | r n r n 1 | | .
Since g is strongly monotone, we have
| | g ( r n + 1 ) g ( r n ) | | δ g | | r n + 1 r n | |
which implies that
| | r n + 1 r n | | 1 δ g | | g ( r n + 1 ) g ( r n ) | | .
Now, combining (12) and (13), we obtain
| | r n + 1 r n | | 1 δ g { ( 1 α ) λ Π E ˘ λ g + α λ Π E ˘ R θ λ A ˘ λ g + α ρ R θ λ Π E ˘ λ C λ B ˘ + α ρ R θ λ Π E ˘ λ Υ 1 λ D ψ + α ρ R θ λ Π E ˘ λ Υ 2 λ D ϕ + α ρ R θ λ Π E ˘ λ Υ 3 λ D φ } | | r n r n 1 | | λ Π E ˘ δ g { ( 1 α ) λ g + α R θ λ A ˘ λ g + α ρ R θ λ C λ B ˘ + α ρ R θ λ Υ 1 λ D ψ + α ρ R θ λ Υ 2 λ D ϕ + α ρ R θ λ Υ 3 λ D φ } | | r n r n 1 | | Ω ( θ ) | | r n r n 1 | | ,
where
Ω ( θ ) = λ Π E ˘ δ g { ( 1 α ) λ g + α R θ λ A ˘ λ g + α ρ R θ λ C λ B ˘ + α ρ R θ λ Υ 1 λ D ψ + α ρ R θ λ Υ 2 λ D ϕ + α ρ R θ λ Υ 3 λ D φ }
From condition (7), it is clear that Ω ( θ ) < 1 , where Ω ( θ ) = λ Π E ˘ δ g { ( 1 α ) λ g + α R θ λ A ˘ λ g + α ρ R θ λ C λ B ˘ + α ρ R θ λ Υ 1 λ D ψ + α ρ R θ λ Υ 2 λ D ϕ + α ρ R θ λ Υ 3 λ D φ } . Consequently, (14) implies that { r n } is a Cauchy sequence in E ˘ . Thus, there exists r E ˘ such that r n r as n .
From (4), (5) and (6), we have
| | u ˘ n u ˘ n 1 | | D ( ψ ( r n ) , ψ ( r n 1 ) ) λ D ψ | | r n r | | λ D ψ | | r n r | | ,
| | v ˘ n v ˘ n 1 | | D ( ϕ ( r n ) , ϕ ( r n 1 ) ) λ D ϕ | | r n r | | λ D ϕ | | r n r | | ,
| | w ˘ n w ˘ n 1 | | D ( φ ( r n ) , φ ( r n 1 ) ) λ D φ | | r n r | | λ D φ | | r n r | | .
Thus { u ˘ n } , { v ˘ n } and { w ˘ n } , are also Cauchy sequences in E ˘ . Therefore, there exists r E ˘ , u ˘ ψ ( r ) , v ˘ ϕ ( r ) and w ˘ φ ( r ) such that u ˘ n u ˘ , v ˘ n v ˘ and w ˘ n w ˘ as n . Next, we show that u ˘ n u ˘ ψ ( r ) , v ˘ n v ˘ ϕ ( r ) and w ˘ n w ˘ φ ( r ) as n .
Furthermore,
d ( u ˘ , ψ ( r ) ) i n f { | | u ˘ t | | , t ψ ( r ) } | | u ˘ u ˘ n | | + d ( u ˘ n , ψ ( r ) ) | | u ˘ u ˘ n | | + d ( ψ ( r n ) , ψ ( r ) ) | | u ˘ u ˘ n | | + λ D ψ | | r n r | | | | u ˘ u ˘ n | | + λ D ψ | | r n r | | 0 , a s n .
Since ψ ( r ) is closed, we have u ˘ ψ ( r ) . Similarly, we can show that v ˘ ϕ ( r ) and w ˘ φ ( r ) . Finally, we apply the continuity of g , A ˘ , B ˘ , Υ , R A ˘ , ρ D , and C A ˘ , ρ D , which implies that
g ( r ) = R A ˘ , ρ D A ˘ ( g ( r ) ) + ρ Υ ( u ˘ , v ˘ , w ˘ ) C A ˘ , ρ D ( B ˘ ( r ) ) .
By Lemma 2, r E ˘ is the solution of the Cayley variational inclusion problem (1), where u ˘ ψ ( r ) , v ˘ ϕ ( r ) and w ˘ φ ( r ) . □

6. Numerical Result

To illustrate Theorem 1, we present the following numerical example, implemented using MATLAB 2024b, accompanied by three computation tables and three convergence graphs.
Example 1. 
Suppose E ˘ = R involving inner product . , . and norm | | . | | , and D : E ˘ 2 E ˘ is a multi-valued mapping.
(i) 
Again, let us consider g , A ˘ , B ˘ : E ˘ E ˘ to be the single-valued mappings, Υ : E ˘ × E ˘ × E ˘ E ˘ to be another single-valued mapping, and ψ , ϕ , φ : E ˘ C ( E ˘ ) to be another multi-valued mapping such that
D ( r ) = { 4 r } a n d g ( r ) = 5 r 3 .
Then, for any r 1 , r 2 E ˘ , we have
| | g ( r 1 ) g ( r 2 ) | | = 5 r 1 3 5 r 2 3 = 5 3 | | r 1 r 2 | | 2 | | r 1 r 2 | | .
Thus, g is Lipschitz continuous with constant λ g = 2 and
| | g ( r 1 ) g ( r 2 ) | | = 5 3 r 1 5 3 r 2 = 5 3 | | r 1 r 2 | | 4 3 | | r 1 r 2 | | .
Similarly, g is strongly monotone with constant δ g = 4 3 .
(ii) 
Suppose Υ : E ˘ × E ˘ × E ˘ E ˘ is the single-valued mapping and ψ , ϕ , φ : E ˘ C ( E ˘ ) is the multi-valued mappings such that
ψ ( r ) = r 6 , ϕ ( r ) = r 5 , φ ( r ) = r 4 , a n d Υ ( u ˘ , v ˘ , w ˘ ) = u ˘ 2 + v ˘ 2 + w ˘ 2 .
Now, we have
D ( ψ ( r ) , ψ ( t ) ) = max sup r S ( r ) d ( r , F ( t ) ) , sup t S ( t ) d ( F ( r ) , t ) max r 6 t 6 , t 6 r 6 1 6 max { | | r t | | , | | t r | | } 1 5 max | | r t | | .
So, ψ is D -Lipschitz continuous with constant λ D ψ = 1 5 . Similarly, we have to show that λ D ϕ = 1 4 , and λ D φ = 1 3 .
Hence, Υ is Lipschitz continuous in three arguments with constant λ Υ 1 = λ Υ 2 = λ Υ 3 = 1 . Thus, we obtain
Υ ( u ˘ , v ˘ , w ˘ ) = r 12 + r 10 + r 8 = 37 120 r .
(iii) 
Suppose A ˘ , B ˘ : E ˘ E ˘ is the single-valued mappings; D : E ˘ 2 E ˘ is a multi-valued mapping such that
A ˘ ( r ) = r 3 a n d B ˘ ( r ) = r 2 .
Now, we have
| | A ˘ ( r 1 ) A ˘ ( r 2 ) | | = r 1 3 r 2 3 = 1 3 | | r 1 r 2 | | 1 2 | | r 1 r 2 | | .
Thus, A ˘ is Lipschitz continuous with constant λ A ˘ = 1 2 . Similarly, we have to show that B ˘ is Lipschitz continuous with constant λ B ˘ = 2 3 . In addition, A ˘ and B ˘ are ξ-ordered non-extended mappings with constant ξ = 1 .
(iv) 
Suppose D : E ˘ 2 E ˘ is the multi-valued mappings and for every constant ρ > 0 such that
D ( r ) = { 4 r } .
Now, letting ρ = 1 , it is clear that D is ( α A ˘ , ρ ) -weak ANODD mapping with α A ˘ = 3 .
(v) 
Now, we calculate the obtained resolvent operators R A ˘ , ρ D such that
R A ˘ , ρ D ( r ) = ( A ˘ + ρ D ) 1 ( r ) = 3 r 13 .
Also, we have
R A ˘ , ρ D ( r 1 ) R A ˘ , ρ D ( r 2 ) = 3 r 1 13 3 r 2 13 = 3 13 | | r 1 r 2 | | 1 2 | | r 1 r 2 | | .
Thus, R A ˘ , ρ D is Lipschitz continuous with constant R θ = 1 2 , where R θ = 1 ξ ( α A ˘ ρ 1 ) , ρ > 1 α A ˘ .
(vi) 
Using the values of R A ˘ , ρ D , we obtain the generalized Cayley approximation operator as
C A ˘ , ρ D ( r ) = 2 R A ˘ , ρ D A ˘ ( r ) = 6 r 13 r 3 = 5 r 39 .
Now, we have
| | C A ˘ , ρ D ( r 1 ) C A ˘ , ρ D ( r 2 ) | | = 5 r 1 39 5 r 2 39 = 5 39 | | r 1 r 2 | | 3 2 | | r 1 r 2 | | .
Thus, C A ˘ , ρ D is Lipschitz continuous with constant λ C = 3 2 where λ C = ξ λ A ˘ ( α A ˘ ρ 1 ) + 2 ξ ( α A ˘ ρ 1 ) .
(vii) 
Now, we consider the interval 0 1 10 r t 1 and λ Π E ˘ = 1 2 .
(viii) 
Considering the constants calculated above, condition (7) of Theorem 1 is satisfied.
(ix) 
Now putting all values in Equation (3), we obtain
g ( r n + 1 ) = ( 1 α ) g ( r n ) + α R A ˘ , ρ D A ˘ ( g ( r n ) ) + ρ Υ ( u ˘ n , v ˘ n , w ˘ n ) C A ˘ , ρ D ( B ˘ ( r n ) ) r n + 1 = ( 1 α ) r n + 78174 608400 α r n = ( 1 0.87 α ) r n .
In this numerical result, we consider three cases for the composition of the computation table and convergence graph we use the tools of MATLAB-R2024b with some different initial values of r 0 and the value of constant α, where 0 α 1 .
In the first case, Consider α = 1 5 , and various initial values r 0 = 2 , 1.5 , 1 , 1 , 1.5 , 2 . We obtain an excellent graph of the convergence sequence { r n + 1 } which converges at r = 0 (after fifty-one iterations), which is the solution of the Cayley variational inclusion problem (1). It is shown through a computation table (Table 1) and convergence graph (Figure 1).
In the second case, Suppose α = 1 2 , and the same initial values. We get a computation table (Table 2) and a graph (Figure 2) of the convergence sequence { r n + 1 } which converges at r = 0 (after eighteen iterations), which is the solution of the Cayley variational inclusion problem (1).
In the third case, Suppose α = 4 5 , and the same initial values. We get a another computation table (Table 3) and a graph (Figure 3) of the convergence sequence { r n + 1 } which converges at r = 0 (after eight iterations), which is the solution of the Cayley variational inclusion problem (1).

7. Conclusions

In the draft, we explored a generalized Cayley variational inclusion problem incorporating XOR and XNOR operations in a real-ordered Hilbert space. We analyzed the existence of solutions for the proposed problem using a fixed-point formulation. The proposed algorithms efficiently address generalized Cayley inclusions and solve equations involving XOR and XNOR operations. Furthermore, a numerical result is provided to support our main result and validate the proposed algorithm using MATLAB programming, demonstrating the rapid convergence of the mathematical model and its effectiveness in achieving optimal solutions. From the above Figure 1, Figure 2 and Figure 3, we notice that the sequence r n + 1 converges to r = 0 . In Figure 1, this occurs within fifty-one iterations, when α = 1 5 ; in Figure 2, within eighteen iterations, when α = 1 2 ; and in Figure 3, in eight iterations, when α = 4 5 . This pattern indicates that as the value of α increases within the range 0 α 1 , the convergence rate accelerates.

Author Contributions

Conceptualization: A. and S.S.I.; Methodology: A. and S.S.I.; Software: A. and S.S.I.; Validation: A. and I.A.; Formal Analysis: A. and S.S.I.; Writing—original draft preparation: A. and I.A.; Writing—review and editing: I.A. and S.S.I.; Funding: I.A. All authors have read and agreed to the published version of the manuscript.

Funding

The Researchers would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support (QU-APC-2025).

Institutional Review Board Statement

Not applicable.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Hassouni, A.; Moudafi, A. A perturbed algorithm for variational inclusions. J. Math. Anal. Appl. 1994, 185, 706–712. [Google Scholar] [CrossRef]
  2. Noor, M.A. Generalized set-valued variational inclusions and resolvent equations. J. Math. Anal. Appl. 1998, 228, 206–220. [Google Scholar] [CrossRef]
  3. Ahmad, I.; Irfan, S.S.; Farid, M.; Shukla, P. Nonlinear ordered variational inclusion problem involving XOR operation with fuzzy mappings. J. Inequal. Appl. 2020, 2020, 36. [Google Scholar] [CrossRef]
  4. Ahmad, I.; Pang, C.T.; Ahmad, R.; Ishtyak, M. System of Yosida inclusions involving XOR-operation. J. Nonlinear Convex Anal. 2017, 18, 831–845. [Google Scholar]
  5. Ayaka, M.; Tomomi, Y. Applications of the Hille—Yosida theorem to the linearized equations of coupled sound and heat flow. AIMS Math. 2016, 1, 165–177. [Google Scholar] [CrossRef]
  6. Chang, S.S. Set-valued variational inclusions in Banach spaces. J. Math. Anal. Appl. 2000, 248, 438–454. [Google Scholar] [CrossRef]
  7. Chang, S.; Yao, J.C.; Wang, L.; Liu, M.; Zhao, L. On the inertial forward-backward splitting technique for solving a system of inclusion problems in Hilbert spaces. Optimization 2021, 70, 2511–2525. [Google Scholar] [CrossRef]
  8. Yosida, K. Functional Analysis, Grundlehren der Mathematischen Wissenschaften; Springer: New York, NY, USA, 1971. [Google Scholar]
  9. Iqbal, J.; Rajpoot, A.K.; Islam, M.; Ahmad, R.; Wang, Y. System of Generalized Variational Inclusions Involving Cayley Operators and XOR-Operation in q-Uniformly Smooth Banach Spaces. Mathematics 2022, 10, 2837. [Google Scholar] [CrossRef]
  10. Khan, A.A.; Tammer, M.; Zalinescu, C. Set-Valued Optimization: An Introduction with Applications; Springer: New York, NY, USA, 2015. [Google Scholar]
  11. Iqbal, J.; Wang, Y.; Rajpoot, A.K.; Ahmad, R. Generalized Yosida inclusion problem involving multi-valued operator with XOR operation. Demonstr. Math. 2024, 57, 20240011. [Google Scholar] [CrossRef]
  12. Ali, I.; Ahmad, R.; Wen, C.F. Cayley Inclusion Problem Involving XOR-Operation. Mathematics 2019, 7, 302. [Google Scholar] [CrossRef]
  13. Rockafellar, R. Monotone Operators and the Proximal Point Algorithm. Siam J. Cont. Optim. 1976, 14, 877–898. [Google Scholar] [CrossRef]
Figure 1. Graphical representation of a convergence sequence of { r n + 1 } with different initial values. when α = 1 5 .
Figure 1. Graphical representation of a convergence sequence of { r n + 1 } with different initial values. when α = 1 5 .
Axioms 14 00149 g001
Figure 2. Graphical representation of a convergence sequence of { r n + 1 } with different initial values. when α = 1 2 .
Figure 2. Graphical representation of a convergence sequence of { r n + 1 } with different initial values. when α = 1 2 .
Axioms 14 00149 g002
Figure 3. Graphical representation of a convergence sequence { r n + 1 } with different initial values when α = 4 5 .
Figure 3. Graphical representation of a convergence sequence { r n + 1 } with different initial values when α = 4 5 .
Axioms 14 00149 g003
Table 1. The values of the convergent sequence { r n } with initial values r 0 = 2 , 1.5 , 1 , 1 , 1.5 , 2 .
Table 1. The values of the convergent sequence { r n } with initial values r 0 = 2 , 1.5 , 1 , 1 , 1.5 , 2 .
No. of Iterations r 0 = 2 r 0 = 1.5 r 0 = 1 r 0 = 1 r 0 = 1.5 r 0 = 2
n = 1−1.65200−1.23900−0.826000.826001.239001.65200
n = 2−1.36460−1.02340−0.682200.682201.023401.36460
n = 3−1.12710−0.84534−0.563560.563560.845341.12710
n = 4−0.93100−0.69825−0.465500.465500.698250.93100
n = 5−0.76901−0.57676−0.384500.384500.576760.76901
n = 6−0.63520−0.47640−0.317600.317600.476400.63520
n = 15−0.11369−0.08526−0.056840.056840.085260.11369
n = 20−0.04371−0.03278−0.021850.021850.032780.04371
n = 25−0.01680−0.01260−0.008400.008400.012600.01680
n = 35−0.00248−0.00186−0.001240.001240.001860.00248
n = 51−0.00011−0.00000−0.000000.000000.000000.00011
n = 55−0.00000−0.00000−0.000000.000000.000000.00000
Table 2. The values of the convergent sequence { r n } with initial values r 0 = 2 , 1.5 , 1 , 1 , 1.5 , 2 .
Table 2. The values of the convergent sequence { r n } with initial values r 0 = 2 , 1.5 , 1 , 1 , 1.5 , 2 .
No. of Iterations r 0 = 2 r 0 = 1.5 r 0 = 1 r 0 = 1 r 0 = 1.5 r 0 = 2
n = 1−1.13000−0.84750−0.565000.565000.847501.13000
n = 2−0.63845−0.47884−0.319220.319220.478840.63845
n = 3−0.36072−0.27054−0.180360.180360.270540.36072
n = 4−0.20381−0.15286−0.101900.101900.152860.20381
n = 5−0.11515−0.08636−0.057570.057570.086360.11515
n = 6−0.06506−0.04879−0.032530.032530.048790.06506
n = 7−0.03675−0.02757−0.018380.018380.027570.03675
n = 11−0.00663−0.00497−0.003310.003310.004970.00663
n = 14−0.00119−0.00089−0.000590.000590.000890.00119
n = 17−0.00021−0.00016−0.000100.000100.000160.00021
n = 18−0.00012−0.00000−0.000000.000000.000000.00012
n = 19−0.00000−0.00000−0.000000.000000.000000.00000
n = 30−0.00000−0.00000−0.000000.000000.000000.00000
Table 3. The values of the convergent sequence { r n } with initial values r 0 = 2 , 1.5 , 1 , 1 , 1.5 , 2 .
Table 3. The values of the convergent sequence { r n } with initial values r 0 = 2 , 1.5 , 1 , 1 , 1.5 , 2 .
No. of Iterations r 0 = 2 r 0 = 1.5 r 0 = 1 r 0 = 1 r 0 = 1.5 r 0 = 2
n = 1−0.60800−0.45600−0.304000.304000.456000.60800
n = 2−0.18483−0.13862−0.092410.092410.138620.18483
n = 3−0.05618−0.04214−0.028090.028090.042140.05618
n = 4−0.01708−0.01281−0.008540.008540.012810.01708
n = 5−0.00519−0.00389−0.002590.002590.003890.00519
n = 6−0.00157−0.00118−0.000780.000780.001180.00157
n = 7−0.00047−0.00035−0.000230.000230.000350.00047
n = 8−0.00014−0.00010−0.000000.000000.000100.00014
n = 9−0.00000−0.00000−0.000000.000000.000000.00000
n = 10−0.00000−0.00000−0.000000.000000.000000.00000
n = 15−0.00000−0.00000−0.000000.000000.000000.00000
n = 20−0.00000−0.00000−0.000000.000000.000000.00000
n = 30−0.00000−0.00000−0.000000.000000.000000.00000
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Arifuzzaman; Irfan, S.S.; Ahmad, I. Convergence Analysis for Cayley Variational Inclusion Problem Involving XOR and XNOR Operations. Axioms 2025, 14, 149. https://doi.org/10.3390/axioms14030149

AMA Style

Arifuzzaman, Irfan SS, Ahmad I. Convergence Analysis for Cayley Variational Inclusion Problem Involving XOR and XNOR Operations. Axioms. 2025; 14(3):149. https://doi.org/10.3390/axioms14030149

Chicago/Turabian Style

Arifuzzaman, Syed Shakaib Irfan, and Iqbal Ahmad. 2025. "Convergence Analysis for Cayley Variational Inclusion Problem Involving XOR and XNOR Operations" Axioms 14, no. 3: 149. https://doi.org/10.3390/axioms14030149

APA Style

Arifuzzaman, Irfan, S. S., & Ahmad, I. (2025). Convergence Analysis for Cayley Variational Inclusion Problem Involving XOR and XNOR Operations. Axioms, 14(3), 149. https://doi.org/10.3390/axioms14030149

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