Laplace Variational Iteration Method Let us consider the following general partial differential equation: Lu(x, t) + Ru(x, t) + Nu(x,t) = g(x,t), (1) where LR denotes linear operator, N denotes nonlinear operator, and g(x,r) is the source term. The variational iteration method presents a correction functional for (1) in the form: or Mn+1(t) = u(t) + 2(x − 1)(L™³ un(t) + Run(t) + N ûn(t) − g(t) dr. (3) Taking Laplace transform of (3), we obtain L{Un+s(t)) = L(Un(t)) + L{ 2(x − t) (L" Un (t) + R &n(t) + N @n(t) − ི་ L{un+1(t)} = L{un(t)} + L{a(t)} L{L™³u„ (t) + R ûn(t) + N (t) − g(t)} (4) Taking the variation of (4), which is given by 8 (Lun+(t))) = (L{u,(t))) +8 (L(a(t)) L{L)(t) +R(t) + Nün(t) − g(t)}). By using computation of (5), we get (5) 8 (Lu+1(t))) = 8 (Lun(t)]) + L{a(t)) & (L{L) un(t)}) = 0. Hence, from (6) we get (6) 1+ s™ L{a(e)) = 0. where -1- 8 (LL)(t))) = 8 (L{u(t)}-s-(0)- 8 (L{u(t)]). Therefore, we get L(x(t)} (-1)(0)) Therefore, we have the following iteration algorithm: L(+(t)) = Lu(t)) {L³ (t) + Ru(t) + Nu(t) = g(t)} =L{ (t)}-{L()}-L(Run(t) + Nun(t) − g(t)} =L{un (t)) (s" L{u, (t))-s*¯¹u„(0) - LR u(t) + Nu(t)-g(t)) (-1) (0)) (0)+(0) (m-1), (0) L(Ru(t) + Nu(t)-g(t)} Finally, the approximate solution is given by u(x,t) = lim u(x,t)

Calculus: Early Transcendentals
8th Edition
ISBN:9781285741550
Author:James Stewart
Publisher:James Stewart
Chapter1: Functions And Models
Section: Chapter Questions
Problem 1RCC: (a) What is a function? What are its domain and range? (b) What is the graph of a function? (c) How...
icon
Related questions
Question
Derivation of the Laplace transform variational leration method in the same and simplified manner Replace the Laplace transform with the Elzaki transform and derive it in order to obtain a new method Elzaki variational leration method
Laplace Variational Iteration Method
Let us consider the following general partial differential equation:
Lu(x, t) + Ru(x, t) + Nu(x,t) = g(x,t),
(1)
where LR denotes linear operator, N denotes nonlinear operator, and
g(x,r) is the source term.
The variational iteration method presents a correction functional for (1) in the form:
or
Mn+1(t) = u(t) + 2(x − 1)(L™³ un(t) + Run(t) + N ûn(t) − g(t) dr. (3)
Taking Laplace transform of (3), we obtain
L{Un+s(t)) = L(Un(t)) + L{ 2(x − t) (L" Un (t) + R &n(t) + N @n(t) −
 ི་
L{un+1(t)} = L{un(t)} + L{a(t)} L{L™³u„ (t) + R ûn(t) + N (t) − g(t)}
(4)
Taking the variation of (4), which is given by
8 (Lun+(t))) = (L{u,(t)))
+8 (L(a(t)) L{L)(t) +R(t) + Nün(t) − g(t)}).
By using computation of (5), we get
(5)
8 (Lu+1(t))) = 8 (Lun(t)]) + L{a(t)) & (L{L) un(t)}) = 0.
Hence, from (6) we get
(6)
1+ s™ L{a(e)) = 0.
where
-1-
8 (LL)(t))) = 8 (L{u(t)}-s-(0)-
8 (L{u(t)]).
Therefore, we get
L(x(t)}
(-1)(0))
Therefore, we have the following iteration algorithm:
L(+(t)) = Lu(t)) {L³ (t) + Ru(t) + Nu(t) = g(t)}
=L{ (t)}-{L()}-L(Run(t) + Nun(t) − g(t)}
=L{un (t)) (s" L{u, (t))-s*¯¹u„(0) -
LR u(t) + Nu(t)-g(t))
(-1) (0))
(0)+(0)
(m-1),
(0)
L(Ru(t) + Nu(t)-g(t)}
Finally, the approximate solution is given by
u(x,t) = lim u(x,t)
Transcribed Image Text:Laplace Variational Iteration Method Let us consider the following general partial differential equation: Lu(x, t) + Ru(x, t) + Nu(x,t) = g(x,t), (1) where LR denotes linear operator, N denotes nonlinear operator, and g(x,r) is the source term. The variational iteration method presents a correction functional for (1) in the form: or Mn+1(t) = u(t) + 2(x − 1)(L™³ un(t) + Run(t) + N ûn(t) − g(t) dr. (3) Taking Laplace transform of (3), we obtain L{Un+s(t)) = L(Un(t)) + L{ 2(x − t) (L" Un (t) + R &n(t) + N @n(t) − ི་ L{un+1(t)} = L{un(t)} + L{a(t)} L{L™³u„ (t) + R ûn(t) + N (t) − g(t)} (4) Taking the variation of (4), which is given by 8 (Lun+(t))) = (L{u,(t))) +8 (L(a(t)) L{L)(t) +R(t) + Nün(t) − g(t)}). By using computation of (5), we get (5) 8 (Lu+1(t))) = 8 (Lun(t)]) + L{a(t)) & (L{L) un(t)}) = 0. Hence, from (6) we get (6) 1+ s™ L{a(e)) = 0. where -1- 8 (LL)(t))) = 8 (L{u(t)}-s-(0)- 8 (L{u(t)]). Therefore, we get L(x(t)} (-1)(0)) Therefore, we have the following iteration algorithm: L(+(t)) = Lu(t)) {L³ (t) + Ru(t) + Nu(t) = g(t)} =L{ (t)}-{L()}-L(Run(t) + Nun(t) − g(t)} =L{un (t)) (s" L{u, (t))-s*¯¹u„(0) - LR u(t) + Nu(t)-g(t)) (-1) (0)) (0)+(0) (m-1), (0) L(Ru(t) + Nu(t)-g(t)} Finally, the approximate solution is given by u(x,t) = lim u(x,t)
Expert Solution
steps

Step by step

Solved in 2 steps with 13 images

Blurred answer
Similar questions
Recommended textbooks for you
Calculus: Early Transcendentals
Calculus: Early Transcendentals
Calculus
ISBN:
9781285741550
Author:
James Stewart
Publisher:
Cengage Learning
Thomas' Calculus (14th Edition)
Thomas' Calculus (14th Edition)
Calculus
ISBN:
9780134438986
Author:
Joel R. Hass, Christopher E. Heil, Maurice D. Weir
Publisher:
PEARSON
Calculus: Early Transcendentals (3rd Edition)
Calculus: Early Transcendentals (3rd Edition)
Calculus
ISBN:
9780134763644
Author:
William L. Briggs, Lyle Cochran, Bernard Gillett, Eric Schulz
Publisher:
PEARSON
Calculus: Early Transcendentals
Calculus: Early Transcendentals
Calculus
ISBN:
9781319050740
Author:
Jon Rogawski, Colin Adams, Robert Franzosa
Publisher:
W. H. Freeman
Precalculus
Precalculus
Calculus
ISBN:
9780135189405
Author:
Michael Sullivan
Publisher:
PEARSON
Calculus: Early Transcendental Functions
Calculus: Early Transcendental Functions
Calculus
ISBN:
9781337552516
Author:
Ron Larson, Bruce H. Edwards
Publisher:
Cengage Learning