You are currently viewing a new version of our website. To view the old version click .
Axioms
  • Article
  • Open Access

11 November 2024

Multivariate Approximation Using Symmetrized and Perturbed Hyperbolic Tangent-Activated Multidimensional Convolution-Type Operators

Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA
This article belongs to the Special Issue Theory and Application of Integral Inequalities

Abstract

In this article, we introduce, for the first time, multivariate symmetrized and perturbed hyperbolic tangent-activated convolution-type operators in three forms. We present their approximation properties, that is, their quantitative convergence to the unit operator via the multivariate modulus of continuity. We continue with the multivariate global smoothness preservation of these operators. We present, in detail, the related multivariate iterative approximation, as well as, multivariate simultaneous approximation, and their combinations. Using differentiability in our research, we produce higher rates of approximation, and multivariate simultaneous global smoothness preservation is also achieved.

1. Organization

In Section 2 we give the preliminaries of our theory. In Section 3, we present the basics, as well as an introduction to our multivariate symmetrized and perturbed hyperbolic tangent-activated convolution-type operators and their properties. In Section 4, we present the main multivariate approximation results. We also include the multivariate global smoothness preservation achieved by our operators. We further study the differentiation of these operators, and we introduce their iterations and give their basic properties. Next, we present the convergence of our operators under differentiability, achieving higher rates of approximation. Following this, we present the multivariate simultaneous differential approximation and, in detail, the multivariate simultaneous global smoothness preservation, as well as the multivariate iterative approximation. We finish with the combination of multivariate simultaneous and iterative approximations.
We are motivated and inspired by [1,2,3].
Other related recent interesting developments in this field are given in the works [4,5,6,7,8,9,10,11,12,13,14,15,16,17].

3. Basics

We establish the following:
Remark 1. 
We introduce
Z x 1 , , x N : = Z x : = i = 1 N φ x i , x = x 1 , , x N R N , N N .
It has the following properties:
(i) 
Z x > 0 , ∀ x R N ; Z x = Z x ,
(ii) 
R N Z x u d u = Z x 1 u 1 , , x N u N d u 1 d u N =
i = 1 N φ x i u i d u i = ( 24 ) 1 , x R N ,
Hence,
(iii) 
R N Z n x u d u = 1 , x R N , n N , and
(iv) 
according to (23),
R N Z x d x = 1 ,
That is, Z is a multivariate density function.
(v) 
Let 0 < β < 1 , n N : n 1 β > 2 . Then, using Theorem 3 and (24), we derive that
u R N : n x u n 1 β Z n x u d u < q + 1 q e e 2 λ n 1 β 1 , q , λ > 0 .
The latter is true, because the condition any u R N : n x u n 1 β , implies that there exists at least one u r : n x r u r n 1 β , where r 1 , , N .
Indeed, the following holds for some r * 1 , , N .
u R N : n x u n 1 β
r = 1 N R N 1 u r R : n x r u r n 1 β
R N 1 u r * R : n x r * u r * n 1 β ,
We also mention a useful related result.
Theorem 4. 
It holds for ( k N ) that
R N x k Z x d x N k tanh λ k + 1 + q + 1 q e 2 λ k ! 2 λ k < .
When k = 0 , (34) is again valid.
Proof. 
We determine that
R N x k Z x d x R N j = 1 N x j k Z x d x
(according to a convexity argument)
R N N k 1 j = 1 N x j k Z x d x = N k 1 j = 1 N R N x j k Z x d x =
N k 1 j = 1 N R N x j k i = 1 N φ x i d x =
N k 1 j = 1 N x j k φ x j d x j i = 1 i j N φ x i d x = ( 23 )
N k 1 j = 1 N x j k φ x j d x j ( 26 )
N k 1 j = 1 N tanh λ k + 1 + q + 1 q e 2 λ k ! 2 λ k =
N k tanh λ k + 1 + q + 1 q e 2 λ k ! 2 λ k ,
proving the claim. □
We will use the following differentiation result.
Theorem 5 
(H. Bauer [18], pp. 103–104). Let Ω , A , μ be a measure space. Let U be an open subset of R d , d 1 , and let f : U × Ω R be a function with the following properties:
(a) 
ω f x , ω is μ-integrable for all x U .
(b) 
x f x , ω is, at each point in U, partially differentiable with respect to x i .
(c) 
There exists a μ-integrable function h 0 on Ω such that
f x i x , ω h ω , for all x , ω U × Ω .
Then, the function φ ¯ , defined on U as
φ ¯ x = Ω f x , ω μ d ω
is partially differentiable with respect to x i on all of U. The mapping ω f x i x , ω is μ-integrable, and we have
φ ¯ x i x = Ω f x i x , ω μ d ω , all x U .
We give the following:
Definition 2. 
Let f C B R N , N N . We define the following activated symmetrized and perturbed hyperbolic tangent multivariate convolution-type operators:
The basic one:
S n f x : = R N f u n Z n x u d u , x R N ,
The activated Kantorovich type:
S n * f x : = n N R N u n u + 1 n f t d t Z n x u d u , x R N .
Now, let θ = θ 1 , , θ N N N , r = r 1 , , r N Z + N , w r = w r 1 r 2 r N 0 , such that
r = 0 θ w r = r 1 = 0 θ 1 r 2 = 0 θ 2 r N = 0 θ N w r 1 r 2 r N = 1 ; u R N ,
and
δ n f u : = δ n f u 1 , , u N : = r = 0 θ w r f u n + r n θ =
r 1 = 0 θ 1 r 2 = 0 θ 2 r N = 0 θ N w r 1 r 2 r N f u 1 n + r 1 n θ 1 , u 2 n + r 2 n θ 2 , , u N n + r N n θ N ,
where r θ : = r 1 θ 1 , r 2 θ 2 , , r N θ N .
We define the activated quadrature operators
S n ¯ f x : = S n ¯ f , x 1 , , x N : = R N δ n f u Z n x u d u =
δ n f u 1 , , u N i = 1 N φ n x i u i d u 1 d u N , x R N .
One can rewrite
S n f x = f u 1 n , u 2 n , , u N n i = 1 N φ n x i u i d u 1 d u N ,
and
S n * f x = n N u 1 n u 1 + 1 n u 2 n u 2 + 1 n u N n u N + 1 n f t 1 , , t N d t 1 d t N
i = 1 N φ n x i u i d u 1 d u N ,
n N , ∀ x R N .
For some f C U R N , the above operators can exist.
In this work, we study the approximation properties of the operators S n , S n * and S n ¯ , especially their convergence to the unit operator I .

4. Main Results

We present the following approximation results:
Theorem 6. 
Let 0 < β < 1 , n N : n 1 β > 2 , f C B R N , n N ,   x R N . Then,
S n f x f x ω 1 f , 1 n β + 2 q + 1 q f e 2 λ n 1 β 1 = : λ s ,
and
S n f f λ s ,
where · is the supremum norm.
So, for f C U B R N : = C U R N C B R N , we determine that lim n S n f = f , pointwise and uniformly.
Proof. 
Call
A 1 : = u R N : u n x < 1 n β ,
and
A 2 : = u R N : u n x 1 n β .
That is, A 1 A 2 = R N .
We determine that
S n f x f x = ( 31 )
R N f u n Z n x u d u f x R N Z n x u d u =
R N f u n f x Z n x u d u
R N f u n f x Z n x u d u =
A 1 f u n f x Z n x u d u + A 2 f u n f x Z n x u d u
A 1 ω 1 f , u n x Z n x u d u + 2 f A 2 Z n x u d u ( 32 )
ω 1 f , 1 n β A 1 Z n x u d u + 2 f q + 1 q e 2 λ n 1 β 1
ω 1 f , 1 n β R N Z n x u d u + 2 q + 1 q f e 2 λ n 1 β 1 =
ω 1 f , 1 n β + 2 q + 1 q f e 2 λ n 1 β 1 .
We continue with the following.
Theorem 7. 
This theorem is all as in Theorem 6. Then,
S n * f x f x ω 1 f , 1 n + 1 n β + 2 q + 1 q f e 2 λ n 1 β 1 = : ρ s ,
and
S n * f f ρ s .
For f C U B R N , we determine that lim n S n * f = f , pointwise and uniformly.
Proof. 
We notice that
u n u + 1 n f t d t = u 1 n u 1 + 1 n u 2 n u 2 + 1 n u N n u N + 1 n f t 1 , , t N d t 1 d t N =
0 1 n 0 1 n 0 1 n f t 1 + u 1 n , t 2 + u 2 n , , t N + u N n d t 1 d t N = 0 , 1 n N f t + u n d t .
Thus, it holds that
S n * f x = n N R N 0 , 1 n N f t + u n d t Z n x u d u .
We observe that
S n * f x f x =
R N n N 0 , 1 n N f t + u n d t Z n x u d u f x R N Z n x u d u =
R N n N 0 , 1 n N f t + u n d t f x Z n x u d u =
R N n N 0 , 1 n N f t + u n f x d t Z n x u d u
R N n N 0 , 1 n N f t + u n f x d t Z n x u d u =
A 1 n N 0 , 1 n N f t + u n f x d t Z n x u d u +
A 2 n N 0 , 1 n N f t + u n f x d t Z n x u d u
A 1 n N 0 , 1 n N ω 1 f , t + u n x d t Z n x u d u +
2 f A 2 Z n x u d u
ω 1 f , 1 n + 1 n β A 1 Z n x u d u + 2 f q + 1 q e 2 λ n 1 β 1
ω 1 f , 1 n + 1 n β + 2 q + 1 q f e 2 λ n 1 β 1 .
Thus, the following are true:
Theorem 8. 
This theorem is all as in Theorem 6. Then,
S n ¯ f x f x ω 1 f , 1 n + 1 n β + 2 q + 1 q f e 2 λ n 1 β 1 = ρ s ,
and
S n ¯ f f ρ s .
For f C U B R N , we determine that lim n S n ¯ f = f , pointwise and uniformly.
Proof. 
We determine that
S n ¯ f x f x =
R N δ n f u Z n x u d u f x R N Z n x u d u =
R N δ n f u f x Z n x u d u =
R N r = 0 θ w r f u n + r n θ f x Z n x u d u
R N r = 0 θ w r f u n + r n θ f x Z n x u d u =
A 1 r = 0 θ w r f u n + r n θ f x Z n x u d u +
A 2 r = 0 θ w r f u n + r n θ f x Z n x u d u
A 1 r = 0 θ w r ω 1 f , u n x + 1 n r θ Z n x u d u +
2 f A 2 Z n x u d u
ω 1 f , 1 n β + 1 n A 1 Z n x u d u + 2 f q + 1 q e 2 λ n 1 β 1
ω 1 f , 1 n + 1 n β + 2 q + 1 q f e 2 λ n 1 β 1 .
Next, we describe the global smoothness preservation property of our activated multivariate operators.
Theorem 9. 
Here, f C B R N C U R N . Then,
ω 1 S n f , δ ω 1 f , δ , δ > 0 .
If f C U R N , then S n f C U R N .
Proof. 
We determine that
S n f x = R N f x z n Z z d z .
Let x , y R N ; then,
S n f x S n f y = R N f x z n f y z n Z z d z .
Thus,
S n f x S n f y R N f x z n f y z n Z z d z
ω 1 f , x y R N Z z d z = ( 31 ) ω 1 f , x y .
Let x y δ , δ > 0 ; then, we obtain (59). □
Remark 2. 
Let f be the projection function onto the x i coordinate, call it p r i x : = x i , i 1 , , N , where x = x 1 , , x i , , x N R N . Then, it holds that
S n p r i x = R N x i z i n Z z d z = x i 1 n R N z i Z z d z .
Hence,
S n p r i x S n p r i y = x i y i = p r i x p r i y ,
proving that
ω 1 S n p r i , δ = ω 1 p r i , δ ,
for any δ > 0 .
So, (59) is an attained sharp inequality.
Furthermore,
S n p r i x = x i 1 n j = 1 j i N φ z j d z j z i φ z i d z i
= x i 1 n z i φ z i d z i ,
and
S n p r i x x i + 1 n z i φ z i d z i
( 26 ) x i + 1 n tanh λ 2 + q + 1 q e 2 λ 2 λ < .
Thus, S n p r i x is well defined.
Theorem 10. 
Let f C B R N C U R N . Then,
ω 1 S n * f , δ ω 1 f , δ , δ > 0 .
If f C U R N , then S n * f C U R N .
Inequality (67) is an attained sharp inequality according to f x = p r i x , i 1 , , N .
Proof. 
According to (52), one can write
B n * f x = R N n N 0 , 1 n N f t + u n d t Z n x u d u =
R N n N 0 , 1 n N f t + x z n d t Z z d z ,
and
S n * f y = R N n N 0 , 1 n N f t + y z n d t Z z d z ,
where x , y R N .
Thus,
S n * f x S n * f y =
R N n N 0 , 1 n N f t + x z n f t + y z n d t Z z d z
R N n N 0 , 1 n N f t + x z n f t + y z n d t Z z d z
ω 1 f , x y R N Z z d z = ω 1 f , x y ,
proving inequality (67).
We do have
S n * p r i x R N n N 0 , 1 n N t i + x i z i n d t Z z d z
R N n N 0 , 1 n N t i + x i + z i n d t Z z d z
R N 1 n + x i + z i n Z z d z = 1 n + x i + z i n φ z i d z i =
1 n + x i + 1 n z i φ z i d z i ( 26 )
1 n + x i + 1 n tanh λ 2 + q + 1 q e 2 λ 2 λ < .
Thus, S n * p r i x is well defined. □
Theorem 11. 
Let f C B R N C U R N . Then,
ω 1 S n ¯ f , δ ω 1 f , δ , δ > 0 .
If f C U R N , then S n ¯ f C U R N .
Inequality (73) is an attained sharp inequality according to f x = p r i x , i 1 , , N .
Proof. 
Let x , y R N ; then,
S n ¯ f x = R N r = 0 θ w r f x z n + r n θ Z z d z ,
and
S n ¯ f y = R N r = 0 θ w r f y z n + r n θ Z z d z .
Hence,
S n ¯ f x S n ¯ f y =
R N r = 0 θ w r f x z n + r n θ f y z n + r n θ Z z d z
R N r = 0 θ w r f x z n + r n θ f y z n + r n θ Z z d z
ω 1 f , x y R N Z z d z = ω 1 f , x y .
That is, (73) is true, and it is an attained sharp inequality according to f x = p r i x , i 1 , , N .
Indeed, we determine that
S n ¯ p r i x = R N r = 0 θ w r x i z i n + r i n θ i Z z d z
R N r = 0 θ w r x i z i n + r i n θ i Z z d z
R N r = 0 θ w r x i + z i n + 1 n Z z d z =
R N x i + z i n + 1 n Z z d z =
(as in (72))
x i + z i n + 1 n φ z i d z i < .
Thus, S n ¯ p r i x is well defined. □
We establish the following:
Remark 3. 
Let i N be fixed. Assume that f C i R N , N N . Here, f α denotes a partial derivative of f, α : = α 1 , , α N , α j Z + , j = 1 , , N , and α : = j = 1 N α j = l , where l = 0 , 1 , , i .
We also write f α : = α f x α , and we say it is of the order l.
We assume that any partial f α C B R N for all α : α = l , l = 0 , 1 , , i .
Through the repeated application of Theorem 5, we obtain
S n f α x = R N f α x z n Z z d z =
R N f α u n Z n x u d u = S n f α x , x R N .
Similarly, we determine that
S n * f α x = S n * f α x ,
and
S n ¯ f α x = S n ¯ f α x , x R N ;
for all α : α = l , l = 0 , 1 , , i .
So, all of our results in this work can be written in the simultaneous approximation context (see Theorems 15–17).
We establish the following:
Remark 4. 
Activated Iterative Multivariate Convolution
We determine that
S n f x = R N f x z n Z z d z ,
x R N , where f C B R N .
Let x N x , as N , and
S n f x N S n f x = R N f x N z n f x z n Z z d z .
We determine that
f x N z n Z z f x z n Z z , z R N , as N .
Furthermore, it holds that
S n f x N S n f x
R N f x N z n f x z n Z z d z 0 , as N ,
according to the dominated convergence theorem, because we determine that
f x N z n Z z f Z z ,
and f Z z is integrable over R N , ∀ z R N .
Hence, S n f C B R N .
Furthermore it holds that
S n f x f R N Z z d z = f ,
i.e.,
S n f f .
So, S n is a bounded positive linear operator.
Clearly, it holds that
S n 2 f = S n S n f S n f f .
And for k N , we obtain
S n k f S n k 1 f S n k 2 f f ,
so the contraction property is valid and S n k is a bounded linear operator.
Remark 5. 
Let r N . We observe that
S n r f f = S n r f S n r 1 f + S n r 1 f S n r 2 f + S n r 2 f S n r 3 f
+ + S n 2 f S n f + S n f f .
Then,
S n r f f S n r f S n r 1 f + S n r 1 f S n r 2 f + S n r 2 f S n r 3 f
+ + S n 2 f S n f + S n f f =
S n r 1 S n f f + S n r 2 S n f f + + S n S n f f +
S n f f r S n f f .
Therefore,
S n r f f r S n f f .
Now, let m 1 , m 2 , , m r N : m 1 m 2 m r , and S m i as above.
S m r S m r 1 S m 2 S m 1 f f = =
S m r S m r 1 S m 2 S m 1 f f + S m r S m r 1 S m 3 S m 2 f f +
S m r S m r 1 S m 4 S m 3 f f + + S m r S m r 1 f f + S m r f f .
Consequently, it holds, as in [1], Chapter 2, that
S m r S m r 1 S m 2 S m 1 f f i = 1 r S m i f f .
Next, we have
Remark 6. 
We obtain
S n * f x = n N R N 0 , 1 n N f t + x z n d t Z z d z ,
f C B R N .
Let x N x , as N , and
S n * f x N S n * f x =
n N R N 0 , 1 n N f t + x N z n f t + x z n d t Z z d z
R N n N 0 , 1 n N f t + x N z n f t + x z n d t Z z d z 0 ,
as N .
This is true according to the bounded convergence theorem, and we determine that
x N x t + x N z n t + x z n
and
f t + x N z n f t + x z n , and
f t + x N z n f ,
where 0 , 1 n N is a cube. Thus,
n N 0 , 1 n N f t + x N z n f t + x z n d t 0 , as N .
Therefore, it holds that
n N 0 , 1 n N f t + x N z n d t n N 0 , 1 n N f t + x z n d t , as N .
and we obtain
n N 0 , 1 n N f t + x N z n d t Z z n N 0 , 1 n N f t + x z n d t Z z ,
as N , z R N .
Furthermore, we have
n N 0 , 1 n N f t + x N z n d t Z z f Z z ,
with f Z z being integrable over R N .
Therefore according to the dominated convergence theorem,
S n * f x N S n * f x , as N .
Hence, S n * f x is a bounded and continuous in x R N .
The iterated facts hold for S n * as in the S n f case, all the same! See (83)–(85) and all of Remark 5.
Remark 7. 
Next, we observe the following: Let f C B R N , and
S n ¯ f x = R N r = 0 θ w r f x z n + r n θ Z z d z .
Let x N x , as N . Then,
S n ¯ f x N S n ¯ f x =
R N r = 0 θ w r f x N z n + r n θ f x z n + r n θ Z z d z
R N r = 0 θ w r f x N z n + r n θ f x z n + r n θ Z z d z 0 ,
as N .
The latter is obtained according go the dominated convergence theorem:
x N z n + r n θ x z n + r n θ
and
r = 0 θ w r f x N z n + r n θ r = 0 θ w r f x z n + r n θ ,
and
r = 0 θ w r f x N z n + r n θ Z z r = 0 θ w r f x z n + r n θ Z z ,
as N , z R N .
Furthermore, it holds that
r = 0 θ w r f x N z n + r n θ Z z f Z z ,
in which the last function is integrable over R N .
Therefore,
S n ¯ f x N S n ¯ f x , as N .
Hence, S n ¯ f x is bounded and continuous in x R N .
The iterated facts hold for S n ¯ in the same manner as with S n f ! See (83)–(85) and all of Remark 5.
See the related Theorems 18 and 19, which we describe later.
Next, we greatly improve the speed of convergence of our activated multivariate operators by using the differentiation of functions.
Notation 1. 
Let f C m R N , m , N N . Here, f α denotes a partial derivative of f, α : = α 1 , , α N , α i Z + , i = 1 , , N , and α = i = 1 N α i = l , where l = 0 , 1 , , m . We also write f α : = α f x α , and we say it is of the order l.
We denote
ω 1 , m max f α , h : = max α : α = m ω 1 f α , h , h > 0 .
also written as
f α , m max : = max α = m f α ,
where · is the supremum norm.
Theorem 12. 
Let 0 < β < 1 , n N : n 1 β > 2 ; x R N , f C m R N , m , N N , with f α C B R N for all α : = α 1 , , α N , α i Z + , i = 1 , , N , and α = i = 1 N α i = l , where l = 0 , 1 , , m . Then,
(i) 
S n f x f x
j = 1 m α : = α 1 , , α N , α i Z + i = 1 , , N , α : = i = 1 N α i = j 1 i = 1 N α i ! f α x S n i = 1 N · x i α i x
N m m ! n m β ω 1 , m max f α , 1 n β +
2 f α , m max N 2 m n m m ! tanh λ m + 1 + q + 1 q e 2 λ m ! 2 λ m = : Φ 1 s ,
(ii) 
Assume that f α x = 0 for all α : α = j , j = 1 , , m . We have
S n f x f x Φ 1 s ,
with a high speed of  n β m + 1 .
(iii) 
S n f x f x
j = 1 N α : α = j 1 i = 1 N α i ! f α x 1 n j i = 1 N tanh λ α i + 1 + q + 1 q e 2 λ α i ! 2 λ α i
+ Φ 1 s ,
and
(iv) 
S n f f
j = 1 N α : α = j 1 i = 1 N α i ! f α 1 n j i = 1 N tanh λ α i + 1 + q + 1 q e 2 λ α i ! 2 λ α i + Φ 1 s .
We determine that S n f f , as n , pointwise and uniformly.
Proof. 
Consider g z t : = f x 0 + t z x 0 , t 0 ; x 0 , z R N . Then,
g z j t = i = 1 N z i x 0 i x i j f x 01 + t z 1 x 01 , , x 0 N + t z N x 0 N ,
for all j = 0 , 1 , , m .
We have the multivariate Taylor’s formula
f z 1 , , z N = g z 1 = j = 0 m g z j 0 j ! +
1 m 1 ! 0 1 1 θ m 1 g z m θ g z m 0 d θ .
Notice that g z 0 = f z 0 . Also, for j = 0 , 1 , , m , we have
g z j 0 = α : = α 1 , , α N , α i Z + i = 1 , , N , α : = i = 1 N α i = j j ! i = 1 N α i !
i = 1 N z i x 0 i α i f α x 0 .
Furthermore we obtain
g z m θ = α : = α 1 , , α N , α i Z + i = 1 , , N , α : = i = 1 N α i = m m ! i = 1 N α i !
i = 1 N z i x 0 i α i f α x 0 + θ z x 0 ,
0 θ 1 .
So, f C m R N .
Thus, we determine, for u , x R N , that
f u 1 n , , u N n f x =
j = 1 m α : = α 1 , , α N , α i Z + i = 1 , , N , α : = i = 1 N α i = j 1 i = 1 N α i !
i = 1 N u i n x i α i f α x + R ,
where
R : = m 0 1 1 θ m 1 α : = α 1 , , α N , α i Z + i = 1 , , N , α : = i = 1 N α i = m 1 i = 1 N α i !
i = 1 N u i n x i α i f α x + θ u n x f α x d θ .
We see that
R m 0 1 1 θ m 1 α = m 1 i = 1 N α i !
i = 1 N u i n x i α i f α x + θ u n x f α x d θ
m 0 1 1 θ m 1 α = m 1 i = 1 N α i ! i = 1 N u i n x i α i
ω 1 f α , θ u n x d θ * .
Notice here that
u n x 1 n β , iff u i n x i 1 n β , i = 1 , , N .
We further see that
* m ω 1 , m max f α , 1 n β 0 1 1 θ m 1 α = m 1 i = 1 N α i ! i = 1 N 1 n β α i d θ
= ω 1 , m max f α , 1 n β m ! n m β α = m m ! i = 1 N α i ! =
ω 1 , m max f α , 1 n β m ! n m β N m .
Conclusion: When u n x 1 n β , we prove that
R N m m ! n m β ω 1 , m max f α , 1 n β .
According to (108) we determine that
R m 0 1 1 θ m 1 α : = α 1 , , α N , α i Z + i = 1 , , N , α = m 1 i = 1 N α i !
i = 1 N u i n x i α i 2 f α d θ =
2 α = m 1 i = 1 N α i ! i = 1 N u i n x i α i f α
2 u n x m f α , m max m ! α = m m ! i = 1 N α i ! =
2 u n x m f α , m max N m m ! .
We prove, in general, that
R 2 u n x m f α , m max N m m ! .
Next, let
U n ¯ : = R N R Z n x u d u ,
Then,
U n ¯ R N R Z n x u d u =
u R N : n x u < n 1 β R Z n x u d u +
u R N : n x u n 1 β R Z n x u d u { ( 112 ) ,   ( 114 ) }
N m m ! n m β ω 1 , m max f α , 1 n β +
2 f α , m max N m m ! u R N : n x u n 1 β u n x m Z n x u d u
N m m ! n m β ω 1 , m max f α , 1 n β +
2 f α , m max N m n m m ! R N n x u m Z n x u d u =
N m m ! n m β ω 1 , m max f α , 1 n β +
2 f α , m max N m n m m ! R N x m Z x d x ( 34 )
N m m ! n m β ω 1 , m max f α , 1 n β +
2 f α , m max N m n m m ! N m tanh λ m + 1 + q + 1 q e 2 λ m ! 2 λ m .
We prove that
U n ¯ N m m ! n m β ω 1 , m max f α , 1 n β +
2 f α , m max N 2 m n m m ! tanh λ m + 1 + q + 1 q e 2 λ m ! 2 λ m .
Next, we estimate
R N i = 1 N u i n x i α i Z n x u d u =
i = 1 N u i n x i α i φ n x i u i d u i =
1 n j i = 1 N u i n x i α i φ u i n x i d u i =
1 n j i = 1 N x α i φ x d x ( 26 )
1 n j i = 1 N tanh λ α i + 1 + q + 1 q e 2 λ α i ! 2 λ α i .
so that the following holds:
R N i = 1 N u i n x i α i Z n x u d u
1 n j i = 1 N tanh λ α i + 1 + q + 1 q e 2 λ α i ! 2 λ α i .
According to (107), we can write
R N f u n Z n x u d u f x
j = 1 m α : = α 1 , , α N , α i Z + i = 1 , , N , α : = i = 1 N α i = j 1 i = 1 N α i !
R N i = 1 N u i n x i α i Z n x u d u f α x = R N R Z n x u d u .
The theorem is proven. □
We continue with the activated multivariate Kantorovich operators under differentiation.
Theorem 13. 
Let 0 < β < 1 , n N : n 1 β > 2 ; x R N , f C m R N , m , N N , with f α C B R N : α = l , l = 0 , 1 , , m . Then,
(i) 
S n * f x f x j = 1 N α : α = j 1 i = 1 N α i ! f α x S n * i = 1 N · x i α i x
N m m ! 1 n + 1 n β m ω 1 , m max f α , 1 n + 1 n β +
2 N m f α , m max n m m ! 1 + N m tanh λ m + 1 + q + 1 q e 2 λ m ! 2 λ m = : Ψ 1 ¯ ,
(ii) 
Assume that f α x = 0 for all α : α = j , j = 1 , , m ; we have
S n * f x f x Ψ 1 ¯ ,
with a high speed of 1 n + 1 n β m + 1 .
(iii) 
S n * f x f x
j = 1 N α : α = j 1 i = 1 N α i ! f α x 2 n j
i = 1 N 1 + tanh λ α i + 2 + q + 1 q e 2 λ α i + 1 ! 2 λ α i + 1 + Ψ 1 ¯ ,
and
(iv) 
S n * f f
j = 1 N α : α = j 1 i = 1 N α i ! f α 2 n j
i = 1 N 1 + tanh λ α i + 2 + q + 1 q e 2 λ α i + 1 ! 2 λ α i + 1 + Ψ 1 ¯ .
We determine that S n * f f , as n , pointwise and uniformly.
Proof. 
It holds that
f t + u n f x j = 1 m α : α = j 1 i = 1 N α i ! i = 1 N t i + u i n x i α i f α x = R ,
where
R : = m 0 1 1 θ m 1 α : α = m 1 i = 1 N α i !
i = 1 N t i + u i n x i α i f α x + θ t + u n x f α x d θ .
We see that
R m 0 1 1 θ m 1 α = m 1 i = 1 N α i !
i = 1 N t i + u i n x i α i f α x + θ t + u n x f α x d θ
m 0 1 1 θ m 1 α = m 1 i = 1 N α i ! i = 1 N t i + u i n x i α i
ω 1 f α , θ t + u n x d θ .
Notice that
u n x 1 n β , iff u i n x i 1 n β , i = 1 , , N .
Here we consider 0 t i 1 n , i = 1 , , N .
We further see that
m ω 1 , m max f α , 1 n + 1 n β 0 1 1 θ m 1
α = m 1 i = 1 N α i ! i = 1 N 1 n + 1 n β α i d θ =
ω 1 , m max f α , 1 n + 1 n β m ! 1 n + 1 n β m α = m m ! i = 1 N α i ! =
ω 1 , m max f α , 1 n + 1 n β m ! 1 n + 1 n β m N m .
Conclusion: When u n x 1 n β , we prove that
R N m m ! 1 n + 1 n β m ω 1 , m max f α , 1 n + 1 n β .
According to (128), we determine that
R m 0 1 1 θ m 1 α : α = m 1 i = 1 N α i !
i = 1 N t i + u i n x i α i 2 f α d θ
m 0 1 1 θ m 1 α : α = m 1 i = 1 N α i !
i = 1 N 1 n + u i n x i α i 2 f α d θ =
α : α = m 1 i = 1 N α i ! i = 1 N 1 n + u i n x i α i 2 f α
2 u n x + 1 n m f α , m max m ! α = m m ! i = 1 N α i ! =
2 u n x + 1 n m f α , m max m ! N m .
We prove, in general, that
R 2 u n x + 1 n m f α , m max N m m ! .
Next, we see that
n N 0 , 1 n N f t + u n d t f x j = 1 m α : α = j 1 i = 1 N α i ! f α x
n N 0 , 1 n N i = 1 N t i + u i n x i α i d t = n N 0 , 1 n N R d t .
So, when u n x 1 n β , we obtain
n N 0 , 1 n N R d t N m m ! 1 n + 1 n β m ω 1 , m max f α , 1 n + 1 n β .
and, in general, it holds that
n N 0 , 1 n N R d t
2 u n x + 1 n m f α , m max N m m ! .
Furthermore, it holds that
S n * f x f x j = 1 N α : α = j 1 i = 1 N α i ! f α x S n * i = 1 N · x i α i x =
R N n N 0 , 1 n N R d t Z n x u d u .
Let
U n * : = R N n N 0 , 1 n N R d t Z n x u d u .
Here, A 1 is as in (45), and A 2 is as in (46).
We do have, under u n x < 1 n β ,
| U n * | | A 1 N m m ! 1 n + 1 n β m ω 1 , m max f α , 1 n + 1 n β .
Furthermore, we determine that
| U n * | | A 2 2 f α , m max N m m ! A 2 u n x + 1 n m Z n x u d u .
or, better still,
U n * | A 2 2 f α , m max N m n m m ! A 2 u n x + 1 m Z u n x d u =
2 f α , m max N m n m m ! A 2 z + 1 m Z z d z
2 m f α , m max N m n m m ! A 2 1 + z m Z z d z
2 N m f α , m max n m m ! 1 + A 2 z m Z z d z ( 34 )
2 N m f α , m max n m m ! 1 + N m tanh λ m + 1 + q + 1 q e 2 λ m ! 2 λ m .
We prove that
U n * | A 2 2 N m f α , m max n m m !
1 + N m tanh λ m + 1 + q + 1 q e 2 λ m ! 2 λ m .
Consequently, we derive that
U n * U n * | A 1 + U n * | A 2
N m m ! 1 n + 1 n β m ω 1 , m max f α , 1 n + 1 n β +
2 N m f α , m max n m m ! 1 + N m tanh λ m + 1 + q + 1 q e 2 λ m ! 2 λ m .
Finally, we estimate
S n * i = 1 N · x i α i x =
R N n N 0 , 1 n N i = 1 N t i + u i n x i α i d t Z n x u d u
R N i = 1 N 1 n + u i n x i α i Z n x u d u =
i = 1 N 1 n + u i n x i α i φ n x i u i d u i =
1 n j i = 1 N 1 + u i n x i α i φ u i n x i d u i =
1 n j i = 1 N 1 + x α i φ x d x
1 n j i = 1 N 1 + x α i + 1 φ x d x
1 n j i = 1 N 2 α i 1 + x α i + 1 φ x d x =
2 n j i = 1 N 1 + x α i + 1 φ x d x ( 26 )
2 n j i = 1 N 1 + tanh λ α i + 2 + q + 1 q e 2 λ α i + 1 ! 2 λ α i + 1 .
We derive that
S n * i = 1 N · x i α i x
2 n j i = 1 N 1 + tanh λ α i + 2 + q + 1 q e 2 λ α i + 1 ! 2 λ α i + 1 .
The theorem is proven. □
We continue with the activated multivariate quadrature operators under differentiation.
Theorem 14. 
Let 0 < β < 1 , n N : n 1 β > 2 ; x R N , f C m R N , m , N N , with f α C B R N : α = l , l = 0 , 1 , , m . Then,
(i) 
S n ¯ f x f x j = 1 N α : α = j 1 i = 1 N α i ! f α x S n ¯ i = 1 N · x i α i x
N m m ! 1 n + 1 n β m ω 1 , m max f α , 1 n + 1 n β +
2 N m f α , m max n m m ! 1 + N m tanh λ m + 1 + q + 1 q e 2 λ m ! 2 λ m = Ψ 1 ¯ ,
(ii) 
Assume that f α x = 0 for all α : α = j , j = 1 , , m ; we have
S n ¯ f x f x Ψ 1 ¯ ,
with a high speed of 1 n + 1 n β m + 1 ,
(iii) 
S n ¯ f x f x
j = 1 N α : α = j 1 i = 1 N α i ! f α x 2 n j
i = 1 N 1 + tanh λ α i + 2 + q + 1 q e 2 λ α i + 1 ! 2 λ α i + 1 + Ψ 1 ¯ ,
and
(iv) 
S n ¯ f f
j = 1 N α : α = j 1 i = 1 N α i ! f α 2 n j
i = 1 N 1 + tanh λ α i + 2 + q + 1 q e 2 λ α i + 1 ! 2 λ α i + 1 + Ψ 1 ¯ .
We determine that S n ¯ f f , as n , pointwise and uniformly.
Proof. 
We determine that
f u n + r n θ f x j = 1 m α : α = j 1 i = 1 N α i ! i = 1 N u i n + r i n θ i x i α i f α x = R ,
where
R : = m 0 1 1 θ m 1 α : α = m 1 i = 1 N α i !
i = 1 N u i n + r i n θ i x i α i f α x + θ u n + r n θ x f α x d θ .
We see that
R m 0 1 1 θ m 1 α = m 1 i = 1 N α i !
i = 1 N u i n + r i n θ i x i α i f α x + θ u n + r n θ x f α x d θ
m 0 1 1 θ m 1 α = m 1 i = 1 N α i ! i = 1 N u i n + r i n θ i x i α i
ω 1 f α , θ u n + r n θ x d θ .
Notice that
u n x 1 n β , iff u i n x i 1 n β , i = 1 , , N .
We further see that
m ω 1 , m max f α , 1 n + 1 n β 0 1 1 θ m 1
α = m 1 i = 1 N α i ! i = 1 N 1 n + 1 n β α i d θ =
ω 1 , m max f α , 1 n + 1 n β m ! 1 n + 1 n β m α = m m ! i = 1 N α i ! =
ω 1 , m max f α , 1 n + 1 n β m ! 1 n + 1 n β m N m .
Conclusion: When u n x 1 n β , we prove that
R N m m ! 1 n + 1 n β m ω 1 , m max f α , 1 n + 1 n β .
According to (154), we determine that
R m 0 1 1 θ m 1 α : α = m 1 i = 1 N α i !
i = 1 N u i n x i + 1 n α i 2 f α d θ =
α : α = m 1 i = 1 N α i ! i = 1 N u i n x i + 1 n α i 2 f α
2 u n x + 1 n m f α , m max m ! α = m m ! i = 1 N α i ! =
2 u n x + 1 n m f α , m max m ! N m .
We establish, in general, that
R 2 u n x + 1 n m f α , m max N m m ! .
Next, we observe that
r = 0 θ w r f u n + r n θ f x j = 1 m α : α = j 1 i = 1 N α i ! f α x
r = 0 θ w r i = 1 N u i n + r i n θ i x i α i = r = 0 θ w r R .
So, when u n x 1 n β , we obtain
r = 0 θ w r R r = 0 θ w r R N m m ! 1 n + 1 n β m ω 1 , m max f α , 1 n + 1 n β .
and it holds, in general, that
r = 0 θ w r R 2 u n x + 1 n m f α , m max N m m ! .
Furthermore, it holds that
S n ¯ f x f x j = 1 N α : α = j 1 i = 1 N α i ! f α x S n ¯ i = 1 N · x i α i x =
R N r = 0 θ w r R Z n x u d u .
Let
E n ¯ : = R N r = 0 θ w r R Z n x u d u .
Here, A 1 is as in (45), and A 2 is as in (46).
We derive, under u n x < 1 n β ,
| E n ¯ | | A 1 N m m ! 1 n + 1 n β m ω 1 , m max f α , 1 n + 1 n β .
Furthermore, we determine that
| E n ¯ | | A 2 2 f α , m max N m m ! A 2 u n x + 1 n m Z n x u d u .
As in the proof of Theorem 13, we obtain
| E n ¯ | | A 2 2 N m f α , m max n m m !
1 + N m tanh λ m + 1 + q + 1 q e 2 λ m ! 2 λ m .
Consequently, we derive that
E n ¯ E n ¯ | A 1 + E n ¯ | A 2
N m m ! 1 n + 1 n β m ω 1 , m max f α , 1 n + 1 n β +
2 N m f α , m max n m m ! 1 + N m tanh λ m + 1 + q + 1 q e 2 λ m ! 2 λ m .
At the end, we estimate
S n ¯ i = 1 N · x i α i x =
R N r = 0 θ w r i = 1 N u i n + r i n θ i x i α i Z n x u d u
R N r = 0 θ w r i = 1 N u i n x i + 1 n α i Z n x u d u =
R N i = 1 N u i n x i + 1 n α i Z n x u d u
(as in the proof of Theorem 13)
2 n j i = 1 N 1 + tanh λ α i + 2 + q + 1 q e 2 λ α i + 1 ! 2 λ α i + 1 .
The theorem is proven. □
Next comes the simultaneous multivariate activated approximation.
Theorem 15. 
Let i N be fixed, with f C i R N , N N . We assume that f α C B R N for α : α = l , l = 0 , 1 , , i . Here, 0 < β < 1 , n N : n 1 β > 2 , x R N .
Then,
(i) 
S n f α x f α x ω 1 f α , 1 n β + 2 q + 1 q f α e 2 λ n 1 β 1 = : λ α s ,
and
S n f α f α λ α s ,
(ii) 
S n * f α x f α x ω 1 f α , 1 n + 1 n β + 2 q + 1 q f α e 2 λ n 1 β 1 = : ρ α s ,
and
S n * f α f α ρ α s ,
and
(iii) 
S n ¯ f α x f α x ω 1 f α , 1 n + 1 n β + 2 q + 1 q f α e 2 λ n 1 β 1 = ρ α s ,
and
S n ¯ f α f α ρ α s .
Proof. 
We prove Theorems 6–8 and Remark 3. □
Next comes simultaneous global smoothness preservation.
Theorem 16. 
Let i N be fixed, with f C i R N , N N . We assume that f α C B R N C U R N for α : α = l , l = 0 , 1 , , i .
Then,
ω 1 S n f α , δ ω 1 f α , δ , δ > 0
ω 1 S n * f α , δ ω 1 f α , δ ,
and
ω 1 S n ¯ f α , δ ω 1 f α , δ .
If f α C U R N , then S n f α , S n * f α and S n ¯ f α C U R N .
Proof. 
We prove Theorems 9–11 and Remark 3. □
Under simultaneous activated multivariate extended differentiation, we derive the following result.
Theorem 17. 
Let 0 < β < 1 , n N : n 1 β > 2 ; x R N , N N . Let f C i ¯ R N , i ¯ N ; f γ denote a partial derivative of f, γ : = γ 1 , , γ N , γ j Z + , j = 1 , , N , and γ : = j = 1 N γ j = r , where r = 0 , 1 , , i ¯ . We assume any f γ C B R N for all γ : γ = r , r = 0 , 1 , , i ¯ .
We further assume that f γ C m R N , m N , with f γ α C B R N : α = l , l = 0 , 1 , , m . Then,
(i) 
S n f γ x f γ x
j = 1 m α : α = j 1 i = 1 N α i ! f γ α x S n i = 1 N · x i α i x
N m m ! n m β ω 1 , m max f γ α , 1 n β +
2 f γ α , m max N 2 m n m m ! tanh λ m + 1 + q + 1 q e 2 λ m ! 2 λ m ,
(ii) 
S n * f γ x f γ x
j = 1 N α : α = j 1 i = 1 N α i ! f γ α x S n * i = 1 N · x i α i x
N m m ! 1 n + 1 n β m ω 1 , m max f γ α , 1 n + 1 n β +
2 N m f γ α , m max n m m ! 1 + N m tanh λ m + 1 + q + 1 q e 2 λ m ! 2 λ m = : Ψ γ s α ,
and
(iii) 
S n ¯ f γ x f γ x
j = 1 N α : α = j 1 i = 1 N α i ! f γ α x S n ¯ i = 1 N · x i α i x Ψ γ s α .
Proof. 
We prove Theorems 12–14 and Remark 3. □
In the final part of this work, we present our results related to activated iterative approximation. This is a continuation of Remarks 4–6.
Theorem 18. 
Let 0 < β < 1 , n N : n 1 β > 2 , r N , f C B R N . Then,
(I) 
S n r f f r S n f f r ω 1 f , 1 n β + 2 q + 1 q f e 2 λ n 1 β 1 ,
(II) 
S n * r f f r S n * f f r ω 1 f , 1 n + 1 n β + 2 q + 1 q f e 2 λ n 1 β 1 ,
and
(III) 
S n ¯ r f f r S n ¯ f f r ω 1 f , 1 n + 1 n β + 2 q + 1 q f e 2 λ n 1 β 1 .
So, the speed of convergence of S n r , S n * r , S n ¯ r to unit I is not worse than the speed of convergence of S n , S n * , S n ¯ to I.
Proof. 
We prove Theorems 6–8 and (87). □
We continue with the following:
Theorem 19. 
Let 0 < β < 1 ; m 1 , m 2 , , m r N : m 1 m 2 m r , with m i 1 β > 2 , i = 1 , , r ; f C B R N . Then,
(I) 
S m r S m r 1 S m 2 S m 1 f f i = 1 r S m i f f
i = 1 r ω 1 f , 1 m i β + 2 q + 1 q f e 2 λ m i 1 β 1 r ω 1 f , 1 m 1 β + 2 q + 1 q f e 2 λ m 1 1 β 1 ,
(II) 
S m r * S m r 1 * S m 2 * S m 1 * f f i = 1 r S m i * f f
i = 1 r ω 1 f , 1 m i + 1 m i β + 2 q + 1 q f e 2 λ m i 1 β 1
r ω 1 f , 1 m 1 + 1 m 1 β + 2 q + 1 q f e 2 λ m 1 1 β 1 ,
and
(III) 
S m r ¯ S m r 1 ¯ S m 2 ¯ S m 1 ¯ f f i = 1 r S m i ¯ f f
i = 1 r ω 1 f , 1 m i + 1 m i β + 2 q + 1 q f e 2 λ m i 1 β 1
r ω 1 f , 1 m 1 + 1 m 1 β + 2 q + 1 q f e 2 λ m 1 1 β 1 .
Clearly, we notice that the speed of convergence to the unit operator of the above activated multiply iterated operator is not worse than the speed of operators S m 1 , S m 1 * , and S m 1 ¯ to the unit, respectively.
Proof. 
We prove Theorems 6–8 and (89). □
We finish our work with multivariate simultaneous iterations.
Remark 8. 
Let i N be fixed. Assume that f C i R N , with f α C B R N , with α : α = l , l = 0 , 1 , , i ; r N . Then, according to (87), we obtain
S n r f α f α r S n f α f α .
According to (78) and inductively, we obtain
S n r f α f α r S n f α f α ,
Similarly, we derive that
S n * r f α f α r S n * f α f α ,
and
S n ¯ r f α f α r S n ¯ f α f α .
Now, let m 1 , m 2 , , m r N : m 1 m 2 m r . Then, based on (89), we find that
S m r S m r 1 S m 2 S m 1 f α f α i * = 1 r S m i * f α f α .
Similarly, we determine that
S m r * S m r 1 * S m 2 * S m 1 * f α f α i * = 1 r S m i * * f α f α ,
and
S m r ¯ S m r 1 ¯ S m 2 ¯ S m 1 ¯ f α f α i * = 1 r S m i * ¯ f α f α .
All the above inequalities (189)–(195) prove that our implied multivariate iterative simultaneous approximations do not have a speed worse than our basic simultaneous approximations using activated convolution operators.
Conclusion: Here, we presented a new idea of going from neural networks’ main tools, the activation functions, to multivariate convolution integral approximation. This represents a rare case of applying applied mathematics to theoretical mathematics.

Funding

This research received no external funding.

Data Availability Statement

There are no data available, as this is a theoretical article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Anastassiou, G.A. Parametrized, Deformed and General Neural Networks; Springer: Heidelberg, Germany; New York, NY, USA, 2023. [Google Scholar]
  2. Anastassiou, G.A. Approximation by symmetrized and perturbed hyperbolic tangent activated convolution type operators. Mathematics 2024, 12, 3302. [Google Scholar] [CrossRef]
  3. Anastassiou, G.A.; Gal, S.G. Approximation Theory; Birkhäuser: Boston, MA, USA; Basel, Switzerland; Berlin, Germany, 2000. [Google Scholar]
  4. Wang, Y.; Wang, T.; Liam, H. The series expansions and blow-up time estimation for the solutions of convolution Volterra-Hammerstein integral equations. Numer. Algorithms 2024, 95, 637–663. [Google Scholar] [CrossRef]
  5. Askhabov, S.N. A system of inhomogeneous integral equations of convolution type with power nonlinearity. Sib. Math. J. 2023, 64, 691–698. [Google Scholar] [CrossRef]
  6. Wang, M.; Dai, X.; Yu, Y.; Xiao, A. Fast θ-Maruyama scheme for stochastic Volterra integral equations of convolution type: Mean-square stability and strong convergence analysis. Comput. Appl. Math. 2023, 42, 108. [Google Scholar] [CrossRef]
  7. Angeloni, L.; Merentes, N.J.; Valera-López, M.A. Convolution integral operators in variable bounded variation spaces. Mediterr. J. Math. 2023, 20, 141. [Google Scholar] [CrossRef]
  8. Askhabov, S.N. System of inhomogeneous integral equations of convolution type with power nonlinearity. Vladikavkaz Math. J. 2022, 24, 5–14. (In Russian) [Google Scholar] [CrossRef]
  9. Khachatryan, K.A.; Petrosyan, A.S. Alternating bounded solutions of a class of nonlinear two-dimensional convolution-type integral equations. Trans. Mosc. Math. Soc. 2021, 82, 259–271. [Google Scholar] [CrossRef]
  10. Askhabov, S.N. Nonlinear convolution type integral equations in complex spaces. Ufim. Math. J. 2021, 13, 17–30. [Google Scholar] [CrossRef]
  11. Safaryan, M.H. On generalizations of Fatou’s theorem in Lp for convolution integrals with general kernels. J. Geom. Anal. 2021, 31, 3280–3299. [Google Scholar] [CrossRef]
  12. Karchevskii, A.L. Solution of the convolution type Volterra integral equations of the first kind by the quadtrature-sum method. Sib. Zh. Ind. Mat. 2020, 23, 40–52. Translation in J. Appl. Ind. Math. 2020, 14, 503–512. (In Russian) [Google Scholar] [CrossRef]
  13. Karapetrović, B.; Mashreghi, J. Hadamard convolution and area integral means in Bergman spaces. Results Math. 2020, 75, 70. [Google Scholar] [CrossRef]
  14. Khachatryan, K.A.; Petrosyan, H.S. On a class of convolution type nonlinear integral equations with an even kernel. Internat. J. Modern Phys. A 2022, 37, 2243014. [Google Scholar] [CrossRef]
  15. Sun, M.; Li, P.; Bai, S. A new efficient method for two classes of singular convolution integral equations of non-normal type with Cauchy kernel. J. Appl. Anal. Comput. 2022, 12, 2057–2074. [Google Scholar] [CrossRef] [PubMed]
  16. Pleshchinskii, N.B. The over-determined boundary value problems and convolution type integral transformations. Lobachevskii J. Math. 2022, 43, 1260–1269. [Google Scholar] [CrossRef]
  17. Khachatryan, K.A.; Petrosyan, H.S. On one class of multidimensional integral equations of convolution type with convex nonlinearity. Differ. Equ. 2022, 58, 680–690, Translation of Differ. Uravn. 2022, 58, 686–695.. [Google Scholar] [CrossRef]
  18. Bauer, H. Maß-und Integrations Theorie; de Gruyter: Berlin, Germany, 1990. [Google Scholar]
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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.