FOA-BDNet: A behavior detection algorithm for elevator maintenance personnel based on first-order deep network architecture

1.   Introduction

This work deals with the numerical and analytical treatment of a second-kind delay Volterra integral equation (DVIE)

where $g(T)$, ${B}_{1}(T, \tau)$, and ${B}_{2}(T, \tau)$ are smooth enough on their respective domains in terms of $J$, ${D}_{1}: = \lbrace (T, \tau):0\leq\tau\leq T\leq \mathfrak{T}\rbrace$, and ${D}_{2}: = \lbrace (T, \tau):0\leq\tau\leq qT\leq \mathfrak{T}\rbrace$, so that based on ^[2], Eq (1.1) can be solved for a unique solution $x(T)$, with respect to the variable vanishing delay of $qT$ with $0 < q < 1$. The reason for calling delay function $qT$ with vanishing delay term more clearly turns back to that, it vanishes at the beginning point of the interval $J$. Moreover, $\mathbb{X}: = {C}^{M+R}(J: = [0, \mathfrak{T}])$ is a Banach space, where $x(T)$, DVIE (1.1) solution lies as long as for the given data function $g(T)$, we have $g\in {C}^{M+R}(J: = [0, \mathfrak{T}])$, too. In more details, $M$ stands for number of used collocation parameters, and $R$ illustrates the first $R$ start solutions obtained via the classical collocation scheme in the multistep collocation strategy as well.

By virtue of Volterra integral equations and also their functional counterparts along with delay terms, whether vanishing or non-vanishing, a wide spectrum of science subjects, namely biology, ecology, physics and chemistry, have been mathematically well-formulated in order to analyse and study underlying phenomena. Particularly, these classes of mathematical modellings can be found in fluid dynamics, viscoelasticity of materials, population growth dynamics, heat conduction, epidemiology, controlled liquidation in obsolete production units, and renovation in economic systems; see ^[3,4,5,6,7] and references therein.

Taking a look at the works being furnished to solve (1.1) results in constructing fast rate convergent multistep collocation-based strategies. This issue emerges because of the fact that, for example, ^[8] illustrates a global convergence order of $M+1$ for under study equation (1.1) on uniform meshes, while when it comes to superconvergence orders, it is notable that the order is at most $2M$, most essentially with $q = 1/2$, even $M$, as well as the $M$ Gauss-Legendre collocation points. It is worth remarking that Brunner et al. ^[9] explored geometric meshes for solving (1.1), which yields to reach again a global convergence order of $M+1$ for iterated collocation methods with the superconvergence order $2M-{\epsilon}_{N}$, by regarding hypotheses of ${\epsilon}_{N}\rightarrow 0$ with $N\rightarrow \infty$.

Seemingly, the concept of exploiting non-uniform meshes makes sense to obtain higher superconvergence orders, most specifically for vanishing delay VIEs of the second type like (1.1). Pursuing this goal, Ming et al. ^[1] utilized quasi-geometric meshes in order to gain $2M$ superconvergence rates for the under consideration second-kind VIEs of pantograph type. As shown, there, quasi-geometric collocation schemes come into $M+1$ globally convergent numerical approximations, while in this study, we have reached the same or even higher superconvergence orders with a great deal of convenience and pace.

For these reasons, and by following our previous works ^[10,11,12], through this paper, we aim to develop multistep collocation techniques for second-type VIEs with vanishing delays (1.1) on uniform meshes, in order to improve global convergence rate up to $M+R$ with $R$ before obtained multistep solutions are considered as starting estimates due to the nature of multistep collocation schemes.

In this regard, the most recent article ^[7] is state-of-the-art where multistep collocation schemes have been used to solve a second-kind Fredholm integral equation, and most significantly, the strategy of employing graded meshes has been proposed to tackle weakly singular FIEs.

Studies of ^[13,14,15] are elaborate evidences for efficiency as well as effectiveness of performing multistep collocation techniques encountering FIEs ^[7], VIEs ^[13,14,15], and DVIEs^[9,10,11,12], within differential and/or integral equations together with prominent delay arguments. Since these classes of methods provide threefold benefits in terms of easy implementation, high-order convergent solutions, as well as the lowest degrees of freedom and complexity. Conte et al. ^[14] utilized a multistep collocation strategy to tackle VIEs of second-kind, which may be considered an introduction to multistep collocation methods.

The outline of this study is as follows: The foundation of Section 2 relies on the construction of multistep collocation techniques for numerically solving second-kind VIEs along with vanishing delays on uniform meshes. A comprehensive investigation of collocation-based multistep methods in terms of existence and uniqueness of multistep collocation approximations, error analysis, and more precisely convergence results has been gathered in Section 3. Section 4 presents a numerical illustration of the performance of the proposed numerical scheme. In addition, it will validate the attained analytical findings of Section 3. The final section stands for some concluding remarks that are concerned with VIEs of pantograph type.

2.   Multistep collocation strategy with relative preliminaries

In this position, we will first prove analytical solution (exact solution) existence, uniqueness, and regularity, or equivalently solvability of pantograph type second-kind VIE (1.1). Also, the same solvability discussion for the $R$-step collocation solution will be given further.

Theorem 2.1. Following regularity assumptions for under consideration vanishing delay VIE (1.1), with some $k\geq 0$ and $J: = [0, \mathfrak{T}]$,

are held. Then, for any given data function $g$ and delay parameter $q\in (0, 1)$, DVIE (1.1) has a unique solution $x\in {C}^{k}(J)$.

Proof. It completely follows from ^[2], most precisely proof of Theorem $2.3.11$. □

As we know, multistep collocation approximations for vanishing delay VIE (1.1) are given in the following manner

which lie in $S^{(-1)}_{M+R-1}(\delta_{h})$, a discontinuous piecewise polynomial space being extensively used for collocation-based approaches, which is defined like this

where ${\pi}_{\mu -1}$ stands for real polynomials having degrees not greater than $\mu -1$. In addition, $\delta_{h}$ is considered as the uniform mesh of the introduced interval $J$ and is like the following

A solution approximation (2.1) is given with the below considerations

In addition, we have assumed that $X_{m, s} = {u}({T}_{m, s})$ together with ${x}_{m-r} = {u}({T}_{m-r})$.

Furthermore, ${\mathbb{Z}}_{h}$ stands for collocation points as bellow

Subsequently, the multistep collocation equation of (1.1), is obtained for $p: = 1, \cdots, M$ and $m: = R, \ldots, N-1$ at the collocation points of ${T}_{m, p}$ as what comes

Next, putting the multistep collocation polynomial (2.1) into Eq (2.3), gets us to the following multistep collocation system for $m: = R-1, \ldots, N-1$

It is worthy to note that, according to the key monograph by Brunner ^[16], tackling with vanishing delay VIEs is a bit sophisticated in comparison to VIEs without any vanishing delay term or even to a non-vanishing one. In more details, let define $q{T}_{m, p}$ like what follows:

in which taking ${q}_{m, p}$ equal and/or less than $m$, along with ${\eta}_{m, p}\in [0, 1)$ yields to have delay term of $q{T}_{m, p}$ being located in the interval $[{T}_{{q}_{m, p}}, {T}_{{q}_{m, p}+1}]$.

Thereafter, determination of the location of the variable delay term, i.e., $q{T}_{m, p}$ in the interval of $[{T}_{{q}_{m, p}}, {T}_{{q}_{m, p}+1}]$ leads to encounter the threefold phases, which come in the subsequent.

Phase I. $q{T}_{m, 1} > {T}_{m}$, equivalently ${q}_{m, 1} = m$.

Phase II. $q{T}_{m, 1}\leqslant {T}_{m} < q{T}_{m, M}$, it means that if there is an integer, namely $ii$, such that for $0 < ii < M$, then we have ${q}_{m, ii} = m-1$, together with ${q}_{m, ii+1} = m$.

Phase III. $q{T}_{m, M}\leqslant {T}_{m}$, which indicates that for integers like ${q}_{m}$ and $ii$, such that $0 < {q}_{m} < m-1$ and $0 < ii < M$, accordingly ${q}_{m, ii} = {q}_{m}$ together with ${q}_{m, ii+1} = {q}_{m}+1$ are satisfied.

Therefore, the phase I multistep collocation equation at ${T}_{m, p}$ has the following form:

Then, with respect to the below notations, which are associated with indices of $i: = 0, \ldots, m$; $\quad p: = 1, \ldots, M$; $\quad r: = 0, \ldots, R-1$; and $\quad s: = 1, \ldots, M$,

Equation (2.5) briefly becomes

Phase II consists of two cases; more directly, for $ii < M$, we have firstly, ${q}_{m, ii} = m-1$, second ${q}_{m, ii+1} = m$. Case I includes $i\leqslant ii$ such that (2.4) takes form of below

In addition, for $p > ii$, the multistep collocation equation at ${T}_{m, p}$ is

Phase II multistep collocation equation is presented by

where

such that in both $ii$ is the number of zeros. We are now concerned with phase III. Herein, we face two cases, such that for integers in terms of ${q}_{m}$ and $ii$ with assuming $0 < {q}_{m} < m$ together with $0 < ii < M$, we then have ${q}_{m, ii} = {q}_{m}-1$ and ${q}_{m, ii+1} = {q}_{m}$. Consequently, the phase III multistep collocation equation is as follows:

which can be written

in which

are satisfied such that the number of zeros is $ii$.

Supposing

where

may lead to helpful underlying bounds, which will be used in solvability proofs. Then, we have what follows:

In the subsequent discussion, we will investigate the solvability of the system derived from the numerical technique. Hence, by means of the underlying theorem, we have demonstrated the most principle idea of compact operators in the case of second-kind vanishing delay VIEs.

Theorem 2.2. Recall $\mathbb{X}: = {C}^{M+R}([0, \mathfrak{T}])$. Let linear and continuous operators $\mathfrak{B}_{1}, \mathfrak{B}_{2}:\mathbb{X}\rightarrow S^{(-1)}_{M+R-1}(\delta _{h})$ as follows:

Then, for operator format of (1.1), more precisely the following

$\mathfrak{B}_{1}$ and $\mathfrak{B}_{2}$ stand for compact operators.

Proof. First, we transform intervals of non-delay and delay integrations, respectively $[0, T]$ and $[0, qT]$ into $[0, \mathfrak{T}]$ with the constant $\mathfrak{T}$, through a transformation like

In this way, under study equation of (1.1) may be transformed into its operator form as

Suppose

Based on ^[17], we aim to prove that $\mathbb{B}_{1}$ and $\mathbb{B}_{2}$ are equicontinuous and uniformly bounded, and then, immediately, thanks to Arzela-Ascoli Theorem, the compactness of operators $\mathfrak{B}_{1}$ and $\mathfrak{B}_{2}$ can be concluded. By assuming ${L}_{1}: = \Vert {B}_{1}\Vert _{\infty} = \sup \vert {B}_{1}(T, \tau(T, \nu))\vert$ and ${L}_{2}: = \Vert {B}_{2}\Vert _{\infty} = \sup \vert {B}_{2}(T, \tau(T, \nu))\vert$ for $T, \tau \in [0, \mathfrak{T}]$, it is straightforward to see

In a similar way,

Thereby, the uniformly boundedness property of sets $\mathbb{B}_{1}$ and $\mathbb{B}_{2}$ has been derived. When it comes to continuity, we only prove that $\mathfrak{B}_{2}$ is a continuous operator; the proof for $\mathfrak{B}_{1}$ is in the same manner. Due to the assumption that kernel ${B}_{2}$ and solution $y$ are sufficiently smooth on their domains, for all $T, \bar{T}$ from $[0, \mathfrak{T}]$

and

are satisfied. Hence, we conduct the following when $T\longrightarrow \bar{T}$.

This fulfills the proof. □

The upcoming theorem, i.e., solvability of numerical solutions, has strong ties with the compactness concept of second-kind pantograph delay VIEs operators. Subsequent theorem demonstrates solvability for numerically obtained multistep collocation solution belonging to (2.3).

Theorem 2.3. Consider ${B}_{1}(T, \tau)\in {C}^{M+R}({D}_{1})$, ${B}_{2}(T, \tau)\in {C}^{M+R}({D}_{2})$, and $g \in {C}^{M+R}(J)$ for vanishing DVIE (1.1). Then, multistep collocation equation (2.3) is uniquely solvable for a unique numerical solution ${u}\in S^{(-1)}_{M+R-1}(\delta _{h})$, which has been provided by relation (2.1) in a general subinterval ${\sigma}_{m}: = ({T}_{m}, {T}_{m+1}]$ of the uniform $\delta _{h}$ mesh, such that for a given $\mathfrak{h} > 0$ we have

where $\beta$ is defined in (2.13) and $M$ is the number of collocation parameters.

Proof. Overall, we aim to show that coefficient matrices in phases I, II, and III, respectively, in terms of

with $0\leq m\leq N-1$ are invertible. For this sake, take into account the obtained multistep collocation equations in three phases, mainly (2.6), (2.9), and (2.11). Recalling achieved bounds of (2.12) and (2.14), there is a well-defined

such that in a generic subinterval ${\sigma}_{m}: = ({T}_{m}, {T}_{m+1}]$ of $\delta_{h}$ with $0 < h < \mathfrak{h}$ for $0\leq m\leq N-1$, we have the followings

Thereafter, thanks to the Neumann theorem, we can display the desired assertion as follows:

which asserts that multistep collocation equation (2.3) is uniquely solvable in all three phases for obtaining a unique approximation of (2.1). □

In this position, we are interested in concerns with convergence analysis. In view of the operator form of the under study second-kind pantograph DVIE (1.1), specifically

with respect to compact operators $\mathfrak{B}_{1}$ and $\mathfrak{B}_{2}$ introduced in Theorem 2.2, the following properties equip us to establish the convergence theorem in the sequel. In order to be convenient, we name $\mathfrak{B}_{1}+\mathfrak{B}_{2}$ with $\mathscr{B}$, which is a compact operator, as Theorem 2.2 shows. The idea of using a projection interpolation operator for attaining convergence is an immediate outcome of compactness. Regarding this, projection interpolation operator like $\mathscr{P}$ is defined in the following for an arbitrary function of $x$,

Afterwards, in order to obtain operator form of error equation, influence equation (1.1), and multistep collocation equation (2.3) by projection operator of $\mathscr{P}$ as follows

The operator error equation is obtained straightforwardly in the following way:

in which we have assumed $\mathcal{K}: = \mathscr{P}\mathscr{B}(\mathcal{I}-\mathscr{P})x$. Additionally, for the sake of simplicity, take $\mathscr{W}: = \mathscr{P}\mathscr{B}$. From (2.22), it can easily be seen that

Lemma 2.1. By supposing ${B}_{1}\in {C}^{M+R}({D}_{1})$, ${B}_{2}\in {C}^{M+R}({D}_{2})$, and $g \in{C}^{M+R}(J)$, then the following key results of

are held.

Proof. On the one hand $\mathscr{W}: = \mathscr{P}\mathscr{B}$, on the other hand, according to Theorem 2.2, $\mathscr{B} \in \mathcal{L}(S^{(-1)}_{M+R-1}(\delta_{h}))$ is a compact operator, thus it can be immediately concluded that $\mathscr{W}$ is uniformly convergent to $\mathscr{B}$, hence (2.24) is asserted. Again, due to the compactness of $\mathscr{B}$, based on Theorem $2.6$ in the study ^[18], $(\mathcal{I}-\mathscr{B})$ is an invertible operator; however, its inverse is bounded. Most specifically,

Regarding well-established (2.24) and (2.26) yields to

(2.27) results in boundedness of operator $\mathscr{W}$, thereby, thanks to the Neumann Theorem, $(\mathcal{I}-\mathscr{W})$ is invertible and bounded simultaneously. In order to attain a bound of $\Vert {(\mathcal{I}-\mathscr{W})}^{-1}\Vert_{\infty}$ we pursue what follows. Operator multistep collocation equation of (2.21) can be written for suitably assumed $\psi \in S^{(-1)}_{M+R-1}(\delta_{h})$ such that

in which most importantly, $\Vert \psi\Vert_{\infty} = 1$ has been taken. First, subtracting $\mathscr{B}{u}$ from (2.28), then multiplying by ${(\mathcal{I}-\mathscr{B})}^{-1}$ derives the following relation:

Taking norm of (2.29), with respect to (2.27) yields

This ends the proof with obtaining the desired result of $\Vert {(\mathcal{I}-\mathscr{W})}^{-1}\Vert_{\infty} = \Vert {u}\Vert _{\infty} < \infty$. □

3.   Convergence analysis

We will just exploit the spectral radius concept of the matrix based on collocation parameters in the difference equation arising from the method's error in concluding convergence results. We now give the convergence analysis in a theorem frame.

Theorem 3.1. In pantograph DVIE (1.1), we have supposed that $g\in {C}^{M+R}(J)$, ${B}_{1}\in {C}^{M+R}({D}_{1})$, and ${B}_{2}\in {C}^{M+R}({D}_{2})$. For $\varepsilon: = x-u$ and $P: = M+R$, suppose that there is a start error of $\Vert \varepsilon\Vert_{\infty}: = \underset{t\in[0, {t}_{r-1}]}{\sup}\mid \varepsilon(t)\mid = \mathcal{O}(h^{P})$. Also, with $\rho$, which denotes the spectral radius of the matrix $\mathbf{S}$, $\rho(\mathbf{S}) < 1$ is satisfied. It should be noted that $\mathbf{S}$ will be defined further in the proof stream. Then, the uniquely attained multistep collocation solution ${u}$ uniformly converges to the exact solution $x$, holding the convergence order of $M+R$

Proof. For the exact solution $x$ with any $\tau \in [0, 1]$, the following representation is satisfied by considering the Peano's theorem on the representation of interpolation error given in the Corollary $1.8.2$ of ^[16].

where the bases $\psi _{r}(\tau)$ and $\rho _{p}(\tau)$ have been previously defined. Also, the remainder function is given as below

in which

Similarly, we have the error representation for $\tau \in [0, 1]$ as follows:

such that $\varepsilon _{m-r}: = x(t_{m-r})-{u}(t_{m-r})$, and $\varepsilon _{m, p}: = x(t_{m, p})-{u}(t_{m, p})$, are held. Recalling the multistep collocation system of (2.4) and considering the fact that the errors satisfy in (2.4), we reach to

Subsequently, by taking advantage of (3.2) and assuming that in phase I we have ${q}_{m, p} = m$, it is straightforward to get to the following, which are indeed the second rows of our error matrices.

Now, it requires to assume what follows

Additionally, by means of Taylor's expansion, it is straightforward to define the following:

where

In order to achieve error matrices, we use the idea in the article ^[19]. To do so, assume $\tau = 1$ in (3.2), which leads to

such that ${\tilde{R}}_{M, R, m-1} =$ $\begin{bmatrix} & {\mathbf{0}}_{R-1, 1} & \\ & {\tilde{R}}_{M, R, m-1}(1) & \end{bmatrix}$.

Therefore, we have a phase I error system as follows:

where $\mathbf{{B}_{1}}$ and $\mathbf{{B}_{2}}$ can be readily derived and

Then, after some manipulation, we obtain into

in which one can derive $\mathcal{\bar{H}}$ and $\mathcal{\hat{H}}$ easily and the matrix of $\mathbf{S}$ is in the following manner

Thereafter, by means of the Gronwall Lemma together with the assumption of $\rho (\mathbf{S}) < 1$, we can conclude that

Now, by taking into account (3.1), it is straightforward to see

where $C$ is a general constant along with

and

with $\tau \in [0, 1]$. Pursuing a similar process, one can deduce convergence analysis in both phase II and phase III. This is the end of the proof. □

4.   Numerical implementation

In this present section, we concentrate on numerically testing and also verifying the previously attained convergence results of Theorem 3.1. What is more, we try various $2$-point and $3$-point multistep collocation techniques with $R = 3$ on uniform meshes in order to illustrate optimum ${L}_{\infty}$-norm convergence orders. It should be pointed out that $2$ and $3$ illustrate the number of collocation parameters.

When it comes to comparing with ^[1], where the same second-type vanishing delay VIE has been analysed and solved, the significant distinct advantages of our proposed technique are twofold. First, the advantage of our method is that it achieves the same error results with significantly fewer spatial grid points specifically, $N = 256$ compared to the $N = 1600$ grid points used in ^[1]. As we know, $N$ is a commonly used notation for displaying the number of interval divisions. Second, from simplicity and efficiency point of view, in our work a fast rate multistep strategy is implemented on uniform meshes with ease.

Locally achieved absolute multistep collocation errors for ${\sigma}_{m}: = ({T}_{m}, {T}_{m+1}]$ with $m: = 1, \ldots, N-1$ in a defined uniform ${\delta}_{h}$ mesh are as follows:

Besides, rates of convergence are like the follows:

Section $2$ of this paper, confirms that the system is solvable for all $q$ values in $(0, 1)$. In addition to that, both one-step ^[16] and $R$-step collocation estimate errors together with convergence rates, CPU time based on different delay parameters such as $q = 0.2, 0.5, 0.9$, and various collocation points have been reported in the upcoming two test problems. We have demonstrated that both solvability and convergence of the system are achieved for all values of $q$ in the interval $(0, 1)$. We have chosen a variety of $q$ parameters. It has been compared with the one-step collocation method with the multistep collocation one. The results in both cases have been gathered and shown.

As it can be seen through all tables, with nearly the same computational cost, the multistep collocation method achieves lower errors compared to the one-step collocation method.

For the sake of comparing our results with the ones given in ^[1], we have provided a selection of the numerical example from ^[1].

Example 1. ^[1] In the current test problem, one-step and multistep collocation-based techniques have been applied for the sake of solving the following pantograph DVIE:

with considering the exact solution of $x(T) = \exp(-T)$, and

As noted, the convergence of one-step methods relies solely on the collocation parameters ${c}_{i}$. In contrast, multistep collocation methods depend not only on these parameters but also on the spectral radius of the coefficient matrix of the difference equation, denoted as $\mathbf{S}$.

The proposed method relies on the parameters ${c}_{i}$, requiring that $\rho(\mathbf{S}) < 1$ for convergence to occur. It is important to note that article ^[1] reports the highest accuracy at the Gauss points; however, since the condition $\rho(\mathbf{S}) < 1$ is not satisfied at these points, our proposed numerical method does not converge there.

For the sake of comparing with ^[1], we have employed the collocation parameters of ${c}_{1} = 7/10$ and ${c}_{2} = 1$, with $M = 2$, $R = 3$, and $q = 0.2, 0.5$. Then we have reached the accuracy of ${10}^{-11}$ at $N = 256$ grid points, while at ^[1], it reaches the accuracy of ${10}^{-11}$ for $N = 1600$ grid points.

In the reference ^[1], the authors have exploited the quasi-geometric meshes, which are dependent on delay parameter $q$. As a result, for $q = 0.9$, they have attained different solutions than the case, $q = 0.2$ and $q = 0.5$. However, here the uniform meshes have been utilized, so we obtain the same results for all values of the parameter $q$.

For the second test problem, we first take a monotone increasing function of $x(T) = \sqrt{2+T}$, which is totally different from an exponential function, as an exact solution, and then we have reported the results just for the delay parameter of $q = 0.2$ but for two selections of collocation parameters.

Example 2. Herein, we have considered what follows.

For which, we have carried out both classical and multistep collocation schemes by taking ${g}_{2}(T)$ such that we have $x(T) = \sqrt{2+T}$.

It is worthwhile to note that in the second test problem the integral interval is $J: = [0, 1]$, which differs from the one in the first example.

All presented results in Tables 1-5 are strongly in agreement with the foregoing Theorem 3.1.

5.   Conclusions

In this article, we employed a robust high-rate multistep collocation strategy in order to tackle second-kind vanishing delay VIEs. Both numerical and theoretical solution solvability have been proved detailedly. Moreover, a theorem associated with multistep collocation solution error analysis has been presented. In the last section, for the sake of confirming theoretically achieved consequences, two numerical examples were given, which have been investigated for a variety of delay parameters of $q = 0.2, 0.5, 0.9$ on uniform meshes perfectly. Furthermore, it is of great importance to remark that based on our study, high convergence rates for second-kind pantograph delay VIEs (1.1) can be attained for all various delay parameters of $q$ in $(0, 1)$.

Author contributions

Shireen Obaid Khaleel: Writing original draft, Visualization, Formal analysis; Parviz Darania: Writing original draft, Validation, Writing review & editing; Saeed Pishbin: Software, Validation, Writing review & editing; Shadi Malek Bagomghaleh: Writing original draft, Visualization, Formal analysis. All authors discussed the results and revised the draft. All authors have read and approved the final version of the manuscript for publication.

Acknowledgments

The authors gratefully acknowledge the anonymous referees for their careful reading of the manuscript and constructive comments.

Conflict of interest

All authors declare that they have no conflicts of interest.