Transforming Controlled Duffing Oscillator to Optimization Schemes Using New Symmetry-Shifted $\mathit{G}\mathbf{\left(}\mathit{t}\mathbf{\right)}\mathbf{-}$Polynomials

Abstract

This work introduces and studies the important properties of a special class of new symmetry-shifted $G\left(t\right)-$olynomials (NSSG). Such polynomials have a symmetry property over the interval [−2, 0], with $G_n^{\left[-2,0\right]}\left(0\right)=$${{\left(-1\right)}^{n}G}_n^{\left[-2,0\right]}(-2)$. An explicit formulation of an NSSG operational matrixwas constructed, which served as a powerful tool for obtaining the desired numerical solutions. Then, a modified direct computational algorithm was suggested for solving the controlled Duffing oscillator problem. The idea behind the proposed algorithm is based on using symmetry basis functions, which are important and have real-world applications in physics and engineering. The original controlled Duffing oscillator problem was transformed into a nonlinear quadratic programming problem. Finally, numerical experiments are presented to validate our theoretical results. The numerical results emphasize that the modified proposed approach reaches the desired value of the performance index, with a few computations and with the minimum order of the NSSG basis function when compared with the other existing method, which is an important factor to consider when choosing the appropriate method in other mathematical and engineering applications.

1. Introduction

Optimal control is a mathematically challenging and practically significant goal. They have been many successful practical applications in a wide range of disciplines, including engineering [1,2,3,4], physics [5,6] and fluid dynamics [7]. Recently, the controlled Duffing oscillator problem, which is known to describe many important oscillating phenomena in nonlinear engineering systems, has received considerable attention. The classical Duffing equation was introduced to study electronics [8], signal processing [9], fuzzy modeling and the adaptive control of uncertain chaotic systems [10,11]. Since most controlled Duffing oscillator problems cannot be solved explicitly, it is often necessary to resort to numerical techniques, which consist of appropriate combinations of numbers numerical and optimization techniques.

The study of numerical methods has provided an attractive field for researchers of the mathematical sciences. This field of study has seen the appearance of different numerical computational methods and efficient algorithms to solve the controlled Duffing oscillator problem, with each one having disadvantages and advantages. For example, a direct method in [12] was presented to treat the controlled Duffing oscillator numerically. This method requires that both the state control variables, the constraint dynamic system, the boundary conditions and the cost function value be expanded in a Chebyshev series with unknown coefficients. The unknowns that evolve from the Chebyshev series expansion of the cost function value have to be determined at each iteration step. As a result, a large complicated nonlinear system of equations must be solved to obtain an accuracy with a suitable order. A cell-averaging Chebyshev spectral method was presented in [13], and it is based on constructing an interpolation polynomial of the degree n using Chebyshev nodes to approximate both the state and control vectors. The integral and differential expressions that arise from the system dynamics and the cost function are transformed into a nonlinear programming problem, while the work presented in [14] contained a pseudospectral approximate numerical solution for Duffing oscillators that use a differential matrix for Chebyshev points in order to compare the boundary conditions over the interval [–1, 1]. The properties of hybrid functions [15], which consist of block-pulse functions plus Legendre polynomials, are studied in [16] for the numerical treatment of Duffing oscillators. The operation matrix of an integration matrix together with hybrid functions have been utilized to reduce the solution of a controlled Duffing oscillator to a solution of algebraic equations. Other numerical treatments for solving Duffing oscillators are as follows: the interpolating scaling functions method [17], the state parameterization based on a linear combination of Chebyshev polynomials [18] and the Chebyshev spectral method [19] together with control variables and state variables.

The base function mentioned may be polynomials or wavelets. Some examples of these wavelets and polynomials include the following: wavelet neural networks [20], shifted wavelets [21], Boubaker wavelets [22], Boubaker polynomials [23], power polynomials [24] and radial basis functions [25,26].

In this paper, we propose new symmetry-shifted $G\left(t\right)-$polynomials (NSSP) as a base function. These novel polynomials are used to solve the controlled Duffing oscillator problem using a direct state parameterization technique. The idea of this method consists of reducing the controlled Duffing oscillator problem to an optimization problem by expanding the second derivative of the state vector as an NSSP that has unknown coefficients with the aid of an operation matrix of derivatives. The operational matrix of the product is introduced, and this matrix together with the operational matrix of derivatives are then used to transfer the original problem to an optimization one.

The paper is organized as follows: In Section 2, the definition of the new symmetry-shifted $G\left(t\right)-$polynomial over the interval [a, b] is presented with some important properties. The NSSP main properties are adopted in Section 3. The controlled Duffing oscillator problem is presented in Section 4, while the proposed algorithm for solving such problem is illustrated in Section 5, where it is converted to a quadratic programming problem. In Section 6, approximated findings and a comparison are made with an existing method in the literature to demonstrate the efficiency and the accuracy of the proposed numerical scheme.

2. New Symmetry-Shifted $\mathit{G}\left(\mathit{t}\right)\mathbf{-}$Polynomial Over $[\mathit{a},\mathit{b}]$

The definition of the new symmetry-shifted $G\left(t\right)-$polynomial over $[a, b]$ denoted by $G_n^{\left[a,b\right]}(t)$ is stated below.

Definition 1. 

Let $G\left(t\right)$ be a linear polynomial $G\left(t\right)=pt+q$. The symmetry-shifted $G\left(t\right)-$polynomial over the interval $[a, b]$ is defined by the recurrence relation

$$G_n^{\left[a,b\right]}\left(t\right)=G\left(t\right)G_{n-1}^{\left[a,b\right]}\left(t\right)-G_{n-2}^{\left[a,b\right]}\left(t\right), n\ge 2,$$

(1)

with the initial conditions

$$G_0^{\left[a,b\right]}\left(t\right)=2, G_1^{\left[a,b\right]}\left(t\right)=G\left(t\right).$$

(2)

It is mentioned here that, from the $G_n^{\left[a,b\right]}(t)$ for special values of $a$$, b, p and q$, one can obtain some of the well-known polynomials. Certain cases of these values are reported in

Table 1. Some special cases of $G\left(t\right)$.

$\mathit{a}$	$\mathit{b}$	$\mathit{p}$	$\mathit{q}$	$\mathit{G}\left(\mathit{t}\right)$
0	1	4	−2	$4t-2$
−1	1	2	0	$2t$
0	2	2	−2	$2t-2$
−2	2	1	0	$t$
−2	0	2	2	$2t+2$
$a$	$b$	${\displaystyle \frac{4}{b-a}}$	${\displaystyle \frac{-(2a+b)}{b-a}}$	${\displaystyle \frac{2\left(2t-a-b\right)}{b-a}}$

.

Note that the NSSG polynomials with the values $a=-1, b=1, p=2,q=0$ and $G\left(t\right)=2t$ will lead to the well-known Pell–Lucas polynomials [27,28].

$$G_n^{\left[-1,1\right]}\left(t\right)=2t{G}_{n-1}^{\left[-1,1\right]}\left(t\right)-G_{n-2}^{\left[-1,1\right]}\left(t\right),n\ge 2,$$

with the initial conditions

$$G_0^{\left[-1,1\right]}\left(t\right)=2, G_1^{\left[-1,1\right]}(t)=2t.$$

The first of several $G_n^{\left[a,b\right]}(t)$ are listed below

$$\begin{array}{l}{\mathit{G}}_{\mathbf{0}}^{\left[\mathit{a}\mathbf{,}\mathit{b}\right]}(\mathit{t})\mathbf{=}\mathbf{2}\mathbf{,} {\mathit{G}}_{\mathbf{1}}^{\left[\mathit{a}\mathbf{,}\mathit{b}\right]}(\mathit{t})\mathbf{=}\frac{\mathbf{2}\left(\mathbf{2}\mathit{t}\mathbf{-}\mathit{a}\mathbf{-}\mathit{b}\right)}{\mathit{b}\mathbf{-}\mathit{a}}\mathbf{,} {\mathit{G}}_{\mathbf{2}}^{\left[\mathit{a}\mathbf{,}\mathit{b}\right]}(\mathit{t})\mathbf{=}{(\frac{\mathbf{2}\left(\mathbf{2}\mathit{t}\mathbf{-}\mathit{a}\mathbf{-}\mathit{b}\right)}{\mathit{b}\mathbf{-}\mathit{a}})}^{\mathbf{2}}\mathbf{-}\mathbf{2}\mathbf{,}\hfill \\ {\mathit{G}}_{\mathbf{3}}^{\left[\mathit{a}\mathbf{,}\mathit{b}\right]}(\mathit{t})\mathbf{=}{(\frac{\mathbf{2}\left(\mathbf{2}\mathit{t}\mathbf{-}\mathit{a}\mathbf{-}\mathit{b}\right)}{\mathit{b}\mathbf{-}\mathit{a}})}^{\mathbf{3}}\mathbf{-}\frac{\mathbf{6}\left(\mathbf{2}\mathit{t}\mathbf{-}\mathit{a}\mathbf{-}\mathit{b}\right)}{\mathit{b}\mathbf{-}\mathit{a}}\mathbf{,} {\mathit{G}}_{\mathbf{4}}^{\left[\mathit{a}\mathbf{,}\mathit{b}\right]}(\mathit{t})\mathbf{=}{({\displaystyle \frac{\mathbf{2}\left(\mathbf{2}\mathit{t}\mathbf{-}\mathit{a}\mathbf{-}\mathit{b}\right)}{\mathit{b}\mathbf{-}\mathit{a}}})}^{\mathbf{4}}\mathbf{-}{\mathbf{4}({\displaystyle \frac{\mathbf{2}\left(\mathbf{2}\mathit{t}\mathbf{-}\mathit{a}\mathbf{-}\mathit{b}\right)}{\mathit{b}\mathbf{-}\mathit{a}}})}^{\mathbf{2}}\mathbf{+}\mathbf{2}\mathbf{,}\hfill \\ {\mathit{G}}_{\mathbf{5}}^{\left[\mathit{a}\mathbf{,}\mathit{b}\right]}(\mathit{t})={(\frac{\mathbf{2}\left(\mathbf{2}\mathit{t}\mathbf{-}\mathit{a}\mathbf{-}\mathit{b}\right)}{\mathit{b}\mathbf{-}\mathit{a}})}^{\mathbf{5}}\mathbf{-}{\mathbf{5}(\frac{\mathbf{2}\left(\mathbf{2}\mathit{t}\mathbf{-}\mathit{a}\mathbf{-}\mathit{b}\right)}{\mathit{b}\mathbf{-}\mathit{a}})}^{\mathbf{3}}\mathbf{+}\frac{\mathbf{10}\left(\mathbf{2}\mathit{t}\mathbf{-}\mathit{a}\mathbf{-}\mathit{b}\right)}{\mathit{b}\mathbf{-}\mathit{a}}\mathbf{.}\hfill \end{array}$$

The leading coefficient of $G_n^{\left[a,b\right]}(t)$ is equal to ${\displaystyle \frac{2^{n+1}}{b-a}}$ for $n=1,2,3,4,\dots$ as we can notice from the recursive formula shown above.

Moreover, the explicit analytical formula for $G_n^{\left[a,b\right]}(t)$ can be obtained through the following expression:

$$G_n^{\left[a,b\right]}(t)=n\sum _{i=0}^{⌊{\displaystyle \frac{n}{2}}⌋}{\displaystyle \frac{1}{\mathrm{j}-\mathrm{i}}}{\left(\begin{array}{c}j-i\\ i\end{array}\right)(G\left(t\right))}^{n-2i},n=1,2,3,...$$

The polynomials $G_n^{\left[a,b\right]}(t)$ have orthogonal properties with respect to the following inner product:

$$\langle G_n^{\left[a,b\right]}(t),G_m^{\left[a,b\right]}(t)\rangle ={\int }_a^b(G_n^{\left[a,b\right]}(t)G_m^{\left[a,b\right]}(t)\omega \left(t\right))dt,$$

(3)

where $\omega \left(t\right)$ is the weight function.

Note that the general matrix form of $G_n^{\left[a,b\right]}(t)$ can be written as below:

$$G^{\left[a, b\right]}(t)=H{T\left(t\right)}^T,$$

(4)

where $G^{\left[a,b\right]}(t)={[G_0^{\left[a,b\right]}\left(t\right)G_1^{\left[a,b\right]}\left(t\right)G_2^{\left[a,b\right]}\left(t\right)\cdots G_n^{\left[a,b\right]}\left(t\right)]}^T$, $T\left(t\right)=\left[\begin{array}{ccccc}1& t& t^2& \cdots & t^n\end{array}\right]$ and $H$ is the triangle matrix in which entries $h_{ij}$ can be evaluated as below:

$$h_{ij}=\left\{\begin{array}{cc} \frac{4}{b-a},& \mathrm{f}\mathrm{o}\mathrm{r} j=0,\\ {\displaystyle \frac{4}{b-a}}\left(h_{i-1,j-1}+h_{i-1,j}-{\frac{1}{2}h}_{i-2,j}\right),& \mathrm{f}\mathrm{o}\mathrm{r} i\ge j,\\ 0,& \mathrm{o}\mathrm{t}\mathrm{h}\mathrm{e}\mathrm{r}\mathrm{w}\mathrm{i}\mathrm{s}\mathrm{e}.\end{array}\right.$$

(5)

3. The Properties of NSSG Polynomials

3.1. The Convergence Analysis

Theorem 1. 

A function $u\left(t\right)$ that is continuous on $[a, b]$ and satisfies the condition $\left|u\left(t\right)\right|<M$, where $M$ is a constant and may be defined by

$$u\left(t\right)={\sum }_{k=0}^{\infty }{a}_k{G}_n^{\left[a,b\right]}\left(t\right),$$

(6)

where

$$a_k={\int }_a^{b}u\left(t\right)G_n^{\left[a,b\right]}\left(t\right)dt$$

(7)

and

$$u_n\left(t\right)={\sum }_{k=0}^n{a}_k{G}_n^{\left[a,b\right]}(t)$$

(8)

will converge to function $u\left(t\right).$

Proof. 

Let $u_n\left(t\right)={\sum }_{k=0}^n{a}_k{G}_n^{\left[a,b\right]}(t)$, where $a_k={\int }_a^{b}u\left(t\right)G_n^{\left[a,b\right]}(t)dt$, then

$${\int }_a^{b}u\left(t\right)u_n\left(t\right)dt={\int }_a^b\left[u(t){\sum }_{k=0}^n{a}_k{G}_n^{\left[a,b\right]}(t)\right]dt,$$

(9)

where $u\left(x\right)$ is defined in Equation (6). From Equation (7), one can obtain

$${\int }_a^{b}u\left(t\right)u_n\left(t\right)dt={\sum }_{k=0}^n{a}_k{\int }_a^{b}u(t)G_n^{\left[a,b\right]}(t)dt={\sum }_{k=0}^n{\left|a_k\right|}^2.$$

This means that function $u_n\left(t\right)$ is a convergence (since it is a Cauchy sequence in the complete Hilbert space $L^2[a,b]$).

In order to prove that the series in Equation (6) converges to $u\left(t\right)$,

Let

$$u_m\left(t\right)={\sum }_{k=0}^m{a}_k{G}_n^{\left[a,b\right]}(t) \mathrm{for} m<n.$$

(10)

Hence,

$${ u}_n\left(t\right)-u_m\left(t\right)={\sum }_{k=0}^n{a}_k{G}_n^{\left[a,b\right]}(t)-{\sum }_{k=0}^m{a}_k{G}_n^{\left[a,b\right]}(t), n>m.$$

(11)

Equation (10) leads to $u_n\left(t\right)-u_m\left(t\right)={\sum }_{i=m+1}^n{a}_k{G}_n^{\left[a,b\right]}(t)$, $n>m.$

As a result

$${‖u_n\left(t\right)-u_m\left(t\right)‖}^2={\sum }_{k=m+1}^n{\left|a_k\right|}^2, n>m.$$

(12)

This shows that ${\sum }_{k=0}^{\infty }{\left|a_k\right|}^2$ is convergent.

From Equation (12), one can conclude that ${‖u_n\left(t\right)-u_m\left(t\right)‖}^2\to 0$ as $n,m\to \infty$ and $u_n\left(t\right)\to u\left(t\right)$, which is the required result. □

3.2. The Operation NSSG Matrix of Products

The product of two NSSGs can be expressed in the following theorem.

Theorem 2. 

The product of two NSSG polynomials satisfies the following relationship

$$G_m^{\left[a,b\right]}(t)G_n^{\left[a,b\right]}(t)=G_{m+n}^{\left[a,b\right]}(t)+G_{⌈m-n⌉}^{\left[a,b\right]}(t).$$

(13)

Proof. 

This theorem is proved by mathematical induction. Note that $G_0^{\left[a,b\right]}(t)=2$; thus, it follows that

$$G_0^{\left[a,b\right]}(t)G_n^{\left[a,b\right]}(t)={2G}_n^{\left[a,b\right]}(t).$$

(14)

Therefore, Theorem 2 is valid when $=0$. Let Equation (13) be valid for all integers $m-1$, that is,

$$G_{m-1}^{\left[a,b\right]}\left(t\right)G_n^{\left[a,b\right]}\left(t\right)=G_{m+n-1}^{\left[a,b\right]}\left(t\right)+G_{⌈m-n-1⌉}^{\left[a,b\right]}\left(t\right).$$

(15)

Multiplying both sides of Equation (15) by $\frac{2\left(2t-a-b\right)}{b-a}$ yields

$$\frac{2\left(2t-a-b\right)}{b-a}{G}_{m-1}^{\left[a,b\right]}\left(t\right)G_n^{\left[a,b\right]}\left(t\right)=\frac{2\left(2t-a-b\right)}{b-a}{G}_{m+n-1}^{\left[a,b\right]}\left(t\right)+\frac{2\left(2t-a-b\right)}{b-a}{G}_{⌈m-n-1⌉}^{\left[a,b\right]}\left(t\right).$$

(16)

Then, from Equation (15) and with the use of Equation (1) one can obtain

$$\left(G_m^{\left[a,b\right]}\left(t\right)+G_{m-2}^{\left[a,b\right]}\left(t\right)\right)G_n^{\left[a,b\right]}\left(t\right)=G_{m+n}^{\left[a,b\right]}\left(t\right)+G_{m+n-2}^{\left[a,b\right]}\left(t\right)+\left(G_{⌈m-n⌉}^{\left[a,b\right]}\left(t\right)+G_{⌈m-n-2⌉}^{\left[a,b\right]}\left(t\right)\right)$$

and

$$G_m^{\left[a,b\right]}\left(t\right)G_n^{\left[a,b\right]}\left(t\right)=G_{m+n}^{\left[a,b\right]}\left(t\right)+G_{m+n-2}^{\left[a,b\right]}\left(t\right)+G_{⌈m-n⌉}^{\left[a,b\right]}\left(t\right)+G_{⌈m-n-2⌉}^{\left[a,b\right]}\left(t\right)$$

$$-G_{m-2}^{\left[a,b\right]}\left(t\right)G_n^{\left[a,b\right]}\left(t\right).$$

(17)

Using Equation (15), yields

$$\begin{gathered} G_m^{\left[a,b\right]}\left(t\right)G_n^{\left[a,b\right]}\left(t\right)=G_{m+n}^{\left[a,b\right]}\left(t\right)+G_{m+n-2}^{\left[a,b\right]}\left(t\right)+G_{⌈m-n⌉}^{\left[a,b\right]}\left(t\right)+G_{⌈m-n-2⌉}^{\left[a,b\right]}\left(t\right) \\ -G_{m+n-2}^{\left[a,b\right]}\left(t\right)-G_{⌈m-n-2⌉}^{\left[a,b\right]}\left(t\right), \end{gathered}$$

i.e., $G_m^{\left[a,b\right]}\left(t\right)G_n^{\left[a,b\right]}\left(t\right)=G_{m+n}^{\left[a,b\right]}\left(t\right)+G_{⌈m-n⌉}^{\left[a,b\right]}\left(t\right).$ This is the required result. □

3.3. The Operation NSSG Matrix of Derivatives

In this part, the first derivative ${\dot{G}}_n^{\left[a,b\right]}(t)$ is determined in terms of itself. Based on that, the first derivative operational matrix of NSSG will be constructed.

Theorem 3. 

For $n\ge 1$, the following relation can be employed to relate the original NSSG with their first derivative

$${\dot{G}}_n^{\left[a,b\right]}(t)={\displaystyle \frac{4n}{b-a}}{\sum }_{i=1}^{n-2}{G}_{n-2i+1}^{\left[a,b\right]}\left(\mathrm{t}\right)+{\displaystyle \frac{2n}{b-a}}{\delta }^{\left[a,b\right]},$$

(18)

where

$${\delta }^{\left[a,b\right]}=\left\{\begin{array}{cc}{G}_0^{\left[a,b\right]},& \mathrm{i}\mathrm{f} n \mathrm{o}\mathrm{d}\mathrm{d},\\ 0,& \mathrm{i}\mathrm{f} n \mathrm{e}\mathrm{v}\mathrm{e}\mathrm{n}.\end{array}\right.$$

(19)

Proof. 

Consider the odd case, where the induction is proceeded on $n$. For $n=1$, the left-hand side is equal to ${\displaystyle \frac{2}{b-a}}{G}_0^{\left[a,b\right]}$. Assume that the relation in Equation (18) holds for $n-1$, and $n$ odd.

The validity for $n$ will be proved.

If one differentiates Equation (1), the following is obtained:

$${\dot{G}}_n^{\left[a,b\right]}(t)=G(t){\dot{G}}_{n-1}^{\left[a,b\right]}(t)+\dot{G}(t)G_{n-1}^{\left[a,b\right]}(t)-{\dot{G}}_{n-2}^{\left[a,b\right]}(t),$$

(20)

where $G\left(t\right)=G_1^{\left[a,b\right]}(t)=\frac{2\left(2t-a-b\right)}{b-a}$ and $\dot{G}\left(t\right)={\displaystyle \frac{4}{b-a}}.$

Appling the principle of induction on $G_{n-1}^{\left[a,b\right]}(t)$ and $G_{n-2}^{\left[a,b\right]}\left(t\right),$ gives

$$\begin{gathered} {\dot{G}}_n^{\left[a,b\right]}(t)=G(t)\frac{4}{b-a}\left((n-1){\sum }_{i=1}^{n-3}{G}_{n-2i}^{\left[a,b\right]}(t)\right)+{\displaystyle \frac{2(n-1)}{b-a}}{G(t)G}_0^{\left[a,b\right]}(t)+\frac{4}{b-a}{G}_{n-1}^{\left[a,b\right]}(t) \\ -\frac{4}{b-a}\left(\left(n-2\right){\sum }_{i=1}^{n-4}{G}_{n-2i+1}^{\left[a,b\right]}\left(t\right)\right)+{\displaystyle \frac{2(n-2)}{b-a}}{G}_0^{\left[a,b\right]}. \end{gathered}$$

This will lead to

$$\begin{gathered} {\dot{G}}_n^{\left[a,b\right]}(t)=\frac{4}{b-a}\left((n-1){\sum }_{i=1}^{n-3}{G(t)G}_{n-2i}^{\left[a,b\right]}(t)\right)+{\displaystyle \frac{2(n-1)}{b-a}}{G_1^{\left[a,b\right]}(t)G}_0^{\left[a,b\right]}(t)+\frac{4}{b-a}{G}_{n-1}^{\left[a,b\right]}(t) \\ -\frac{4}{b-a}\left(\left(n-2\right){\sum }_{i=1}^{n-4}{G}_{n-2i+1}^{\left[a,b\right]}\left(t\right)\right)+\frac{2(n-2)}{b-a}{G}_0^{\left[a,b\right]}. \end{gathered}$$

Now, using the identity below

$$G\left(t\right)G_{n-1}^{\left[a,b\right]}\left(t\right)=G_n^{\left[a,b\right]}\left(t\right)+G_{n-2}^{\left[a,b\right]}\left(t\right),$$

(21)

as well as Equation (13) in Theorem 2,one can enable obtaining the following result:

$$\begin{gathered} {\dot{G}}_n^{\left[a,b\right]}\left(t\right)=\frac{4}{b-a}\left[\begin{array}{c}{\sum }_{i=1}^{n-3}\left(n-1\right)\left(G_{n-2i+1}^{\left[a,b\right]}\left(t\right)+G_{n-2i-1}^{\left[a,b\right]}\left(t\right)\right)\end{array}\right]+\frac{4(n-1)}{b-a}{G}_1^{\left[a,b\right]}(t) \\ +\frac{4}{b-a}{G}_{n-1}^{\left[a,b\right]}(t)-\frac{4}{b-a}\left(\left(n-2\right){\sum }_{i=1}^{n-4}{G}_{n-2i+1}^{\left[a,b\right]}\left(t\right)\right)+\frac{2(n-2)}{b-a}{G}_0^{\left[a,b\right]}. \end{gathered}$$

(22)

After performing some manipulation, Equation (22) can be written as below:

$${\dot{G}}_n^{\left[a,b\right]}(t)= \frac{4n}{b-a}{\sum }_{i=1}^{n-2}{G}_{n-2i+1}^{\left[a,b\right]}(t)+{\displaystyle \frac{2n}{b-a}}{G}_0^{\left[a,b\right]}(t).$$

This is equivalent to the result in Equation (18). In a similar way, one can prove the case for an even order.

On the other hand, the derivative of $G_n^{\left[a,b\right]}$ can be written in matrix form as illustrated in the following result: □

Corollary 1. 

Let $\varnothing \left(t\right)$ be the NSSG polynomial vector defined as below

$$\varnothing \left(t\right)=[G_0^{\left[a,b\right]}(t) G_1^{\left[a,b\right]}(t) G_2^{\left[a,b\right]}(t)\cdots G_n^{\left[a,b\right]}(t)].$$

Then, for $n\ge 1$, the derivative of $\varnothing \left(t\right)$ can be explicitly constructed by

$$\dot{\varnothing }\left(t\right)=D\varnothing \left(t\right)$$

where $D=d_{ij}$ is the $\left(n+1\right)\times (n+1)$, which is a lower triangular NSSG polynomial operational matrix of derivatives. For odd  $n$, the matrix $D$ is obtained as below

$$D=\left[\begin{array}{cccccccc}0& 0& 0& 0& 0& 0& 0& 0\\ \frac{2}{b-a}& 0& 0& 0& 0& 0& 0& 0\\ 0& \frac{8}{b-a}& 0& 0& 0& 0& 0& 0\\ \frac{6}{b-a}& 0& \frac{12}{b-a}& 0& 0& 0& 0& 0\\ 0& \frac{16}{b-a}& 0& \frac{16}{b-a}& 0& 0& 0& 0\\ \frac{10}{b-a}& 0& \frac{20}{b-a}& 0& \frac{20}{b-a}& 0& 0& 0\\ 0& \frac{24}{b-a}& 0& \frac{24}{b-a}& 0& \frac{24}{b-a}& 0& 0\\ ⋮& ⋮& ⋮& ⋮& ⋮& ⋮& ⋮& ⋮\\ \frac{2n}{b-a}& 0& \frac{4n}{b-a}& 0& \frac{4n}{b-a}& \cdots & 0& \frac{4n}{b-a}\end{array}\right].$$

Meanwhile, for even $n$, the last row of the matrix $D$ is constructed as below:

$$\left[\begin{array}{cccccc}0& \frac{4n}{b-a}& 0& \frac{4n}{b-a}& \cdots & \frac{4n}{b-a}\end{array}\right]$$

Moreover, the element of matrix can be obtained explicitly in the following form:

$$d_{ij}=\left\{\begin{array}{cc}\frac{4n}{b-a}{\in }_j, & i\ge j, \left(i+j\right) odd,\\ 0,& \mathrm{o}\mathrm{t}\mathrm{h}\mathrm{e}\mathrm{r}\mathrm{w}\mathrm{i}\mathrm{s}\mathrm{e}.\end{array}\right.$$

where ${\in }_j=\left\{\begin{array}{cc}1/2,& j=0,\\ 1,& otherwise.\end{array}\right.$

3.4. The Relation between NSSG Over $\left[-2,0\right]$ and the Power Function $t^n$

The first six NSSG polynomial over the interval [−2, 0] is given by

$$\begin{array}{cc}\hfill G_0^{\left[-2,0\right]}& =2,\hfill \\ \hfill G_1^{\left[-2,0\right]}& =2t+2,\hfill \\ \hfill G_2^{\left[-2,0\right]}& =4t^2+8t+2,\hfill \\ \hfill G_3^{\left[-2,0\right]}& =8t^3+24t^2+18t+2,\hfill \\ \hfill G_4^{\left[-2,0\right]}& =16t^4+64t^3+80t^2+32t+2,\hfill \\ \hfill G_5^{\left[-2,0\right]}& =32t^5+160t^4+280t^3+200t^2+50t+2,\hfill \\ \hfill G_6^{\left[-2,0\right]}& =64t^6+384t^5+864t^4+896t^3+420t^2+72t+2,\hfill \end{array}$$

which can be rewritten in the following form

$$\begin{array}{cc}\hfill 1& =\frac{1}{2}{G}_0^{-2,0},\hfill \\ \hfill t& =\frac{1}{2}{(G}_1^{-2,0}-G_0^{-2,0}),\hfill \\ \hfill t^2& =\frac{1}{4}(G_2^{-2,0}-4G_1^{-2,0}+3G_0^{-2,0}),\hfill \\ \hfill t^3& =\frac{1}{8}(G_3^{-2,0}-6G_2^{-2,0}+15G_1^{-2,0}-10G_0^{-2,0}),\hfill \\ \hfill t^4& =\frac{1}{16}(G_4^{-2,0}-8G_3^{-2,0}+28G_2^{-2,0}-56G_1^{-2,0}+35G_0^{-2,0})\hfill \\ \hfill t^5& =\frac{1}{32}(G_5^{-2,0}-10G_4^{-2,0}+45G_3^{-2,0}-120G_2^{-2,0}+210G_1^{-2,0}-126G_0^{-2,0}),\hfill \\ \hfill t^6& ={\displaystyle \frac{1}{64}}{(G}_6^{-2,0}-12G_5^{-2,0}+66G_4^{-2,0}-220G_3^{-2,0}+495G_2^{-2,0}-792G_1^{-2,0}+462G_0^{-2,0}).\hfill \end{array}$$

This means that the powers of $t$ can be expressed in terms of the NSSG polynomials of degrees up to $n$. The general explicit formula is given by the following result.

Theorem 4. 

For every integer $n\ge 0,$ power $t^n$ can be expanded in a unique way as a linear combination of $G_n^{\left[-2,0\right]}\left(t\right)$ as follows:

$$t^n=\frac{1}{2^n}\left({\sum }_{k=0}^{n-1}{\left(-1\right)}^k\left({\displaystyle \genfrac{}{}{0pt}{}{2n}{k}}\right)G_{n-k}^{\left[-2,0\right]}\left(t\right)+{\left(-1\right)}^n{\displaystyle \frac{\left(2n\right)!}{2{(n!)}^2}}{G}_0^{\left[-2,0\right]}\left(t\right)\right).$$

(23)

Proof. 

Mathematical induction is used to prove Equation (23) for $n=1.$

$t^1=1=G_0^{\left[-2,0\right]}\left(t\right)$; therefore, Equation (23) is true for $n=1.$ Let Equation (23) be valid for $n$, where $n-1$. This means that

$$t^n=\left\{\frac{1}{2^n}\left({\sum }_{k=0}^{n-1}{\left(-1\right)}^k\left(\genfrac{}{}{0pt}{}{2n}{k}\right)G_{n-k}^{\left[-2,0\right]}\left(t\right)+{\left(-1\right)}^n\frac{\left(2n\right)!}{2{(n!)}^2}{G}_0^{\left[-2,0\right]}\left(t\right)\right)\right..$$

(24)

Multiplying both sides of Equation (24) by $(2t+2)$ yields

$$t^{n+1}=-t^n+\left\{\frac{1}{2^{n+1}}\left({\sum }_{k=0}^{n-1}{\left(-1\right)}^k\left({\displaystyle \genfrac{}{}{0pt}{}{2n}{k}}\right)t{G}_{n-k}^{\left[-2,0\right]}\left(t\right)+{\left(-1\right)}^n{\displaystyle \frac{\left(2n\right)!}{2{\left(n!\right)}^2}}x{G}_0^{\left[-2,0\right]}\left(t\right)\right)\right..$$

Using Equation (24) yields

$$\begin{gathered} t^{n+1}=\left\{\frac{1}{2^n}\left({\sum }_{k=0}^{n-1}{\left(-1\right)}^k\left(\genfrac{}{}{0pt}{}{2n}{k}\right)G_{n-k}^{\left[-2,0\right]}\left(t\right)+{\left(-1\right)}^n{\displaystyle \frac{\left(2n\right)!}{2{\left(n!\right)}^2}}{G}_0^{\left[-2,0\right]}\left(t\right)\right)\right. \\ +\left\{\frac{1}{2^{n+1}}\left({\sum }_{k=0}^{n-1}{\left(-1\right)}^k\left(\genfrac{}{}{0pt}{}{2n}{k}\right)t{G}_{n-k}^{\left[-2, 0\right]}\left(t\right)+{\left(-1\right)}^n{\displaystyle \frac{\left(2n\right)!}{2{(n!)}^2}}x{G}_0^{\left[-2,0\right]}\left(t\right)\right)\right.. \end{gathered}$$

Hence, the required result can be obtained after using the following identities:

$$1+\left(\begin{array}{c}n\\ 1\end{array}\right)-\left(\begin{array}{c}n\\ 0\end{array}\right)=n=\left(\begin{array}{c}n\\ 1\end{array}\right)-\left(\begin{array}{c}n+1\\ 0\end{array}\right) , \left(\begin{array}{c}n\\ i+1\end{array}\right)+\left(\begin{array}{c}n\\ i\end{array}\right)=\left(\begin{array}{c}n+1\\ i+1\end{array}\right), i=\mathrm{0,1},\dots$$

□

4. The NSSG Technique for Solving the Controlled Duffing Oscillator Problem

Consider the following controlled Duffing oscillator problem of a linear oscillator, as shown in [6]:

$$J=0.5{\int }_{-T}^0{u\left(t\right)}^{2}dt,-T\le t\le 0, T \mathrm{is} \mathrm{known},$$

(25)

which is subject to

$$\ddot{x}\left(t\right)+wx\left(t\right)=u\left(t\right)$$

(26)

together with the conditions

$$x\left(-T\right)=\alpha , \dot{x}\left(-T\right)=\rho , x\left(0\right)=0, \dot{x}\left(0\right)=0.$$

(27)

The problem is in finding control vector $u\left(t\right)$, which minimizes (25) to be subject to (26) and (27). The exact solution of the controlled linear oscillator can be obtained by applying Pontryagin’s maximum principle:

$$\begin{array}{cc}\hfill x\left(t\right)& =\frac{1}{2w}\left(Awt sinwt+B(sinwt-wt coswt)\right),\hfill \\ \hfill u\left(t\right)& =\left(A coswt+B sinwt\right),\hfill \\ \hfill J& =\frac{1}{8w}\left(2wT\left(A^2+B^2 \right)+\left(A^2-B^2 \right)sin2wT-4AB{sin}^{2}wT\right),\hfill \end{array}$$

where

$$\begin{array}{cc}\hfill A& =\frac{1}{C}\left(2w\left(x{w}^{2}T sinwT-\dot{x}(wT coswT-sinwT\right)\right),\hfill \\ \hfill B& =\frac{1}{C}(2w^2\left(\dot{x}T sinwT-x(\mathit{sin}wT+wT\mathit{cos}wT)\right),\hfill \\ \hfill C& =(w^2{T}^2-{sin}^{2}wT\hfill \end{array}$$

Consider an approximation to state variable $x\left(t\right)$ using NSSG polynomials with order $n$ as below:

$$x_n\left(t\right)={\sum }_{k=0}^n{a}_k{G}_k^{\left[-T,0\right]}\left(t\right).$$

(28)

The boundary conditions in Equation (27) must satisfy the approximate solution in Equation (28):

$$x_n\left(-T\right)={\sum }_{k=0}^n{a}_k{G}_k^{\left[-T,0\right]}(-T)=\alpha ,$$

(29)

$${\dot{x}}_n\left(-T\right)={\sum }_{k=0}^n{a}_k{\dot{G}}_k^{\left[-T,0\right]}(-T)=\rho ,$$

(30)

$$x_n(0)={\sum }_{k=0}^n{a}_k{G}_k^{\left[-T,0\right]}(0)=0,$$

(31)

$${\dot{x}}_n(0)={\sum }_{k=0}^n{a}_k{\dot{G}}_k^{\left[-T,0\right]}(0)=0.$$

(32)

Then, control variable $u\left(t\right)$ is obtained from Equation (26) as

$$u_n\left(t\right)={\sum }_{k=0}^n{a}_k{G}_k^{\left[-T,0\right]}\left(t\right)+w{\sum }_{k=0}^n{a}_k{\ddot{G}}_k^{\left[-T,0\right]}\left(t\right).$$

(33)

Then, substituting Equation (33) into Equation (25) gives

$$J=0.5{\int }_{-T}^0{u_n\left(t\right)}^{2}dt.$$

(34)

As a result, the controlled Duffing oscillator problem (25)–(27) is transformed into a nonlinear quadratic programming problem, which can be stated as follows:

Let

$$H=0.5{\int }_{-T}^0{u\left(t\right)}^{2}dt, \mathcal{F}=\left[\begin{array}{c}{x}_n\left(-T\right)\\ {\dot{x}}_n\left(-T\right)\\ x_n\left(0\right)\\ {\dot{x}}_n\left(0\right)\end{array}\right] \mathrm{and} c=\left[\begin{array}{c}\alpha \\ \rho \\ 0\\ 0\end{array}\right],$$

(35)

then,

$$\min J=\frac{1}{2}{a}^{T}Ha$$

(36)

Is subject to the equality constraint

$$\mathcal{F}a-c=0.$$

(37)

This is a nonlinear quadratic programming problem. The unknown parameters of vector $a$ have to be determined with the below:

$$a^{*}=H^{-1}{\mathcal{F}}^T{\left(\mathcal{F}{H}^{-1}{\mathcal{F}}^T\right)}^{-1}c.$$

(38)

The advantages of the proposed NSSG polynomial technique in terms of solving the controlled Duffing oscillator problem include the following points:

(1)

It can deal directly with the second-order derivative in the constrained differential equation, Equation (26), without reducing it to a first-order system. As a result, the number of unknown parameters will be reduced, unlike the technique in [25].

(2)

It can deal directly with interval $t\in \left[-T, 0\right]$ while other methods must introduce a suitable transformation according to the base functions [18].

(3)

The problem is reduced to a quadratic programming problem, which is much easier than the numerical integration of a nonlinear TPBVP derived from Pontryagin’s maximum principle method [26].

5. Results and Discussion

Problems (25)–(27) can be solved in the standard case: $w=1, T=2$, $\alpha =0.5$ and $\rho =-0.5$. By performing Equations (28)–(35) with $n=4$, one can obtain

$$\begin{gathered} J=4{a_0}^2+{\displaystyle \frac{88}{3}}{a}_0{a}_2+{\displaystyle \frac{1912}{15}}{a}_0{a}_4+{\displaystyle \frac{4}{3}}{a_1}^2+{\displaystyle \frac{312}{5}}{a}_1{a}_3+{\displaystyle \frac{4216}{7}}{a}_2{a}_4+{\displaystyle \frac{276}{5}}{a_2}^2 \\ +\frac{25604}{35}{a_3}^2+\frac{1328108}{315}{a_4}^2. \end{gathered}$$

(39)

These are subject to the constraints

$$\begin{array}{cc}\hfill {2a}_0& - 2a_1+2a_2-2a_3{+2a}_4=0.5,\hfill \\ \hfill 2a_1& - 8a_2+18a_3{-32a}_4=-0.5,\hfill \\ \hfill {2a}_0& + 2a_1+2a_2+2a_3{+2a}_4=0,\hfill \\ \hfill 2a_1& + 8a_2+18a_3{+32a}_4=0,\hfill \end{array}$$

which can be written as

$$J=\frac{1}{2}{a}^{T}Ha.$$

This is subject to the equality constraints $\mathcal{F}a-c=0,$

where $=\left[\begin{array}{ccccc}8& 0& \frac{88}{3}& 0& {\displaystyle \frac{1912}{15}}\\ 0& \frac{8}{3}& 0& \frac{312}{5}& 0\\ \frac{88}{3}& 0& \frac{552}{5}& 0& \frac{4216}{7}\\ 0& \frac{312}{5}& 0& \frac{51208}{35}& 0\\ \frac{1912}{15}& 0& \frac{4216}{7}& 0& \frac{2656216}{315}\end{array}\right],$ $a^T=\left[\begin{array}{ccccc}{a}_0& a_1& a_2& a_3& a_4\end{array}\right]$,

$$\mathcal{F}=\left[\begin{array}{ccccc}2& -2& 2& -2& 2\\ 0& 2& -8& 18& -32\\ 2& 2& 2& 2& 2\\ 0& 2& 8& 18& 32\end{array}\right] \mathrm{a}\mathrm{n}\mathrm{d} c=\left[\begin{array}{c}0.5\\ -0.5\\ 0\\ 0\end{array}\right].$$

When using Equation (31) to obtain the optimal unknown vector $a^T$, we have

$$a^T=\left[\begin{array}{ccccc}0.0877800707547& -0.125& 0.0392099056603& 0& -0.0019899764150\end{array}\right].$$

The NSSG polynomial coefficients for state function $x\left(t\right)$ and control function $u\left(t\right)$ are listed in

Table 2. The optimal values of unknown parameters $a^{*}$.

${\mathit{a}}_{\mathit{m}}$	$\mathit{n}\mathbf{=}\mathbf{4}$	$\mathit{n}\mathbf{=}\mathbf{5}$	$\mathit{n}\mathbf{=}\mathbf{6}$	$\mathit{n}\mathbf{=}\mathbf{7}$
$a_0$	0.087780070754717	0.087780070754717	0.087777927696772	0.087777927696772
$a_1$	−0.125000000000000	−0.124857719370861	−0.124857719370861	−0.124857905722070
$a_2$	0.039209905660377	0.039209905660377	0.039258031287699	0.039258031287699
$a_3$	0	2.1342094370 $\times {10}^{-4}$	−2.134209437 $\times {10}^{-4}$	−2.144165008 $\times {10}^{-4}$
$a_4$	−0.001989976415094	−0.001989976415094	−0.002063119914508	−0.002063119914508
$a_5$		7.1140314569 $\times {10}^{-5}$	7.114031456 $\times {10}^{-5}$	7.317227891 $\times {10}^{-5}$
$a_6$			2.716093003 $\times {10}^{-5}$	2.716093003 $\times {10}^{-5}$
$a_7$				−8.5005597850 $\times {10}^{-5}$

with different values of $n$. In

Table 3. The approximate and exact values of $x\left(t\right)$.

$\mathit{t}$	$\mathit{n}\mathbf{=}\mathbf{4}$	$\mathit{n}\mathbf{=}\mathbf{5}$	$\mathit{n}\mathbf{=}\mathbf{6}$	$\mathit{n}\mathbf{=}\mathbf{7}$	Exact $\mathit{x}$
−2	0.500000000000	0.500000000000	0.500000000000	0.500000000000	0.500000000000
−1.8	0.400873584905	0.400637558415	0.400742711379	0.400746010012	0.400745520599
−1.6	0.306958490566	0.306399020367	0.306531993566	0.306532325222	0.306533016886
−1.4	0.222533962264	0.221891445707	0.221875203991	0.221869442930	0.221870390820
−1.2	0.150656603773	0.150237001124	0.150023545433	0.150017376467	0.150016904455
−1	0.093160377358	0.093160377358	0.092859231129	0.092859231129	0.092857866797
−0.8	0.050656603773	0.051076206422	0.050862750731	0.050868919696	0.050868512592
−0.6	0.022533962264	0.023176478820	0.023160237103	0.023165998164	0.023166956703
−0.4	0.006958490566	0.007517960764	0.007650933963	0.007650602307	0.007651246479
−0.2	0.000873584905	0.001109611395	0.001214764359	0.001211465727	0.001210986094
0	0	0	0	0	0

and

Table 4. The approximate and exact values of $u\left(t\right)$.

$\mathit{t}$	$\mathit{n}\mathbf{=}\mathbf{4}$	$\mathit{n}\mathbf{=}\mathbf{5}$	$\mathit{n}\mathbf{=}\mathbf{6}$	$\mathit{n}\mathbf{=}\mathbf{7}$	Exact $\mathit{u}$
−2	0.495283018867	0.477071098338	0.488568324681	0.489136213462	0.488967005484
−1.8	0.533703773584	0.53201079345	0.529144271204	0.528914733143	0.528980363594
−1.6	0.546769811320	0.55276663251	0.548019438632	0.547935662347	0.547904943902
−1.4	0.538760377358	0.546131105835	0.544877791187	0.545034546924	0.544986283110
−1.2	0.512732075471	0.517411810571	0.520149659487	0.520325422387	0.520340739015
−1	0.470518867924	0.470518867924	0.474898905657	0.474898905657	0.474950851685
−0.8	0.412732075471	0.408052340372	0.410790189288	0.410614426389	0.410626172692
−0.6	0.338760377358	0.331389648881	0.330136334234	0.329979578497	0.329931124000
−0.4	0.246769811320	0.240772990128	0.236025796248	0.236109572533	0.236082762552
−0.2	0.133703773584	0.135396753717	0.132530231469	0.132759769530	0.132822526363
0	0.004716981132	0.013494939397	0.024992165741	0.024424276960	0.024267075194

, the approximated values for the state and control functions are determined for different values of $t$ $\in \left[-2, 0\right]$ using different orders of the basis functions $n=4, 5, 6 \mathrm{a}\mathrm{n}\mathrm{d} 7$.

Also, these solutions were plotted according to same values illustrated in Figure 1.

As shown in

Table 5. Absolute and relative errors.

The MSSG Polynomial Method
$\mathit{n}$	$\mathit{J}$	$\mathbf{A}\mathbf{b}\mathbf{s}\mathbf{o}\mathbf{l}\mathbf{u}\mathbf{t}\mathbf{e} \mathbf{E}\mathbf{r}\mathbf{r}\mathbf{o}\mathbf{r}\mathbf{s}$	Relative Errors
4	0.184916891284816	5.83492848160$\times {10}^{-5}$	3.15642892044 $\times {10}^{-4}$
5	0.184873529569269	1.49875692690$\times {10}^{-5}$	8.10758816274 $\times {10}^{-5}$
6	0.184858574012377	3.20123770269$\times {10}^{-8}$	1.73172289906 $\times {10}^{-7}$
7	0.184858544450233	2.45023301648 $\times {10}^{-9}$	1.32546377893 $\times {10}^{-8}$
Radial Basis Functions [25]
4	0.223031934020577	0.00381733	3.81732916 $\times {10}^{-2}$
6	0.186100046239558	1.24150 $\times {10}^{-3}$	6.71596705 $\times {10}^{-3}$
8	0.184867276203868	8.733840 $\times {10}^{-6}$	4.72460763 $\times {10}^{-5}$
10	0.184858593684025	5.13202 $\times {10}^{-8}$	2.7802840 $\times {10}^{-7}$

, a comparison was made between the present method against the solution obtained by radial basis functions [25] for different values of $n$. This method is based on radial basis functions to approximate the solution of the optimal control problem using the collocation method.

Table 6. The approximate values of $x\left(t\right)$ and $u\left(t\right)$.

$\mathit{x}\left(\mathit{t}\right)$			$\mathit{u}\mathbf{\left(}\mathit{t}\mathbf{\right)}$
t	$\mathit{n}=10$ [25]	$\mathbf{N}\mathbf{S}\mathbf{S}\mathbf{G}$ Polynomial $\mathit{n}\mathbf{=}\mathbf{7}$	$\mathit{n}=10$ [25]	$\mathbf{N}\mathbf{S}\mathbf{S}\mathbf{G}$ Polynomial $\mathit{n}\mathbf{=}\mathbf{7}$
−2	0	0	0.00000000	0.0000000000
−1.5	2.96999999 $\times {10}^{-6}$	1.0836221649 $\times {10}^{-6}$	0.00137793000	1.6921346 $\times {10}^{-4}$
−1	7.99999999 $\times {10}^{-8}$	1.3611290560 $\times {10}^{-6}$	3.2213000 $\times {10}^{-4}$	5.4912806 $\times {10}^{-5}$
−0.5	2.32000000 $\times {10}^{-6}$	1.054616982 $\times {10}^{-6}$	1.13700000 $\times {10}^{-5}$	5.1946027 $\times {10}^{-5}$
0	0	0	2.46780000 $\times {10}^{-4}$	5.2213726 $\times {10}^{-5}$

compares the values of $x\left(t\right)$ and $u\left(t\right)$, which were obtained by our method with the existing findings in [25]. The results in [25] needed three numerical methods that will increase the computational time and effort.

As $n$ increases, the absolute errors $\left|J_{exact}-J_{G\left(t\right)}\right|$ and $\left|{\displaystyle \frac{J_{xact}-J_{G\left(t\right)}}{J_{exact}}}\right|$ decrease significantly, and the results will rapidly tend to the exact values. This table illustrates that the NSSG polynomials have a good convergence rate.

The absolute errors $\left|x_{exact}-x_{G\left(t\right)}\right|$ and $\left|u_{exact}-u_{G\left(t\right)}\right|$, as well as the relative errors $\left|{\displaystyle \frac{x_{exact}-x_{G\left(t\right)}}{x_{exact}}}\right|$ and $\left|{\displaystyle \frac{u_{exact}-u_{G\left(t\right)}}{u_{exact}}}\right|$, are listed in

Table 7. The absolute and relative errors with $n=7$.

Absolute Error			Relative Error
$\mathit{t}$	$\mathit{x}\left(\mathit{t}\right)$	$\mathit{u}\left(\mathit{t}\right)$	$\mathit{x}\left(\mathit{t}\right)$	$\mathit{u}\left(\mathit{t}\right)$
−2	0	1.692079 $\times {10}^{-4}$	0	3.460517746 $\times {10}^{-4}$
−1.8	4.89412962 $\times {10}^{-7}$	6.563045 $\times {10}^{-5}$	1.221256225 $\times {10}^{-6}$	1.240697283 $\times {10}^{-4}$
−1.6	6.91664531 $\times {10}^{-7}$	3.071844 $\times {10}^{-5}$	2.256411195 $\times {10}^{-6}$	5.606527252 $\times {10}^{-5}$
−1.4	9.47889511 $\times {10}^{-7}$	4.8263813 $\times {10}^{-5}$	4.272266828 $\times {10}^{-6}$	8.855968396 $\times {10}^{-5}$
−1.2	4.72011755 $\times {10}^{-7}$	1.5316628 $\times {10}^{-5}$	3.146390446 $\times {10}^{-6}$	2.943576555 $\times {10}^{-5}$
−1	1.36433170 $\times {10}^{-7}$	5.1946027 $\times {10}^{-5}$	1.469268837 $\times {10}^{-6}$	1.093713735 $\times {10}^{-4}$
0	0	5.2213726 $\times {10}^{-5}$	0	2.21516172 $\times {10}^{-4}$

for $n=7$, and they are also presented graphically in Figure 2.

Figure 2 shows the decreasing absolute error by the NSSG polynomials with the state parameterization technique. Figure 3 is the last illustration that displays the graph of the absolute values of $J$ with different orders of the $\mathrm{N}\mathrm{S}\mathrm{S}\mathrm{G}$ polynomials. All the tables and figures show that the suggested methodology is capable of providing numerical solutions for the controlled osculation problem with high accuracy. The solution obtained from the proposed approach is in good agreement with the existing results, thus demonstrating the reliability of the proposed schemes.

The above figures show the decreasing absolute error by the suggested algorithm based on NSSG polynomials. The optimal performance index value $J$, which is obtained by the proposed method for $n=4, 5, 6 \mathrm{a}\mathrm{n}\mathrm{d} 7$, is a good approximation. The approximate state and control variables are, respectively, as below

$$\begin{gathered} x_4\left(t\right)=1.086656969857170\times {10}^{-14}t-0.031839622641504t^4{-0.127358490566016t}^3 \\ -{0.002358490566011t}^2+6.791606061607311\times {10}^{-16}, \end{gathered}$$

$$\begin{gathered} u_4\left(t\right)=-0.031839622641504t^4-0.127358490566016t^3-{0.384433962264059t}^2 \\ -0.764150943396085t-0.004716981132020, \end{gathered}$$

$$\begin{gathered} x_5\left(t\right)=0.002276490066225t^5-0.020457172310378t^4-{ 0.105731834936877t}^3 \\ +0.016991674996903t^2+0.007683153973521t+ 8.536837748351163\times {10}^{-4}, \end{gathered}$$

$$\begin{gathered} u_5\left(t\right)= 0.002276490066225{t^5-0.020457172310378t}^4-0.060202033612374t^3 \\ -{0.228494392727635t}^2- 0.626707855647741t+0.034837033768642. \end{gathered}$$

$$\begin{gathered} x_6\left(t\right)=0.001738299522379t^6+ 0.012706287200501t^5+0.001839575251112t^4 \\ -0.089491560685423t^3+0.012496082870642t^2-2.411308712488788\times {10}^{-17}t \\ -3.763967600050567\times {10}^{-18}, \end{gathered}$$

$$\begin{gathered} u_6\left(t\right)=0.001738299522379t^6+0.012706287200501t^5+0.053988560922489t^4 \\ +0.164634183324589t^3+0.034570985883986t^2-0.536949364112541t \\ +0.024992165741284, \end{gathered}$$

$$\begin{gathered} x_7\left(t\right)=-1.088071652483369\times {10}^{-4}{t}^7+9.766493656408826\times {10}^{-4}{t}^6 \\ +0.010676772128411t^5-6.914985419546381\times {10}^{-4}{t}^4-0.090929906788370t^3 \\ +0.012212138480162t^2-1.5346542938353\times {10}^{-17}t+4.37916033730\times {10}^{-18}, \end{gathered}$$

$$\begin{gathered} u_7\left(t\right)=-1.088071652483369\times {10}^{-4}{t}^7+9.766493656408826\times {10}^{-4}{t}^6 \\ +0.006106871187980t^5+ 0.028607982427272t^4+0.122605535779841t^3 \\ +0.003914155976706t^2- 0.545579440730220t+ 0.024424276960324, \end{gathered}$$

6. Conclusions

A special optimal control problem called the controlled Duffing oscillator was treated numerically in the present work using NSSG polynomials. The suggested technique uses the constructed NSSG polynomial operational matrix of first-order derivatives in combination with an appropriate direct parameterization scheme. The controlled Duffing oscillator problem was treated approximately with special values of unknown parameters utilizing various orders of NSSG polynomials. The outcomes of the approximate solutions have demonstrated the simplicity and the accuracy of the presented direct technique. Additionally, the proposed methodology can be used in a number of applications to numerically treat different classes of the optimal control problem. The presented results prove and support the satisfactory accuracy and efficiency of the recommended method. It can deal directly with the highest-order derivatives in a constrained differential equation without reducing it to a first-order system. As a result, the number of the unknown parameters can be reduced. This fact was shown when applying the presented NSSG polynomials on the controlled Duffing oscillator. The suggested direct technique is much easier to use than the numerical integration of the nonlinear TPBVP derived from Pontryagin’s maximum principle method. The proposed method can be extended to the nonlinear calculus of variations and optimal control problems.