1,092
Views
4
CrossRef citations to date
0
Altmetric
Research Article

A novel scheme for the hyperbolic partial differential equation through Fibonacci wavelets

ORCID Icon &
Pages 1112-1132 | Received 25 Jun 2022, Accepted 31 Oct 2022, Published online: 11 Nov 2022

ABSTRACT

In this study, we generated the operational matrices of integration based on the Fibonacci wavelets through the concept of linear algebra and developed the novel technique known as the Fibonacci wavelet collocation method (FWCM). The proposed approach extracts the numerical solution of linear hyperbolic partial differential equations (HPDEs). This technique is an efficient and emerging numerical algorithm that converts the considered problem into a system of equations of algebraic type. We obtained desired numerical results in solving this system of algebraic equations with the help of the Newton–Raphson technique. We solved the five problems concerning a minimum level of resolution to strengthen our results. The obtained outcome is compared with the exact and other numerical solutions available in the literature through tables and graphs. The tables and graphical representations clarify the accuracy and efficiency of the proposed technique. Convergence analysis for the proposed method is drawn in terms of the theorems.

2010 MATHEMATICS SUBJECT CLASSIFICATIONS:

1. Introduction

A Partial differential equation (PDE) is the mathematical model of real-world physical, chemical, and biological problems and describes many physical phenomena in nature. In recent years, PDE has become a language of many fields such as thermodynamics, electrostatics, electrodynamics, elasticity, general relativity, quantum mechanics, sound, heat, traffic flow [Citation1], electroshock therapy [Citation2], medicine [Citation3], waste-water treatment [Citation4], chemical [Citation5], fluid mechanics [Citation6-8], engineering [Citation9], and biology [Citation10,Citation11]. In the classification of PDEs, we considered three sorts of PDEs such as parabolic, hyperbolic, and elliptic. Out of these, the Hyperbolic type gets much more attention from researchers due to its tremendous applications in industry, atomic physics, biology, aerospace, and engineering problems such as vibrations of structures, beams, and buildings. The term “hyperbolic” was typically used to refer to a certain class of nth-order equations in the nomenclature of classical partial differential equations.

Consider an equation aUxx + bUxt + cUtt=0, the coefficients a,b,c depend on the values of x, the equation will be hyperbolic in a region if b24ac>0. HPDEs are built as mathematical models that describe wave phenomena with more applications in various fields such as optical devices, earth sciences (oil exploration), electromagnetic radiation [Citation12], fluid mechanics [Citation13,Citation14], and geosciences [Citation15], applied mathematics, physics, and engineering. HPDEs come in various forms, such as the wave equation and the telegraph equation, etc. The wave equation describes waves like sound, water, and seismic waves that occur in classical physics. The solutions of these equations based on continuum mechanics are usually singular, including discontinuity, shock discontinuity, etc. For such models, anticipating the exact solution always is not possible. So, numerical techniques are employed to study those problems. To solve such equations, we need to pay a high computational cost and increased CPU burden, and it is complicated to solve engineering physics problems with a certain scale. In recent years researchers have been paying close attention to HPDEs’ solutions. To solve these hyperbolic equations, a variety of numerical techniques were offered, including semi-analytical methods, finite difference techniques, spectral methods, and finite element processes. Because of the above analysis and the special properties of HPDEs, people began to seek an efficient technique called the wavelet method to avoid these singular extreme points. Here wavelet techniques are very simple and minimises the computational cost. Due to this, we considered HPDE problems through the wavelet technique.

Consider the general form of the first-order linear hyperbolic equation (1) S(x,t)t+S(x,t)x+S(x,t)=f(x,t),0x1,0t1(1) subject to the conditions: (2) S(x,0)=p(x),S(0,t)=q(t),S(a,t)=r(t),0x1,0t1(2) This type of HPDE is solved through various methods [Citation16-20]. We solve these hyperbolic equations by the Fibonacci wavelet collocation method.

Wavelet analysis is a new and emerging field in applied and computational numerical exploration. The subject of wavelet analysis has recently attracted a lot of interest from mathematicians across the world. Wavelets are mathematical functions that aid in dividing data into distinct recurrence sections and urge the exploration of each data segment with a goal proportional to its scale. Wavelets outperform traditional Fourier techniques when analyzing physical situations with discontinuities and strong spikes. The wavelet transform is a new mathematical approach for decomposing a signal into many lower-resolution levels by adjusting a single wavelet function's scaling and shifting parameters. The wavelets are classified as discrete and continuous. The wavelet approach gives better results than other methods. Comparatively, continuous wavelets are quite better than discrete wavelets. Some of the literatures related to wavelet methods are: Laguerre wavelet method [Citation21-23], Gegenbauer-wavelet collocation method [Citation22], Taylor-wavelet collocation method [Citation22,Citation24], Gaussian wavelet-based method [Citation25], Legendre wavelet-based numerical approach [Citation26], Hermite Wavelet Method [Citation27-29], Génie Rural à 6 paramètres Journalier (GR6J)-wavelet-based-genetic algorithm [Citation30], Wavelet-based decomposition electro-hysterogram signals [Citation31], wavelet-based Granger causality approach [Citation32], Haar wavelets hybrid collocation technique [Citation33], Genocchi collocation technique [Citation34], Implicit wavelet collocation method [Citation35]. In the applied and computational sciences, Fibonacci wavelets have become an emerging tool for finding efficient numerical solutions. Fibonacci wavelets are continuous wavelets. They have been used in various fields, including data compression, signal analysis, and many more. The Fibonacci wavelet is a function defined in different scales, and it has tremendous applications due to its properties like orthogonality, compactly supported and vanishing moment, etc. The projected method is most suitable for studying solutions with discontinuity and sharp edges. We make a window for the function (at the point of discontinuity and sharp edges) then we apply this method to get information about such function. Presently, we have not found any numerical techniques like our proposed new method. Moreover, this paper says that the wavelet theory will be a tool for studying numerical problems. Also, this method can apply to higher-order equations with slight modifications. Due to these advantages, Fibonacci wavelets gathered the attention of many researchers towards it. In our literature survey, we found the following treasure related to the Fibonacci wavelet approach: two classes of time-varying delay problems [Citation36], time-fractional telegraph equations with Dirichlet boundary conditions [Citation37], nonlinear Stratonovich Volterra integral equations [Citation38], Pennes bioheat transfer equation [Citation39], fractional optimal control problems with bibliometric analysis [Citation40], high-order linear Fredholm integro-differential-difference equations [Citation41], class of systems of nonlinear differential equations [Citation42], nonlinear Volterra integral equations [Citation43], time-fractional bioheat transfer model [Citation44]. No one considered the HPDEs through the Fibonacci wavelet. This impetus us to propose the Fibonacci wavelet method for HPDEs.

The organization of the article is as follows. In section 2, the Preliminaries of the Fibonacci wavelets and their operational matrix of integration are discussed. The convergence analysis is presented in section 3. Section 4 contains the method of solution and applications of the proposed method implemented in section 5. Finally, conclusions are drawn in section 6.

2. Fibonacci wavelet and its operational matrix of integration

2.1. Fibonacci wavelets

To build a family of functions, the mother wavelets dilate and translate themselves. We coined the term wavelets to describe them. The family's wavelets are as follows: (3) Ψp,q(t)=|p|12Ψ(tqp),p,qR,p0(3) The dilation and translation parameters are indicated by the letters p and q, respectively. Furthermore, q varies continuously.

If we choose p=p0k,q=np0kq0,p0>1,q0>1, and n and k are positive integers, the discrete wavelet family is introduced as, (4) Ψk,n(t)=|p0|k2Ψ(p0ktnq0),(4) where Ψk,n(t) is the wavelet basis in L2(R). Fibonacci wavelets Ψn,m(t)=Ψ(k,nˆ,m,t) have four arguments; nˆ=n1,n=1,2,3,,2k1,k is a positive integer, m is the degree of Fibonacci polynomials, and t is the normalized time. On the interval [0,1], these wavelets are defined as [Citation36-38], (5) Ψn,m(t)={2k12wmPm(2k1tnˆ),nˆ2k1t<nˆ+12k1,0,Otherwise,(5) with (6) wm=01(Pm(t))2dt,(6) where Pm(t) is the Fibonacci polynomial of degree m=0,1,,M1, k denotes the level of resolution k=1,2, and translation parameter n=1,2,,2k1, respectively. The coefficient 1wm is a normalization factor.

The Fibonacci polynomials are defined as follows in terms of the recurrence relation for every tR+: (7) Pm+2(t)=tPm+1(t)+Pm(t),m0,(7) with initial conditions P0(t)=1,P1(t)=t. They can be defined similarly using the following general formula: (8) Pm(t)={1,m=0,t,m=1,tPm1(t)+Pm2(t),m>1,(8) and the closed-form formula: (9) Pm1(t)=βmγmβγ,m1,(9) where β and γ are the roots of the companion polynomial (x2tx1) of the recursion. Furthermore, the Fibonacci polynomials’ power-form representation is as follows [Citation38]: (10) Pm(t)=i=0m2(mii)tm2i,m0,(10) where, [] is a well-known floor function. Now, we fairly accurate the function y(x) under the Fibonacci wavelet as follows: (11) y(x)=n=1m=0Cn,mΨn,m(x),(11) where Ψn,m(x) is the Fibonacci wavelet. By truncating the series as follows; (12) y(x)n=12k1m=0M1Cn,mΨn,m(x)=ATΨ(x),(12) where A and Ψ(x) are 2k1M×1 matrix, (13) AT=[C1,0,,C1,M1,C2,0,,C2,M1,,C2k1,0,C2k1,M1],(13) (14) Ψ(x)=[Ψ1,0,,Ψ1,M1,Ψ2,0,Ψ2,M1,Ψ2k1,0,Ψ2k1,M1]T.(14) Let {Ψi,j} be the sequence of Fibonacci wavelets, m=0,1,,M1 and n=1,2,2k1. For every fixed n, there is a Fibonacci space spanned by the elements of the sequence {Ψi,j}. That is, L({Ψi,j})=L2[0,1] is Banach space.

2.2. Integration operational matrix

The Fibonacci wavelet basis is tackled at k=1: Ψ1,0(t)=1, Ψ1,1(t)=3t, Ψ1,2(t)=12157(1+t2), Ψ1,3(t)=105239t(2+t2), Ψ1,4(t)=3351943(1+3t2+t4), Ψ1,5(t)=343852582t(3+4t2+t4), Ψ1,6(t)=350051268209(1+6t2+5t4+t6), Ψ1,7(t)=350052827883t(4+10t2+6t4+t6), Ψ1,8(t)=328508528195421(1+10t2+15t4+7t6+t8), Ψ1,9(t)=316166155016284989t(5+20t2+21t4+8t6+t8), Ψ1,10(t)=3161661511941544471(1+15t2+35t4+28t6+9t8+t10),where, Ψ10(t)=[Ψ1,0(t),Ψ1,1(t),Ψ1,2(t),Ψ1,3(t),Ψ1,4(t),Ψ1,5(t),Ψ1,6(t),Ψ1,7(t),Ψ1,8(t),Ψ1,9(t)]T. Now integrate the above first ten bases concerning t limit from 0 to t, then express as a linear combination of Fibonacci wavelet basis as; 0tΨ1,0(t)dt=[01300000000]Ψ10(t), 0tΨ1,1(t)dt=[320750000000]Ψ10(t), 0tΨ1,2(t)dt=[0567023942000000]×Ψ10(t), 0tΨ1,3(t)dt=[105223907223901943471700000]Ψ10(t), 0tΨ1,4(t)dt=[000717519430425825213730000]Ψ10(t), 0tΨ1,5(t)dt=[3854258200021373242582012682092433566000]Ψ10(t), 0tΨ1,6(t)dt=[0000043356671268209028278837126820900]Ψ10(t), 0tΨ1,7(t)dt=[3500542827883000001268209828278830281954214480740110]Ψ10(t), 0tΨ1,8(t)dt=[00000004807401118281954210501628498918535712999]Ψ10(t),

Hence, 0tΨ(t)dt=B10×10Ψ10(t)+Ψ10(t)¯, where, B10×10=[013000320750005670239420105223907223901943471700071751943038542582000213732425820000035005428278830000000003323323250814249450000000000000000000000004258252137300000126820924335660004335667126820902827883712682090001268209828278830281954214480740110004807401118281954210501628498918535712999000535712999550162849890]and Ψ10(t)¯=[00000000011941544471105016284989Ψ1,10(t)].

Next, twice integration of the above ten bases, we get; 0t0tΨ1,0(t)dtdt=[1207150000000]Ψ10(t), 0t0tΨ1,1(t)dtdt=[0130239635000000]Ψ10(t), 0t0tΨ1,2(t)dtdt=[522101401943168300000]Ψ10(t), 0t0tΨ1,3(t)dtdt=[053512239021502582578870000]Ψ10(t), 0t0tΨ1,4(t)dtdt=[352194307310194301120126820930277849000]Ψ10(t), 0t0tΨ1,5(t)dtdt=[038547746026294077460235028278831683356600]Ψ10(t), 0t0tΨ1,6(t)dtdt=[500541268209000277849421268209012402819542128215595530]Ψ10(t), 0t0tΨ1,7(t)dtdt=[01501542827883000167837565576602630501628498972913406209]Ψ10(t), 0t0tΨ1,8(t)dtdt=[317017814097710500000215595531442819542101400]×Ψ10(t)+11941544471180535712999Ψ1,10(t),0t0tΨ1,9(t)dtdt=[09699692508142494500000913406209905016284989029]Ψ10(t)+41027600203855115374554747Ψ1,11(t) Hence, 0t0tΨ(t)dtdt=B10×10Ψ10(t)+Ψ10(t)¯, where B10×10=[1207150000130239635005221014019431683005351223902150258257887352194307310194301120038547746026294077460235500541268209000277849421268209001501542827883000167837565576631701781409771050000009699692508142494500000000000000000000126820930277849000028278831683356600124028195421282155955300263050162849897291340620921559553144281954210140009134062099050162849890299] and Ψ10(t)¯=[0000000011941544471180535712999Ψ1,10(t)41027600203855115374554747Ψ1,11(t)].

In the same way, by varying both k and M, we can generate matrices for our handiness.

3. Main results of convergence analysis

The space of functions L2(R): The set of all functions f for which |f(x)|2 is integrable on the region R.

Continuous Functions in L2(R): Let S(x,t)L2(R) with t[a,b]. Then S(x,t) is continuous in L2(R) in the variable t on [a,b] if S(x,t)S(x,t) in L2(R) whenever ttt[a,b]. This definition says that, if the function S(x,t) is continuous in t on [a,b], then the S(x,t) is continuous in t on [a,b].

Riesz Fischer theorem: If a sequence of functions {fk}k=1 in L2(R) converges itself in L2(R) then there is a function fL2( R) such that fkf0 as k.

Theorem 1:

Let S(x,t) in L2(R×R) be a continuous bounded function defined on [0,1]×[0,1], then Fibonacci wavelet expansion of S(x,t) is uniformly converges to it.

Proof:

Let S(x,t) in L2(R×R) be a continuous function defined on [0,1]×[0,1] and bounded by a real number μ. The approximation of S(x,t) is; S(x,t)=i=1j=0ai,jΨi,j(x)Ψi,j(t), where, ai,j=S(x,t),Ψi,j(x)Ψi,j(t), and , represents inner product. Since Ψi,j(x)Ψi,j(t) are orthogonal functions on [0,1]. Then, ai,j=0101S(x,t)Ψi,j(x)Ψi,j(t)dxdt, ai,j=01InoS(x,t)2k12wmPm(2k1xn+1)×Ψi,j(t)dxdt, where I=[n12k1,n2k1]. Put 2k1xn+1=r then, ai,j=2k12wm0101S(r1+n2k1,t)Pm(r)dr2k1×Ψi,j(t)dt, ai,j=2(k12)wm01[01S(r1+n2k1,t)Pm(r)dr]×Ψi,j(t)dt, By generalized mean value theorem for integrals, ai,j=2(k12)wm01S(ξ1+n2k1,t)Ψi,j(t)dt×[01Pm(r)dr], where ξ(0,1) and choose 01Pm(r)dr=A, ai,j=A2(k12)wmn12k1n2k1S(ξ1+n2k1,t)×2k12wmPm(2k1tn+1)dt, Put 2k1tn+1=r then, ai,j=Awm01S(ξ1+n2k1,s1+n2k1)Pm(s)ds2k1, ai,j=A2k+1wm01S(ξ1+n2k1,s1+n2k1)Pm(s)ds, By generalized mean value theorem for integrals, ai,j=A2k+1wmS(ξ1+n2k1,ξ11+n2k1)01Pm(s)ds, where, ξ1(0,1) and 01Pm(s)ds=B then ai,j=AB2k+1wmS(ξ1+n2k1,ξ11+n2k1),ξ,ξ1(0,1),

Therefore, |ai,j|=|AB2k+1wm||S(ξ1+n2k1,ξ11+n2k1)|, Since S is bounded by μ, |ai,j|=|A||B||2k+1|μ|wm|. where wm=01(Pm(t))2dt. Therefore i=1j=0ai,j is convergent. Hence the Fibonacci wavelet expansion of S(x,t) converges uniformly.

Theorem 2:

Let the Fibonacci wavelet sequence {Ψn,mk(x,t)}k=1 which are continuous functions defined in L2(R) in t on [a,b] converges to the function S(x,t) in L2(R) uniformly in t on [a,b]. Then S(x,t) is continuous in L2(R) in t on [a,b].

Proof:

Since, the Fibonacci wavelet sequence {Ψn,mk(x,t)}k=1 is uniformly converges to S(x,t) in L2(R). Therefore, for every ϵ>0, there exists a number k=kϵ such that, (15) Ψn,mk(x,t)S(x,t)<ϵ3,t[a,b](15) Also, {Ψn,mk(x,t)} is continuous in L2(R) in t[a,b]. Then there exists a number δ=δϵ such that, (16) Ψn,mk(x,t)Ψn,mk(x,t)<ϵ3,whenever tt<δt,t[a,b],(16) S(x,t)S(x,t)=S(x,t)Ψn,mk(x,t)+Ψn,mk(x,t)S(x,t)S(x,t)=Ψn,mk(x,t)+Ψn,mk(x,t)S(x,t),S(x,t)Ψm,nk(x,t)+Ψm,nk(x,t)Ψm,nk(x,t)+Ψm,nk(x,t)S(x,t), <ϵ3+ϵ3+ϵ3=ϵ, S(x,t)S(x,t)<ϵ for all tt<δ with t,t[a,b]. Hence S(x,t) is continuous in L2(R) in t on [a,b].

Theorem 3:

Let the Fibonacci wavelet sequence {Ψn,mk(x,t)}k=1 converges itself in L2(R) uniformly in t on [a,b]. Then there is a function S(x,t) is continuous in L2(R) in t on [a,b] and limkΨn,mk(x,t)=Ψn,m(x,t)t[a,b].

Proof:

By Riesz Fischer theorem, for each t[a,b] there is a function S(x,t) in L2(R) such that (17) limkΨn,mk(x,t)=S(x,t),(17) Consider the subsequence {Ψn,mki(x,t)}i=1 such that, (18) Ψn,mki+1(x,t)Ψn,mki(x,t)<12i,t[a,b],(18) from (17) S(x,t)=limpΨn,mkp=Ψn,mki+(Ψn,mki+1Ψn,mki)+(Ψn,mki+2Ψn,mki+1)+,, from (18) S(x,t)Ψn,mkiΨn,mki+1Ψn,mki+Ψn,mki+2Ψn,mki+1+,, 12i+12i+1+,,=12i1,i=1,2,3,, This shows that the subsequence {Ψn,mki(x,t)} converges to S(x,t) in L2(R) uniformly in t on [a,b]. By theorem 2 the function S(x,t) is continuous in L2(R) in t on [a,b].

4. Method of solution

Consider the linear PDE is of the form: (19) F(x,t,S,St,Sx,Sxx,Sxxt)=0,(19) where, x,t are independent variables, S is the dependent variable with the following physical conditions. (20) S(x,0)=H1(x),S(0,t)=H2(t),S(a,t)=H3(t),(20) where, a be any constant, H1(x),H2(t),H3(t) are continuous real-valued functions. Assume that, (21) 3S(x,t)x2tΨT(x)KΨ(t)(21) where, ΨT(x)=[Ψ1,0(x),,Ψ1,M1(x),,Ψ2k1,0(x),,Ψ2k1,M1(x)],

K=[bi,j] be 2k1M×2k1M unknown matrix such that i,j=1,,2k1M. Ψ(t)=[Ψ1,0(t),,Ψ1,M1(t),,Ψ2k1,0(t),,Ψ2k1,M1(t)]T, Integrate (21) concerning t from limit 0 to t. (22) 2S(x,t)x2=2S(x,0)x2+ΨT(x)K[BΨ(t)+Ψ(t)¯],(22) Now integrate (22) twice concerning x from 0 to x. (23) S(x,t)x=S(0,t)x+S(x,0)xS(0,0)x+[BΨ(x)+Ψ(x)¯]TK[BΨ(t)+Ψ(t)¯],(23) (24) S(x,t)=S(0,t)+S(x,0)S(0,0)+x[S(0,t)xS(0,0)x]+[BΨ(x)+Ψ(x)¯]TK[BΨ(t)+Ψ(t)¯],(24) Put x=a on (24) along with the physical conditions given in (20). We get, H3(t)=H2(t)+H1(a)H1(0)+a[S(0,t)xS(0,0)x]+limxa[BΨ(x)+Ψ(x)¯]TK[BΨ(t)+Ψ(t)¯], (25) [S(0,t)xS(0,0)x]=1a[H3(t)H2(t)H1(a)+H1(0)limxa[BΨ(x)+Ψ(x)¯]TK[BΨ(t)+Ψ(t)¯]],(25) Substitute (25) in (23) and (24) (26) S(x,t)x=H1(x)x+1a[limxaH3(t)H2(t)H1(a)+H1(0)limxa[BΨ(x)+Ψ(x)¯]TK[BΨ(t)+Ψ(t)¯]]+[BΨ(x)+Ψ(x)¯]TK[BΨ(t)+Ψ(t)¯],(26) (27) S(x,t)=H2(t)+H1(x)H1(0)+limx[BΨ(x)+Ψ(x)¯]TK[BΨ(t)+Ψ(t)¯]+xa[H3(t)H2(t)H1(a)+H1(0)limxa[BΨ(x)+Ψ(x)¯]TK[BΨ(t)+Ψ(t)¯]],(27) Now, differentiate (27) concerning t. We get, (28) S(x,t)t=H2(t)+xaddt[limxaH3(t)H2(t)H1(a)+H1(0)limxa[BΨ(x)+Ψ(x)¯]T×K[BΨ(t)+Ψ(t)¯]]+ddt[[BΨ(x)+Ψ(x)¯]T×K[BΨ(t)+Ψ(t)¯]],(28) Now, fit S,St,Sx,Sxx and Sxxt in (19) and discretize by following collocation points, (29) xi=ti=2i12[2k1M]2,i=1,2,,[2k1M]2(29) To extract the values of unknown coefficients, we use the Newton–Raphson method. Finally, substitute obtained values of unknown coefficients in (27) yield the Fibonacci wavelet numerical solution of the given PDE.

5. Applications of the projected method

To discuss the error analysis we consider the following three types of errors:

L2error=i=1nYi2, Lerror=Max(Yi),1in1, {RMS}error=i=1nYi2n, where, Yi=Si(exact solution)Si(approximate solution).

Example 1. Consider the linear hyperbolic equation of first-order [Citation16], S(x,t)t+S(x,t)x+S(x,t)=(xt)2,0x1,0t1, subject to the conditions: S(x,0)=x2,S(0,t)=t2,0x1,0t1, The exact solution to the above problem is S(x,t)=(xt)2. Here, we solved example 1 by the FWCM. The obtained results are as follows; represents the time–space graph of the present method solution at M=2,4 and the exact solution along with its absolute error. reveals that the error of the FWCM is better than the errors of the Legendre wavelet collocation method, and Chebyshev wavelet collocation method. compares the absolute errors obtained from the projected method, the Legendre wavelet collocation method [Citation17], and the Chebyshev wavelet collocation method [Citation17]. Figures and explain the graphical comparison of the FWCM solution with the exact solution at different values of x and t, respectively. For M=2,4,6, compares the different error norms for numerical solutions achieved by the proposed method and other recognized methods in the literature [Citation17]. On solving the above problem at M=4, we get the following set of algebraic equations,

Apply the Newton–Raphson technique that yields the values of unknown coefficients as follows: b1,1=2.0000,b1,2=9.7181×1013,b1,3=1.7227×1013,b1,4=2.4250×1012,b2,1=b2,2=b2,3=0,b2,4=6.2001×1013,b3,1=b3,2=b3,3=0,b3,4=1.5871×1012,b4,1=b4,2=b4,3=0,b4,4=7.5486×1013 Then the FWCM solution is given by, S(x,t)=t21.9999tx4.2322×1015t2x+4.2030×1014t3x+2.0934×1013t4x+x22.4267×1014t2x26.0668×1015t4x22.5666×1013t2x36.4166×1014t4x3+8.2908×1014t2x4+2.0727×1014t4x4.

Figure 1. Graphical illustration of the FWCM and Exact solution along with its absolute error, for example, 1.

Figure 1. Graphical illustration of the FWCM and Exact solution along with its absolute error, for example, 1.

Figure 2. Absolute error graphical comparison of the present method solution, Legendre wavelet collocation method, and Chebyshev wavelet collocation method, for example, 1.

Figure 2. Absolute error graphical comparison of the present method solution, Legendre wavelet collocation method, and Chebyshev wavelet collocation method, for example, 1.

Figure 3. Graphical evaluation of the present method solution and the exact solution at different values of x, for example, 1.

Figure 3. Graphical evaluation of the present method solution and the exact solution at different values of x, for example, 1.

Figure 4. Graphical judgment between the proposed method solution and the exact solution at different values of t, for example, 1.

Figure 4. Graphical judgment between the proposed method solution and the exact solution at different values of t, for example, 1.

Table 1. Comparison of absolute errors by the FWCM, and different wavelet methods, for example, 1.

Table 2. Error norms comparison between the FWCM and other methods in the literature [Citation17], for example, 1.

Example 2. Consider another HPDE of first-order [Citation16], S(x,t)t+S(x,t)x+S(x,t)=2sin(x+t)+cos(x+t),0x1,0t1, subject to the conditions: S(x,0)=cos(x),S(0,t)=cos(t),0x1,0t1,

The exact solution is S(x,t)=cos(x+t). This problem is solved by the projected technique. is a graphical representation of the current method solution at M=3,6 compared to the precise solution and its absolute error. reveals that the absolute errors obtained from the proposed method are compared to those methods in the literature [Citation16, Citation17, Citation20]. The absolute error graph of the present method and literature methods is drawn in . From Tables and and Figures and , we can see that the FWCM yields better results than the other literature methods [Citation16, Citation18, Citation20]. Figures and reflect the graphical comparison of the FWCM solution with the exact solution at different values of t and x, respectively.

Figure 5. Graphical illustration of FWCM and Exact solution along with its absolute error, for example, 2.

Figure 5. Graphical illustration of FWCM and Exact solution along with its absolute error, for example, 2.

Figure 6. Graphical comparison of Shifted fifth-kind Chebyshev Galerkin method at N=6 (A1), Bernoulli matrix approach at N=10 (A2), Shifted Jacobi spectral-Galerkin method at M=6 (A3), present method at M=3 (A4), for example, 2.

Figure 6. Graphical comparison of Shifted fifth-kind Chebyshev Galerkin method at N=6 (A1), Bernoulli matrix approach at N=10 (A2), Shifted Jacobi spectral-Galerkin method at M=6 (A3), present method at M=3 (A4), for example, 2.

Figure 7. Graphical comparison of absolute errors of the present method and Shifted fifth-kind Chebyshev Galerkin method at t=0.1, for example, 2.

Figure 7. Graphical comparison of absolute errors of the present method and Shifted fifth-kind Chebyshev Galerkin method at t=0.1, for example, 2.

Figure 8. Graphical evaluation of the present method solution and the exact solution at different values of t, for example, 2.

Figure 8. Graphical evaluation of the present method solution and the exact solution at different values of t, for example, 2.

Figure 9. Graphical judgment of the present method solution and the exact solution at different values of x, for example, 2.

Figure 9. Graphical judgment of the present method solution and the exact solution at different values of x, for example, 2.

Table 3. Comparison of absolute errors by the projected method with the different literature methods, for example, 2.

Table 4. Comparison of absolute errors of the projected method and different literature methods, for example, 2.

Table 5. Comparison of absolute errors of the projected method and method in literature at t=0.1, for example, 2.

Example 3. Consider the linear HPDE of first-order [Citation16], S(x,t)tS(x,t)xS(x,t)=2e2tx,0x1,0t1, subject to the conditions: S(x,0)=ex,S(0,t)=e2t,0x1,0t1, The exact solution is S(x,t)=e(2t+x). We solved the above problem with the FWCM. is a surface plot of the FWCM at M=6,9 and the exact solution with its absolute error. Tables and show that the absolute error by the present method at M=6andk=2 is better than the methods in [Citation16, Citation19]. Figures and show the graphical comparison of the current method solution at M=6 with the exact solution at different values of t and x, respectively.

Figure 10. Graphical illustration of FWCM and Exact solution along with the absolute error, for example, 3.

Figure 10. Graphical illustration of FWCM and Exact solution along with the absolute error, for example, 3.

Figure 11. Graphical evaluation of the present method solution and the exact solution at different values of x, for example, 3.

Figure 11. Graphical evaluation of the present method solution and the exact solution at different values of x, for example, 3.

Figure 12. Graphical judgment of the present method solution and the exact solution at different values of t, for example, 3.

Figure 12. Graphical judgment of the present method solution and the exact solution at different values of t, for example, 3.

Table 6. Comparison of absolute errors of projected method and different collocation methods, for example, 3 at t=0.1.

Table 7. Comparison of absolute errors of projected method and different collocation methods, for example, 3 at t=0.5.

Example 4. Consider one more HPDE of first-order [Citation16], S(x,t)tS(x,t)xS(x,t)=etx(cos(t)sin(t)),0x1,0t1, subject to the conditions: S(x,0)=0,S(0,t)=etsin(t),0x1,0t1,

The exact solution is S(x,t)=e(t+x)sin(t). The graphical presentation of the current technique solution compared with the exact solution in . Figures and explain the graphical evaluation of the FWCM solution at M=9 with the exact solution at different values of x and t, respectively. Tables and represent that for the small value of M and k, we obtained a higher accuracy in the solution than the method in [Citation18]. Also, k and M values are directly proportional to the closeness of the solution.

Figure 13. Graphical illustration of FWCM and Exact solution along with the absolute error, for example, 4.

Figure 13. Graphical illustration of FWCM and Exact solution along with the absolute error, for example, 4.

Figure 14. Graphical evaluation of the present method solution and the exact solution at different values of t, for example, 4.

Figure 14. Graphical evaluation of the present method solution and the exact solution at different values of t, for example, 4.

Figure 15. Graphical judgment of the present method solution and the exact solution at different values of x, for example, 4.

Figure 15. Graphical judgment of the present method solution and the exact solution at different values of x, for example, 4.

Table 8. Comparison of absolute errors of projected method and different collocation method, for example, 4 at t=0.1.

Table 9. Comparison of absolute errors of projected method and different collocation method, for example, 4 at t=0.5.

Example 5. Consider the linear hyperbolic equation of first-order [Citation16], S(x,t)t+S(x,t)x+S(x,t)=(x+t)72(x+t+9),0x1,0t1, subject to the conditions: S(x,0)=(x)92,S(0,t)=(t)92,0x1,0t1, The exact solution is S(x,t)=(x+t)92. The projected technique FWCM solves this problem. The graphical presentation of the present approach solution at M=6,9 compared with the exact solution is shown in , and the error graph is also drawn. and explain the graphical judgment of the FWCM solution at M=9 with the exact solution at different values of x and t.

Figure 16. Graphical illustration of FWCM and Exact solution along with the absolute error, for example, 5.

Figure 16. Graphical illustration of FWCM and Exact solution along with the absolute error, for example, 5.

Figure 17. Graphical evaluation of the present method solution and the exact solution at different values of t, for example, 5.

Figure 17. Graphical evaluation of the present method solution and the exact solution at different values of t, for example, 5.

Figure 18. Graphical judgment of the present method solution and the exact solution at different values of x, for example, 5.

Figure 18. Graphical judgment of the present method solution and the exact solution at different values of x, for example, 5.

6. Conclusion

This article introduced the Fibonacci wavelet operational matrix of integration through the linear combination concepts. Based on this Fibonacci wavelets matrix, we have projected an efficient algorithm for solving hyperbolic partial differential equations with the help of the Mathematica software. In this approach, first given HPDEs are transformed into a system of algebraic equations then the solution will be obtained with the help of the Newton–Raphson method. The efficiency of the proposed method can be seen in the tables and graphs. Also, the current approach is better than the methods in [Citation16-20]. The projected method takes less computational time and achieves excellent precision at less resolution level. shows that by increasing the M values simultaneously accuracy in the solution also increases. Tables and reveal that on varying k values we get still higher accuracy in the solution.

Acknowledgments

The authors are grateful to the referees and the editor for carefully checking the details and for helpful comments that improved this paper. Also, the author thanks to Backward Classes Welfare Department, Karnataka for the Ph.D. fellowship.

Disclosure statement

No potential conflict of interest was reported by the author(s).

Data availability statement

The data that support the findings of this study are available within the article.

References

  • Strub I, Bayen A. Optimal control of air traffic networks using continuous flow model. (AIAA Conference on Guidance, Control, and Dynamics, Keystone, Colorado). 2006;3:1700–1710.
  • Bendahmane M, Nagaiah C, Comte É, et al. A 3D boundary optimal control for the bidomain-bath system modeling the thoracic shock therapy for cardiac defibrillation. J Math Anal Appl. 2016;437(2). hal-01261547.
  • Ng KW, Rohanin A. Numerical solution for PDE-constrained optimization problem in cardiac electrophysiology. Int J Comput Appl. 2012;44(12):11–15.
  • Martínez A, Rodríguez C, Vázquez M. Theoretical and numerical analysis of an optimal control problem related to wastewater treatment. SIAM J Control Optim. 2000;38(5):1534–1553.
  • Maidi A, Corriou J. Optimal control of nonlinear chemical processes using the variational iteration method. IFAC Symposium Advanced Control of Chemical Processes. 2012;45(15):898–903.
  • Bhatti MM, Zeeshan A, Bashir F, et al. Sinusoidal motion of small particles through a Darcy-Brinkman-Forchheimer microchannel filled with non-Newtonian fluid under electro-osmotic forces. J Taibah Univ Sci. 2021;15(1):514–529.
  • Tereshko D. Discrete optimization of unsteady fluid flows. CEUR Workshop Proc. 2016;1623:293–302.
  • Sadiya U, Inc M, Arefin MA, et al. Consistent travelling waves solutions to the non-linear time fractional Klein–Gordon and Sine-Gordon equations through extended tanh-function approach. J Taibah Univ Sci. 2022;16(1):594–607.
  • Munteanu I, Bratcu A, Cutululis N, et al. Optimal control of wind energy systems towards a global approach. Adv Ind Control. 2008.
  • Lenhart S, Workman JT. Optimal control applied to biological model. Math Comput Biol. 2007.
  • Gökmen E. A computational approach with residual error analysis for the fractional-order biological population model. J Taibah Univ Sci. 2021;15(1):218–225.
  • Gibson WC. The method of moments in electromagnetics. Abingdon: Taylor and Francis Group; 2008.
  • Pettersson MP, Iaccarino G, Nordström J. Polynomial chaos methods for hyperbolic partial differential equations: numerical techniques for fluid dynamics problems in the presence of uncertainties. Cham: Springer International Publishing; 2015.
  • Yeh KC, Liu CH. Wave propagation in random media in theory of ionospheric waves. Cambridge (MA): Academic Press. 1972;17:308–366.
  • Vergara RC. Development of geostatistical models using stochastic partial differential equations [Ph.D. thesis]. Paris: Université Paris Sciences et Lettres; 2018.
  • Atta AG, Abd-Elhameed WM, Moatimid GM, et al. Shifted fifth-kind Chebyshev Galerkin treatment for linear hyperbolic first-order partial differential equations. Appl Numer Math. 2021;167:237–256.
  • Singh S, Patel VK, Singh VK. Application of wavelet collocation method for hyperbolic partial differential equations via matrices. Appl Math Comput. 2018;320:407–424.
  • Doha EH, Hafez RM, Youssri YH. Shifted Jacobi spectral-Galerkin method for solving hyperbolic partial differential equations. Comp Math Appl. 2019;78:889–904.
  • Bhrawy AH, Hafez RM, Alzahrani EO, et al. Generalized Laguerre-Gauss-Radau scheme for the first order hyperbolic equations in a semi-infinite domain. Rom J Phys. 2015;60(7-8):918–934.
  • Tohidi E, Toutounian F. Convergence analysis of Bernoulli matrix approach for one-dimensional matrix hyperbolic equations of the first order. Comput Math Appl. 2014;68(1-2):1–12.
  • Shiralashetti SC, Kumbinarasaiah S. Laguerre wavelets collocation method for the numerical solution of the Benjamina–Bona–Mohany equations. J Taibah Univ Sci. 2019;13(1):9–15.
  • Shahni J, Singh R. Numerical simulation of Emden–Fowler integral equation with Green’s function type kernel by Gegenbauer-wavelet, Taylor-wavelet, and Laguerre-wavelet collocation methods. Math Comput Simul. 2022;194:430–444.
  • Shahni J, Singh R. Laguerre wavelet method for solving Thomas–Fermi type equations. Eng Comput. 2022;38:2925–2935.
  • Behera S, Ray SS. On a wavelet-based numerical method for linear and nonlinear fractional Volterra integro-differential equations with weakly singular kernels. Comput Appl Math. 2022;41:211.
  • Guo L, Yu Z. A Gaussian wavelet-based method for extracting rockfall motion information in consecutive impact tests on flexible barrier systems. Int J Impact Eng. 2022;167:104264.
  • Gupta S, Ranta S. Legendre wavelet based numerical approach for solving a fractional eigenvalue problem. Chaos, Solitons Fractals. 2022;155:111647.
  • Kumbinarasaiah S, Raghunatha KR. Numerical solution of the Jeffery–Hamel flow through the wavelet technique. Heat Transfer. 2022;51:1568–1584.
  • Saeed U, Rehman MU. Hermite wavelet method for fractional delay differential equations. J Diff Equ. 2014;2014:359093.
  • Kumbinarasaiah S. A novel approach for multi-dimensional fractional coupled Navier–Stokes equation. SeMA; 2022.
  • Sezen C, Partal T. New hybrid GR6J-wavelet-based genetic algorithm-artificial neural network (GR6J-WGANN) conceptual-data-driven model approaches for daily rainfall–runoff modelling. Neural Comput Appl. 2022;34:17231–17255.
  • Janjarasjitt S. Comparison of wavelet-based decomposition and empirical mode decomposition of electrogastrogram signals for preterm birth classification. ETRI J. 2022: 1–11.
  • Adebayo TS. Environmental consequences of fossil fuel in Spain amidst renewable energy consumption: new insights from the wavelet-based Granger causality approach. Int J Sustain Dev World Ecol. 2022.
  • Ahsan M, Hussain I, Ahmad M. A finite-difference and Haar wavelets hybrid collocation technique for non-linear inverse Cauchy problems. Appl Math Sci Eng. 2022;30(1):121–140.
  • El-Gamel M, Mohamed N, Adel W. Numerical study of a nonlinear high order boundary value problems using Genocchi collocation technique. Int J Appl Comput Math. 2022;8:143.
  • Liu C, Yu Z, Zhang X, et al. An implicit wavelet collocation method for variable coefficients space fractional advection-diffusion equations. Appl Numer Math. 2022;177:93–110.
  • Sabermahani S, Ordokhani Y, Yousefi S. Fibonacci wavelets and their applications for solving two classes of time-varying delay problems. Optim Control Appl Methods. 2020;41:395–416.
  • Shah FA, Irfan M, Nisar KS, et al. Fibonacci wavelet method for solving time-fractional telegraph equations with Dirichlet boundary conditions. Results Phys. 2021;24:104123.
  • Shiralashetti SC, Lamani L. Fibonacci wavelet based numerical method for the solution of nonlinear Stratonovich Volterra integral equations. Sci Afr. 2020;10:e00594.
  • Mohd I, Shah FA, Nisar KS. Fibonacci wavelet method for solving Pennes bioheat transfer equation. Int J Wavelets Multiresolut Inf Process. 2021;19(6):2150023.
  • Sabermahani S, Ordokhani Y. Fibonacci wavelets and Galerkin method to investigate fractional optimal control problems with bibliometric analysis. J Vib Control. 2021;27(15-16):1778–1792.
  • Kurt A, Yalçınbaş S, Sezer M. Fibonacci collocation method for solving high-order linear Fredholm integro-differential-difference equations. Int J Math Math Sci. 2013;2013:486013.
  • Alkan S, Cakmak M. Fibonacci collocation method for solving a class of systems of nonlinear differential equations. New Trends Math Sci. 2021;9(4):11–24.
  • Shiralashetti SC, Lamani L. A modern approach for solving nonlinear Volterra integral equations using Fibonacci wavelets. Electron J Math Anal Appl. 2021;9(2):88–98.
  • Irfan M, Shah FA. Fibonacci wavelet method for solving the time-fractional bioheat transfer model. Optik (Stuttg). 2021;241:167084.