Next Article in Journal
Generalized Bertrand Curves of Non-Light-like Framed Curves in Lorentz–Minkowski 3-Space
Previous Article in Journal
Identification of Patterns in CO2 Emissions among 208 Countries: K-Means Clustering Combined with PCA and Non-Linear t-SNE Visualization
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Semi-Discretized Approximation of Stability of Sine-Gordon System with Average-Central Finite Difference Scheme

1
School of Mathematics and Statistics, Hainan University, Haikou 570228, China
2
School of Mathematics, Tianjin University, Tianjin 300072, China
3
School of Mathematical Sciences, Daqing Normal University, Daqing 163712, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2024, 12(16), 2592; https://doi.org/10.3390/math12162592
Submission received: 19 June 2024 / Revised: 11 August 2024 / Accepted: 18 August 2024 / Published: 22 August 2024

Abstract

:
In this study, the energy control and asymptotic stability of the 1D sine-Gordon equation were investigated from the viewpoint of numerical approximation. An order reduction method was employed to transform the closed-loop system into an equivalent system, and an average-central finite difference scheme was constructed. This scheme is not only energy-preserving but also possesses uniform stability. The discrete multiplier method was utilized to obtain the uniformly asymptotic stability of the discrete systems. Moreover, to cope with the nonlinear term of the model, a discrete Wirtinger inequality suitable for our approximating scheme was established. Finally, several numerical experiments based on the eigenvalue distribution of the linearized approximation systems were conducted to demonstrate the effectiveness of the numerical approximating algorithm.

1. Introduction

The sine-Gordon equation, a type of semi-linear wave equation, is utilized to model a range of physical phenomena. This includes the behavior of Josephson junctions, seismic activity such as earthquakes and slow slip and after-slip events, and dislocation within materials. The sine-Gordon equation has recently grown in importance as a class of classical infinite-dimensional nonlinear dynamical systems. The controlled system exhibits high nonlinearity, making finding global or roughly global solutions challenging. Nevertheless, numerous studies have been conducted in recent years to explore the numerical solution of this equation. For instance, Zhou provided a more precise estimate of the dimension of the global attractor for discretization of the damped sine-Gordon equation with the periodic boundary condition [1]. Three effective energy-conserving compact finite difference schemes for numerically solving the sine-Gordon equation with homogeneous Dirichlet boundary conditions were developed [2]. Radial basis functions (RBFs) and a finite difference technique were used to derive the approximate solution of the two-dimensional (2D) time-fractional stochastic sine-Gordon equation in non-rectangular domains in [3].
Energy control problems arise in many disciplines, such as engineering and physics, among others. Examples of these issues have been addressed in previous studies [4,5,6]. While the regulation or tracking of linear models as control objectives has been the focus of the majority of previous efforts, the control of oscillatory modes is one of the main areas of control theory and is inspired by real-world issues such as vibration separation and suppression. Some of the developed techniques can be used to stabilize wave motion and/or other distributed systems. Over the last few decades, control methods addressing regulation and tracking issues for systems described by partial differential equations (PDEs), including optimum control, resilient control, adaptive control, etc., have been proposed. Additionally, during the 1990s, a growing trend that focused on oscillation shaping and synchronization, as opposed to suppression, emerged, bringing forth new research areas. However, until recently, distributed systems and wave control were included in an energy control strategy that was first proposed in [7,8] based on the speed-gradient method. The primary reason is that the necessary set energy level might be a complex, unbounded set. However, there has not been much research on the sine-Gordon model of energy regulation in an infinite-dimensional environment. In [9], the problem of observer-based boundary control of sine-Gordon model energy was investigated. Specifically, a Luenberger-type observer for the sine-Gordon equation was analyzed. The authors not only addressed the observer-based boundary control of sine-Gordon model energy but also provided explicit bounds on the system parameters. These bounds are crucial, as they ensure the exponential decay of the estimation error. This means that in the above study, the authors established specific limits within which the system parameters must lie to guarantee that the error in estimating the system state decreases exponentially over time. Furthermore, speed-gradient output feedback for the energy control of the sine-Gordon model was proposed. The problem was numerically studied in [10], further supporting the validity of this strategy. The simplest speed-gradient-proportional algorithm performed the best across all three performance criteria (limit error, transient time, and threshold of stability for the sampling interval). The “relay” speed-gradient algorithm was devised and adaptively improved in [11] by employing state feedback and in-domain actuators. However, these studies were based on continuous systems, and there are not many discrete systems with which to advance research in this field.
Discretization is a crucial process for PDE systems in terms of enabling the application of theoretical results in engineering technology. In most scenarios, a PDE is first discretized into a sequence of finite-dimensional systems represented by ordinary differential equations (ODEs), which are familiar to most engineers. This discretization procedure primarily focuses on the spatial variable while keeping the time variable continuous. In a sense, this process approximates an infinite-dimensional system by using finite-dimensional systems and is referred to as semi-discretization. Secondly, preserving the essential control or geometric properties inherent in the original PDEs is a primary concern during the semi-discretization process.
Therefore, building structure-preserving algorithms and energy-preserving or stability-preserving algorithms is a research hot spot in computational mathematics [5] and control theory [12,13]. For example, the uniform exponential stability of semi-discrete schemes for linear hyperbolic PDEs has been discussed extensively in the past decade (see [14,15,16,17,18,19,20]). However, there are few results on the uniform asymptotic stability of nonlinear systems. Up until now, research on uniform approximation of nonlinear systems has been primarily concentrated on systems with nonlinear boundary conditions [12]. The task of approximating the uniformly asymptotic stability of the sine-Gordon system is particularly challenging due to the nonlinear term appearing in system equations.
In our work, the aims are to fill the gap and to tackle this problem for the first time by establishing suitable discrete time-domain energy multipliers. More precisely, the sine-Gordon system was investigated from the viewpoint of numerical approximation, in line with previous studies [15,16]. A new finite difference scheme that is both energy- and stability-preserving was designed for the sine-Gordon equation. For this purpose, the PDE component was first numerically discretized, and it was turned into a family of ODEs. Subsequently, the uniform stability of this family of discrete systems was studied, i.e., whether or not the discrete energies uniformly converge concerning the mesh size. To validate uniform stability, the common approach is to follow each step of the continuous case (see, for instance, [15,16,18,20]). The discrete multiplier method was utilized to obtain the uniform stability of the discrete system. Moreover, to cope with the nonlinear term of the model, a discrete Wirtinger inequality suitable for our approximating scheme was established.
Based on the above, the novelty of this work is two-fold. First, an appropriate numerical approximating scheme for a nonlinear PDE that is both energy-preserving and stability-preserving was designed. Secondly, we generalized the conclusions reported in [15,16,20] from the exponential stability of linear models to the asymptotic stability of nonlinear systems.
This remainder of this paper is organized as follows: In Section 2, the problem formulation is presented, and relevant definitions and the control algorithm are introduced. In Section 3, an order reduction method is utilized to transform the sine-Gordon equation into an equivalent system, and a suitable semi-discretization system is designed. The main result of this study is then presented. In Section 4, the several numerical experiments conducted to demonstrate the effectiveness of the numerical approximating scheme are presented. In Section 5, some conclusions and remarks are presented.

2. Problem Formulation and Speed-Gradient Control Law

Consider the one-dimensional sine-Gordon equation incorporating initial conditions and boundary control mechanisms.
z t t ( t , x ) k z x x ( t , x ) + β sin z ( t , x ) = 0 , t > 0 , x ( 0 , 1 ) ,
z ( t , 0 ) = 0 , z x ( t , 1 ) = u ( t ) , t > 0 ,
z ( 0 , x ) = z 0 ( x ) , z t ( 0 , x ) = z 1 ( x ) , x ( 0 , 1 ) ,
y ( t ) = z t ( t , 1 ) , t 0 ,
where t 0 is the time variable, x ( 0 , 1 ) is a spatial variable, z t ( t , x ) represents the first-order derivative with respect to the time variable, z x ( t , x ) represents the first-order derivative with respect to the spatial variable, β > 0 and k > 0 , z 0 H 1 ( 0 , 1 ) , z 1 L 2 ( 0 , 1 ) are given functions, u ( t ) is a control input, and y ( t ) is the output.
H ( t ) = 0 1 z t 2 ( t , x ) 2 + k z x 2 ( t , x ) 2 + β 1 cos z ( t , x ) d x
is the Hamiltonian that corresponds to the sine-Gordon equation. The quantity ( H ( t ) ) is conserved along solutions of the unforced system (see (19)). In addition, H ( t ) is greater than or equal to zero, and H ( t ) equals zero only when z ( t , x ) is equal to zero. As a result, H ( t ) can be thought of as the energy at time t, and H ( t ) is replaced with E ( t ) .
A control law ( u ( t ) ) must be identified that will make the energy of the system (1)–(4) conform to the expected value ( E * ) (see also [21]), taking the following form:
lim t + E ( t ) = E * .
Let us design a control law that addresses the energy control issue using the Speed-Gradient (SG) approach ([22,23]). First, we introduce the goal function, i.e.,
Q ( t ) = 1 2 ( E ( t ) E * ) 2 ,
which is the difference between the present and required energy. The derivative of this function is
Q t = ( E ( t ) E * ) 0 1 z t z t t + k z x z x t + β sin z z t d x .
Substituting k z x x ( t , x ) β sin z ( t , x ) for z t t and integrating the term z x z x t by parts, one obtains
Q t = ( E ( t ) E * ) [ k z x ( t , 1 ) z t ( t , 1 ) k z x ( t , 0 ) z t ( t , 0 ) ] .
Thus, the boundary condition ( z ( t , 0 ) = 0 ) yields
Q t = k ( E ( t ) E * ) u ( t ) y ( t ) .
In the second step, the gradient ( u Q t ) of Q t with respect to the component ( u ( t ) ) is derived as
u Q t = k ( E ( t ) E * ) y ( t ) .
In the third step, the vector function ( η ( z , z t ) ) is selected to satisfy the acute angle condition ( η T u Q t 0 ). The following control law results from this:
u 0 ( t ) = k γ ( E ( t ) E * ) y ( t ) ,
where the scalar gain is defined as γ > 0 . A more generic control algorithm is expressed in the following form:
u ( t ) = γ ψ ( E ( t ) E * ) y ( t ) ,
where ψ : R R is a continuous function such that ψ ( 0 ) = 0 and ψ ( s ) s > 0 for s 0 .

3. The Semi-Discretized System

In this section, the original system (1)–(4) is first transformed into an equivalent system. A spatial semi-discretized finite difference approach is then built for the order-reduced system. Furthermore, uniform stability is investigated for these semi-discretized systems.

3.1. Order Reduction and Semi-Discretization

The introduction of auxiliary functions v ( t , x ) = z t ( t , x ) and w ( t , x ) = z x ( t , x ) , (1)–(4) with feedback control (12) can be rewritten as the following equivalent system:
v t ( t , x ) k w x ( t , x ) + β sin z ( t , x ) = 0 ,
w t ( t , x ) v x ( t , x ) = 0 , t 0 , 0 < x < 1 ,
z t ( t , x ) = v ( t , x ) ,
v ( t , 0 ) = 0 , w ( t , 1 ) = γ ψ ( E ( t ) E * ) v ( t , 1 ) ,
v ( 0 , x ) = v 0 ( x ) , w ( 0 , x ) = w 0 ( x ) ,
where ( v 0 , w 0 ) = ( z 1 , z x 0 ) L 2 ( 0 , 1 ) × L 2 ( 0 , 1 ) . The energy ( E ( t ) ) of (13)–(17) now equivalently reads
E ( t ) = 0 1 v 2 ( t , x ) 2 + k w 2 ( t , x ) 2 + β ( 1 cos z ( t , x ) ) d x ,
and satisfies
d E ( t ) d t = k γ ψ ( E ( t ) E * ) v 2 ( t , 1 ) .
A few notations are introduced before performing finite difference semi-discretization on the system (13)–(17). A partition of the spatial domain [ 0 , 1 ] with equal distance of h : = 1 N + 1 for every N N + is given, i.e.,
1 = x N + 1 > > x j = j h > > x 1 > x 0 = 0 .
The difference operator and the average operator are denoted as
δ x z j + 1 2 ( t ) = z j + 1 ( t ) z j ( t ) h , z j + 1 2 ( t ) = z j + 1 ( t ) + z j ( t ) 2 .
In the sequel, the prime symbol () denotes differentiation with respect to time.
By following the difference scheme reported in [15,16,19,20] and replacing sin z ( t , x j ) with sin z j + 1 2 ( t ) , a semi-discretized finite difference scheme of (13)–(17) is arrived at as follows:
v j + 1 2 ( t ) k δ x w j + 1 2 ( t ) + β sin z j + 1 2 ( t ) = 0 ,
w j + 1 2 ( t ) δ x v j + 1 2 ( t ) = 0 , j = 0 , , N ,
z j ( t ) = v j ( t ) , j = 0 , , N + 1 ,
v k ( 0 ) = v k 0 , w k ( 0 ) = w k 0 ,
v 0 ( t ) = 0 , w N + 1 ( t ) = γ ψ ( E h ( t ) E * ) v N + 1 ( t ) ,
in which v j ( t ) , w j ( t ) , and z j ( t ) are approximations of v ( t , x j ) , w ( t , x j ) , and z ( t , x j ) , respectively; v k 0 and w k 0 are the approximations of the initial values of v 0 ( x k ) and w 0 ( x k ) , respectively; and E h ( t ) is defined by (27) in the next subsection.
The following lemma (see [16], Lemma 2.2) is simple but extremely helpful in demonstrating the convergence of energy.
Lemma 1.
For any grid functions ( { V j ( t ) } j = 0 N + 1 , { W j ( t ) } j = 0 N + 1 , { Z j ( t ) } j = 0 N + 1 ) at mesh grids ( { x j } j = 0 N + 1 ), the below two summation by parts formulas hold:
h j = 0 N δ x V j + 1 2 W j + 1 2 + h j = 0 N V j + 1 2 δ x W j + 1 2 = V N + 1 W N + 1 V 0 W 0 ,
and
h j = 0 N δ x V j + 1 2 W j + 1 2 Z j + 1 2 + h j = 0 N V j + 1 2 δ x W j + 1 2 Z j + 1 2 + h j = 0 N V j + 1 2 W j + 1 2 δ x Z j + 1 2 = V N + 1 W N + 1 Z N + 1 V 0 W 0 Z 0 h 3 4 j = 0 N δ x V j + 1 2 δ x W j + 1 2 δ x Z j + 1 2 .

3.2. Uniform Stability of (20)–(24)

The discretized energy of the finite difference scheme (20)–(24) is calculated as
E h ( t ) = h j = 0 N 1 2 v j + 1 2 ( t ) 2 + k 2 w j + 1 2 ( t ) 2 + β ( 1 cos z j + 1 2 ( t ) ) .
Here, E h ( t ) represents a natural discretization of the continuous energy ( E ( t ) ) as defined in (18). Moreover, a discrete counterpart result of (19) is easily derived.
Lemma 2.
The discrete goal function ( Q h ( t ) ) defined by Q h ( t ) = 1 2 E h ( t ) E * 2 satisfies
d Q h ( t ) d t = k γ ( E h ( t ) E * ) ψ ( E h ( t ) E * ) v N + 1 2 ( t ) 0 , t 0 .
Proof. 
Multiply both sides of the Equation (20) by h v j + 1 2 ( t ) and summarize j from 0 to N to acquire
h j = 0 N v j + 1 2 ( t ) v j + 1 2 ( t ) = k h j = 0 N v j + 1 2 ( t ) δ x w j + 1 2 ( t ) h β j = 0 N v j + 1 2 ( t ) sin z j + 1 2 ( t ) .
Similarly, multiplying both sides of Equation (21) by k h w j + 1 2 ( t ) and summing up j from 0 to N, we obtain
h k j = 0 N w j + 1 2 ( t ) w j + 1 2 ( t ) = k h j = 0 N w j + 1 2 ( t ) δ x v j + 1 2 ( t ) .
Then, (29)–(30) give
d E h ( t ) d t = k γ ψ ( E h ( t ) E * ) v N + 1 2 ( t ) .
Now, by noting Q h ( t ) = ( E h ( t ) E * ) E h ( t ) , the proof is completed. □
Remark 1.
In Equation (31), ψ ( s ) is a continuous function, and ψ ( s ) s > 0 for s 0 and ψ ( 0 ) = 0 show that
d E h ( t ) d t 0 , if   E h ( t ) > E * , = 0 , if   E h ( t ) = E * , 0 , if   E h ( t ) < E * .
The following assumption is introduced in order to establish the uniform convergence of E h ( t ) E * .
Assumption 1.
The parameters k > 0 and β > 0 in (1)–(4) satisfy the following inequalities: 0 < β < k / 4 .
A Lyapunov function is built as follows:
G h ( t ) = E h ( t ) + ε sign ( E h ( t ) E * ) Φ h ( t ) ,
where ε is a parameter determined later, sign ( · ) is the sign function, and the auxiliary function Φ h ( t ) is defined by
Φ h ( t ) = h j = 0 N x j + 1 2 v j + 1 2 ( t ) w j + 1 2 ( t ) .
Lemma 3.
The Lyapunov function ( G h ( t ) ) defined in (33) is equivalent to the discretized energy ( E h ( t ) ).
( 1 ε k 0 ) E h ( t ) G h ( t ) ( 1 + ε k 0 ) E h ( t ) ,
where k 0 = max { 1 , 1 / k } and 0 < ε < min { 1 , k } .
The proof is omitted, since it only involves simple calculation. The discrete Wirtinger inequality for our approximating scheme is established as follows.
Lemma 4.
Suppose that h ( N + 1 ) = 1 holds; then, for a sequence ( { z j } j = 0 N + 1 ) with z 0 = 0 , we have
h j = 0 N | z j + 1 2 | 2 h j = 0 N | δ x z j + 1 2 | 2 .
Proof. 
It is easy to see that z j + 1 = k = 0 j [ z k + 1 z k ] and
| z j + 1 | 2 j = 0 N | 1 | 2 j = 0 N | z j + 1 z j | 2 = ( N + 1 ) h 2 j = 0 N | δ x z j + 1 2 | 2 = h j = 0 N | δ x z j + 1 2 | 2 .
Thus, using inequality (37) one obtains
h j = 0 N | z j + 1 2 | 2 h 2 j = 0 N | z j + 1 | 2 + | z j | 2 ( N + 1 ) h 2 j = 0 N | δ x z j + 1 2 | 2 = h j = 0 N | δ x z j + 1 2 | 2 .
Lemma 5.
The auxiliary function ( Φ h ( t ) ) defined by (34) satisfies
d Φ h ( t ) d t C 0 E h ( t ) + 1 + k γ 2 ψ 2 ( E h ( t ) E * ) 2 v N + 1 2 ( t ) ,
where C 0 = 1 4 β / k > 0 according to Assumption 1.
Proof. 
Taking the derivative of Φ h ( t ) with respect to the solution of (20)–(24) yields
d Φ h ( t ) d t = k h j = 0 N x j + 1 2 ( t ) δ x w j + 1 2 ( t ) w j + 1 2 ( t ) + h j = 0 N x j + 1 2 ( t ) v j + 1 2 ( t ) δ x v j + 1 2 ( t ) h β j = 0 N x j + 1 2 ( t ) sin z j + 1 2 ( t ) w j + 1 2 ( t )
The second formula in Lemma 1 further shows
d Φ h ( t ) d t = k h 2 j = 0 N w j + 1 2 2 ( t ) + k 2 w N + 1 2 ( t ) h k 8 j = 0 N ( w j + 1 w j ) 2 h 2 j = 0 N v j + 1 2 2 ( t ) h 8 j = 0 N ( v j + 1 v j ) 2 + 1 2 v N + 1 2 ( t ) h β j = 0 N ( 1 cos z j + 1 2 ( t ) ) + h β j = 0 N ( 1 cos z j + 1 2 ( t ) ) h β j = 0 N x j + 1 2 w j + 1 2 ( t ) sin z j + 1 2 ( t ) .
Using Lemma 4 for { z j } j = 0 N + 1 , we obtain
h β j = 0 N x j + 1 2 ( t ) sin z j + 1 2 ( t ) w j + 1 2 ( t ) h β j = 0 N x j + 1 2 ( t ) sin z j + 1 2 ( t ) w j + 1 2 ( t ) h β j = 0 N | sin z j + 1 2 ( t ) w j + 1 2 ( t ) | h β 2 j = 0 N | sin z j + 1 2 ( t ) | 2 + j = 0 N | w j + 1 2 ( t ) | 2 h β 2 j = 0 N | z j + 1 2 ( t ) | 2 + j = 0 N | w j + 1 2 ( t ) | 2 h β 2 j = 0 N | δ x z j + 1 2 ( t ) | 2 + h β 2 j = 0 N | w j + 1 2 ( t ) | 2 = h β j = 0 N | w j + 1 2 ( t ) | 2 ,
where w j + 1 2 ( t ) = δ x z j + 1 2 ( t ) , which comes from w ( t , x ) = z x ( t , x ) , is utilized in the last step. Then, the term h β j = 0 N ( 1 cos z j + 1 2 ( t ) ) is calculated using Lemma 4 once more as follows:
h β j = 0 N ( 1 cos z j + 1 2 ( t ) ) = 2 h β j = 0 N sin 1 2 | z j + 1 2 ( t ) | 2 h β j = 0 N | z j + 1 2 ( t ) | 2 h β j = 0 N | w j + 1 2 ( t ) | 2 .
From the above (42) and (43), we have
d Φ h ( t ) d t k h 2 j = 0 N | w j + 1 2 ( t ) | 2 + k 2 w N + 1 2 ( t ) k h 8 j = 0 N ( w j + 1 w j ) 2 h 2 j = 0 N | v j + 1 2 ( t ) | 2 h 8 j = 0 N ( v j + 1 v j ) 2 + 1 2 v N + 1 2 ( t ) h β j = 0 N ( 1 cos z j + 1 2 ( t ) ) + 2 h β j = 0 N | w j + 1 2 ( t ) | 2 h 2 j = 0 N | v j + 1 2 ( t ) | 2 + 2 h β k h 2 j = 0 N | w j + 1 2 ( t ) | 2 h β j = 0 N ( 1 cos z j + 1 2 ( t ) ) + k γ 2 ψ 2 ( E h ( t ) E * ) 2 v N + 1 2 ( t ) + 1 2 v N + 1 2 ( t ) = h 2 j = 0 N | v j + 1 2 ( t ) | 2 h k 2 1 4 β k j = 0 N | w j + 1 2 ( t ) | 2 h β j = 0 N ( 1 cos z j + 1 2 ( t ) ) + 1 + k γ 2 ψ 2 ( E h ( t ) E * ) 2 v N + 1 2 ( t ) C 0 E h ( t ) + 1 + k γ 2 ψ 2 ( E h ( t ) E * ) 2 v N + 1 2 ( t ) ,
where mesh sizes of h = 1 / ( N + 1 ) and C 0 = 1 4 β / k > 0 are utilized. This yields the required result. □
Theorem 1.
If Assumption 1 holds, then the energies ( E h ( t ) ) of the discrete systems ((20)–(24)) are uniformly convergent to E * with respect to the step size h, i.e.,
E h ( t ) E * as t , for all h ( 0 , 1 ) .
Proof. 
By combining the derivative of function G h ( t ) as defined in (33) with Equation (31), one obtains
d G h ( t ) d t = d E h ( t ) d t + ε sign ( E h ( t ) E * ) d Φ h ( t ) d t = k γ ψ ( E h ( t ) E * ) v N + 1 2 ( t ) + ε sign ( E h ( t ) E * ) d Φ h ( t ) d t
Let Δ h > 0 be arbitrary and suppose that E h ( 0 ) > E * . Therefore, taking into account (32), E h ( t ) decreases for a time interval, then increases for the remaining part. This means that there exists T h , Δ [ 0 , + ) such that E h ( t ) E * + Δ h for any t [ 0 , T h , Δ ) and E h ( t ) < E * + Δ h for any t ( T h , Δ , + ) . The aim is to show that T h , Δ < + for any Δ h > 0 .
It is proven by contradiction, and suppose that there exists Δ h > 0 such that T h , Δ = + . We define
ξ h , Δ = min { ψ ( s ) | s [ Δ h , E h ( 0 ) E * ] } > 0 ,
and
η h , Δ = max { ψ ( s ) | s [ Δ h , E h ( 0 ) E * ] } > 0 .
Then, for any t 0 , one has ξ h , Δ ψ ( E h ( t ) E * ) η h , Δ . Therefore, in light of (35), (39) and (46), one obtains
d G h ( t ) d t ε C 0 1 + ε k 0 G h ( t ) + ε 1 + k γ 2 η h , Δ 2 2 v N + 1 2 ( t ) k γ ξ h , Δ v N + 1 2 ( t )
for any t 0 . Choosing ε > 0 sufficiently small such that ε < 2 k γ ξ h , Δ 1 + k γ 2 η h , Δ 2 , one finds that d G h ( t ) d t C ε G h ( t ) , t 0 , where C ε = ε C 0 1 + ε k 0 > 0 . A direct use of Gronwall’s inequality leads to G h ( t ) G h ( 0 ) e C ε t for any t 0 .
This means that, for   all   h ( 0 , 1 ) , G h ( t ) 0 as t , which contradicts the definition of T h , Δ and the fact that E * + Δ h > 0 . Thus, T h , Δ < + and E h ( t ) < E * + Δ h for any t > T h , Δ . Hence, E h ( t ) E * as t +   for   all   h ( 0 , 1 ) because Δ h > 0 was chosen arbitrarily.
Now, suppose that E h ( 0 ) < E * and E h ( t ) E * Δ h for any t [ 0 , + ) , then arguing in a similar way to the case of E h ( 0 ) > E * , one can show that for any sufficiently small ε > 0 and some D ε > 0 , the following inequality holds true:
d G h ( t ) d t D ε G h ( t ) , t 0 .
Thus, G h ( t ) G h ( 0 ) e D ε t for any t 0 . In this case, we obtain   for   all   h ( 0 , 1 ) , and G h ( t ) approaches positive infinity as t approaches infinity. This contradicts the assumption that E h ( t ) E * Δ h for any t [ 0 , + ) . Hence, E h ( t ) E * as t +   for   all   h ( 0 , 1 ) , since Δ h > 0 is arbitrary. □

4. Numerical Analysis

In this section, we first show that the semi-discretized finite difference scheme (20)–(24) for an equivalent system (13)–(17) can also yield a semi-discretized finite difference scheme for the original system (1)–(4).
Lemma 6.
Let z ( t , x ) be a solution of system (1)–(4). The semi-discretized average-central finite difference scheme (20)–(24) can be used to numerically solve the original system (1)–(4) as follows:
1 4 z j 1 ( t ) + 2 z j ( t ) + z j + 1 ( t ) k δ x 2 z j ( t ) + β 2 ( sin z j 1 2 + sin z j + 1 2 ) = 0 , j = 1 , , N , 1 2 z N ( t ) + z N + 1 ( t ) + β 2 sin z N + 1 2 + k h δ x z N + 1 2 + k h γ ψ ( E h ( t ) E * ) z N + 1 ( t ) = 0 , z 0 ( t ) = 0 , z j ( 0 ) = z 0 ( x j ) , z j ( 0 ) = z 1 ( x j ) , j = 0 , 1 , 2 , , N + 1 ,
where z j ( t ) represents approximations of z ( t , x j ) for j = 0 , 1 , , N + 1 .
Proof. 
It follows from v ( t , x ) = z t ( t , x ) and w ( t , x ) = z x ( t , x ) that
v j + 1 2 = z j + 1 2 , w j + 1 2 = δ x z j + 1 2 , j = 0 , 1 , , N .
By multiplying both sides of the Equation (20) by h 2 , one obtains
k ( w j + 1 w j ) 2 h β 2 sin z j + 1 2 = h 2 v j + 1 2 , j = 0 , , N .
Then, combining with (52), for j = 0 , , N we have
w j + 1 = δ x z j + 1 2 + h 2 k z j + 1 2 + h β 2 k sin z j + 1 2 , w j = δ x z j + 1 2 h 2 k z j + 1 2 h β 2 k sin z j + 1 2 .
Eliminating the variable w j , one obtains
z j + 1 2 z j + z j 1 h 2 + 1 4 k ( z j 1 + 2 z j + z j + 1 ) + β 4 k ( sin z j 1 2 + sin z j + 1 2 ) = 0 ,
which yields the first equation of (51). Setting j = N in the first equation of (54) derives
w N + 1 = δ x z N + 1 2 + h 2 k z N + 1 2 + h β 2 k sin z N + 1 2 ,
amd with the right boundary of (24), the second equation of (51) is derived. The left boundary condition and initial conditions are trivial. The proof of the lemma is complete. □
In order to perform numerical simulations, the first choice of the approximation of the nonlinear term ( sin z j + 1 2 ) is z j + 1 2 for j = 1 , 2 , , N . In this case, (51) becomes
1 4 z j 1 ( t ) + 2 z j ( t ) + z j + 1 ( t ) k δ x 2 z j ( t ) + β 2 ( z j 1 2 + z j + 1 2 ) = 0 , j = 1 , , N , 1 2 z N ( t ) + z N + 1 ( t ) + β 2 z N + 1 2 + k h δ x z N + 1 2 + k h γ ψ ( E h ( t ) E * ) z N + 1 ( t ) = 0 , z 0 ( t ) = 0 , z j ( 0 ) = z 0 ( x j ) , z j ( 0 ) = z 1 ( x j ) , j = 0 , 1 , 2 , , N + 1 ,
The discrete scheme (57) should be rewritten as a state space formulation. For this purpose, we define ( N + 1 ) × ( N + 1 ) matrices as follows:
P = 2 1 1 2 1 1 2 1 2 2 , B = 2 1 1 2 1 1 2 1 1 1 ,
and A = d i a g { 0 , , a } with a = k γ ψ ( E h ( t ) E * ) belonging to C ( N + 1 ) × ( N + 1 ) . Then, (51) can be rewritten respectively as the vectorial forms:
P 4 Z h ( t ) + β 4 P Z h ( t ) + k h 2 B Z h + 1 h A Z h = 0 , Z h ( 0 ) = Z h 0 , Z h ( 0 ) = Z h 1 ,
where Z h ( t ) = z 1 ( t ) , , z N + 1 ( t ) , Z h 0 = z 1 0 , , z N + 1 0 , Z h 1 = z 1 1 , , z N + 1 1 .
By setting
P h = I 0 0 1 4 P , B h = 0 I β 4 P k h 2 B 1 h A ,
the differential Equation (57) is then equivalent to
P h Y h ( t ) = B h Y h ( t ) Y h ( t ) = D h Y h ( t ) ,
with D h : = P h 1 B h and Y h ( t ) = ( Z h ( t ) , Z h ( t ) ) . Note that P h is evidently invertible (see [24]), but it corresponds to the average operator. If P h is replaced by the identity operator (I), the system (61) would not contain the average operator, and the corresponding scheme restores the classical finite difference for the original system (1)–(4).
The significance of the discrete scheme (61) is discussed here. We present thee plots in Figure 1, Figure 2 and Figure 3. Figure 1 depicts the maximal real parts of D h (with the average operator) and B h (without the average operator) for N = 10 : 5 : 400 . Figure 2 depicts the distributions of the eigenvalues of D h and B h in which N = 200 . In Figure 1 and Figure 2, the feedback control (a) is set as a random number located within the interval of [ 0.5 , 0.5 ] . It is easy to see from Figure 1 that the maximal real parts of the eigenvalues of D h are almost negative, and those of B h are positive. This means that the classical finite difference does not preserve uniform asymptotic stability. This is in accordance with the analysis reported in [24]. However, the average-central finite difference scheme (20)–(24), which corresponds to D h , may be uniformly asymptotically stable. This matches the main result of Theorem 1. Moreover, the importance of the feedback control gain ( a = k γ ψ ( E h ( t ) E * ) ) is reflected through Figure 1 and Figure 3. If a is fixed at a = 0.5 , the stability of the average-central finite difference scheme (20)–(24) is still preserved, and the maximal real parts of D h are almost the same. The other parameters are selected as β = k = γ = 1 in these figures.
In the next numerical simulations, the second choice of the approximation of the nonlinear term ( sin z j + 1 2 ) is z j + 1 for j = 1 , 2 , , N . In this scenario, (51) becomes
1 4 z j 1 ( t ) + 2 z j ( t ) + z j + 1 ( t ) k δ x 2 z j ( t ) + β 2 z j + z j + 1 = 0 , j = 1 , , N , 1 2 z N ( t ) + z N + 1 ( t ) + β 2 z N + 1 + k h δ x z N + 1 2 + k h γ ψ ( E h ( t ) E * ) z N + 1 ( t ) = 0 , z 0 ( t ) = 0 , z j ( 0 ) = z 0 ( x j ) , z j ( 0 ) = z 1 ( x j ) , j = 0 , 1 , 2 , , N + 1 ,
The state space formulation of the discrete scheme (62) is expressed as follows:
P 4 Z h ( t ) + β D Z h ( t ) + k h 2 B Z h + 1 h A Z h = 0 , Z h ( 0 ) = Z h 0 , Z h ( 0 ) = Z h 1 ,
with an ( N + 1 ) × ( N + 1 ) matrix as follows:
D = 1 2 1 1 1 1 1 1 1 .
Moreover, the differential Equation (62) is then equivalent to
P h Y h ( t ) = C h Y h ( t ) Y h ( t ) = G h Y h ( t ) ,
with G h : = P h 1 C h and
C h = 0 I β D k h 2 B 1 h A .
Figure 4, Figure 5 and Figure 6 are plotted for the discrete scheme (65) as above. The k, β , γ , and a parameters are the same as above. From these figures, it is easy to see that the discrete schemes ((61) and (65)) are similar. However, discrete scheme (65) is simpler than (61) and has lower computational costs. This implies that (65) is a more optimal approximation.

5. Conclusions

In this study, we investigated the asymptotic stability of the sine-Gordon system from the viewpoint of numerical approximation. It is widely recognized that the traditional finite difference scheme cannot uniformly preserve the exponential stability of a continuous system. Furthermore, given the challenge of the nonlinear term emerging in the model, we employed the order-reduction method to create a spatially semi-discretized finite difference scheme specifically designed for continuous systems. Moreover, to cope with the challenging nature of the nonlinear term in the proof of the main result, a discrete Wirtinger inequality suitable for our approximating scheme was established. More interestingly, we discovered that the proof of uniformly asymptotic stability for the semi-discretized system, using the order-reduction method, could be conducted in parallel with that of its continuous PDE counterpart. Importantly, the method proposed in this paper is not limited to the specific nonlinear PDE under investigation but can be readily applied to other partial differential equations or coupled systems where exponential stability can be established. However, we should point out that convergence and stability analyses of algorithms are not within the scope of this article. Moreover, the current numerical experiments may not necessarily reflect the nonlinearity of the system. These issues are worth investigating in further research.

Author Contributions

Conceptualization, X.W. and F.Z.; Methodology, S.W. and F.Z.; Software, X.Q.; Validation, F.Z.; Formal analysis, X.W. and S.W.; Resources, X.W.; Data curation, X.Q.; Writing—original draft, S.W. and X.Q.; Writing—review & editing, F.Z.; Supervision, F.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This paper is supported by the Heilongjiang Provincial Natural Science Foundation of China (No. LH2022A001).

Data Availability Statement

The data will be made available by the authors on request.

Acknowledgments

The authors would like to thank the anonymous reviewers for their very careful reading and valuable comments and suggestions to improve the manuscript.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Zhou, S. Dimension of the global attractor for discretization of damped sine-Gordon equation. Appl. Math. Lett. 1999, 12, 95–100. [Google Scholar] [CrossRef]
  2. Almushaira, M. Efficient energy-preserving eighth-order compact finite difference schemes for the sine-Gordon equation. App. Math. Comput. 2023, 451, 128039. [Google Scholar] [CrossRef]
  3. Mirzaee, F.; Rezaei, S.; Samadyar, N. Numerical solution of two-dimensional stochastic time-fractional Sine-Gordon equation on non-rectangular domains using finite difference and meshfree methods. Eng. Anal. Bound. Elem. 2021, 127, 53–63. [Google Scholar] [CrossRef]
  4. Christofides, P.; Chow, J. Nonlinear and Robust Control of PDE Systems: Methods and applications to transport-reaction processes. Appl. Mech. Rev. 2002, 55, B29–B30. [Google Scholar] [CrossRef]
  5. Fradkov, A. Cybernetical physics. In From Control of Chaos to Quantum Control; Springer: Basel, Swizerland, 2007. [Google Scholar]
  6. Xin, X.; Kaneda, M. Analysis of the energy-based control for swinging up two pendulums. IEEE Trans. Automat. Control 2005, 50, 679–684. [Google Scholar] [CrossRef]
  7. Fradkov, A. Swinging control of nonlinear oscillations. Intern. J. Control 1996, 1189–1202. [Google Scholar] [CrossRef]
  8. Shiriaev, A.; Fradkov, A. Stabilization of invariant sets for nonlinear nonaffine systems. Automatica 2000, 36, 1709–1715. [Google Scholar] [CrossRef]
  9. Dolgopolik, V.; Fradkov, A.; Andrievsky, R. Observer-based boundary control of the sine-Gordon model energy. Pergamon 2020, 113, 108682. [Google Scholar] [CrossRef]
  10. Andrievsky, B.; Orlov, Y.; Fradkov, A. On robustness of the speed-gradient sampled-data energy control for the sine-Gordon equation: The simpler the better. Commun. Nonlinear Sci. 2023, 117, 106901. [Google Scholar] [CrossRef]
  11. Andrievsky, B.; Orlov, Y. Discrete-Time Sliding Mode Energy Control of sine-Gordon Chain with Adaptive Augmentation. IFAC-PapersOnLine 2022, 55, 717–722. [Google Scholar] [CrossRef]
  12. Christian, H.; Joachim, D. Stability and passivity preserving Petrov-Galerkin approximation of linear infinite-dimensional systems. Automatica 2012, 48, 1347–1352. [Google Scholar]
  13. Zuazua, E. Uniform stabilization of the wave equation by nonlinear boundary feedback. SIAM J. Control Optim. 1990, 28, 466–477. [Google Scholar] [CrossRef]
  14. Guo, B.; Zheng, F. Uniform exponential stability for a Schrödinger equation and its semi-discrete approximation. IEEE Trans. Autom. Control 2024, 69, 1–8. [Google Scholar] [CrossRef]
  15. Liu, J.; Guo, B. A novel semi-discrete scheme preserving uniformly exponential stability for an Euler-Bernoulli beam. Syst. Control Lett. 2019, 160, 104518. [Google Scholar] [CrossRef]
  16. Liu, J.; Guo, B. A new semi-discretized order reduction finite difference scheme for uniform approximation of 1-D wave equation. SIAM J. Control Optim. 2020, 58, 2256–2287. [Google Scholar] [CrossRef]
  17. Ren, H.J.; Guo, B.Z. Uniform exponential stability of semi-discrete scheme for observer-based control of 1-D wave equation. Syst. Control Lett. 2022, 168, 105346. [Google Scholar] [CrossRef]
  18. Wang, X.; Xue, W.; He, Y.; Zheng, F. Uniformly exponentially stable approximations for Timoshenko beams. Appl. Math. Comput. 2023, 451, 128028. [Google Scholar] [CrossRef]
  19. Zheng, F.; Zhang, S.; Wang, H.; Guo, B. The exponential stabilization of a heat-wave coupled system and its approximation. J. Math. Anal. Appl. 2023, 521, 126927. [Google Scholar] [CrossRef]
  20. Zheng, F.; Zhou, H. State reconstruction of the wave equation with general viscosity and non-collocated observation and control. J. Math. Anal. Appl. 2020, 502, 125257. [Google Scholar] [CrossRef]
  21. Baranovskii, E.S.; Shishkina, O.Y. Generalized Boussinesq System with Energy Dissipation: Existence of Stationary Solutions. Mathematics 2024, 12, 756. [Google Scholar] [CrossRef]
  22. Fradkov, A. Speed-gradient scheme and its applications in adaptive control problems. Autom. Remote Control 1980, 40, 1333–1342. [Google Scholar]
  23. Orlov, Y.; Fradkov, A.; Andrievsky, B. Energy control of distributed parameter systems via speed-gradient method: Case study of string and sine-Gordon benchmark models. Intern. J. Control 2017, 90, 2554–2566. [Google Scholar] [CrossRef]
  24. Tebou, L.; Zuazua, E. Uniform boundary stabilization of the finite difference space discretization of the 1-d wave equation. Adv. Comput. Math. 2007, 26, 337–365. [Google Scholar] [CrossRef]
Figure 1. Maximal real parts of eigenvalues of the semi-discrete schemes with random a in the case of the first substitution.
Figure 1. Maximal real parts of eigenvalues of the semi-discrete schemes with random a in the case of the first substitution.
Mathematics 12 02592 g001
Figure 2. Eigenvalue distribution of the semi-discrete scheme with random a and N = 200 in the case of the first substitution.
Figure 2. Eigenvalue distribution of the semi-discrete scheme with random a and N = 200 in the case of the first substitution.
Mathematics 12 02592 g002
Figure 3. Maximal real parts of eigenvalues of the semi-discrete schemes with a = 0.5 in the case of the first substitution.
Figure 3. Maximal real parts of eigenvalues of the semi-discrete schemes with a = 0.5 in the case of the first substitution.
Mathematics 12 02592 g003
Figure 4. Maximal real parts of eigenvalues of the semi-discrete schemes with random a in the case of the second substitution.
Figure 4. Maximal real parts of eigenvalues of the semi-discrete schemes with random a in the case of the second substitution.
Mathematics 12 02592 g004
Figure 5. Eigenvalue distribution of the semi-discrete scheme with random a and N = 200 in the case of the second substitution.
Figure 5. Eigenvalue distribution of the semi-discrete scheme with random a and N = 200 in the case of the second substitution.
Mathematics 12 02592 g005
Figure 6. Maximal real parts of eigenvalues of the semi-discrete schemes with a = 0.5 in the case of the second substitution.
Figure 6. Maximal real parts of eigenvalues of the semi-discrete schemes with a = 0.5 in the case of the second substitution.
Mathematics 12 02592 g006
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

Wang, X.; Wang, S.; Qiao, X.; Zheng, F. Semi-Discretized Approximation of Stability of Sine-Gordon System with Average-Central Finite Difference Scheme. Mathematics 2024, 12, 2592. https://doi.org/10.3390/math12162592

AMA Style

Wang X, Wang S, Qiao X, Zheng F. Semi-Discretized Approximation of Stability of Sine-Gordon System with Average-Central Finite Difference Scheme. Mathematics. 2024; 12(16):2592. https://doi.org/10.3390/math12162592

Chicago/Turabian Style

Wang, Xudong, Sizhe Wang, Xing Qiao, and Fu Zheng. 2024. "Semi-Discretized Approximation of Stability of Sine-Gordon System with Average-Central Finite Difference Scheme" Mathematics 12, no. 16: 2592. https://doi.org/10.3390/math12162592

APA Style

Wang, X., Wang, S., Qiao, X., & Zheng, F. (2024). Semi-Discretized Approximation of Stability of Sine-Gordon System with Average-Central Finite Difference Scheme. Mathematics, 12(16), 2592. https://doi.org/10.3390/math12162592

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