2016
DOI: 10.1080/15502287.2016.1157646
|View full text |Cite
|
Sign up to set email alerts
|

A new approach based on embedding Green’s functions into fixed-point iterations for highly accurate solution to Troesch’s problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 29 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…a1y1false(sfalse)+b1y2false(sfalse)+c1y3false(sfalse)+1pfalse(sfalse)=a2y1false(sfalse)+b2y2false(sfalse)+c2y3false(sfalse)$$ {a}_1{y}_1^{\prime \prime }(s)+{b}_1{y}_2^{\prime \prime }(s)+{c}_1{y}_3^{\prime \prime }(s)+\frac{1}{p(s)}={a}_2{y}_1^{\prime \prime }(s)+{b}_2{y}_2^{\prime \prime }(s)+{c}_2{y}_3^{\prime \prime }(s) $$ and alongside the fact that Gfalse(x,sfalse)$$ G\left(x,s\right) $$ is a solution of Lfalse[Gfalse(x,sfalse)false]=δfalse(tsfalse)$$ L\left[G\left(x,s\right)\right]=\delta \left(t-s\right) $$ as in [17].…”
Section: Construction Of Green's Functionmentioning
confidence: 99%
See 1 more Smart Citation
“…a1y1false(sfalse)+b1y2false(sfalse)+c1y3false(sfalse)+1pfalse(sfalse)=a2y1false(sfalse)+b2y2false(sfalse)+c2y3false(sfalse)$$ {a}_1{y}_1^{\prime \prime }(s)+{b}_1{y}_2^{\prime \prime }(s)+{c}_1{y}_3^{\prime \prime }(s)+\frac{1}{p(s)}={a}_2{y}_1^{\prime \prime }(s)+{b}_2{y}_2^{\prime \prime }(s)+{c}_2{y}_3^{\prime \prime }(s) $$ and alongside the fact that Gfalse(x,sfalse)$$ G\left(x,s\right) $$ is a solution of Lfalse[Gfalse(x,sfalse)false]=δfalse(tsfalse)$$ L\left[G\left(x,s\right)\right]=\delta \left(t-s\right) $$ as in [17].…”
Section: Construction Of Green's Functionmentioning
confidence: 99%
“…Based on how worthwhile the fixed point iterative scheme has been in approximating the solution of IVPs and BVPs, a new method for approximating the solution of BVPs was introduced. This new method is based on embedding Green's function in a traditional fixed point iterative scheme (see [17][18][19][20][21][22] and other references therein).…”
Section: Introductionmentioning
confidence: 99%
“…, we need k ≥ 20. Below, we show how to find ω 20 for the nonlinear second-order right focal boundary value problem (7), (8).…”
Section: Existence Applicationmentioning
confidence: 99%
“…See Zeidler [4] or Granas and Dugundji [5] for a thorough treatment of the classical techniques. For papers using Green's function approaches, see Kafri and Khuri [6], Kafri, Khuri, and Sayfy [7], Khuri and Louhichi [8], or Khuri and Sayfy [9]. See also Duffy [10] for a review of Green's function techniques.…”
Section: Introductionmentioning
confidence: 99%
“…Mann and his colleagues also generalised the variational iteration method for proper treatment of the boundary value problem in [10]. Kafri et al, [11] recently presented a new approach for obtaining a numerical solution to Troesch's nonlinear boundary value problem by utilising Green's functions and manipulating fixed-point iterations such as Picard's and Kranoselkii-schemes. Mann's To approximate the solution of a two-point boundary value problem, we propose a fixed-point iteration method like the Mann iteration process in this paper.…”
Section: Introductionmentioning
confidence: 99%