Home On a nonlinear boundary value problems with impulse action
Article Open Access

On a nonlinear boundary value problems with impulse action

  • Agila B. Tleulessova , Svetlana M. Temesheva EMAIL logo and Aidana S. Orazbekova
Published/Copyright: July 25, 2025

Abstract

In this work, a boundary value problems for a system of nonlinear ordinary differential equations that incorporates impulsive actions is considered. This formulation is significant for modeling real-world phenomena in which abrupt changes occur at specific time instants. The study established sufficient conditions for the existence of isolated solutions to the proposed boundary value problems. This is crucial to ensure that the mathematical models accurately reflect the behavior of systems subject to impulsive actions. Algorithms were developed to find solutions to the boundary value problems. These algorithms leverage the parameterization method, which is effective in handling the discontinuities introduced by impulsive actions. The research includes a numerical implementation of the proposed algorithms, demonstrating their practicality and effectiveness in solving the boundary value problems with impulsive actions. The findings have implications in various fields, including mechanics, electrical engineering, and biology, where systems often experience sudden changes due to external influences. In general, the research contributes to the understanding and solution of nonlinear boundary value problems affected by impulsive actions, providing a framework for further exploration and application in scientific and engineering contexts.

MSC 2010: 34A37; 34B15; 34B37

1 Introduction and problems statement

Investigating various problems in the natural sciences often involves dealing with evolutionary processes described by differential equations and subject to short-term perturbations. When mathematically modeling such processes, it is often convenient to neglect the duration of these perturbations, considering them to be of an impulse (shock) nature. Such idealization leads to the need to study systems of differential equations whose solutions undergo abrupt changes. Frequently, discontinuities in certain dependencies within the system studied are essential characteristics. Many specific problems whose mathematical models involve differential equations with discontinuous trajectories can be found in various areas of mathematical natural science: mechanics, electrical engineering, chemistry, biology and medicine, process control, dynamics of aircrafts, economics, and other branches of science and technology.

The growing interest in systems with discontinuous trajectories is primarily associated with the demands of modern technology, where impulse control systems, impulse computing systems, and neural networks have taken a prominent place and are rapidly developing, expanding their application scope in diverse technical problems varying in physical nature and functional purpose. A natural response to this has been a noticeable increase in the number of mathematical works dedicated to the study of differential equations with impulse effects. Classical monographs systematically addressing differential equations with impulse perturbations include the books by Samoilenko and Perestyuk [1] and Lakshmikantam et al. [2]. The results compiled in these monographs have served as a basis for further development of analytical and qualitative methods in the theory of impulse-disturbed systems [38].

The solvability of various types of boundary value problems using operator methods has been actively investigated by Samoilenko et al. [9], including problems with impulsive action [10].

In the work of Dzhumabaev, a parameterization method research and solving a linear two-point boundary value problems for a system of ordinary differential equations (ODEs), was developed [11]. The Dzhumabaev’s parameterization method provides a constructive algorithm for finding solutions, which is particularly useful for nonlinear problems where analytical solutions may be difficult or unattainable [12]. The application of this method allows for the development of a systematic approach to obtaining solutions, without relying solely on existence theorems.

It is important to note that the use of the parameterization method to nonlinear simplifies the derivation of sufficient conditions for the existence of isolated solutions, which is crucial in the context of nonlinear problems. Furthermore, the algorithms of the method are amenable to numerical implementation. It enables the use of computational methods to obtain approximate solutions. This feature is particularly advantageous in practical applications where numerical solutions are often required.

The versatility of the parameterization method allows it to be applied to a wide range of boundary value problems, including those with complex boundary conditions and multiple impulsive actions. Such broad applicability makes it a valuable tool in mathematical modeling across various fields.

Thus, researchers obtained an effective tool for the constructive solving of boundary value problems for various classes of differential equations [1327], such that it stands out due to its constructive nature, flexibility in handling discontinuities, ability to establish solvability conditions, and suitability for numerical implementation, making it a powerful tool for solving various classes of nonlinear boundary value problems for differential equations, including those subjected to impulsive actions.

The solving and investigation of boundary value problems with impulsive action at fixed time instants by the parameterization method are devoted to [2838].

In these works, conditions for solvability were obtained, algorithms for finding solutions were constructed, and coefficient criteria for unique solvability were obtained.

We consider the boundary value problems with impulsive actions on [ a , b ]

(1) d x d t = f ( t , x ) , t ( a , b ) \ { θ 1 , θ 2 , , θ m } , x R n ,

(2) x ( θ i ) x ( θ i 0 ) = p i , p i R n , i = 1 , m ¯ ,

(3) B x ( a ) + C x ( b ) = d , d R n ,

where f : ( [ a , b ] \ { θ 1 , θ 2 , , θ m } ) × R n R n is continuous, B and C are the given ( n × n ) matrices and d and p i ( i = 1 , m ¯ ) are the given n vectors, a = θ 0 < θ 1 < < θ m < θ m + 1 = b , Θ = { θ 1 , θ 2 , , θ m } .

Let P C ( [ a , b ] \ Θ , R n ) be a space of piecewise continuous functions with the norm

x 1 = max i = 0 , m ¯ sup t [ θ i , θ i + 1 ) x ( t ) .

A solution to problem (1)–(3) is a piecewise-continuously differentiable on ( a , b ) \ Θ function x * ( t ) P C ( [ a , b ] \ Θ , R n ) that satisfies

  1. differential equation (1); moreover, at the points t = a , t = b , equation (1) satisfies the one-sided derivatives d x * ( t ) d t t = a = lim t a + 0 x * ( t ) x * ( a ) t a , d x * ( t ) d t t = b = lim t b 0 x * ( t ) x * ( b ) t b ,

  2. the impulsive conditions (2) at the points of the set Θ , and

  3. the boundary condition (3).

2 Method for solving the problem (1)–(3)

We choose a natural number N . Denote by Δ N the partition [ a , b ) \ Θ = r = 1 ( m + 1 ) N [ t r 1 , t r ) , where

t r = θ s + ( r s N ) θ s + 1 θ s N , r = s N , ( s + 1 ) N ¯ , s = 0 , m ¯ .

We introduce the space C ( [ a , b ) \ Θ , Δ N , R n ( m + 1 ) N ) consisting of all function systems x [ t ] = ( x 1 ( t ) , x 2 ( t ) , , x ( m + 1 ) N ( t ) ) , where functions x r : [ t r 1 , t r ) R n are continuous and have finite limits lim t t r 0 x r ( t ) for all r = 1 , ( m + 1 ) N ¯ , with the norm x 2 = max r = 1 , ( m + 1 ) N ¯ sup t [ t r 1 , t r ) x r ( t ) .

Let us introduce the notations: λ r = x ( t r 1 ) , u r ( t ) = x ( t ) λ r , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ . Then, we reduce problem (1)–(3) to the equivalent multipoint boundary-value problem with parameters

(4) d u r d t = f ( t , λ r + u r ) , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ ,

(5) u r ( t r 1 ) = 0 , r = 1 , ( m + 1 ) N ¯ ,

(6) λ i N + 1 λ i N lim t t i N 0 u i N ( t ) p i = 0 , i = 1 , m ¯ ,

(7) B λ 1 + C λ ( m + 1 ) N + C lim t t ( m + 1 ) N 0 u ( m + 1 ) N ( t ) d = 0 ,

(8) λ r + lim t t r 0 u r ( t ) λ r + 1 = 0 , r = i N + 1 , ( i + 1 ) N 1 ¯ , i = 0 , m ¯ ,

where (8) are the gluing conditions at the points of partition of the intervals ( θ i 1 , θ i ) , i = 1 , m + 1 ¯ .

The solution of problem (4)–(8) is the pair ( λ * , u * [ t ] ) , where λ * = ( λ 1 * , λ 2 * , , λ ( m + 1 ) N * ) R n ( m + 1 ) N , u * [ t ] = ( u 1 * ( t ) , u 2 * ( t ) , , u ( m + 1 ) N * ( t ) ) C ( [ a , b ) \ Θ , Δ N , R n ( m + 1 ) N ) .

If ( λ * , u * [ t ] ) is a solution problem (4)–(8), then the function

x * ( t ) = λ r * + u r * ( t ) for t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ , λ ( m + 1 ) N * + lim t b 0 u ( m + 1 ) N * ( t ) for t = b

is a solution to problem (1)–(3).

If x ˜ ( t ) is a solution to problem (1)–(3), then, the pair ( λ ˜ , u ˜ [ t ] ) with elements λ ˜ = ( x ˜ ( t 0 ) , x ˜ ( t 1 ) , , x ˜ ( t ( m + 1 ) N 1 ) ) R n ( m + 1 ) N , u ˜ [ t ] = ( x ˜ ( t ) x ˜ ( t 0 ) , x ˜ ( t ) x ˜ ( t 1 ) , , x ˜ ( t ) x ˜ ( t ( m + 1 ) N 1 ) ) is a solution to problem (4)–(8).

For fixed values of λ r , the Cauchy problem (4), (5) is equivalent to the Volterra integral equation of the second kind

(9) u r ( t ) = t r 1 t f ( τ 1 , λ r + u r ( τ 1 ) ) d τ 1 , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ .

Using equality (9), we obtain the expression

u r ( t ) = t r 1 t f τ 1 , λ r + t r 1 τ 1 f τ 2 , λ r + + t r 1 τ ν 1 f ( τ ν , λ r + u r ( τ ν ) ) d τ ν d τ 2 d τ 1 ,

t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ .

Then

(10) lim t t r 0 u r ( t ) = t r 1 t r f τ 1 , λ r + t r 1 τ 1 f τ 2 , λ r + + t r 1 τ ν 1 f ( τ ν , λ r + u r ( τ ν ) ) d τ ν d τ 2 d τ 1 ,

r = 1 , ( m + 1 ) N ¯ .

Substituting these limits into (6)–(8), we obtain a system of nonlinear equations

(11) θ i + 1 θ i N λ i N + 1 λ i N t i N 1 t i N f τ 1 , λ i N + t i N 1 τ 1 f t i N 1 τ 1 τ 2 , λ i N + + t i N 1 τ ν 1 f ( τ ν , λ i N + u i N ( τ ν ) ) d τ ν d τ 2 d τ 1 p i = 0 , i = 1 , m ¯ ,

(12) θ m + 1 θ m N B λ 1 + C λ ( m + 1 ) N + C t ( m + 1 ) N 1 t ( m + 1 ) N f τ 1 , λ ( m + 1 ) N + t ( m + 1 ) N 1 τ 1 f τ 2 , λ ( m + 1 ) N + + t ( m + 1 ) N 1 τ ν 1 f ( τ ν , λ ( m + 1 ) N + u ( m + 1 ) N ( τ ν ) ) d τ ν d τ 2 d τ 1 d = 0 ,

(13) λ r + t r 1 t r f τ 1 , λ r + t r 1 τ 1 f τ 2 , λ r + + t r 1 τ ν 1 f ( τ ν , λ r + u r ( τ ν ) ) d τ ν d τ 2 d τ 1 λ r + 1 = 0 ,

r = i N + 1 , ( i + 1 ) N 1 ¯ , i = 0 , m ¯ .

For known u r ( t ) ( r = 1 , ( m + 1 ) N ¯ ), the system of equations (11)–(13) is a system of equations with respect to the parameters ( λ 1 , λ 2 , , λ ( m + 1 ) N ) . We write the system of equations (11)–(13) in the following form:

(14) Q ν , Δ N ( λ , u ) = 0 , λ = ( λ 1 , λ 2 , , λ ( m + 1 ) N ) R n ( m + 1 ) N .

3 Algorithms of Dzhumabaev’s parameterization method and convergence conditions

Condition A. There exists a partition Δ N , a natural number ν such that the system of nonlinear equations Q ν , Δ N ( λ , 0 ) = 0 have a solution λ ( 0 ) = ( λ 1 ( 0 ) , λ 2 ( 0 ) , , λ ( m + 1 ) N ( 0 ) ) R n ( m + 1 ) N .

Let Condition A be satisfied. We assume a Cauchy problems

(15) d u r d t = f ( t , u r + λ r ( 0 ) ) , u r ( t r 1 ) = 0

having a solution u r ( 0 ) ( t ) , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ , and the system of functions u ( 0 ) [ t ] belongs to the space C ( [ a , b ) \ Θ , Δ N , R n ( m + 1 ) N ) .

By using a pair ( λ ( 0 ) , u ( 0 ) [ t ] ) , we specify a piecewise continuous function on [ a , b ]

x ( 0 ) ( t ) = λ r ( 0 ) + u r ( 0 ) ( t ) for t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ , λ ( m + 1 ) N ( 0 ) + lim t b 0 u ( m + 1 ) N ( 0 ) ( t ) for t = b .

We take the numbers ρ λ > 0 , ρ u > 0 , ρ x > 0 and define the sets

S ( λ ( 0 ) , ρ λ ) = { λ = ( λ 1 , λ 2 , , λ ( m + 1 ) N ) R n ( m + 1 ) N : λ λ ( 0 ) = max r = 1 , ( m + 1 ) N ¯ λ r λ r ( 0 ) < ρ λ } , S ( u ( 0 ) [ t ] , ρ u ) = { u [ t ] C ( [ a , b ) \ Θ , Δ N , R n ( m + 1 ) N ) : u u ( 0 ) 2 < ρ u } , S ( x ( 0 ) ( t ) , ρ x ) = { x ( t ) P C ( [ a , b ] \ Θ , R n ) : x x ( 0 ) 1 < ρ x } , G f ( ρ x ) = { ( t , x ) : t [ a , b ] \ Θ , x S ( x ( 0 ) ( t ) , ρ x ) } .

Let Condition A hold, and let the components of the system of functions u ( 0 ) [ t ] be solutions to Cauchy problems (15).

We construct sequences { ( λ ( k ) , u ( k ) ( t ) ) } k = 1 and { x ( k ) ( t ) } k = 1 by performing the following sequence of steps:

Step k

  1. Solve the equation Q ν , Δ N ( λ , u ( k 1 ) ) = 0 and find λ ( k ) = ( λ 1 ( k ) , , λ ( m + 1 ) N ( k ) ) R n ( m + 1 ) N .

  2. Solve the Cauchy problems

    d u r d t = f ( t , u r + λ r ( k ) ) , u r ( t r 1 ) = 0 ,

    and find the components of the system u ( k ) [ t ] = ( u 1 ( k ) ( t ) , , u ( m + 1 ) N ( k ) ( t ) ) .

  3. Construct the function

    x ( k ) ( t ) = λ r ( k ) + u r ( k ) ( t ) , if t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ , λ ( m + 1 ) N ( k ) + lim t b 0 u ( m + 1 ) N ( k ) ( t ) , if t = t ( m + 1 ) N = b .

where k = 1,2 , .

Condition B. The function f ( t , x ) in G f ( ρ x ) is continuous, has a uniformly continuous partial derivative f x ( t , x ) , and there exists a number L > 0 such that f x ( t , x ) L for all ( x , t ) G f ( ρ x ) .

Theorem 1

Suppose that for some Δ N with N N , and for ν N , as well as positive constants ρ λ > 0 , ρ u > 0 , and ρ x > 0 , the following conditions are satisfied:

  1. conditions A and B,

  2. Jacobi matrix Q ν , Δ N ( λ , u ) λ : R n ( m + 1 ) N R n ( m + 1 ) N is invertible for all ( λ , u [ t ] ) S ( λ ( 0 ) , ρ λ ) × S ( u ( 0 ) [ t ] , ρ u ) ,

  3. Q ν , Δ N ( λ , u ) λ 1 γ ν ( Δ N ) , γ ν ( Δ N ) -const ,

  4. q ν ( Δ N ) < 1 , where

    q ν ( Δ N ) = γ ν ( Δ N ) max 1 , max i = 0 , m ¯ θ i + 1 θ i N , θ m + 1 θ m N C max i = 0 , m ¯ e L θ i + 1 θ i N j = 0 ν ( L ( θ i + 1 θ i ) ) j j ! N j ,

  5. γ ν ( Δ N ) 1 q ν ( Δ N ) Q ν , Δ N ( λ ( 0 ) , u ( 0 ) ) < ρ λ ,

  6. γ ν ( Δ N ) 1 q ν ( Δ N ) max i = 0 , m ¯ e L θ i + 1 θ i N 1 Q ν , Δ N ( λ ( 0 ) , u ( 0 ) ) < ρ u ,

  7. max p = 1 , ν ¯ ρ λ max i = 0 , m ¯ j = 0 p 1 ( L ( θ i + 1 θ i ) ) j j ! N j + ρ u max i = 0 , m ¯ ( L ( θ i + 1 θ i ) ) p 1 ( p 1 ) ! N p 1 ρ x .

Then, the sequence of pairs ( λ ( k ) , u ( k ) [ t ] ) , k N , defined by the algorithm, belongs to the set S ( λ ( 0 ) , ρ λ ) × S ( u ( 0 ) [ t ] , ρ u ) , and converges to the pair ( λ * , u * [ t ] ) , which is an isolated solution of problem (4)–(8) in the set S ( λ ( 0 ) , ρ λ ) × S ( u ( 0 ) [ t ] , ρ u ) . Moreover, the following estimates hold:

(16) λ * λ ( k ) ( q ν ( Δ N ) ) k 1 q ν ( Δ N ) γ ν ( Δ N ) Q ν , Δ N ( λ ( 0 ) , u ( 0 ) ) ,

(17) u r * ( t ) u r ( k ) ( t ) ( e L ( t t r 1 ) 1 ) λ r * λ r ( k ) ,

k = 0 , 1 , 2 , , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ .

Proof

By some number N , we perform a partition Δ N of the interval [ a , b ) . Let us reduce problem (1), (2) to the equivalent multipoint boundary value problem with parameters (4)–(8).

Taking any pair ( λ , u [ t ] ) S ( λ ( 0 ) , ρ λ ) × S ( u ( 0 ) [ t ] , ρ u ) , then

(18) λ r λ r ( 0 ) + u r ( t ) u r ( 0 ) ( t ) λ r λ r ( 0 ) + u r ( t ) u r ( 0 ) ( t ) < ρ λ + ρ u ρ x , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ .

By virtue of Condition B for all r = 1 , ( m + 1 ) N ¯ , the following inequalities occur:

(19) λ r + t r 1 t f ( τ 1 , λ r + u r ( τ 1 ) ) d τ 1 λ r ( 0 ) u r ( 0 ) ( t ) λ r λ r ( 0 ) + t r 1 t f ( τ 1 , λ r + u r ( τ 1 ) ) d τ 1 t r 1 t f ( τ 1 , λ r ( 0 ) + u r ( 0 ) ( τ 1 ) ) d τ 1 ( 1 + L ( t t r 1 ) ) λ r λ r ( 0 ) + t r 1 t L u r ( τ ) u r ( 0 ) ( τ ) d τ < ( 1 + L ( t r t r 1 ) ) ρ λ + ρ u L ( t r t r 1 ) ρ x , t [ t r 1 , t r ) .

Similarly, we obtain that

(20) λ r + t r 1 t f τ 1 , λ r + + t r 1 τ ν 2 f ( τ ν 1 , λ r + u r ( τ ν 1 ) ) d τ ν 1 d τ 1 λ r ( 0 ) u r ( 0 ) ( t ) λ r λ r ( 0 ) + t r 1 t f τ 1 , λ r + + t r 1 τ ν 2 f ( τ ν 1 , λ r + u r ( τ ν 1 ) ) d τ ν 1 d τ 1 t r 1 t f τ 1 , λ r ( 0 ) + + t r 1 τ ν 2 f ( τ ν 1 , λ r ( 0 ) + + u r ( 0 ) ( τ ν 1 ) ) d τ ν 1 d τ 1 j = 0 ν 1 ( L ( t r t r 1 ) ) j j ! λ r λ r ( 0 ) + t r 1 t L t r 1 τ ν 2 L u r ( τ ) u r ( 0 ) ( τ ) d τ ν 1 d τ 1 < j = 0 ν 1 ( L ( t r t r 1 ) ) j j ! ρ λ + ( L ( t r t r 1 ) ) ν 1 ( ν 1 ) ! ρ u ρ x , t [ t r 1 , t r ) .

In view of (18)–(20) and inequality (vii) of the theorem, the pairs

( t , λ r + u r ( t ) ) , t , λ r + t r 1 t f ( τ 1 , λ r + u r ( τ 1 ) ) d τ 1 , ,

t , λ r + t r 1 t f τ 1 , λ r + + t r 1 τ ν 2 f ( τ ν 1 , λ r + u r ( τ ν 1 ) ) d τ ν 1 d τ 1 ,

where ( λ , u [ t ] ) S ( λ ( 0 ) , ρ λ ) × S ( u ( 0 ) [ t ] , ρ u ) with t [ t r 1 , t r ) for all r = 1 , ( m + 1 ) N ¯ belong to the set G f ( ρ x ) .

We will search for the solution of problem (4)–(8) using the proposed algorithm. Taking the pair ( λ ( 0 ) , u ( 0 ) [ t ] ) from Condition A as the initial approximation, we find the next approximation with respect to the parameter from the equation

(21) Q ν , Δ N ( λ , u ( 0 ) ) = 0 , λ R n ( m + 1 ) N .

By virtue of the conditions of the theorem, the operator Q ν , Δ N ( λ , u ( 0 ) ) in S ( λ ( 0 ) , ρ λ ) satisfies all the assumptions of Theorem A [12, p. 345]. Taking a number ε 0 > 0 , satisfying the inequalities

ε 0 γ ν ( Δ N ) 1 2 , γ ν ( Δ N ) 1 ε 0 γ ν ( Δ N ) Q ν , Δ N ( λ ( 0 ) , u ( 0 ) ) < ρ λ ,

and using uniform continuity in S ( λ ( 0 ) , ρ λ ) Jacobi matrices Q ν , Δ N ( λ , u ( 0 ) ) λ , we find δ 0 ( 0,0.5 ρ λ ] such that for any λ , λ ˜ S ( λ ( 0 ) , ρ λ ) , satisfying inequality λ λ ˜ < δ 0 is true such that

Q ν , Δ N ( λ , u ( 0 ) ) λ Q ν , Δ N ( λ ˜ , u ( 0 ) ) λ < ε 0 .

Let us choose α α 0 = max 1 , γ ν ( Δ N ) δ 0 Q ν , h ( λ ( 0 ) , u ( 0 ) ) , build an iterative process: λ ( 1,0 ) = λ ( 0 ) ,

(22) λ ( 1 , m + 1 ) = λ ( 1 , m ) 1 α Q ν , Δ N ( λ ( 1 , m ) , u ( 0 ) ) λ 1 Q ν , Δ N ( λ ( 1 , m ) , u ( 0 ) ) , m = 0 , 1 , 2 , .

The iterative process (22) converges to λ ( 1 ) S ( λ ( 0 ) , ρ λ ) -isolated solution of equation (21) and

(23) λ ( 1 ) λ ( 0 ) γ ν ( Δ N ) Q ν , Δ N ( λ ( 0 ) , u ( 0 ) ) < ρ λ .

Under our assumptions, the Cauchy problem (4), (5) for λ r = λ r ( 1 ) on [ t r 1 , t r ) has a unique solution u r ( 1 ) ( t ) and for it holds the following inequality:

u r ( 1 ) ( t ) u r ( 0 ) ( t ) t r 1 t L ( λ r ( 1 ) λ r ( 0 ) + u r ( 1 ) ( τ ) u r ( 0 ) ( τ ) ) d τ .

Using the Gronwall-Bellman lemma, we obtain

(24) u r ( 1 ) ( t ) u r ( 0 ) ( t ) ( e L ( t t r 1 ) 1 ) λ r ( 1 ) λ r ( 0 ) , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ .

From (23) and (24) we obtain u ( 1 ) [ t ] = ( u 1 ( 1 ) ( t ) , u 2 ( 1 ) ( t ) , , u N ( 1 ) ( t ) ) S ( u ( 0 ) [ t ] , ρ u ) .

From the structure of the operator Q ν , Δ N ( λ , u ) and the equality Q ν , Δ N ( λ ( 1 ) , u ( 0 ) ) = 0 , it follows that

Q ν , Δ N ( λ ( 1 ) , u ( 1 ) ) = Q ν , Δ N ( λ ( 1 ) , u ( 1 ) ) Q ν , Δ N ( λ ( 1 ) , u ( 0 ) ) max 1 , max i = 1 , m ¯ θ i + 1 θ i N , θ m + 1 θ m N C × max r = 1 , ( m + 1 ) N ¯ t r 1 t r L t r 1 τ ν 1 L u r ( 1 ) ( τ ν ) u r ( 0 ) ( τ ν ) d τ ν d τ 1 .

Substituting instead of u r ( 1 ) ( τ ν ) u r ( 0 ) ( τ ν ) the right-hand side of (24) and computing the repeated integrals, we have

(25) γ ν ( h ) Q ν , Δ N ( λ ( 1 ) , u ( 1 ) ) q ν ( Δ N ) λ ( 1 ) λ ( 0 ) .

Let us take ρ 1 = γ ν ( Δ N ) Q ν , Δ N ( λ ( 1 ) , u ( 1 ) ) . If λ S ( λ ( 1 ) , ρ 1 ) , then, due to the inequalities (iv), (v) of the theorem and (23), (25), the following estimate holds

λ λ ( 0 ) λ λ ( 1 ) + λ ( 1 ) λ ( 0 ) < γ ν ( Δ N ) Q ν , Δ N ( λ ( 1 ) , u ( 1 ) ) + λ ( 1 ) λ ( 0 ) ( q ν ( Δ N ) + 1 ) λ ( 1 ) λ ( 0 ) < γ ν ( Δ N ) 1 q ν ( Δ N ) Q ν , Δ N ( λ ( 0 ) , u ( 0 ) ) < ρ λ ,

that is, S ( λ ( 1 ) , ρ 1 ) S ( λ ( 0 ) , ρ λ ) .

The operator Q ν , Δ N ( λ , u ( 1 ) ) in S ( λ ( 1 ) , ρ 1 ) satisfies all conditions of Theorem A [12]. Therefore, the iterative process: λ ( 2,0 ) = λ ( 1 ) ,

λ ( 2 , m + 1 ) = λ ( 2 , m ) 1 α Q ν , Δ N ( λ ( 2 , m ) , u ( 1 ) ) λ 1 Q ν , Δ N ( λ ( 2 , m ) , u ( 1 ) ) , m = 0 , 1 , 2 , ,

converges to λ ( 2 ) = ( λ 1 ( 2 ) , λ 2 ( 2 ) , , λ N ( 2 ) ) S ( λ ( 1 ) , ρ 1 ) -isolated solution of the equation Q ν , Δ N ( λ , u ( 1 ) ) = 0 and

(26) λ ( 2 ) λ ( 1 ) γ ν ( Δ N ) Q ν , Δ N ( λ ( 1 ) , u ( 1 ) ) .

From (26) and (25), it follows that

λ ( 2 ) λ ( 1 ) q ν ( Δ N ) λ ( 1 ) λ ( 0 ) .

Assuming that the pair ( λ ( k 1 ) , u ( k 1 ) [ t ] ) S ( λ ( 0 ) , ρ λ ) × S ( u ( 0 ) [ t ] , ρ u ) defined and established estimates

(27) λ ( k 1 ) λ ( k 2 ) q ν k 2 ( Δ N ) λ ( 1 ) λ ( 0 ) ,

(28) γ ν ( Δ N ) Q ν , Δ N ( λ ( k 1 ) , u ( k 1 ) ) q ν ( Δ N ) λ ( k 1 ) λ ( k 2 ) ,

k th approximation with respect to the parameter λ ( k ) can be found from the equation Q ν , Δ N ( λ , u ( k 1 ) ) = 0 . Using (27), (28), and equality Q ν , h ( λ ( k 1 ) , u ( k 2 ) ) = 0 , similar to (25), we establish the validity of the inequality

(29) γ ν ( Δ N ) Q ν , Δ N ( λ ( k 1 ) , u ( k 1 ) ) q ν k 1 ( Δ N ) λ ( 1 ) λ ( 0 ) .

Let us take ρ k 1 = γ ν ( Δ N ) Q ν , Δ N ( λ ( k 1 ) , u ( k 1 ) ) and show that S ( λ ( k 1 ) , ρ k 1 ) S ( λ ( 0 ) , ρ λ ) . Indeed, in view of (27)–(29) and inequalities (v)

λ λ ( 0 ) λ λ ( k 1 ) + λ ( k 1 ) λ ( k 2 ) + + λ ( 1 ) λ ( 0 ) < ρ k 1 + q ν k 2 ( Δ N ) λ ( 1 ) λ ( 0 ) + + λ ( 1 ) λ ( 0 ) λ ( 1 ) λ ( 0 ) < γ ν ( Δ N ) 1 q ν ( Δ N ) Q ν , Δ N ( λ ( 0 ) , u ( 0 ) ) < ρ λ .

Since Q ν , Δ N ( λ , u ( k 1 ) ) in S ( λ ( k 1 ) , ρ k 1 ) satisfies all the conditions of Theorem A [12], there exists λ ( k ) S ( λ ( k 1 ) , ρ k 1 ) – solution of the equation Q ν , Δ N ( λ , u ( k 1 ) ) = 0 and the following estimate is valid

(30) λ ( k ) λ ( k 1 ) q ν ( Δ N ) Q ν , Δ N ( λ ( k 1 ) , u ( k 1 ) ) .

Solving the Cauchy problems (4) and (5) for λ r = λ r ( k ) , we find functions u r ( k ) ( t ) , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ . If ρ k = γ ν ( Δ N ) Q ν , Δ N ( λ ( k ) , u ( k ) ) = 0 , then Q ν , Δ N ( λ ( k ) , u ( k ) ) = 0 . Hence, taking into account that u r ( k ) ( t ) is a solution to the Cauchy problem (4), (5) at λ r = λ r ( k ) on [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ , we obtain the equalities

λ i N + 1 ( k ) λ i N ( k ) lim t t i N 0 u i N ( k ) ( t ) p i = 0 , i = 1 , m ¯ , B λ 1 ( k ) + C λ ( m + 1 ) N ( k ) + C lim t t ( m + 1 ) N 0 u ( m + 1 ) N ( k ) ( t ) d = 0 , λ r ( k ) + lim t t r 0 u r ( k ) ( t ) λ r + 1 ( k ) = 0 , r = i N + 1 , ( i + 1 ) N 1 ¯ , i = 0 , m ¯ ,

i.e., the pair ( λ ( k ) , u ( k ) [ t ] ) is a solution of problem (4)–(8).

Using (29), (30), and the Gronwall-Bellman inequality, we set estimates

(31) λ ( k ) λ ( k 1 ) q ν ( Δ N ) λ ( k 1 ) λ ( k 2 ) ,

(32) u r ( k ) ( t ) u r ( k 1 ) ( t ) ( e L ( t t r 1 ) 1 ) λ r ( k ) λ r ( k 1 ) , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ .

From inequalities (31), (32), and q ν ( Δ N ) < 1 , it follows that the sequence of pairs ( λ ( k ) , u ( k ) [ t ] ) for k converges to ( λ , u [ t ] ) is a solution to problem (4)–(8). Moreover, due to inequalities (v) and (vi) of the theorem ( λ ( k ) , u ( k ) [ t ] ) , k N , and ( λ , u [ t ] ) belong to S ( λ ( 0 ) , ρ λ ) × S ( u ( 0 ) [ t ] , ρ u ) . In inequalities

λ ( k + ) λ ( k ) < ( q ν ( Δ N ) ) k 1 q ν ( Δ N ) γ ν ( Δ N ) Q ν , Δ N ( λ ( 0 ) , u ( 0 ) ) ,

u r ( k + ) ( t ) u r ( k ) ( t ) ( e L ( t t r 1 ) 1 ) λ r ( k + ) λ r ( k ) , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ ,

passing to the limit as , we obtain estimates (16) and (17).

Note that

λ ( k + ) λ ( k ) 1 ( q ν ( Δ N ) ) 1 q ν ( Δ N ) q ν ( Δ N ) λ ( k ) λ ( k 1 ) ,

u r ( k + ) ( t ) u r ( k ) ( t ) ( e L ( t t r 1 ) 1 ) 1 ( q ν ( Δ N ) ) 1 q ν ( Δ N ) q ν ( Δ N ) λ ( k ) λ ( k 1 ) ,

t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ . Let us move on to the limit as and obtain the estimates

(33) λ * λ ( k ) q ν ( Δ N ) 1 q ν ( Δ N ) λ ( k ) λ ( k 1 ) ,

u r * ( t ) u r ( k ) ( t ) ( e L ( t t r 1 ) 1 ) q ν ( Δ N ) 1 q ν ( Δ N ) λ ( k ) λ ( k 1 ) , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ .

Let us show the isolation of the solution. Let the pair ( λ ˜ , u ˜ [ t ] ) be a solution of problem (4)–(8) belonging to S ( λ ( 0 ) , ρ λ ) × S ( u ( 0 ) [ t ] , ρ u ) . Then, there are numbers δ ˜ 1 > 0 , δ ˜ 2 > 0 such that

λ ˜ λ ( 0 ) + δ ˜ 1 < ρ λ , max r = 1 , ( m + 1 ) N ¯ ( e L ( t r t r 1 ) 1 ) λ ˜ λ ( 0 ) + δ ˜ 2 < ρ u .

Considering that the functions u ˜ r ( t ) , u r ( 0 ) ( t ) are solutions of the Cauchy problem (4), (5) for λ r = λ ˜ r , λ r = λ r ( 0 ) , respectively, and again using the Gronwall-Bellman inequality we have

u ˜ r ( t ) u r ( 0 ) ( t ) ( e L ( t t r 1 ) 1 ) λ ˜ r λ r ( 0 ) , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ .

If λ S ( λ ˜ , δ ˜ 1 ) , u [ t ] S ( u ˜ [ t ] , δ ˜ 2 ) , then due to the inequalities

λ λ ( 0 ) λ λ ˜ + λ ˜ λ ( 0 ) < δ ˜ 1 + λ ˜ λ ( 0 ) < ρ λ ,

u r ( t ) u r ( 0 ) ( t ) u r ( t ) u ˜ r ( t ) + u ˜ r ( t ) u r ( 0 ) ( t ) < δ ˜ 2 + u ˜ r ( t ) u r ( 0 ) ( t ) < ρ u ,

t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ , λ S ( λ ( 0 ) , ρ λ ) , u [ t ] S ( u ( 0 ) [ t ] , ρ u ) , that is S ( λ ˜ , δ ˜ 1 ) S ( λ ( 0 ) , ρ λ ) , S ( u ˜ [ t ] , δ ˜ 2 ) S ( u ( 0 ) [ t ] , ρ u ) .

Let us take a number ε > 0 such that

(34) ε γ ν ( Δ N ) < 1 , q ν ( Δ N ) < 1 ε γ ν ( Δ N ) .

From a uniform continuity f x ( t , x ) in G f ( ρ x ) and structure of the Jacobi matrix Q ν , Δ N ( λ , u ) λ follows from its uniform continuity in S ( λ ˜ , δ ˜ 1 ) × S ( u ˜ [ t ] , δ ˜ 2 ) . Therefore, there is δ ( 0 , min { δ ˜ 1 , δ ˜ 2 } ] , for which

Q ν , Δ N ( λ , u ) λ Q ν , Δ N ( λ ˜ , u ˜ ) λ < ε

for all ( λ , u ) S ( λ ˜ , δ ) × S ( u ˜ [ t ] , δ ) . Note that if ( λ ˜ , u ˜ [ t ] ) is the solution of problem (4)–(8), Q ν , Δ N ( λ ˜ , u ˜ ) = 0 for any ν N .

Let ( λ ^ , u ^ [ t ] ) S ( λ ˜ , δ ) × S ( u ˜ [ t ] , δ ) be another solution to problem (4)–(8). Since Q ν , Δ N ( λ ˜ , u ˜ ) = 0 and Q ν , Δ N ( λ ^ , u ^ ) = 0 , from the equalities

λ ˜ = λ ˜ Q ν , Δ N ( λ ˜ , u ˜ ) λ 1 Q ν , Δ N ( λ ˜ , u ˜ ) , λ ^ = λ ^ Q ν , Δ N ( λ ˜ , u ˜ ) λ 1 Q ν , Δ N ( λ ^ , u ^ ) ,

it follows that

λ ˜ λ ^ = Q ν , Δ N ( λ ˜ , u ˜ ) λ 1 0 1 Q ν , Δ N ( λ ^ + θ ( λ ˜ λ ^ ) , u ˜ ) λ Q ν , Δ N ( λ ˜ , u ˜ ) λ d θ ( λ ˜ λ ^ ) Q ν , Δ N ( λ ˜ , u ˜ ) λ 1 ( Q ν , Δ N ( λ ^ , u ˜ ) Q ν , Δ N ( λ ^ , u ^ ) ) ,

then

(35) λ ˜ λ ^ γ ν ( Δ N ) 1 ε γ ν ( Δ N ) Q ν , Δ N ( λ ^ , u ˜ ) Q ν , Δ N ( λ ^ , u ^ ) γ ν ( Δ N ) 1 ε γ ν ( Δ N ) max 1 , max i = 1 , m ¯ θ i + 1 θ i N , θ m + 1 θ m N C × max r = 1 , ( m + 1 ) N ¯ t r 1 t r L t r 1 τ ν 1 L u ˜ r ( τ ν ) u ^ r ( τ ν ) d τ ν d τ 1 .

Since

u ˜ r ( t ) u ^ r ( t ) t r 1 t L ( λ ˜ r λ ^ r + u ˜ r ( τ ) u ^ r ( τ ) ) d τ ,

by the Gronwall-Bellman lemma

(36) u ˜ r ( t ) u ^ r ( t ) ( e L ( t t r 1 ) 1 ) λ ˜ r λ ^ r .

Substituting (36) to the right part of (35), we have

(37) λ ˜ λ ^ q ν ( Δ N ) 1 ε γ ν ( Δ N ) λ ˜ λ ^ .

Thus, due to inequalities (34), (36), and (37), we have the equalities λ ˜ r = λ ^ r , u ˜ r ( t ) = u ^ r ( t ) , t [ t r 1 , t r ) , r = 1 , ( m + 1 ) N ¯ . Theorem 1 is proved.□

Comments on the theorem:

  1. Theorem 1 provides sufficient conditions for the feasibility and convergence of the proposed algorithm to solve problem (4)–(8). Furthermore, Theorem 1 establishes sufficient conditions for the existence of an isolated solution to problem (4)–(8).

  2. The fulfillment of conditions (i), (ii), and (v) ensures the applicability of Theorem A [12] to find the solution of equation (14) with a given u [ t ] .

  3. The fulfillment of condition (iv) guarantees the convergence of the proposed algorithm.

  4. The fulfillment of conditions (v)–(vii) is required to ensure isolation of the solution.

The choice of numbers N , ν depends on the properties of the initial data of the problem (1)–(3). If the data of the problems allow, it is possible to do so without dividing the interval and using substitutions.

Since problem (4)–(8) and problem (1)–(3) are equivalent, the following assertion holds.

Corollary

Let the conditions (i)–(vii) of Theorem 1 hold for certain values of Δ N ( N N ), ν ( ν N ), ρ λ > 0 , ρ u > 0 , and ρ x > 0 . Then, the sequence { x ( k ) ( t ) } k = 0 belongs to the ball S ( x ( 0 ) ( t ) , ρ x ) and converges to an isolated solution x * ( t ) of problem (1)–(3) in S ( x ( 0 ) ( t ) , ρ x ) .

4 Illustrative examples

To demonstrate the accuracy and efficiency of the proposed algorithm, this section examines two numerical examples of solving the boundary-value problem of type (1)–(3). The method described in Section 2 is applied to both cases, and all computations are carried out using the MathCAD system.

Example 1

Find the numerical solution of the boundary value problem (38)–(40) with an accuracy of ε = 1 0 4

(38) d d t x 1 x 2 = f t , x 1 x 2 , t ( 0.95 , 1.10 ) \ { 1 } ,

(39) x 1 x 2 ( 1 ) x 1 x 2 ( 1 0 ) = p 1 ,

(40) B x 1 x 2 ( 0.95 ) + C x 1 x 2 ( 1.10 ) = d ,

where f t , x 1 x 2 = x 2 x 1 x 2 2 + ln ( t ) + η ( 1 t ) 1 2 t + 1 + η ( t 1 ) 0 0.5 , η ( t ) = 0 for t < 0 , 1 for t > 0 , p 1 = 0.5 1 , B = 0.5 0.75 1 0.2 , C = 0 0.375 0.2 0.125 , d = 1.5 0.2 .

We will formulate equation

Q 1 , Δ 2 ( λ , u ) = 0 , λ R 4 ,

where Q 1 , Δ 2 ( λ , u ) = ( ( Q 1 , Δ 2 ( λ , u ) ) 1 , ( Q 1 , Δ 2 ( λ , u ) ) 2 , ( Q 1 , Δ 2 ( λ , u ) ) 3 , ( Q 1 , Δ 2 ( λ , u ) ) 4 ) is an operator with components

( Q 1 , Δ 2 ( λ , u ) ) 1 = λ 11 λ 12 + 0.95 0.975 λ 12 + u 12 ( t ) 1 λ 11 u 11 ( t ) ( λ 12 + u 12 ( t ) ) 2 + ln ( t ) + 1 + 2 t d t λ 21 λ 22 ,

( Q 1 , Δ 2 ( λ , u ) ) 2 = 1 40 λ 31 λ 32 λ 21 λ 22 0.5 1 1 40 0.975 1.0 λ 22 + u 22 ( t ) 1 λ 21 u 21 ( t ) ( λ 22 + u 22 ( t ) ) 2 + ln ( t ) + 1 + 2 t d t , ( Q 1 , Δ 2 ( λ , u ) ) 3 = λ 31 λ 32 + 1.0 1.05 λ 32 + u 32 ( t ) λ 31 u 31 ( t ) ( λ 32 + u 32 ( t ) ) 2 + ln ( t ) + 1 2 d t λ 41 λ 42 , ( Q 1 , Δ 2 ( λ , u ) ) 4 = 1 20 B λ 11 λ 12 + C λ 41 λ 42 1.5 0.2 + 1 20 C 1.05 1.1 λ 42 + u 42 ( t ) λ 41 u 41 ( t ) ( λ 42 + u 42 ( t ) ) 2 + ln ( t ) + 1 2 d t .

Condition A is satisfied for λ ( 0 ) = ( λ 1 ( 0 ) , λ 2 ( 0 ) , λ 3 ( 0 ) , λ 4 ( 0 ) ) = λ 11 ( 0 ) λ 12 ( 0 ) , λ 21 ( 0 ) λ 22 ( 0 ) , λ 31 ( 0 ) λ 32 ( 0 ) , λ 41 ( 0 ) λ 42 ( 0 ) = ( 0.057146 1.647708 , 0.040953 1.657188 , 0.475469 0.664826 , 0.508709 0.645427 ) with a precision of 1 0 5 , since there is an inequality Q 1 , Δ 2 ( λ ( 0 ) , 0 ) < 0.000009 < 1 0 5 .

Solutions to the Cauchy problems of kind (15) were found using the Runge-Kutta method of the fourth order of accuracy. We have listed the values of the components of the functions system u ( 0 ) [ t ] = ( u 1 ( 0 ) ( t ) , u 2 ( 0 ) ( t ) , u 3 ( 0 ) ( t ) , u 4 ( 0 ) ( t ) ) = u 11 ( 0 ) ( t ) u 12 ( 0 ) ( t ) , u 21 ( 0 ) ( t ) u 22 ( 0 ) ( t ) , u 31 ( 0 ) ( t ) u 32 ( 0 ) ( t ) , u 41 ( 0 ) ( t ) u 42 ( 0 ) ( t ) in Table 1.

Table 1

Values of the components of the functions system u ( 0 ) [ t ] (Ex. 1, N = 2 )

t u 1 ( 0 ) ( t ) t u 2 ( 0 ) ( t ) t u 3 ( 0 ) ( t ) t u 4 ( 0 ) ( t )
0.950 0.000000 0.000000 0.975 0.000000 0.000000 1.000 0.000000 0.000000 1.050 0.000000 0.000000
0.955 0.003244 0.001941 0.980 0.003290 0.001568 1.010 0.006628 0.004131 1.060 0.006436 0.003726
0.960 0.006497 0.003806 0.985 0.006588 0.003067 1.020 0.013215 0.008175 1.070 0.012835 0.007375
0.965 0.009759 0.005597 0.990 0.009893 0.004499 1.030 0.019762 0.012134 1.080 0.019198 0.010947
0.970 0.013030 0.007314 0.995 0.013205 0.005866 1.040 0.026270 0.016010 1.090 0.025525 0.014446
0.975 0.016310 0.008960 1.000 0.016524 0.007169 1.050 0.032739 0.019805 1.100 0.031818 0.017873

Note that

q 1 ( Δ 2 ) = γ 1 ( Δ 2 ) max { 1,0.025,0.05,0.05 * C } max { e 0.025 L 1 0.025 L , e 0.05 L 1 0.05 L } 68.142 * { 1,0.025,0.05,0.05 * 0.375 } × max { e 0.025 * 4.33 1 0.025 * 4.33 , e 0.05 * 4.33 1 0.05 * 4.33 } 1.72 > 1 .

So, let us take N = 4 and introduce the notation t r = 0.95 + r 80 , if r = 0 , 4 ¯ , 1.00 + ( r 4 ) 40 , if r = 5,8 ¯ . We will construct equation Q 1 , Δ 4 ( λ , u ) = 0 , λ R 8 , where Q 1 , Δ 4 ( λ , u ) = ( ( Q 1 , Δ 4 ( λ , u ) ) 1 , ( Q 1 , Δ 4 ( λ , u ) ) 2 , , ( Q 1 , Δ 4 ( λ , u ) ) 8 ) is an operator with components

( Q 1 , Δ 4 ( λ , u ) ) r = λ r 1 λ r 2 λ r + 1,1 λ r + 1,2 + t r 1 t r λ r 2 + u r 2 ( t ) 1 λ r 1 u r 1 ( t ) ( λ r 2 + u r 2 ( t ) ) 2 + ln ( t ) + 1 + 2 t d t , r = 1 , 2 , 3 , ( Q 1 , Δ 2 ( λ , u ) ) 4 = 1 80 λ 51 λ 52 λ 41 λ 42 0.5 1 1 80 t 3 t 4 λ 42 + u 42 ( t ) 1 λ 41 u 41 ( t ) ( λ 42 + u 42 ( t ) ) 2 + ln ( t ) + 1 + 2 t d t , ( Q 1 , Δ 2 ( λ , u ) ) r = λ r 1 λ r 2 λ r + 1,1 λ r + 1,2 + t r 1 t r λ r 2 + u r 2 ( t ) λ r 1 u r 1 ( t ) ( λ r 2 + u r 2 ( t ) ) 2 + ln ( t ) + 1 2 d t , r = 5 , 6 , 7 , ( Q 1 , Δ 2 ( λ , u ) ) 8 = 1 40 B λ 11 λ 12 + C λ 81 λ 82 t 7 t 8 1.5 0.2 + 1 40 C t 7 t 8 λ 82 + u 82 ( t ) λ 81 u 81 ( t ) ( λ 82 + u 82 ( t ) ) 2 + ln ( t ) + 1 2 d t .

Condition A is satisfied for

λ ( 0 ) = ( λ 1 ( 0 ) , λ 2 ( 0 ) , , λ 8 ( 0 ) ) = λ 11 ( 0 ) λ 12 ( 0 ) , λ 21 ( 0 ) λ 22 ( 0 ) , , λ 81 ( 0 ) λ 82 ( 0 ) = 0.056962 1.648151 , 0.048867 1.652971 , 0.040705 1.657316 , 0.032488 1.661212 , 0.475773 0.664690 , 0.492390 0.654637 , 0.508756 0.645109 , 0.524884 0.636074

with a precision of 1 0 5 : Q 1 , Δ 4 ( λ ( 0 ) , 0 ) 0.000007 < 1 0 5 .

Solutions to the Cauchy problems of kind (15) were found using the Runge-Kutta method of the fourth order of accuracy. We have listed the values of the components of the function system u ( 0 ) [ t ] = ( u 1 ( 0 ) ( t ) , u 2 ( 0 ) ( t ) , , u 8 ( 0 ) ( t ) ) in Tables 29.

Note that Q 1 , Δ 4 ( λ ( 0 ) , u ( 0 ) ) 0.000336 .

For N = 4 , ν = 1 , ( λ ( 0 ) , u ( 0 ) [ t ] ) , ρ λ = 0.2976 , ρ u = 0.03403 , ρ x = 0.33163 we have that γ 1 ( Δ 4 ) < 138.82 ,

q 1 ( Δ 4 ) = γ 1 ( Δ 2 ) max { 1,0.0125,0.025,0.025 C } max { e 0.0125 L 1 0.0125 L , e 0.025 L 1 0.025 L } < 138.82 max { 1,0.0125,0.025,0.025 0.375 } × max { e 0.0125 4.33 1 0.0125 4.33 , e 0.025 4.33 1 0.025 4.33 } 0.843511 < 1 ,

and

(41) ( q 1 ( Δ 4 ) ) 47 1 q 1 ( Δ 4 ) γ 1 ( Δ 4 ) Q 1 , Δ 4 ( λ ( 0 ) , u ( 0 ) ) < 0.000099998 < ε .

From inequality (41), it follows that to obtain an approximate solution of problem (38)–(40) with the required accuracy of ε = 1 0 4 , no more than 47 steps of the proposed algorithm are needed.

Next, we will find the solution to equation Q 1 , Δ 4 ( λ , u ( 0 ) ) = 0 . To do this, we use the iterative process:

λ ( 1,0 ) = λ ( 0 ) , λ ( 1 , m + 1 ) = λ ( 1 , m ) 1 2 Q 1 , Δ 4 ( λ ( 1 , m ) , u ( 0 ) ) λ 1 Q 1 , Δ 4 ( λ ( 1 , m ) , u ( 0 ) ) , m = 0 , 1 , 2 , .

We will take λ ( 1,6 ) as λ ( 1 ) to an accuracy of 1 0 5 , since Q 1 , Δ 4 ( λ ( 1,6 ) , u ( 0 ) ) 0.000005 . Thus,

λ ( 1 ) = ( λ 1 ( 1 ) , λ 2 ( 1 ) , , λ 8 ( 1 ) ) = 0.056809 1.648539 , 0.048673 1.653194 , 0.040481 1.657390 , 0.032240 1.661150 , 0.476045 0.664499 , 0.492532 0.654409 , 0.508772 0.644840 , 0.524779 0.635762 .

Let us find numerical solutions of Cauchy problems of the form (4) with λ r = λ r ( 1 ) , r = 1,8 ¯ . We have listed the values of the components of the functions system u ( 1 ) [ t ] = ( u 1 ( 1 ) ( t ) , u 2 ( 1 ) ( t ) , , u 8 ( 1 ) ( t ) ) in Tables 2, 3, 4, 5, 6, 7, 8, 9.

Table 2

Values of the components u 1 ( k ) ( t ) of the functions system u ( k ) [ t ] for k = 0 , 1 , 2 , 3 (Ex. 1, N = 4 )

t u 1 ( 0 ) ( t ) u 1 ( 1 ) ( t ) u 1 ( 2 ) ( t ) u 1 ( 3 ) ( t )
0.950000 0.00000000 0.00000000 0.00000000 0.00000000 0.00000000 0.00000000 0.00000000 0.00000000
0.953125 0.00202738 0.00121777 0.00202859 0.00121332 0.00202861 0.00121322 0.00202863 0.00121315
0.956250 0.00405852 0.00240555 0.00406092 0.00239669 0.00406097 0.00239648 0.00406101 0.00239635
0.959375 0.00609333 0.00356373 0.00609690 0.00355049 0.00609699 0.00355018 0.00609703 0.00355000
0.962500 0.00813171 0.00469270 0.00813645 0.00467513 0.00813656 0.00467471 0.00813662 0.00467447
Table 3

Values of the components u 2 ( k ) ( t ) of the functions system u ( k ) [ t ] for k = 0 , 1 , 2 , 3 (Ex. 1, N = 4 )

t u 2 ( 0 ) ( t ) u 2 ( 1 ) ( t ) u 2 ( 2 ) ( t ) u 2 ( 3 ) ( t )
0.962500 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000
0.965625 0.0020423 0.0010990 0.0020430 0.0010961 0.0020430 0.0010960 0.0020430 0.0010959
0.968750 0.0040879 0.0021695 0.0040893 0.0021637 0.0040893 0.0021635 0.0040894 0.0021634
0.971875 0.0061369 0.0032119 0.0061389 0.0032033 0.0061390 0.0032030 0.0061390 0.0032029
0.975000 0.0081890 0.0042267 0.0081917 0.0042153 0.0081918 0.0042149 0.0081919 0.0042147
Table 4

Values of the components u 3 ( k ) ( t ) of the functions system u ( k ) [ t ] for k = 0 , 1 , 2 , 3 (Ex. 1, N = 4 )

t u 3 ( 0 ) ( t ) u 3 ( 1 ) ( t ) u 3 ( 2 ) ( t ) u 3 ( 3 ) ( t )
0.975000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000
0.978125 0.0020557 0.0009863 0.0020559 0.0009849 0.0020559 0.0009848 0.0020559 0.0009847
0.981250 0.0041144 0.0019457 0.0041148 0.0019428 0.0041148 0.0019426 0.0041149 0.0019426
0.984375 0.0061760 0.0028785 0.0061767 0.0028742 0.0061767 0.0028739 0.0061768 0.0028738
0.987500 0.0082406 0.0037851 0.0082414 0.0037793 0.0082415 0.0037790 0.0082416 0.0037788
Table 5

Values of the components u 4 ( k ) ( t ) of the functions system u ( k ) [ t ] for k = 0 , 1 , 2 , 3 (Ex. 1, N = 4 )

t u 4 ( 0 ) ( t ) u 4 ( 1 ) ( t ) u 4 ( 2 ) ( t ) u 4 ( 3 ) ( t )
0.987500 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000
0.990625 0.0020677 0.0008796 0.0020675 0.0008795 0.0020675 0.0008794 0.0020675 0.0008794
0.993750 0.0041380 0.0017337 0.0041377 0.0017335 0.0041377 0.0017333 0.0041377 0.0017333
0.996875 0.0062111 0.0025627 0.0062105 0.0025623 0.0062105 0.0025621 0.0062105 0.0025620
1.000000 0.0082866 0.0033668 0.0082858 0.0033663 0.0082859 0.0033660 0.0082859 0.0033658
Table 6

The values of the components u 5 ( k ) ( t ) of the functions system u ( k ) [ t ] for k = 0 , 1 , 2 , 3 (Ex. 1, N = 4 )

t u 5 ( 0 ) ( t ) u 5 ( 1 ) ( t ) u 5 ( 2 ) ( t ) u 5 ( 3 ) ( t )
1.00000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000
1.00625 0.0041462 0.0025926 0.0041450 0.0025927 0.0041450 0.0025928 0.0041450 0.0025928
1.01250 0.0082763 0.0051509 0.0082739 0.0051512 0.0082739 0.0051513 0.0082740 0.0051514
1.01875 0.0123905 0.0076755 0.0123869 0.0076758 0.0123870 0.0076760 0.0123870 0.0076762
1.02500 0.0164890 0.0101668 0.0164843 0.0101672 0.0164843 0.0101675 0.0164844 0.0101677
Table 7

The values of the components u 6 ( k ) ( t ) of the functions system u ( k ) [ t ] for k = 0 , 1 , 2 , 3 (Ex. 1, N = 4 )

t u 6 ( 0 ) ( t ) u 6 ( 1 ) ( t ) u 6 ( 2 ) ( t ) u 6 ( 3 ) ( t )
1.02500 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000
1.03125 0.0040838 0.0024602 0.0040824 0.0024592 0.0040824 0.0024593 0.0040824 0.0024593
1.03750 0.0081523 0.0048881 0.0081494 0.0048862 0.0081495 0.0048863 0.0081495 0.0048864
1.04375 0.0122057 0.0072842 0.0122015 0.0072812 0.0122015 0.0072814 0.0122015 0.0072815
1.05000 0.0162443 0.0096488 0.0162386 0.0096449 0.0162387 0.0096451 0.0162387 0.0096453
Table 8

The values of the components u 7 ( k ) ( t ) of the functions system u ( k ) [ t ] for k = 0 , 1 , 2 , 3 (Ex. 1, N = 4 )

t u 7 ( 0 ) ( t ) u 7 ( 1 ) ( t ) u 7 ( 2 ) ( t ) u 7 ( 3 ) ( t )
1.05000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000
1.05625 0.0040246 0.0023354 0.0040229 0.0023334 0.0040230 0.0023334 0.0040230 0.0023334
1.06250 0.0080347 0.0046403 0.0080314 0.0046362 0.0080314 0.0046363 0.0080314 0.0046364
1.06875 0.0120305 0.0069151 0.0120256 0.0069090 0.0120256 0.0069091 0.0120256 0.0069092
1.07500 0.0160122 0.0091603 0.0160056 0.0091521 0.0160057 0.0091523 0.0160057 0.0091525
Table 9

The values of the components u 8 ( k ) ( t ) of the functions system u ( k ) [ t ] for k = 0 , 1 , 2 , 3 (Ex. 1, N = 4 )

t u 8 ( 0 ) ( t ) u 8 ( 1 ) ( t ) u 8 ( 2 ) ( t ) u 8 ( 3 ) ( t )
1.07500 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000
1.08125 0.0039685 0.0022177 0.0039666 0.0022145 0.0039666 0.0022146 0.0039666 0.0022146
1.08750 0.0079233 0.0044065 0.0079194 0.0044003 0.0079194 0.0044003 0.0079194 0.0044004
1.09375 0.0118644 0.0065669 0.0118587 0.0065576 0.0118587 0.0065577 0.0118587 0.0065578
1.10000 0.0157922 0.0086993 0.0157845 0.0086870 0.0157846 0.0086871 0.0157846 0.0086872

Let us introduce the notation t r , j = t r + j 640 , if r = 0 , 4 ¯ , t r + j 320 , if r = 5,8 ¯ , j = 0 , 8 ¯ . The following inequalities hold:

δ 1 ( 1 ) ( 1 , 4 , 8 ) < 0.00004 , δ 2 ( 1 ) ( 1 , 4 , 8 ) < 0.00002 , δ 3 ( 1 ) ( 1 , 4 , 8 ) < 0.000044 .

However, since there is an inequality q 1 ( Δ 4 ) 1 q 1 ( Δ 4 ) λ ( 1 ) λ ( 0 ) 0.004654 > ε , we will look for λ ( 2 ) by solving the equation Q 1 , Δ 4 ( λ , u ( 1 ) ) = 0 . We will use the iterative the process

λ ( 2,0 ) = λ ( 1 ) , λ ( 2 , m + 1 ) = λ ( 2 , m ) 1 2 Q 1 , Δ 4 ( λ ( 2 , m ) , u ( 1 ) ) λ 1 Q 1 , Δ 4 ( λ ( 2 , m ) , u ( 1 ) ) , m = 0 , 1 , 2 , .

We will take λ ( 2,1 ) as λ ( 2 ) to an accuracy of 1 0 5 , since Q 1 , Δ 4 ( λ ( 2,1 ) , u ( 1 ) ) 0.000002 < 1 0 5 . So λ ( 2 ) is

λ ( 2 ) = 0.056803 1.648548 , 0.048667 1.653201 , 0.040475 1.657396 , 0.032234 1.661155 , 0.476052 0.664502 , 0.492537 0.654412 , 0.508776 0.644842 , 0.524783 0.635764 .

Let us find numerical solutions of Cauchy problems of the form (4) with λ r = λ r ( 2 ) , r = 1,8 ¯ (see Tables 29).

The following inequalities hold:

δ 1 ( 2 ) ( 1 , 4 , 8 ) < 0.00004 , δ 2 ( 2 ) ( 1 , 4 , 8 ) < 0.00002 , δ 3 ( 2 ) ( 1 , 4 , 8 ) < 0.000038 .

Since there is an inequality q 1 ( Δ 4 ) 1 q 1 ( Δ 4 ) λ ( 2 ) λ ( 1 ) 0.000113 > ε , we will look for λ ( 3 ) by solving the equation Q 1 , Δ 4 ( λ , u ( 2 ) ) = 0 . We will use the iterative process:

λ ( 3,0 ) = λ ( 2 ) , λ ( 3 , m + 1 ) = λ ( 3 , m ) 1 2 Q 1 , Δ 4 ( λ ( 3 , m ) , u ( 2 ) ) λ 1 Q 1 , Δ 4 ( λ ( 3 , m ) , u ( 2 ) ) , m = 0 , 1 , 2 , .

Since Q 1 , Δ 4 ( λ ( 3,1 ) , u ( 2 ) ) 0.000001 , we will take λ ( 3,1 ) as λ ( 3 ) to an accuracy of 1 0 5

λ ( 3 ) = 0.056801 1.648553 , 0.048664 1.653206 , 0.040472 1.657399 , 0.032231 1.661158 , 0.476055 0.664504 , 0.492540 0.654414 , 0.508779 0.644844 , 0.524785 0.635765 .

Let us find numerical solutions of Cauchy problems of the form (4) with λ r = λ r ( 3 ) , r = 1,8 ¯ . We have listed the values of the components of the function system u ( 3 ) [ t ] = ( u 1 ( 3 ) ( t ) , u 2 ( 3 ) ( t ) , , u 8 ( 3 ) ( t ) ) Tables 29.

Note that there are estimates

q 1 ( Δ 4 ) 1 q 1 ( Δ 4 ) λ ( 3 ) λ ( 2 ) < 0.00007 < ε ,

q 1 ( Δ 4 ) 1 q 1 ( Δ 4 ) max { e 0.0125 * 4.33 1 , e 0.025 * 4.33 1 } λ ( 3 ) λ ( 2 ) < 0.000008 < ε .

δ 1 ( 3 ) ( 1 , 4 , 8 ) < 0.000038 < ε , δ 2 ( 3 ) ( 1 , 4 , 8 ) < 0.00002 < ε , δ 3 ( 3 ) ( 1 , 4 , 8 ) < 0.0000333 < ε .

As can be seen from these inequalities, only three steps of the algorithm were needed to obtain the approximate solution of problem (38)–(40)

x * ( t ) x ( 3 ) ( t ) = λ r ( 3 ) + u r ( 3 ) ( t ) , if t [ t r 1 , t r ) , r = 1,8 ¯ , λ 8 ( 3 ) + u 8 ( 3 ) ( t 8 ) , if t = t 8 .

The graph of the approximate solution to problem (38)–(40) is shown in Figure 1.

Figure 1 
               Approximate solution 
                     
                        
                        
                           
                              
                                 x
                              
                              
                                 
                                    (
                                    
                                       3
                                    
                                    )
                                 
                              
                           
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {x}^{\left(3)}\left(t)
                     
                   of the problem (38)–(40): (a) first component 
                     
                        
                        
                           
                              
                                 x
                              
                              
                                 1
                              
                              
                                 
                                    (
                                    
                                       3
                                    
                                    )
                                 
                              
                           
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {x}_{1}^{\left(3)}\left(t)
                     
                  ; (b) second component 
                     
                        
                        
                           
                              
                                 x
                              
                              
                                 2
                              
                              
                                 
                                    (
                                    
                                       3
                                    
                                    )
                                 
                              
                           
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {x}_{2}^{\left(3)}\left(t)
                     
                  .
Figure 1

Approximate solution x ( 3 ) ( t ) of the problem (38)–(40): (a) first component x 1 ( 3 ) ( t ) ; (b) second component x 2 ( 3 ) ( t ) .

Remarks

  1. The parameters λ ( 0 ) = λ ( 0,17 ) R 2 N were determined using an iterative process

    λ ( 0,0 ) = λ 0 , λ ( 0 , m + 1 ) = λ ( 0 , m ) 1 2 Q 1 , Δ N ( λ ( 0 , m ) , 0 ) λ 1 Q 1 , Δ N ( λ ( 0 , m ) , 0 ) , m = 0 , 1 , 2 , ,

    where λ 0 = 1 0 , 0 0 , , 0 0 N R 2 N ( N = 2 , 4 ).

  2. The fourth order Runge-Kutta method is used to solve the Cauchy problems for ODEs, and the Simpson rules (ship stability) are used to calculate definite integrals.

  3. To compute the derivatives, we used the following formulas:

    1. at the point t r , 0 :

      d d t λ r 1 ( k ) + u r 1 ( k ) ( t ) λ r 2 ( k ) + u r 2 ( k ) ( t ) t = t r , 0 = 1 2 ( t r , 1 t r , 0 ) 3 u r 1 ( k ) ( t ) u r 2 ( k ) ( t ) t = t r , 0 + 4 u r 1 ( k ) ( t ) u r 2 ( k ) ( t ) t = t r , 1 u r 1 ( k ) ( t ) u r 2 ( k ) ( t ) t = t r , 2 ,

    2. at the point t r , j for j = 1 , K 1 ¯ :

      d d t λ r 1 ( k ) + u r 1 ( k ) ( t ) λ r 2 ( k ) + u r 2 ( k ) ( t ) t = t r , j = 1 2 ( t r , 1 t r , 0 ) u r 1 ( k ) ( t ) u r 2 ( k ) ( t ) t = t r , j + 1 u r 1 ( k ) ( t ) u r 2 ( k ) ( t ) t = t r , j 1 ,

    3. at the point t r , K :

      d d t λ r 1 ( k ) + u r 1 ( k ) ( t ) λ r 2 ( k ) + u r 2 ( k ) ( t ) t = t r , K = 1 2 ( t r , 1 t r , 0 ) × u r 1 ( k ) ( t ) u r 2 ( k ) ( t ) t = t r , K 2 4 u r 1 ( k ) ( t ) u r 2 ( k ) ( t ) t = t r , K 1 + 3 u r 1 ( k ) ( t ) u r 2 ( k ) ( t ) t = t r , K .

  4. In Example 1, the following designations were used:

    δ 2 ( k ) ( m , N , K ) = λ N + 1,1 ( k ) λ N + 1,2 ( k ) λ N 1 ( k ) + u N 1 ( k ) ( t N , K ) λ N 2 ( k ) + u N 2 ( k ) ( t N , K ) p m , δ 3 ( k ) ( m , N , K ) = B λ 11 ( k ) λ 12 ( k ) + C λ ( m + 1 ) N , 1 ( k ) + u ( m + 1 ) N , 1 ( k ) ( t ( m + 1 ) N , K ) λ ( m + 1 ) N , 2 ( k ) + u ( m + 1 ) N , 2 ( k ) ( t ( m + 1 ) N , K ) d ,

    δ 1 ( k ) ( m , N , K ) = Z d d t λ 11 ( k ) + u 11 ( k ) ( t 1,0 ) λ 12 ( k ) + u 12 ( k ) ( t 1,0 ) f t , λ 11 ( k ) + u 11 ( k ) ( t 1,0 ) λ 12 ( k ) + u 12 ( k ) ( t 1,0 ) for j 1 K Z stack Z , d d t λ 11 ( k ) + u 11 ( k ) ( t 1 , j ) λ 12 ( k ) + u 12 ( k ) ( t 1 , j ) f t , λ 11 ( k ) + u 11 ( k ) ( t 1 , j ) λ 12 ( k ) + u 12 ( k ) ( t 1 , j ) for r 2 ( m + 1 ) N for j 0 K Z stack Z , d d t λ r 1 ( k ) + u r 1 ( k ) ( t r , j ) λ r 2 ( k ) + u r 2 ( k ) ( t r , j ) f t , λ r 1 ( k ) + u r 1 ( k ) ( t r , j ) λ r 2 ( k ) + u r 2 ( k ) ( t r , j ) Z .

Here, k is the algorithm step number, m is the count of impulse action points, N is the count of subdivisions of the intervals between the impulse action points, K is the count of nodes in solving the Cauchy problems, and r = 1 , N ¯ .

Example 2

Consider a two-point boundary value problems for a system of two nonlinear differential equations subjected to impulsive action at one point

(42) d d t x 1 x 2 = f t , x 1 x 2 , t ( 0.5 , 1.5 ) \ { 1 } ,

(43) x 1 x 2 ( 1 ) x 1 x 2 ( 1 0 ) = p 1 ,

(44) B x 1 x 2 ( 0.5 ) + C x 1 x 2 ( 1.5 ) = d ,

where f t , x 1 x 2 = x 2 x 1 x 2 2 + ln ( t ) + η ( 1 t ) 1 2 t + 1 + η ( t 1 ) 0 0.5 , η ( t ) = 0 for t < 0 , 1 for t > 0 , p 1 = 0.5 1 , B = 0.5 0.75 1 0.2 , C = 0 0.375 0.2 0.125 , d = 0.5 ln 2 + 2.5 1.2 ln 2 0.2 ln 3 + 5 12 .

Find the numerical solution of the boundary value problem (42)–(44) with an accuracy of ε = 1 0 3 , and compare the results with the exact solution x * ( t ) = x 1 * ( t ) x 2 * ( t ) , where

x 1 * ( t ) = ln t for t [ 0.5 , 1 ) , 0.5 + ln t for t [ 1.0 , 1.5 ] , x 2 * ( t ) = 1 + 1 t for t [ 0.5 , 1 ) , 1 t for t [ 1.0 , 1.5 ] .

We will use the notations

δ N ( k ) = ( q 1 ( σ N ) ) k 1 q 1 ( σ N ) γ 1 ( σ N ) Q 1 , σ N ( λ ( 0 ) , u ( 0 ) ) , t r = 0.5 + r ( 2 N ) , if r = 0 , N ¯ , 1.00 + ( r N ) ( 2 N ) , if r = N + 1,2 N ¯ , μ ( N ) = ( x * ( t 0 ) , x * ( t 1 ) , , x * ( t 2 N 1 ) ) ,

and choose the number N based on the data from Table 10.

Table 10

Selection of the number of partitions for the intervals [ 0.5 , 1.0 ) and ( 1.0 , 1.5 ] (Ex. 2)

N γ 1 ( Δ N ) q 1 ( Δ N ) Q 1 , Δ N ( λ ( 0 ) , u ( 0 ) ) k : σ N ( k ) < ε = 1 0 3
51 419.3803 1.0106 > 1
52 427.64 0.991 < 1 0.0009362 1,184
64 526.715 0.8022 < 1 0.000613 34
128 1055.11 0.3981 < 1 0.0009432 9

From Table 10, it is evident that the number N 52 can be chosen. The conditions of Theorem 1 are satisfied for N = 64 , ν = 1 , ρ λ = 1.63234 , ρ u = 0.0918 , ρ x = 1.72414 , γ 1 ( Δ 64 ) 526.715 , q 1 ( Δ 64 ) 0.8022 < 1 .

From these estimates (Table 11), it follows that the approximate solution at the 6th step (Figures 2 and 3) is found with an accuracy not exceeding ε = 0.001 10 −3 . The third column of Table 11 is based on the equation (33) inequality.

Table 11

Selection of the number of partitions for the intervals [0.5, 1.0) and (1.0, 1.5] (Ex. 2)

k μ ( 64 ) λ ( k ) q 1 ( Δ 64 ) 1 q 1 ( Δ 64 ) λ ( k ) λ ( k 1 )
0 0.009825
1 0.004 0.026
2 0.0022 0.0055
3 0.00141 0.0033
4 0.0009724 < ε 0.002 > ε
5 0.000744 < ε 0.0012003 > ε
6 0.00063 < ε 0.0007112015 < ε
Figure 2 
               Approximate solution 
                     
                        
                        
                           
                              
                                 x
                              
                              
                                 
                                    (
                                    
                                       6
                                    
                                    )
                                 
                              
                           
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {x}^{\left(6)}\left(t)
                     
                   of the problem (42)–(44): (a) first component 
                     
                        
                        
                           
                              
                                 x
                              
                              
                                 1
                              
                              
                                 
                                    (
                                    
                                       6
                                    
                                    )
                                 
                              
                           
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {x}_{1}^{\left(6)}\left(t)
                     
                  ; (b) second component 
                     
                        
                        
                           
                              
                                 x
                              
                              
                                 2
                              
                              
                                 
                                    (
                                    
                                       6
                                    
                                    )
                                 
                              
                           
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {x}_{2}^{\left(6)}\left(t)
                     
                  .
Figure 2

Approximate solution x ( 6 ) ( t ) of the problem (42)–(44): (a) first component x 1 ( 6 ) ( t ) ; (b) second component x 2 ( 6 ) ( t ) .

Figure 3 
               Error rectangles for the numerical solution of the problem (42)–(44): (a) plot of absolute errors in the numerical approximation 
                     
                        
                        
                           
                              
                                 x
                              
                              
                                 1
                              
                           
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {x}_{1}\left(t)
                     
                  ; (b) plot of absolute errors in the numerical approximation of 
                     
                        
                        
                           
                              
                                 x
                              
                              
                                 2
                              
                           
                           
                              (
                              
                                 t
                              
                              )
                           
                        
                        {x}_{2}\left(t)
                     
                  .
Figure 3

Error rectangles for the numerical solution of the problem (42)–(44): (a) plot of absolute errors in the numerical approximation x 1 ( t ) ; (b) plot of absolute errors in the numerical approximation of x 2 ( t ) .

5 Conclusion

This work was devoted to obtaining sufficient conditions for the existence of an isolated solution within a certain ball for a two-point boundary value problems of a system of nonlinear ODEs subjected to impulsive actions. The ideas of the parameterization method were employed to determine the discontinuous trajectory. By leveraging the concepts of the parameterization method, the authors managed to develop an algorithm for finding a solution to the given problems. The authors plan to consider most of the problems from studies [2838] for nonlinear systems of differential equations, as well as apply the parametrization method to the problems from study [39].


This work is dedicated to the bright memory of our scientific advisor, D. S. Dzhumabaev, on the occasion of his 70th anniversary.


Acknowledgments

The authors thank the staff of the Differential Equations Department at the Institute of Mathematics and Mathematical Modeling of the Science Committee of the Ministry of Science and Higher Education of the Republic of Kazakhstan for their valuable discussions and helpful advice on this work. The authors are grateful for the reviewer’s valuable comments that improved the manuscript.

  1. Funding information: This research was supported by the Committee of Science of the Ministry of Science and Higher Education of the Republic of Kazakhstan (Grant No. AP23488811 “Numerical and analytical methods for investigating evolutionary problems with impulsive actions” and “The Best University Teacher Award - 2024”).

  2. Author contributions: All authors contributed equally to this work.

  3. Conflict of interest: The authors declare that they have no conflicts of interest.

  4. Data availability statement: All data generated or analyzed during this study are included in this published article.

References

[1] A. M. Samoilenko and N. A. Perestyuk, Impulsive Differential Equations, World Scientific, Singapore, 1995. 10.1142/9789812798664Search in Google Scholar

[2] V. Lakshmikantham, D. D. Bainov, and P. S. Simeonov, Theory of Impulsive Differential Equations, World Scientific, Singapore, 1989. 10.1142/0906Search in Google Scholar

[3] S. Dashkovskiy, O. Kapustyan, and I. Romaniuk, Global attractors of impulsive parabolic inclusions, Discrete Contin. Dyn. Syst. Ser. B 22 (2017), no. 5, 1875–1886, DOI: https://doi.org/10.3934/dcdsb.2017111. 10.3934/dcdsb.2017111Search in Google Scholar

[4] O. V. Kapustyan, M. O. Perestyuk, and I. V. Romanyuk, Stability of global attractors of impulsive infinite-dimensional systems, Ukrainian Math. J. 70 (2018), no. 2, 1–12, DOI: https://doi.org/10.1007/s11253-018-1486-z. 10.1007/s11253-018-1486-zSearch in Google Scholar

[5] S. Dashkovskiy, P. Feketa, O. Kapustyan, and I. Romaniuk, Invariance and stability of global attractors for multi-valued impulsive dynamical systems, J. Math. Anal. Appl. 458 (2018), no. 1, 193–218, DOI: https://doi.org/10.1016/j.jmaa.2017.09.001. 10.1016/j.jmaa.2017.09.001Search in Google Scholar

[6] S. Dashkovskiy, O. V. Kapustyan, Yu. Perestyuk, Stability of uniform attractors of impulsive multi-valued semiflows, Nonlinear Anal. Hybrid Syst. 40 (2021), 101025, DOI: https://doi.org/10.1016/j.nahs.2021.101025. 10.1016/j.nahs.2021.101025Search in Google Scholar

[7] S. Dashkovskiy, O. V. Kapustyan, O. V. Kapustian, and N. Gorban, Attractors for multi-valued impulsive dynamical systems: existence and application to reaction-diffusion systems, Math. Probl. Eng. 5 (2021), 1–7, DOI: https://doi.org/10.1155/2021/7385450. 10.1155/2021/7385450Search in Google Scholar

[8] O. V. Kapustyan, O. A. Kapustian, I. Korol, and B. Rubino, Uniform attractor of impulse-perturbed reaction-diffusion system, Math. Mech. Complex Syst. 11 (2023), no. 1, 45–55, DOI: https://doi.org/10.2140/memocs.2023.11.45. 10.2140/memocs.2023.11.45Search in Google Scholar

[9] A. A. Boichuk, V. F. Zhuravlev, and A. M. Samoilenko, Normally Solvable Boundary-Value Problems, Naukova Dumka, Kiev, 2019 (in Russian). Search in Google Scholar

[10] A. Boichuk, M. Langerová, M. Růžičková, and E. Voitushenko, Systems of singular differential equations with pulse action, Adv. Differential Equations 1 (2013), 186, DOI: https://doi.org/10.1186/1687-1847-2013-186. 10.1186/1687-1847-2013-186Search in Google Scholar

[11] D. S. Dzhumabayev, Criteria for the unique solvability of a linear boundary-value problems for an ordinary differential equation, USSR. Comp. Math. Math. Phys. 29 (1989), no. 1, 34–46, DOI: https://doi.org/10.1016/0041-5553(89)90038-4. 10.1016/0041-5553(89)90038-4Search in Google Scholar

[12] D. S. Dzhumabaev and S. M. Temesheva, Necessary and sufficient conditions for the existence of an “isolated” solution of a nonlinear two-point boundary-value problems, J. Math. Sci. (N.Y.) 94 (2013), no. 4, 341–353, DOI: https://doi.org/10.1007/s10958-013-1533-0. 10.1007/s10958-013-1533-0Search in Google Scholar

[13] D. S. Dzhumabaev, Estimates for the approximation of singular boundary value problems for ordinary differential equations, Comput. Math. Math. Phys. 38 (1998), no. 11, 1739–1746, http://mathscinet.ams.org/mathscinet-getitem?mr=1657846. Search in Google Scholar

[14] E. V. Kokotova, Criteria of unique solvability of two-point boundary-value problems with non-uniform internal partition, Math. J. 4 (2004), no. 3, 49–57 (in Russian). Search in Google Scholar

[15] A. E. Imanchiev, On solvability of the Cauchy-Nikoletti problems for ordinary differential equation, Math. J. 10 (2010), no. 3, 75–84 (in Russian). Search in Google Scholar

[16] D. S. Dzhumabaev, and E. A. Bakirova, Criteria for the well-posedness of a linear two-point boundary value problems for systems of integro-differential equations, Differ. Equ. 46 (2010), no. 4, 553–567, DOI: https://doi.org/10.1134/S0012266110040117. 10.1134/S0012266110040117Search in Google Scholar

[17] D. S. Dzhumabaev and A. D. Abildaeva, Properties of the isolated solutions bounded on the entire axis for a system of nonlinear ordinary differential equations, Ukrainian Math. J. 68 (2017), no. 8, 1297–1304, DOI: https://doi.org/10.1007/s11253-017-1294-x. 10.1007/s11253-017-1294-xSearch in Google Scholar

[18] D. S. Dzhumabaev and R. E. Uteshova, Weighted limit solution of a nonlinear ordinary differential equation at a singular point and its property, Ukrainian Math. J. 69 (2018), no. 12, 1997–2004, DOI: https://doi.org/10.1007/s11253-018-1483-2. 10.1007/s11253-018-1483-2Search in Google Scholar

[19] A. D. Abildayeva, A. T. Assanova, and B. B. Minglibayeva, An existence solution to an identification parameter problems for higher-order partial differential equations, Int. J. Math. Phys. 11 (2020), 28–35, DOI: https://doi.org/10.26577/ijmph.2020.v11.i1.04. 10.26577/ijmph.2020.v11.i1.04Search in Google Scholar

[20] S. M. Temesheva, D. S. Dzhumabaev, and S. S. Kabdrakhova, On one algorithm to find a solution to a linear two-point boundary value problems, Lobachevskii J. Math. 42 (2021), no. 3, 606–612, DOI: https://doi.org/10.1134/S1995080221030173. 10.1134/S1995080221030173Search in Google Scholar

[21] Zh. Kadirbayeva and S. Kabdrakhova, A numerical solution of problems for essentially loaded differential equations with an integro-multipoint condition, Open Math. 20 (2022), no. 1, 1173–1183, DOI: https://doi.org/10.1515/math-2022-0496. 10.1515/math-2022-0496Search in Google Scholar

[22] G. A. Abdikalikova, A. T. Assanova, and S. T. Shekerbekova, Nonlocal problems for fourth-order loaded hyperbolic equations, Russian Math. (Iz. VUZ) 66 (2022), no. 8, 1–18, DOI: https://doi.org/10.3103/S1066369X22080011. 10.3103/S1066369X22080011Search in Google Scholar

[23] N. Iskakova, S. Temesheva, and R. Uteshova, On a problems for a delay differential equation, Math. Methods Appl. Sci. 46 (2023), no. 9, 11283–11297, DOI: https://doi.org/10.1002/mma.9181. 10.1002/mma.9181Search in Google Scholar

[24] P. B. Abdimanapova and S. Temesheva, Well-posedness criteria for one family of boundary value problems, Bull. Karaganda Univ. Math. Ser. 112 (2023), no. 4, 5–20, DOI: https://doi.org/10.31489/2023m4/5-20. 10.31489/2023m4/5-20Search in Google Scholar

[25] P. B. Abdimanapova and S. M. Temesheva, On a solution of a nonlinear nonlocal boundary value problems for one class of hyperbolic equation, Lobachevskii J. Math. 44 (2023), no. 7, 2529–2541, DOI: https://doi.org/10.1134/S1995080223070028. 10.1134/S1995080223070028Search in Google Scholar

[26] A. T. Assanova, Zh. M. Kadirbayeva, R. A. Medetbekova, and S. T. Mynbayeva, Problem for differential-algebraic equations with significant loads, Bull. Karaganda Univ. Math. Ser. 113 (2024), 46–59, DOI: https://doi.org/10.31489/2024m1/46-59. 10.31489/2024m1/46-59Search in Google Scholar

[27] A. T. Assanova, C. Trunk, and R. Uteshova, On the solvability of boundary value problems for linear differential-algebraic equations with constant coefficients, Contemp. Math. 1 (2024), 13–19, DOI: https://doi.org/10.1090/conm/798/15979. 10.1090/conm/798/15979Search in Google Scholar

[28] E. A. Bakirova, Zh. M. Kadirbayeva, and A. B. Tleulessova, On one algorithm for finding a solution to a two-point boundary value problems for loaded differential equations with impulse effect, Bull. Karaganda Univ. Math. Ser. 87 (2017), no. 3, 43–50, DOI: http://doi.org/10.31489/2017M3/43-50. 10.31489/2017M3/43-50Search in Google Scholar

[29] A. T. Assanova and Zh. M. Kadirbayeva, Periodic problems for an impulsive system of loaded hyperbolic equations, Electron. J. Differential Equations 2018 (2018), no. 72, 1–8, https://ejde.math.txstate.edu/Volumes/2018/72/assanova.pdf. Search in Google Scholar

[30] A. T. Assanova, and Zh. M. Kadirbayeva, On the numerical algorithms of parametrization method for solving a two-point boundary-value problems for impulsive systems of loaded differential equations, Comput. Appl. Math. 37 (2018), no. 4, 4966–4976, DOI: https://doi.org/10.1007/s40314-018-0611-9. 10.1007/s40314-018-0611-9Search in Google Scholar

[31] A. T. Assanova, E. A. Bakirova, and Zh. M. Kadirbayeva, On the unique solvability of a nonlocal boundary-value problems for systems of loaded hyperbolic equations with impulsive actions, Ukrainian Math. J. 69 (2018), no. 8, 1175–1195, DOI: https://doi.org/10.1007/s11253-017-1424-5. 10.1007/s11253-017-1424-5Search in Google Scholar

[32] A. T. Assanova, A. D. Abildayeva, and A. B. Tleulessova, Nonlocal problems for the fourth order impulsive partial differential equations, in: S. Pinelas, J. R. Graef, S. Hilger, P. Kloeden, C. Schinas, (Eds), Differential and Difference Equations with Applications. ICDDEA 2019. Springer Proceedings in Mathematics & Statistics, vol. 333, Springer, 2020, pp. 81–94, DOI: https://doi.org/10.1007/978-3-030-56323-3_7. 10.1007/978-3-030-56323-3_7Search in Google Scholar

[33] A. T. Assanova and A. B. Tleulessova, Nonlocal problems for a system of partial differential equations of higher order with pulse actions, Ukrainian Math. J 71 (2020), no. 12, 1821–1842, DOI: https://doi.org/10.1007/s11253-020-01750-9. 10.1007/s11253-020-01750-9Search in Google Scholar

[34] Zh. Kadirbayeva, S. Kabdrakhova and S. Mynbyaeva, A computational method of solving the boundary value problems for impulsive systems of essentially loaded differential equations, Lobachevskii J. Math. 42 (2021), no. 15, 3675–3683, DOI: https://doi.org/10.1134/S1995080222030131. 10.1134/S1995080222030131Search in Google Scholar

[35] Zh. KadirbayevaAnalytical and numerical solutions of a boundary value problems for impulsive differential equations with loadings, Lobachevskii J. Math. 44 (2023), no. 12, 5276–5285, DOI: https://doi.org/10.1134/S199508022312017X. 10.1134/S199508022312017XSearch in Google Scholar

[36] E. Bakirova, N. Iskakova, and Zh. Kadirbayeva, Numerical implementation for solving the boundary value problems for impulsive integro-differential equations with parameter, J. Math. Mech. Comput. S. 119 (2023), no. 3, 19–29, DOI: https://doi.org/10.26577/JMMCS2023v119i3a2. 10.26577/JMMCS2023v119i3a2Search in Google Scholar

[37] M. A. Mukash, A. T. Assanova, and O. Stanzhytskyi, A problems with impulse actions for nonlinear ODEs, Int. J. Math. Phys. 14 (2023), no. 1, 23–31, DOI: https://doi.org/10.26577/ijmph.2023.v14.i1.04. 10.26577/ijmph.2023.v14.i1.04Search in Google Scholar

[38] A. B. Tleulessova, A. S. Orazbekova, and Y. N. Kalpakov, On the solvability of a linear boundary value problems with impulse effects for differential system, Lobachevskii J. Math. 44 (2023), no. 2, 653–660, DOI: https://doi.org/10.1134/S199508022302035X. 10.1134/S199508022302035XSearch in Google Scholar

[39] O. M. Stanzhytskyi, R. Uteshova, M. Mukash, and V. V. Mogylova, Application of the method of averaging to boundary value problems for differential equations with non-fixed moments of impulse, Carpathian Math. Publ. 14 (2022), no. 2, 304–326, DOI: https://doi.org/10.15330/cmp.14.2.304-326. 10.15330/cmp.14.2.304-326Search in Google Scholar

Received: 2024-02-25
Revised: 2025-01-24
Accepted: 2025-06-10
Published Online: 2025-07-25

© 2025 the author(s), published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 International License.

Articles in the same Issue

  1. Special Issue on Contemporary Developments in Graphs Defined on Algebraic Structures
  2. Forbidden subgraphs of TI-power graphs of finite groups
  3. Finite group with some c#-normal and S-quasinormally embedded subgroups
  4. Classifying cubic symmetric graphs of order 88p and 88p 2
  5. Simplicial complexes defined on groups
  6. Two-sided zero-divisor graphs of orientation-preserving and order-decreasing transformation semigroups
  7. Further results on permanents of Laplacian matrices of trees
  8. Special Issue on Convex Analysis and Applications - Part II
  9. A generalized fixed-point theorem for set-valued mappings in b-metric spaces
  10. Research Articles
  11. Dynamics of particulate emissions in the presence of autonomous vehicles
  12. The regularity of solutions to the Lp Gauss image problem
  13. Exploring homotopy with hyperspherical tracking to find complex roots with application to electrical circuits
  14. The ill-posedness of the (non-)periodic traveling wave solution for the deformed continuous Heisenberg spin equation
  15. Some results on value distribution concerning Hayman's alternative
  16. 𝕮-inverse of graphs and mixed graphs
  17. A note on the global existence and boundedness of an N-dimensional parabolic-elliptic predator-prey system with indirect pursuit-evasion interaction
  18. On a question of permutation groups acting on the power set
  19. Chebyshev polynomials of the first kind and the univariate Lommel function: Integral representations
  20. Blow-up of solutions for Euler-Bernoulli equation with nonlinear time delay
  21. Spectrum boundary domination of semiregularities in Banach algebras
  22. Statistical inference and data analysis of the record-based transmuted Burr X model
  23. A modified predictor–corrector scheme with graded mesh for numerical solutions of nonlinear Ψ-caputo fractional-order systems
  24. Dynamical properties of two-diffusion SIR epidemic model with Markovian switching
  25. Classes of modules closed under projective covers
  26. On the dimension of the algebraic sum of subspaces
  27. Periodic or homoclinic orbit bifurcated from a heteroclinic loop for high-dimensional systems
  28. On tangent bundles of Walker four-manifolds
  29. Regularity of weak solutions to the 3D stationary tropical climate model
  30. A new result for entire functions and their shifts with two shared values
  31. Freely quasiconformal and locally weakly quasisymmetric mappings in metric spaces
  32. On the spectral radius and energy of the degree distance matrix of a connected graph
  33. Solving the quartic by conics
  34. A topology related to implication and upsets on a bounded BCK-algebra
  35. On a subclass of multivalent functions defined by generalized multiplier transformation
  36. Local minimizers for the NLS equation with localized nonlinearity on noncompact metric graphs
  37. Approximate multi-Cauchy mappings on certain groupoids
  38. Multiple solutions for a class of fourth-order elliptic equations with critical growth
  39. A note on weighted measure-theoretic pressure
  40. Majorization-type inequalities for (m, M, ψ)-convex functions with applications
  41. Recurrence for probabilistic extension of Dowling polynomials
  42. Unraveling chaos: A topological analysis of simplicial homology groups and their foldings
  43. Global existence and blow-up of solutions to pseudo-parabolic equation for Baouendi-Grushin operator
  44. A characterization of the translational hull of a weakly type B semigroup with E-properties
  45. Some new bounds on resolvent energy of a graph
  46. Carmichael numbers composed of Piatetski-Shapiro primes in Beatty sequences
  47. The number of rational points of some classes of algebraic varieties over finite fields
  48. Singular direction of meromorphic functions with finite logarithmic order
  49. Pullback attractors for a class of second-order delay evolution equations with dispersive and dissipative terms on unbounded domain
  50. Eigenfunctions on an infinite Schrödinger network
  51. Boundedness of fractional sublinear operators on weighted grand Herz-Morrey spaces with variable exponents
  52. On SI2-convergence in T0-spaces
  53. Bubbles clustered inside for almost-critical problems
  54. Classification and irreducibility of a class of integer polynomials
  55. Existence and multiplicity of positive solutions for multiparameter periodic systems
  56. Averaging method in optimal control problems for integro-differential equations
  57. On superstability of derivations in Banach algebras
  58. Investigating the modified UO-iteration process in Banach spaces by a digraph
  59. The evaluation of a definite integral by the method of brackets illustrating its flexibility
  60. Existence of positive periodic solutions for evolution equations with delay in ordered Banach spaces
  61. Tilings, sub-tilings, and spectral sets on p-adic space
  62. The higher mapping cone axiom
  63. Continuity and essential norm of operators defined by infinite tridiagonal matrices in weighted Orlicz and l spaces
  64. A family of commuting contraction semigroups on l 1 ( N ) and l ( N )
  65. Pullback attractor of the 2D non-autonomous magneto-micropolar fluid equations
  66. Maximal function and generalized fractional integral operators on the weighted Orlicz-Lorentz-Morrey spaces
  67. On a nonlinear boundary value problems with impulse action
  68. Normalized ground-states for the Sobolev critical Kirchhoff equation with at least mass critical growth
  69. Decompositions of the extended Selberg class functions
  70. Subharmonic functions and associated measures in ℝn
  71. Some new Fejér type inequalities for (h, g; α - m)-convex functions
  72. The robust isolated calmness of spectral norm regularized convex matrix optimization problems
  73. Multiple positive solutions to a p-Kirchhoff equation with logarithmic terms and concave terms
  74. Joint approximation of analytic functions by the shifts of Hurwitz zeta-functions in short intervals
  75. Green's graphs of a semigroup
  76. Some new Hermite-Hadamard type inequalities for product of strongly h-convex functions on ellipsoids and balls
  77. Infinitely many solutions for a class of Kirchhoff-type equations
  78. On an uncertainty principle for small index subgroups of finite fields
  79. On a generalization of I-regularity
  80. Spin(8, ℂ)-Higgs bundles fixed points through spectral data
  81. Coloring the vertices of a graph with mutual-visibility property
  82. Embedding of lattices and K3-covers of an enriques surface
Downloaded on 20.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/math-2025-0176/html
Scroll to top button