A Tutorial to Approximately Invert the Sumudu Transform

Abstract

Unlike the traditional Laplace transform, the Sumudu transform of a function, when approximated as a power series, may be readily inverted using factorial-based coefficient diminution. This technique offers straightforward computational advantages for approximate range-limited numerical solutions of certain ordinary, mixed, and partial linear differential and integro-differential equations. Furthermore, discrete convolution (the Cauchy product), may also be utilized to assist in this approximate inversion method of the Sumudu transform. Illustrative examples are provided which elucidate both the applicability and limitations of this method.

Keywords

Share and Cite:

Atlas, G. , Li, J. and Work, A. (2019) A Tutorial to Approximately Invert the Sumudu Transform. Applied Mathematics, 10, 1004-1028. doi: 10.4236/am.2019.1011070.

1. Introduction

Transform mathematics has traditionally been utilized for obtaining solutions of differential and integro-differential equations (DEs and IDEs) which arise in control theory, engineering, and related areas such as pharmacologic and mathematical modeling [1] [2] [3]. In general, transform mathematics allows for the conversion of differentiation and integration into algebraic processes which yield a preliminary solution that is expressed within the transform domain. Subsequent inversion of this transform function then produces the actual solution of the original DE or IDE which is represented in terms of moments.

The Laplace transform is classically utilized for this purpose [4] [5]. Typically, the inversion of a Laplace transform is accomplished using pre-existing tables which facilitate this process. Partial fraction expansion may be helpful, in simplifying an expression within the Laplace domain, but is not always reliable in generating a readily invertible result.

Therefore, when a tabular result is unavailable, inversion of the Laplace transform may be difficult; requiring integration within the complex plane. Approximate Laplace transform inversion techniques exist which are based upon numerical methods [6], Fourier analysis [7], or repetitive symbolic differentiation [8].

Relatively recently, alternative mathematical transforms have been developed. Specifically, the Sumudu transform is defined as [9]:

$G\left(u\right)=\frac{1}{u}{\int }_{0}^{\infty }g\left(t\right){\text{e}}^{\frac{-t}{u}}\text{d}t\text{ }.$ (1)

It should be noted that the Sumudu transform of a real function yields results, within the u-domain, which are also real. Additionally, the Sumudu transform “preserves dimensions.” Thus, whatever physical dimension $g\left(t\right)$ has $G\left(u\right)$ will also have [9] [10] [11]. This is particularly helpful when checking for algebraic accuracy.

For simplicity, the Sumudu transform process will be referred to using the S operator:

$G\left(u\right)=S\left[g\left(t\right)\right].$ (2)

Whereas the inversion process will be referred to as:

$g\left(t\right)={S}^{-1}\left[G\left(u\right)\right].$ (3)

Note that the traditional Laplace transform is defined using the L operator:

$L\left[g\left(t\right)\right]=F\left(s\right)={\int }_{0}^{\infty }g\left(t\right){\text{e}}^{-st}\text{d}t\text{ }\text{ }.$ (4)

Inspection of (1) and (4) demonstrates that the conversion, from a Laplace to a Sumudu transform, is obtained by using the substitution of $\frac{1}{u}$ for s with the subsequent multiplication of the Laplace transform by $\frac{1}{u}$ :

$\underset{\text{Sumudu}}{\underset{︸}{G\left(u\right)=S\left[g\left(t\right)\right]}}={\frac{1}{u}\underset{\text{Laplace}}{\underset{︸}{L\left[g\left(t\right)\right]}}|}_{s=\frac{1}{u}}={\frac{1}{u}\underset{\text{Laplace}}{\underset{︸}{F\left(s\right)}}|}_{s=\frac{1}{u}}.$ (5)

A “duality” between the Laplace and Sumudu transforms therefore exists in terms of similar mathematical properties regarding linearity, convolution, differentiation, and integration. These topics have been explored and discussed previously [10] [11]. Furthermore, tables of Sumudu transforms are available which allow for straightforward conversions, between the u-domain and t-domains, for many commonly used functions [10] [11].

If t in the above equation has units of time, then s consequently has units of complex frequency, whereas u would also have the dimension of time. As previously stated, the Sumudu transform “preserves units.”

The purpose of this paper is to demonstrate an approximate inversion process of the Sumudu transform utilizing a geometric power series technique which uses non-negative integer values for n:

$G\left(u\right)\approx \underset{n=0}{\overset{N}{\sum }}\left({a}_{n}\right){u}^{n}.$ (6)

Furthermore, this approximate inversion process may only apply within a narrow numerical range owing to the limitations of a truncated geometric power series as a means of representing a function.

Note that $G\left(u\right)$ in (6) would also be continuously differentiable or “smooth.” In addition, ${a}_{n}$ is a constant coefficient. Moreover, this geometric power series method can also be combined, utilizing superposition, with single or multiple known “pre-existing” Sumudu transform or transforms; such as those available from a table:

$G\left(u\right)\approx \left({S}_{1}\left[{g}_{1}\left(t\right)\right]+{S}_{2}\left[{g}_{2}\left(t\right)\right]+{S}_{3}\left[{g}_{3}\left(t\right)\right]+\cdots \right)+\underset{n=0}{\overset{N}{\sum }}\left({a}_{n}\right){u}^{n}.$ (7)

Multiple geometric power series may also be combined in an additive or multiplicative manner.

The Sumudu Transform of a Power Series

The Sumudu transform of a power series in the t-domain is a “factorial-based” amplified power series in the u-domain (See Appendix A) [9]. Therefore:

$S\left[{t}^{0}\right]=0!{u}^{0}=1,$ (8)

$S\left[{t}^{1}\right]=1!{u}^{1}=u,$ (9)

$S\left[{t}^{2}\right]=2!{u}^{2}=2{u}^{2},$ (10)

$S\left[{t}^{3}\right]=3!{u}^{3}=6{u}^{3},$ (11)

$S\left[{t}^{4}\right]=4!{u}^{4}=24{u}^{4}.$ (12)

Thus, for integer values of $n\ge 0$ :

$S\left[{t}^{n}\right]=n!{u}^{n}.$ (13)

A summation of multiple power terms, in the time domain, could then be expressed as a power series:

$g\left(t\right)\approx \underset{n=0}{\overset{N}{\sum }}\text{ }\text{ }g\left(t,n\right)=\underset{g\left(t,0\right)}{\underset{︸}{{a}_{0}{t}^{0}}}+\underset{g\left(t,1\right)}{\underset{︸}{{a}_{1}{t}^{1}}}+\cdots +\underset{g\left(t,N\right)}{\underset{︸}{{a}_{N}{t}^{N}}}=\underset{n=0}{\overset{N}{\sum }}\text{ }\text{ }{a}_{n}{t}^{n}.$ (14)

The corresponding Sumudu transform of the above equation would therefore be:

$G\left(u\right)\approx \underset{n=0}{\overset{N}{\sum }}\text{ }\text{ }G\left(u,n\right)=\underset{G\left(u,0\right)}{\underset{︸}{{a}_{0}\left(0!\right){u}^{0}}}+\underset{G\left(u,1\right)}{\underset{︸}{{a}_{1}\left(1!\right){u}^{1}}}+\cdots +\underset{G\left(u,N\right)}{\underset{︸}{{a}_{N}\left(N!\right){u}^{N}}}=\underset{n=0}{\overset{N}{\sum }}\text{ }\text{ }{a}_{n}\left(n!\right){u}^{n}.$ (15)

Use of factorial-based coefficient diminution (FBCD) subsequently yields the inversion of (15) “back to” (14):

$\underset{n=0}{\overset{N}{\sum }}\text{ }\text{ }g\left(t,n\right)={\underset{n=0}{\overset{N}{\sum }}\frac{G\left(u,n\right)}{n!}|}_{t=u}.$ (16)

Note that t has to be substituted for u on the RHS of the above equation. Therefore, functions which can be approximated with a geometric power series, expressed with the form of (6) in the u-domain, may be readily inverted, back to the t-domain, using the aforementioned technique. Thus, approximate solutions of certain types of both linear differential equations, as well as linear integro-differential equations, can be generated. However, these approximate solutions may also be range-limited.

In addition, a Sumudu transform is frequently a rational function expressed within the u-domain:

$G\left(u\right)=\frac{P\left(u\right)}{Q\left(u\right)}.$ (17)

However, $G\left(u\right)$ may sometimes be expressed utilizing transcendental functions. Nonetheless, approximating $G\left(u\right)$ as a geometric power series in the form of (6) can often be accomplished using commonly-known mathematical techniques and algorithms. Computer-based symbolic processors can also be utilized. As previously stated, geometric power series representations of functions may have limitations which restrict the acceptable accuracy of this approximation to that of a relatively narrow numerical range.

Lastly, a Sumudu transform may sometimes be expressed as a product of two or more rational functions:

$G\left(u\right)=\left[\frac{{P}_{n}\left(u\right)}{{Q}_{n}\left(u\right)}\cdot \frac{{P}_{n+1}\left(u\right)}{{Q}_{n+1}\left(u\right)}\cdots \frac{{P}_{N}\left(u\right)}{{Q}_{N}\left(u\right)}\right]=\underset{n=0}{\overset{N}{\prod }}\left(\frac{{P}_{n}\left(u\right)}{{Q}_{n}\left(u\right)}\right).$ (18)

Each rational function would then be approximated as a unique geometric power series. Consequently, $G\left(u\right)$ would be represented as the product of two or more infinite series:

$G\left(u\right)\approx \left[\underset{m=0}{\overset{\infty }{\sum }}{}^{\left(n\right)}a{}_{m}{u}^{m}\cdot \underset{m=0}{\overset{\infty }{\sum }}{}^{\left(n+1\right)}a{}_{m}{u}^{m}\cdots \underset{m=0}{\overset{\infty }{\sum }}{}^{\left(N\right)}a{}_{m}{u}^{m}\right].$ (19)

So that:

$G\left(u\right)\approx \underset{n=0}{\overset{N}{\prod }}\left(\underset{m=0}{\overset{\infty }{\sum }}{}^{\left(n\right)}a{}_{m}{u}^{m}\right).$ (20)

where:

$\frac{{P}_{n}\left(u\right)}{{Q}_{n}\left(u\right)}\approx \underset{m=0}{\overset{\infty }{\sum }}{}^{\left(n\right)}a{}_{m}{u}^{m},$ (21)

$\frac{{P}_{n+1}\left(u\right)}{{Q}_{n+1}\left(u\right)}\approx \underset{m=0}{\overset{\infty }{\sum }}{}^{\left(n+1\right)}a{}_{m}{u}^{m},$ (22)

and:

$\frac{{P}_{N}\left(u\right)}{{Q}_{N}\left(u\right)}\approx \underset{m=0}{\overset{\infty }{\sum }}{}^{\left(N\right)}a{}_{m}{u}^{m}.$ (23)

Note that: ${}^{\left(n\right)}a{}_{m}$, ${}^{\left(n+1\right)}a{}_{m}$, and ${}^{\left(N\right)}a{}_{m}$ all represent series-specific constant coefficients. Furthermore, the above product of multiple series can be combined using discrete convolution (the Cauchy product) [12] [13]. However, each series must be truncated.

As will be shown later, this technique can also be utilized as an approximation-based means to invert a partial fraction expansion from the u-domain back to the t-domain.

2. Methods

Numerical analysis and the conversion of rational functions into geometric power series were accomplished using Mathcad (PTC Corporation, MA, USA). Graphs were prepared using Excel (Microsoft Corporation, WA, USA).

3. Preliminary Examples of the Exponential, Sine, and Cosine Functions

3.1. Exponential Function

The Sumudu transform of the exponential function is [9]:

$S\left[{\text{e}}^{at}\right]=\frac{1}{u}{\int }_{0}^{\infty }{\text{e}}^{at}{\text{e}}^{\frac{-t}{u}}\text{d}t=\frac{1}{u}{\int }_{0}^{\infty }{\text{e}}^{\left(a-\frac{1}{u}\right)t}\text{d}t,\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}|ua|<1.$ (24)

Thus:

$S\left[{\text{e}}^{at}\right]={\frac{1}{u\left(a-\frac{1}{u}\right)}{\text{e}}^{\left(a-\frac{1}{u}\right)t}|}_{0}^{\infty }=0-\frac{1}{\left(ua-1\right)}=\frac{1}{\left(1-au\right)}.$ (25)

Therefore, the Sumudu transform of the exponential function subsequently expressed as a power series is:

$S\left[{\text{e}}^{at}\right]=\frac{1}{\left(1-au\right)}\approx 1+au+{a}^{2}{u}^{2}+{a}^{3}{u}^{3}+\cdots$ (26)

Use of FBCD with substitution of t for u then yields the well-known Taylor’s series of an exponential function. Thus, the above Sumudu transform is approximately inverted without the need for integration within the complex plane:

${\text{e}}^{at}\approx \frac{1}{0!}+\frac{at}{1!}+\frac{{a}^{2}{t}^{2}}{2!}+\frac{{a}^{3}{t}^{3}}{3!}+\cdots \approx \underset{n=0}{\overset{\infty }{\sum }}\frac{{a}^{n}{t}^{n}}{n!}.$ (27)

3.2. Sine Function

Using (1) the Sumudu transform of the sine function is [9]:

Expressing the above as a power series:

$S\left[\mathrm{sin}\left(at\right)\right]=\frac{au}{\left(1+{a}^{2}{u}^{2}\right)}.$ (28)

$\frac{au}{\left(1+{a}^{2}{u}^{2}\right)}\approx au-{a}^{3}{u}^{3}+{a}^{5}{u}^{5}-{a}^{7}{u}^{7}+{a}^{9}{u}^{9}+\cdots$ (29)

By using FBCD, the above Sumudu transform, expressed as a power series, is approximately inverted. This yields the Taylor series of a sine function. Note that u has been replaced by t:

$\mathrm{sin}\left(at\right)\approx \frac{at}{1!}-\frac{{a}^{3}{t}^{3}}{3!}+\frac{{a}^{5}{t}^{5}}{5!}-\frac{{a}^{7}{t}^{7}}{7!}+\frac{{a}^{9}{t}^{9}}{9!}+\cdots$ (30)

Equivalently:

$\mathrm{sin}\left(at\right)\approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{\left(at\right)}^{\left(2n+1\right)}}{\left(2n+1\right)!}.$ (31)

3.3. Cosine Function

The Sumudu transform of the cosine function is found in a manner similar to that of the sine function [7]:

$S\left[\mathrm{cos}\left(at\right)\right]=\frac{1}{\left(1+{a}^{2}{u}^{2}\right)}.$ (32)

Therefore:

$\frac{1}{\left(1+{a}^{2}{u}^{2}\right)}\approx 1-{a}^{2}{u}^{2}+{a}^{4}{u}^{4}-{a}^{6}{u}^{6}+{a}^{8}{u}^{8}+\cdots$ (33)

The Taylor’s series for the cosine function is then approximated using FBCD along with substitution of t for u within the above equation:

$\mathrm{cos}\left(at\right)\approx \frac{1}{0!}-\frac{{a}^{2}{t}^{2}}{2!}+\frac{{a}^{4}{t}^{4}}{4!}-\frac{{a}^{6}{t}^{6}}{6!}+\frac{{a}^{8}{t}^{8}}{8!}+\cdots$ (34)

So that:

$\mathrm{cos}\left(at\right)\approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{\left(at\right)}^{\left(2n\right)}}{\left(2n\right)!}.$ (35)

4. Differentiation and Integration within the Sumudu Domain

Differentiation and integration, with the Sumudu transform, have an “inverse resemblance” to that of Laplace transforms [10] [11]. The first derivative is:

$S\left[\frac{\text{d}g}{\text{d}t}\right]=\frac{G\left(u\right)}{u}-\frac{g\left(0\right)}{u}.$ (36)

Whereas the second derivative is:

$S\left[\frac{{\text{d}}^{2}g}{\text{d}{t}^{2}}\right]=\frac{G\left(u\right)}{{u}^{2}}-\frac{g\left(0\right)}{{u}^{2}}-\frac{\left({\frac{\text{d}g}{\text{d}t}|}_{t=0}\right)}{u}.$ (37)

Higher-order derivatives can also be determined:

$S\left[\frac{{\text{d}}^{n}g}{\text{d}{t}^{n}}\right]=\frac{G\left(u\right)}{{u}^{n}}-\frac{g\left(0\right)}{{u}^{n}}-\cdots -\frac{\left({\frac{{\text{d}}^{\left(n-1\right)}g}{\text{d}{t}^{\left(n-1\right)}}|}_{t=0}\right)}{u}.$ (38)

Furthermore, integration within the Sumudu transform domain can be summarized as:

$S\left[\underset{n}{\underset{︸}{{\int }^{\text{​}}\cdots {\int }^{\text{​}}{\int }^{\text{​}}}}g\left(t\right){\left(\text{d}t\right)}^{n}\right]={u}^{n}G\left(u\right).$ (39)

Sumudu Shift Theorem

The Sumudu transform of a function $t\cdot g\left(t\right)$ can be expressed using the Sumudu shift theorem and $G\left(u\right)$ :

$S\left[t\cdot g\left(t\right)\right]=u\left[G\left(u\right)+u\frac{\text{d}}{\text{d}u}G\left(u\right)\right].$ (40)

Making use of the product rule yields:

$S\left[t\cdot g\left(t\right)\right]=u\frac{\text{d}\left[uG\left(u\right)\right]}{\text{d}u}.$ (41)

5. Approximate Solutions to Certain Linear Differential Equationsand Integro-Differential Equations

5.1. Example 1

Consider the fourth-order linear inhomogeneous differential equation with all initial conditions equal to zero:

$\frac{{\text{d}}^{4}g}{\text{d}{t}^{4}}+g\left(t\right)=1.$ (42)

Using the Sumudu transform technique:

$\frac{G\left(u\right)}{{u}^{4}}+G\left(u\right)=1.$ (43)

Which is equivalent to:

$G\left(u\right)+{u}^{4}G\left(u\right)={u}^{4}.$ (44)

Thus:

$G\left(u\right)=\frac{{u}^{4}}{\left(1+{u}^{4}\right)}.$ (45)

Expressing the above equation as a power series yields:

$G\left(u\right)\approx {u}^{4}-{u}^{8}+{u}^{12}-{u}^{16}+{u}^{20}-{u}^{24}+{u}^{28}-{u}^{32}+\cdots$ (46)

Thus:

$G\left(u\right)\approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}{u}^{4\left(n+1\right)}.$ (47)

The approximate solution is readily obtained by means of FBCD and substitution of t for u:

$g\left(t\right)\approx \frac{{t}^{4}}{4!}-\frac{{t}^{8}}{8!}+\frac{{t}^{12}}{12!}-\frac{{t}^{16}}{16!}+\frac{{t}^{20}}{20!}-\frac{{t}^{24}}{24!}+\frac{{t}^{28}}{28!}-\frac{{t}^{32}}{32!}.$ (48)

Therefore:

$g\left(t\right)\approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{t}^{4\left(n+1\right)}}{\left[4\left(n+1\right)\right]!}.$ (49)

The fourth derivative of the above is:

$\frac{{\text{d}}^{4}g}{\text{d}{t}^{4}}\approx 1-\frac{{t}^{4}}{4!}+\frac{{t}^{8}}{8!}-\frac{{t}^{12}}{12!}+\frac{{t}^{16}}{16!}-\frac{{t}^{20}}{20!}+\frac{{t}^{24}}{24!}-\frac{{t}^{28}}{28!}+\frac{{t}^{32}}{32!}+\cdots$ (50)

Thus:

$\frac{{\text{d}}^{4}g}{\text{d}{t}^{4}}\approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{t}^{4n}}{\left(4n\right)!}.$ (51)

Inspection of (48) and (50) demonstrates the solution:

$\frac{{\text{d}}^{4}g}{\text{d}{t}^{4}}=1-g\left(t\right).$ (52)

The numerical results of this are graphically illustrated in Figure 1.

5.2. Example 2

The FBCD technique can also be used to determine the approximate solution to this inhomogeneous first order integro-differential equation (IDE):

$\frac{\text{d}g}{\text{d}t}+\int g\left(t\right)\text{d}t={t}^{3}.$ (53)

Note that a straightforward ordinary differential equation (ODE) results:

$\frac{G\left(u\right)}{u}+uG\left(u\right)=3!{u}^{3}.$ (54)

Assume that $g\left(0\right)=0$. Solving for $G\left(u\right)$ :

$G\left(u\right)=\frac{6{u}^{3}}{\left(\frac{1}{u}+u\right)}=\frac{6{u}^{4}}{1+{u}^{2}}.$ (55)

Expressing the above as a power series:

$G\left(u\right)\approx 6\left({u}^{4}-{u}^{6}+{u}^{8}-{u}^{10}+{u}^{12}-{u}^{14}+{u}^{16}+\cdots \right).$ (56)

Representing the above using series notation:

$G\left(u\right)\approx 6\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}{u}^{\left(2n+4\right)}.$ (57)

By applying FBCD and substituting t for u results in the inversion of $G\left(u\right)$ to $g\left(t\right)$ :

$g\left(t\right)\approx 6\left(\frac{{t}^{4}}{4!}-\frac{{t}^{6}}{6!}+\frac{{t}^{8}}{8!}-\frac{{t}^{10}}{10!}+\frac{{t}^{12}}{12!}-\frac{{t}^{14}}{14!}+\frac{{t}^{16}}{16!}+\cdots \right).$ (58)

Therefore:

$g\left(t\right)\approx 6\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{t}^{\left(2n+4\right)}}{\left(2n+4\right)!}.$ (59)

Figure 1. The numerical solution to $\frac{{\text{d}}^{4}g}{\text{d}{t}^{4}}+g\left(t\right)=1$ is displayed.

And

$\frac{\text{d}g}{\text{d}t}\approx 6\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{t}^{\left(2n+3\right)}}{\left(2n+3\right)!}.$ (60)

And

$\int g\left(t\right)\text{d}t\approx 6\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{t}^{\left(2n+5\right)}}{\left(2n+5\right)!}.$ (61)

This approximate solution is shown in Figure 2 whereas the “components” of the equation are illustrated in Figure 3.

5.3. Example 3

Consider the following integro-differential equation (IDE) which incorporates the sine integral (Si) function:

$\frac{\text{d}g}{\text{d}t}+g\left(t\right)=\underset{0}{\overset{t}{\int }}\frac{\mathrm{sin}\left(\tau \right)}{\tau }\text{d}\tau .$ (62)

where: $\text{Si}\left(t\right)={\int }_{0}^{t}\frac{\mathrm{sin}\left(\tau \right)}{\tau }\text{d}\tau$. Note that that $g\left(0\right)=0$. The Sumudu transform of the above IDE is:

$\frac{G\left(u\right)}{u}+G\left(u\right)=\text{atan}\left(u\right).$ (63)

where $S\left[{\int }_{0}^{t}\frac{\mathrm{sin}\left(\tau \right)}{\tau }\text{d}\tau \right]=\text{atan}\left(u\right)$. This is derived in Appendix B. Rearranging (63):

Figure 2. An approximate solution to: $\frac{\text{d}g}{\text{d}t}+\int g\left(t\right)\text{d}t={t}^{3}$ is illustrated.

Figure 3. The above graph displays $g\left(t\right)$, $\frac{\text{d}g}{\text{d}t}$, $\int g\left(t\right)\text{d}t$, and ${t}^{3}$ from Example 2.

$G\left(u\right)\cdot \left[\frac{1}{u}+1\right]=\text{atan}\left(u\right).$ (64)

The above can be expressed as:

$G\left(u\right)\cdot \left[\frac{u+1}{u}\right]=\text{atan}\left(u\right).$ (65)

Thus:

$G\left(u\right)=\left[\frac{u}{u+1}\right]\text{atan}\left(u\right).$ (66)

Note that [14]:

$\text{atan}\left(u\right)\approx u-\frac{{u}^{3}}{3}+\frac{{u}^{5}}{5}-\frac{{u}^{7}}{7}+\cdots$ (67)

Therefore:

$\text{atan}\left(u\right)\approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{u}^{\left(2n+1\right)}}{\left(2n+1\right)}.$ (68)

Furthermore,

$\frac{u}{u+1}\approx \underset{k=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{k}{u}^{\left(k+1\right)}.$ (69)

Thus, the product of the above two power series, (68) and (69), yields an approximation for $G\left(u\right)$ :

$G\left(u\right)\approx \left[\underset{k=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{k}{u}^{\left(k+1\right)}\right]\cdot \left[\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{u}^{\left(2n+1\right)}}{\left(2n+1\right)}\right].$ (70)

Use of the Cauchy product, or discrete convolution with two truncated series, results in a double or “nested” series:

$G\left(u\right)\approx \underset{k=0}{\overset{m}{\sum }}\underset{n=0}{\overset{m}{\sum }}\left\{\left[{\left(-1\right)}^{k}{u}^{\left(k+1\right)}\right]\cdot \left[{\left(-1\right)}^{\left(m-n\right)}\frac{{u}^{\left(2\left(m-n\right)+1\right)}}{\left(2\left(m-n\right)+1\right)}\right]\right\}.$ (71)

This allows for a single expression for u as a power function and ultimately a power series. Thus, the two series, which have undergone convolution, can also be algebraically combined:

$G\left(u\right)\approx \underset{k=0}{\overset{m}{\sum }}\underset{n=0}{\overset{m}{\sum }}\left\{{\left(-1\right)}^{\left(k+m-n\right)}\frac{{u}^{\left(2\left(m-n\right)+k+2\right)}}{\left(2\left(m-n\right)+1\right)}\right\}.$ (72)

Use of FBCD and substitution of t for u, yields the approximate inversion of $G\left(u\right)$ :

$g\left(t\right)\approx \underset{k=0}{\overset{m}{\sum }}\underset{n=0}{\overset{m}{\sum }}\left\{{\left(-1\right)}^{\left(k+m-n\right)}\frac{{t}^{\left(2\left(m-n\right)+k+2\right)}}{\left(2\left(m-n\right)+1\right)\cdot \left(2\left(m-n\right)+k+2\right)!}\right\}.$ (73)

In addition, a double series which resulted from the discrete convolution of two series, is readily integrated and differentiated utilizing the same “term-by-term” methodology as a single series:

$\frac{\text{d}g}{\text{d}t}\approx \underset{k=0}{\overset{m}{\sum }}\underset{n=0}{\overset{m}{\sum }}\left\{{\left(-1\right)}^{\left(k+m-n\right)}\frac{{t}^{\left(2\left(m-n\right)+k+1\right)}}{\left(2\left(m-n\right)+1\right)\cdot \left(2\left(m-n\right)+k+1\right)!}\right\}.$ (74)

Using a value of $m=50$ results in range-limited approximation of the Si function as shown in Figure 4. Furthermore, $g\left(t\right)$ and $\frac{\text{d}g}{\text{d}t}$ are graphically displayed in Figure 5. It should be noted that the value of $m=50$ was utilized owing to the upper limits of the Mathcad factorial function.

5.4. Example 4

Consider the following third-order differential equation in which all initial conditions are equal to zero:

Figure 4. The sine integral function is approximated by $\frac{\text{d}g}{\text{d}t}+g\left(t\right)$ from Example 3.

Figure 5. The above graph illustrates $g\left(t\right)$ and $\frac{\text{d}g}{\text{d}t}$ from Example 3.

$\frac{{\text{d}}^{3}g}{\text{d}{t}^{3}}+\frac{{\text{d}}^{2}g}{\text{d}{t}^{2}}+\frac{\text{d}g}{\text{d}t}+g\left(t\right)=\frac{{t}^{2}{\text{e}}^{-t}}{2}.$ (75)

It is expressed within the Sumudu transform domain as:

$\frac{G\left(u\right)}{{u}^{3}}+\frac{G\left(u\right)}{{u}^{2}}+\frac{G\left(u\right)}{u}+G\left(u\right)=\frac{{u}^{2}}{{\left(1+u\right)}^{3}}.$ (76)

Note that the following relationship: $S\left[\frac{{t}^{2}{\text{e}}^{-t}}{2}\right]=\frac{{u}^{2}}{{\left(1+u\right)}^{3}}$ is from a pre-existing Sumudu transform table [8] [9].

Solving for $G\left(u\right)$ :

$G\left(u\right)=\frac{{u}^{2}}{\left(\frac{1}{{u}^{3}}+\frac{1}{{u}^{2}}+\frac{1}{u}+1\right){\left(1+u\right)}^{3}}.$ (77)

5.4.1. Solution Method 1: Series Representation of the Partial Fraction Expansion

Use of the partial fraction expansion method results in the following expression:

$G\left(u\right)=\frac{-u}{4\left({u}^{2}+1\right)}+\frac{5}{4\left(u+1\right)}-\frac{11}{4{\left(u+1\right)}^{2}}+\frac{2}{{\left(u+1\right)}^{3}}-\frac{1}{2{\left(u+1\right)}^{4}}.$ (78)

The above equation is then represented as a sum of five series:

$G\left(u\right)\approx \underset{h=1}{\overset{5}{\sum }}\text{ }\text{ }{G}_{h}\left(u\right).$ (79)

where:

${G}_{1}\left(u\right)=\frac{-u}{4\left({u}^{2}+1\right)}\approx \left(\frac{-1}{4}\right)\underset{j=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{j}{u}^{\left(2j+1\right)},$ (80)

${G}_{2}\left(u\right)=\frac{5}{4\left(u+1\right)}\approx \left(\frac{5}{4}\right)\underset{k=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{k}{u}^{k},$ (81)

${G}_{3}\left(u\right)=\frac{-11}{4{\left(u+1\right)}^{2}}\approx \left(\frac{-11}{4}\right)\underset{l=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{l}\left(l+1\right){u}^{l},$ (82)

${G}_{4}\left(u\right)=\frac{2}{{\left(u+1\right)}^{3}}\approx \underset{m=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{m}\left(m+1\right)\left(m+2\right){u}^{m},$ (83)

and:

${G}_{5}\left(u\right)=\frac{-1}{2{\left(u+1\right)}^{4}}\approx \left(\frac{1}{12}\right)\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{\left(n+1\right)}\left(n+1\right)\left(n+2\right)\left(n+3\right){u}^{n}.$ (84)

Use of FBCD and substitution of t for u yields the following five power series:

${g}_{1}\left(t\right)\approx \left(\frac{-1}{4}\right)\underset{j=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{j}\frac{{t}^{\left(2j+1\right)}}{\left(2j+1\right)!},$ (85)

${g}_{2}\left(t\right)\approx \left(\frac{5}{4}\right)\underset{k=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{k}\frac{{t}^{k}}{k!},$ (86)

${g}_{3}\left(t\right)\approx \left(\frac{-11}{4}\right)\underset{l=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{l}\left(l+1\right)\frac{{t}^{l}}{l!},$ (87)

${g}_{4}\left(t\right)\approx \underset{m=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{m}\left(m+1\right)\left(m+2\right)\frac{{t}^{m}}{m!},$ (88)

and:

${g}_{5}\left(t\right)\approx \left(\frac{1}{12}\right)\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{\left(n+1\right)}\left(n+1\right)\left(n+2\right)\left(n+3\right)\frac{{t}^{n}}{n!}.$ (89)

So that:

$g\left(t\right)\approx \underset{h=1}{\overset{5}{\sum }}\text{ }\text{ }{g}_{h}\left(t\right).$ (90)

5.4.2. Solution Method 2: Use of Discrete Convolution (The Cauchy Product)

Reiterating the original Sumudu transform equation:

$G\left(u\right)=\frac{{u}^{2}}{\left(\frac{1}{{u}^{3}}+\frac{1}{{u}^{2}}+\frac{1}{u}+1\right){\left(1+u\right)}^{3}}.$ (91)

Algebraic rearrangement subsequently yields the product of two rational functions:

$G\left(u\right)=\frac{{u}^{5}}{\left(1+u+{u}^{2}+{u}^{3}\right)}\cdot \frac{1}{{\left(1+u\right)}^{3}}.$ (92)

Each of these rational functions can be approximated using infinite series representations:

$\frac{{u}^{5}}{\left(1+u+{u}^{2}+{u}^{3}\right)}\approx \left({u}^{5}-{u}^{6}+{u}^{9}-{u}^{10}+{u}^{13}+\cdots \right),$ (93)

and

$\frac{1}{{\left(1+u\right)}^{3}}\approx \left(1-3u+6{u}^{2}-10{u}^{3}+15{u}^{4}+\cdots \right).$ (94)

Therefore:

$G\left(u\right)\approx \left({u}^{5}-{u}^{6}+{u}^{9}-{u}^{10}+{u}^{13}+\cdots \right)\cdot \left(1-3u+6{u}^{2}-10{u}^{3}+15{u}^{4}+\cdots \right).$ (95)

Note that:

$\left({u}^{5}-{u}^{6}+{u}^{9}-{u}^{10}+{u}^{13}+\cdots \right)=\left[\underset{k=0}{\overset{\infty }{\sum }}\left({u}^{\left(4k+5\right)}\right)-\underset{n=0}{\overset{\infty }{\sum }}\left({u}^{\left(4n+6\right)}\right)\right].$ (96)

and:

$\left(1-3u+6{u}^{2}-10{u}^{3}+15{u}^{4}+\cdots \right)=\left[\frac{1}{2}\underset{p=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{p}\left(p+1\right)\left(p+2\right){u}^{p}\right].$ (97)

Therefore:

$G\left(u\right)\approx \left[\underset{k=0}{\overset{\infty }{\sum }}\left({u}^{\left(4k+5\right)}\right)-\underset{n=0}{\overset{\infty }{\sum }}\left({u}^{\left(4n+6\right)}\right)\right]\cdot \left[\frac{1}{2}\underset{p=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{p}\left(p+1\right)\left(p+2\right){u}^{p}\right].$ (98)

Making use of the distributive property:

$\begin{array}{c}G\left(u\right)\approx \left\{\frac{1}{2}\left[\underset{k=0}{\overset{\infty }{\sum }}\left({u}^{\left(4k+5\right)}\right)\right]\cdot \left[\underset{p=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{p}\left(p+1\right)\left(p+2\right){u}^{p}\right]\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}-\frac{1}{2}\left[\underset{n=0}{\overset{\infty }{\sum }}\left({u}^{\left(4n+6\right)}\right)\right]\cdot \left[\underset{p=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{p}\left(p+1\right)\left(p+2\right){u}^{p}\right]\right\}.\end{array}$ (99)

Applying discrete convolution (the Cauchy product) with two truncated series, each of m terms, yields:

$\begin{array}{c}G\left(u\right)\approx \left\{\frac{1}{2}\underset{k=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left[{u}^{\left(4k+5\right)}{\left(-1\right)}^{\left(m-p\right)}\left(m-p+1\right)\left(m-p+2\right){u}^{\left(m-p\right)}\right]\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}-\frac{1}{2}\underset{n=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left[{u}^{\left(4n+6\right)}{\left(-1\right)}^{\left(m-p\right)}\left(m-p+1\right)\left(m-p+2\right){u}^{\left(m-p\right)}\right]\right\}.\end{array}$ (100)

Utilizing further algebraic simplification:

$\begin{array}{c}G\left(u\right)\approx \left\{\frac{1}{2}\underset{k=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left[{u}^{\left(4k+5+m-p\right)}{\left(-1\right)}^{\left(m-p\right)}\left(m-p+1\right)\left(m-p+2\right)\right]\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}-\frac{1}{2}\underset{n=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left[{u}^{\left(4n+6+m-p\right)}{\left(-1\right)}^{\left(m-p\right)}\left(m-p+1\right)\left(m-p+2\right)\right]\right\}.\end{array}$ (101)

The use of FBCD and substitution of t for u yields the approximate solution:

$\begin{array}{c}g\left(t\right)\approx \left\{\frac{1}{2}\underset{k=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left[\frac{{t}^{\left(4k+5+m-p\right)}}{\left(4k+5+m-p\right)!}{\left(-1\right)}^{\left(m-p\right)}\left(m-p+1\right)\left(m-p+2\right)\right]\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}-\frac{1}{2}\underset{n=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left[\frac{{t}^{\left(4n+6+m-p\right)}}{\left(4n+6+m-p\right)!}{\left(-1\right)}^{\left(m-p\right)}\left(m-p+1\right)\left(m-p+2\right)\right]\right\}.\end{array}$ (102)

“Term-by-term” differentiation results in the following:

$\begin{array}{c}\frac{\text{d}g}{\text{d}t}\approx \left\{\frac{1}{2}\underset{k=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left[\frac{{t}^{\left(4k+4+m-p\right)}}{\left(4k+4+m-p\right)!}{\left(-1\right)}^{\left(m-p\right)}\left(m-p+1\right)\left(m-p+2\right)\right]\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}-\frac{1}{2}\underset{n=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left[\frac{{t}^{\left(4n+5+m-p\right)}}{\left(4n+5+m-p\right)!}{\left(-1\right)}^{\left(m-p\right)}\left(m-p+1\right)\left(m-p+2\right)\right]\right\},\end{array}$ (103)

$\begin{array}{c}\frac{{\text{d}}^{2}g}{\text{d}{t}^{2}}\approx \left\{\frac{1}{2}\underset{k=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left[\frac{{t}^{\left(4k+3+m-p\right)}}{\left(4k+3+m-p\right)!}{\left(-1\right)}^{\left(m-p\right)}\left(m-p+1\right)\left(m-p+2\right)\right]\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}-\frac{1}{2}\underset{n=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left[\frac{{t}^{\left(4n+4+m-p\right)}}{\left(4n+4+m-p\right)!}{\left(-1\right)}^{\left(m-p\right)}\left(m-p+1\right)\left(m-p+2\right)\right]\right\},\end{array}$ (104)

$\begin{array}{c}\frac{{\text{d}}^{3}g}{\text{d}{t}^{3}}\approx \left\{\frac{1}{2}\underset{k=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left[\frac{{t}^{\left(4k+2+m-p\right)}}{\left(4k+2+m-p\right)!}{\left(-1\right)}^{\left(m-p\right)}\left(m-p+1\right)\left(m-p+2\right)\right]\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}-\frac{1}{2}\underset{n=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left[\frac{{t}^{\left(4n+3+m-p\right)}}{\left(4n+3+m-p\right)!}{\left(-1\right)}^{\left(m-p\right)}\left(m-p+1\right)\left(m-p+2\right)\right]\right\}.\end{array}$ (105)

The results of this are graphically illustrated in Figure 6 and Figure 7. Note that a value of $m=30$ has been utilized owing to the upper limits of the Mathcad factorial function. Although not illustrated, both method 1 and method 2 yielded numerical results with similar range-limited accuracy.

5.5. Example 5

The following double integral equation can be expressed as an ordinary differential equation (ODE) using a Sumudu transform and the shift theorem:

$\iint g\left(t\right)\text{d}t\text{d}t+t\cdot g\left(t\right)=0.$ (106)

Thus:

${u}^{2}G\left(u\right)+u\left[G\left(u\right)+u\frac{\text{d}G}{\text{d}u}\right]=0.$ (107)

Rearranging:

$G\left(u\right)\left[{u}^{2}+u\right]=-{u}^{2}\frac{\text{d}G}{\text{d}u}.$ (108)

Separating variables and simplifying:

$-\left[1+\frac{1}{u}\right]\text{d}u=\frac{\text{d}G}{G}.$ (109)

Figure 6. The function $g\left(t\right)$ and its first, second, and third derivatives are illustrated from Example 4.

Figure 7. The approximate and exact solutions for Example 4 are illustrated.

Integrating both sides:

$-{\int }^{\text{​}}\left[1+\frac{1}{u}\right]\text{d}u={\int }^{\text{​}}\frac{\text{d}G}{G}.$ (110)

This subsequently yields:

$-\left[u+\mathrm{ln}\left(u\right)+C\right]=\text{ln}\left\{G\left(u\right)\right\}.$ (111)

Exponentiation results in:

$G\left(u\right)={\text{e}}^{-\left[u+\mathrm{ln}\left(u\right)+C\right]}={\text{e}}^{-u}{\text{e}}^{\text{ln}\left(\frac{1}{u}\right)}{\text{e}}^{-C}.$ (112)

Allowing the constant of integration, C, to equal zero yields:

$G\left(u\right)=\frac{1}{u}{\text{e}}^{-u}.$ (113)

The above equation can subsequently be expressed as an infinite series:

$G\left(u\right)\approx \frac{1}{u}\left(1+\frac{\left(-u\right)}{1!}+\frac{{\left(-u\right)}^{2}}{2!}+\frac{{\left(-u\right)}^{3}}{3!}+\frac{{\left(-u\right)}^{4}}{4!}+\cdots \right).$ (114)

Distribution of the $\frac{1}{u}$ term yields:

$G\left(u\right)\approx \left(\frac{1}{u}-\frac{1}{1!}+\frac{u}{2!}-\frac{{u}^{2}}{3!}+\frac{{u}^{3}}{4!}+\cdots \right).$ (115)

Thus:

$G\left(u\right)\approx \frac{1}{u}+\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{\left(n+1\right)}\frac{{u}^{n}}{\left(n+1\right)!}.$ (116)

The above Sumudu transform can be inverted by separating it into two distinct functions within the u-domain. Firstly:

${S}^{-1}\left[\frac{1}{u}\right]=\delta \left(t\right).$ (117)

where $\delta \left(t\right)$ is the Dirac delta function.

Secondly, combining the Sumudu transform ${S}^{-1}\left[\frac{1}{u}\right]=\delta \left(t\right)$ along with FBCD for the remaining terms of (116) yields the following:

$g\left(t\right)\approx \delta \left(t\right)+\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{\left(n+1\right)}\frac{{t}^{n}}{\left(n!\right)\cdot \left(n+1\right)!},\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}t>0.$ (118)

Additionally, t has replaced u in the above equation as well. Subsequent integration yields:

$\int g\left(t\right)\text{d}t\approx H\left(t\right)+\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{\left(n+1\right)}\frac{{t}^{\left(n+1\right)}}{{\left[\left(n+1\right)!\right]}^{2}},\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}t>0.$ (119)

where $H\left(t\right)$ is the Heaviside step function which is the indefinite integral of the Dirac delta function. The double integral of (118) is:

$\iint g\left(t\right)\text{d}t\text{d}t\approx t+\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{\left(n+1\right)}\frac{{t}^{\left(n+2\right)}}{\left(n+2\right)!\cdot \left(n+1\right)!}.$ (120)

Note that the variable t is the indefinite integral of the Heaviside step function. Furthermore, t is also the double indefinite integral of the Dirac delta function. Lastly, the constants of integration for (119) and (120) are equal to zero. Figure 8 and Figure 9 illustrate the solution of this example.

5.6. Example 6

The aforementioned techniques can also be applied to certain partial differential equations (PDEs). As an example:

$\frac{\partial g}{\partial x}-\frac{\partial g}{\partial t}=x.$ (121)

The above equation can be readily converted to an ODE using the Sumudu transform:

$\frac{\text{d}G}{\text{d}x}-\frac{G}{u}=x.$ (122)

Figure 8. The function $g\left(t\right)$, from Example 5, is graphically displayed.

Figure 9. Based on Example 5, $t\cdot g\left(t\right)$ and $\iint g\left(t\right)\text{d}t\text{d}t$ are additive inverses.

An integrating factor is then utilized to take advantage of the product rule:

${\text{e}}^{{\int }^{\text{​}}\left(\frac{-1}{u}\right)\text{d}x}={\text{e}}^{\left(\frac{-x}{u}\right)}.$ (123)

Thus:

$\frac{\text{d}}{\text{d}x}\left(G\left(x,u\right){\text{e}}^{\left(\frac{-x}{u}\right)}\right)=x{\text{e}}^{\left(\frac{-x}{u}\right)}.$ (124)

Expressing the above equation as two separate indefinite integrals:

$\int \text{d}\left(G\left(x,u\right){\text{e}}^{\left(\frac{-x}{u}\right)}\right)=\int x{\text{e}}^{\left(\frac{-x}{u}\right)}\text{d}x\text{ }\text{ }.$ (125)

This yields an expression such that the integrating factor now cancels from both sides of the resulting equation:

$G\left(x,u\right){\text{e}}^{\left(\frac{-x}{u}\right)}=-{u}^{2}{\text{e}}^{\left(\frac{-x}{u}\right)}-ux{\text{e}}^{\left(\frac{-x}{u}\right)}.$ (126)

The Sumudu transform is then simplified:

$G\left(x,u\right)=-\left[ux+{u}^{2}\right].$ (127)

Use of FBCD and substitution of t for u yields:

$g\left(x,t\right)=-\left(\frac{t}{1!}x+\frac{{t}^{2}}{2!}\right)=-\left(tx+\frac{{t}^{2}}{2}\right).$ (128)

The partial derivatives of (128) demonstrate the solution:

$\frac{\partial g}{\partial x}=-t$ (129)

and

$\frac{\partial g}{\partial t}=-x-t=-\left(x+t\right).$ (130)

5.7. Example 7

The Sumudu transform, with FBCD, and can also be utilized with this mixed partial integro-differential equation (IDE):

$\frac{{\partial }^{2}g}{\partial x\partial t}+\int g\left(x,t\right)\text{d}t=0.$ (131)

Expressing the above results in an ODE within the Sumudu domain:

$\left(\frac{\text{d}G}{\text{d}x}\right)\frac{1}{u}+uG=0.$ (132)

Separating variables yields:

$\frac{\text{d}G}{G}=-{u}^{2}\text{d}x.$ (133)

Integrating both sides:

$\int \frac{\text{d}G}{G}=-\int {u}^{2}\text{d}x\text{ }\text{ }.$ (134)

This results in an expression which utilizes the natural log function:

$\mathrm{ln}\left(G\right)=-{u}^{2}x+C.$ (135)

Exponentiation then yields $G\left(u,x\right)$ :

$G\left(u,x\right)={\text{e}}^{-{u}^{2}x+C}.$ (136)

With $C=0$ the above equation can then be approximated as a power series:

$G\left(u,x\right)\approx \frac{1}{0!}-\frac{{u}^{2}x}{1!}+\frac{{u}^{4}{x}^{2}}{2!}-\frac{{u}^{6}{x}^{2}}{3!}+\cdots$ (137)

Equivalently:

$G\left(u,x\right)\approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{u}^{2n}{x}^{n}}{n!}.$ (138)

Utilizing FBCD and substitution of t for u results in the following expression:

$g\left(t,x\right)\approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{t}^{2n}{x}^{n}}{n\text{!}\cdot \left(2n\right)!}.$ (139)

Therefore:

$\frac{\partial g}{\partial t}\approx \underset{n=1}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{t}^{\left(2n-1\right)}{x}^{n}}{n\text{!}\cdot \left(2n-1\right)!}.$ (140)

and

$\frac{{\partial }^{2}g}{\partial t\partial x}\approx \underset{n=1}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{t}^{\left(2n-1\right)}{x}^{\left(n-1\right)}}{\left(n-1\right)\text{!}\cdot \left(2n-1\right)!}.$ (141)

Note that both infinite series, in (140) and (141), use indices starting at $n=1$ to avoid a negative factorial. Furthermore:

$\int g\left(t,x\right)\text{d}t\approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{t}^{\left(2n+1\right)}{x}^{n}}{n\text{!}\cdot \left(2n+1\right)!}.$ (142)

Figure 10 and Figure 11 illustrate two solutions to this example.

5.8. Example 8

Consider a partial IDE:

$g\left(x,t\right)+\frac{\partial g\left(x,t\right)}{\partial x}+\int g\left(x,t\right)\text{d}t=0.$ (143)

Use of a Sumudu transform leads to an ODE:

$G+\frac{\text{d}G}{\text{d}x}+uG=0.$ (144)

Rearrangement yields:

$G\left(1+u\right)=-\frac{\text{d}G}{\text{d}x}.$ (145)

Separating variables:

$\frac{\text{d}G}{G}=-\left(1+u\right)\text{d}x.$ (146)

Integrating both sides:

$\int \frac{\text{d}G}{G}=-\int \left(1+u\right)\text{d}x\text{ }\text{ }.$ (147)

Thus:

$\mathrm{ln}\left(G\right)=-\left(1+u\right)x+C.$ (148)

Exponentiation yields:

$G\left(x,u\right)={\text{e}}^{-\left(1+u\right)x}{\text{e}}^{C}.$ (149)

Allowing C to equal zero:

$G\left(x,u\right)={\text{e}}^{-\left(1+u\right)x}={\text{e}}^{-x}{\text{e}}^{-ux}.$ (150)

Note that ${\text{e}}^{-\left(1+u\right)x}$ cannot be readily represented as a power series with the form of (6). However, ${\text{e}}^{-x}{\text{e}}^{-ux}$ can be approximated as the product of two power series each of which uses the format of (6):

$G\left(x,u\right)\approx \underset{n=0}{\overset{\infty }{\sum }}\left[{\left(-1\right)}^{n}\frac{{x}^{n}}{n!}\right]\cdot \underset{p=0}{\overset{\infty }{\sum }}\left[{\left(-1\right)}^{p}\frac{{x}^{p}{u}^{p}}{p!}\right].$ (151)

Figure 10. Examination of the above graph demonstrates how $\frac{{\partial }^{2}g}{\partial t\partial x}$ and $\int g\left(x,t\right)\text{d}t$ are additive inverses from Example 7. This graph is based upon $x=1$ and $0\le t\le 10$.

Figure 11. Inspection of the above graph, from Example 7, illustrates how $\frac{{\partial }^{2}g}{\partial t\partial x}$ and $\int g\left(x,t\right)\text{d}t$ are again additive inverses. In this case, $t=1$ and $0\le x\le 10$.

Discrete convolution (the Cauchy product) can then be utilized to combine the product of the above two series into a truncated double series:

$G\left(x,u\right)\approx \underset{n=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left\{\left[{\left(-1\right)}^{n}\frac{{x}^{n}}{n!}\right]\cdot \left[{\left(-1\right)}^{\left(m-p\right)}\frac{{x}^{\left(m-p\right)}{u}^{\left(m-p\right)}}{\left(m-p\right)!}\right]\right\}.$ (152)

Algebraically combining terms yields:

$G\left(x,u\right)\approx \underset{n=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left\{{\left(-1\right)}^{\left(n+m-p\right)}\frac{{x}^{\left(n+m-p\right)}{u}^{\left(m-p\right)}}{\left(n!\right)\cdot \left(m-p\right)!}\right\}.$ (153)

Use of FBCD, with substitution of t for u, produces the solution:

$g\left(x,t\right)\approx \underset{n=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left\{{\left(-1\right)}^{\left(n+m-p\right)}\frac{{x}^{\left(n+m-p\right)}{t}^{\left(m-p\right)}}{\left(n!\right)\cdot {\left(\left(m-p\right)!\right)}^{2}}\right\}.$ (154)

Figure 12. Using Example 8, sum of $g\left(t,x\right)$, $\frac{\partial g\left(x,t\right)}{\partial x}$, and $\int g\left(x,t\right)\text{d}t$ is equal to zero. Note that: $t=1$ and $0\le x\le 10$.

Figure 13. Again, using Example 8, the sum of $g\left(t,x\right)$, $\frac{\partial g\left(x,t\right)}{\partial x}$, and $\int g\left(x,t\right)\text{d}t$ is also equal to zero. Note that: $x=1$ and $0\le t\le 10$.

Therefore:

$\frac{\partial g\left(x,t\right)}{\partial x}=\underset{n=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left\{{\left(-1\right)}^{\left(n+m-p\right)}\frac{{x}^{\left(n+m-p-1\right)}{t}^{\left(m-p\right)}}{\left(n!\right)\cdot {\left(\left(m-p\right)!\right)}^{2}}\left(n+m-p\right)\right\},$ (155)

and:

$\int g\left(x,t\right)\text{d}t\approx \underset{n=0}{\overset{m}{\sum }}\underset{p=0}{\overset{m}{\sum }}\left\{{\left(-1\right)}^{\left(n+m-p\right)}\frac{{x}^{\left(n+m-p\right)}{t}^{\left(m-p+1\right)}}{\left(n!\right)\cdot {\left(\left(m-p\right)!\right)}^{2}\left(m-p+1\right)}\right\}.$ (156)

Figure 12 and Figure 13 demonstrate the solution. Note that a value of $m=50$ has been utilized oweing to the numerical limits of Mathcad.

6. Conclusion

By taking advantage of the relationship between a geometric power series in the u-domain and its inversion back to the t-domain utilizing FBCD, an approximate range-limited solution to certain differential equations as well as integro-differential equations may be obtained. This process may also be facilitated with the utilization of convolution. Further research and applications of this technique, particularly with non-linear and fractional differential equations, may be warranted.

Appendix A: Determining the Sumudu Transform of tn Using Its Laplace Transform

The Laplace transform of ${t}^{n}$ is:

$L\left[{t}^{n}\right]=n!{s}^{-\left(n+1\right)}.$ (A1)

Using (5) the corresponding Sumudu transform is therefore:

$S\left[{t}^{n}\right]=n!\left(\frac{1}{u}\right){\left(\frac{1}{u}\right)}^{-\left(n+1\right)}=n!\left(\frac{1}{u}\right){\left(u\right)}^{\left(n+1\right)}.$ (A2)

Simplifying the above:

$S\left[{t}^{n}\right]=n!{\left(u\right)}^{n}.$ (A3)

For integer values of $n\ge 0$. Therefore, the use of FBCD with substitution of t for u, leads to inversion of the above Sumudu transform:

$\frac{S\left[{t}^{n}\right]}{n!}={\frac{n!{\left(u\right)}^{n}}{n!}|}_{t=u}={t}^{n}.$ (A4)

Appendix B: The Sumudu Transform of the Sine Integral (Si) Function

Note that the Si function is based upon the following:

$\text{sinc}\left(x\right)=\frac{\text{sin}\left(x\right)}{x}\approx \frac{1}{x}\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{x}^{\left(2n+1\right)}}{\left(2n+1\right)!}=\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{x}^{\left(2n\right)}}{\left(2n+1\right)!}.$ (B1)

Using (31), $\text{sin}\left(x\right)$ is approximated as:

$\text{sin}\left(x\right)\approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{x}^{\left(2n+1\right)}}{\left(2n+1\right)!}.$ (B2)

Therefore:

$\text{Si}\left(t\right)={\int }_{0}^{t}\text{sinc}\left(\tau \right)\text{d}\tau ={\int }_{0}^{t}\frac{\text{sin}\left(\tau \right)}{\tau }\text{d}\tau \approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{t}^{\left(2n+1\right)}}{\left(2n+1\right)\text{!}\cdot \left(2n+1\right)}.$ (B3)

Use of “factorial-based” coefficient amplification yields the following Sumudu transform:

$S\left[{\int }_{0}^{t}\frac{\text{sin}\left(\tau \right)}{\tau }\text{d}\tau \right]=S\left[\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{t}^{\left(2n+1\right)}}{\left(2n+1\right)\text{!}\cdot \left(2n+1\right)}\right]=\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{u}^{\left(2n+1\right)}}{\left(2n+1\right)}.$ (B4)

Note that the factorial-based coefficient amplification results in a cancellation, in both the numerator and denominator, of the above expression:

$\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{\left(2n+1\right)!{u}^{\left(2n+1\right)}}{\left(2n+1\right)!\left(2n+1\right)}=\underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{u}^{\left(2n+1\right)}}{\left(2n+1\right)}.$ (B5)

It is well established that [14]:

$\text{atan}\left(u\right)\approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{u}^{\left(2n+1\right)}}{\left(2n+1\right)},\text{\hspace{0.17em}}\text{\hspace{0.17em}}|u|<1.$ (B6)

Therefore:

$S\left[{\int }_{0}^{t}\frac{\text{sin}\left(\tau \right)}{\tau }\text{d}\tau \right]=\text{atan}\left(u\right)\approx \underset{n=0}{\overset{\infty }{\sum }}{\left(-1\right)}^{n}\frac{{u}^{\left(2n+1\right)}}{\left(2n+1\right)}.$ (B7)

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

 [1] Kreyszig, E. (1999) Advanced Engineering Mathematics. 8th Edition, Wiley, Hoboken. [2] Atlas, G., Li, K.-J.J., Amin, S. and Hahn, R.G. (2017) Development and Retrospective Clinical Assessment of a Patient-Specific Closed-Form Integro-Differential Equation Model of Plasma Dilution. Biomedical Engineering and Computational Biology, 8, 1-20. https://doi.org/10.1177/1179597217730305 [3] Atlas, G. (2008) Development and Application of a Logistic-Based Systolic Model for Hemodynamic Measurements Using the Esophageal Doppler Monitor. Cardiovascular Engineering, 8, 159-173. https://doi.org/10.1007/s10558-008-9057-9 [4] Dyke, P.P. (2014) An Introduction to Laplace Transforms and Fourier Series. Springer, New York. https://doi.org/10.1007/978-1-4471-6395-4 [5] Schiff, J.L. (2013) The Laplace Transform: Theory and Applications. Springer, New York. [6] Hassanzadeh, H. and Pooladi-Darvish, M. (2007) Comparison of Different Numerical Laplace Inversion Methods for Engineering Applications. Applied Mathematics and Computation, 189, 1966-1981. https://doi.org/10.1016/j.amc.2006.12.072 [7] Crump, K.S. (1976) Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation. Journal of the Association for Computing Machinery, 23, 89-96. https://doi.org/10.1145/321921.321931 [8] Al-Shuaibi, A. (2001) Inversion of the Laplace Transform via Post-Widder Formula. Integral Transforms and Special Functions, 11, 225-232. https://doi.org/10.1080/10652460108819314 [9] Watugala, G.K. (1993) Sumudu Transform: A New Integral Transform to Solve Differential Equations and Control Engineering Problems. International Journal of Mathematical Education in Science and Technology, 24, 35-43. https://doi.org/10.1080/0020739930240105 [10] Belgacem, F.B.M., Karaballi, A.A. and Kalla, S.L. (2003) Analytical Investigations of the Sumudu Transform and Applications to Integral Production Equations. Mathematical Problems in Engineering, 3, 103-118. https://doi.org/10.1155/S1024123X03207018 [11] Belgacem, F.B.M. and Karaballi, A.A. (2006) Sumudu Transform Fundamental Properties Investigations and Applications. Journal of Applied Mathematics and Stochastic Analysis, 1-23. https://doi.org/10.1155/JAMSA/2006/91083 [12] Johnson, D. and Johnson, J. (1971) Applications of Cauchy Product in Sampled-Data Systems. IEEE Transactions on Education, 2, 76. https://doi.org/10.1109/TE.1971.4320659 [13] Hata, M. (2016) Problems and Solutions in Real Analysis. 2nd Edition, World Scientific, Singapore. [14] Nimbran, A.S. (2010) On the Derivation of Machin-Like Arctangent Identities for Computing Pi (π). The Mathematics Student, 79, 171-186.

 customer@scirp.org +86 18163351462(WhatsApp) 1655362766 Paper Publishing WeChat