2021
DOI: 10.1007/s10915-021-01498-9
|View full text |Cite
|
Sign up to set email alerts
|

Poly-Sinc Solution of Stochastic Elliptic Differential Equations

Abstract: In this paper, we introduce a numerical solution of a stochastic partial differential equation (SPDE) of elliptic type using polynomial chaos along side with polynomial approximation at Sinc points. These Sinc points are defined by a conformal map and when mixed with the polynomial interpolation, it yields an accurate approximation. The first step to solve SPDE is to use stochastic Galerkin method in conjunction with polynomial chaos, which implies a system of deterministic partial differential equations to be… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
2

Relationship

3
4

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 27 publications
0
4
0
Order By: Relevance
“…A novel family of polynomial approximation called Poly-Sinc interpolation which interpolate data of the form {x k , y k } N k=−M where {x k } N k=−M are Sinc points, were derived in [23,30] and extended in [24]. The interpolation to this type of data is accurate provided that the function y with values y k = y(x k ) belong to the space of analytic functions [30,31]. For the ease of presentation and discussion, we assume that M = N. Poly-Sinc approximation was developed in order to mitigate the poor accuracy associated with differentiating the Sinc approximation when approximating the derivative of functions [23].…”
Section: Background 21 Poly-sinc Approximationmentioning
confidence: 99%
See 1 more Smart Citation
“…A novel family of polynomial approximation called Poly-Sinc interpolation which interpolate data of the form {x k , y k } N k=−M where {x k } N k=−M are Sinc points, were derived in [23,30] and extended in [24]. The interpolation to this type of data is accurate provided that the function y with values y k = y(x k ) belong to the space of analytic functions [30,31]. For the ease of presentation and discussion, we assume that M = N. Poly-Sinc approximation was developed in order to mitigate the poor accuracy associated with differentiating the Sinc approximation when approximating the derivative of functions [23].…”
Section: Background 21 Poly-sinc Approximationmentioning
confidence: 99%
“…Theoretical frameworks on the error analysis of function approximation, quadrature, and the stability of the Poly-Sinc approximation were studied in [23,24,32,33]. Furthermore, Poly-Sinc approximation was used to solve BVPs in ordinary and partial differential equations [31,[34][35][36][37][38]. We start with a brief overview of Lagrange interpolation.…”
Section: Background 21 Poly-sinc Approximationmentioning
confidence: 99%
“…Theoretical frameworks on the error analysis of function approximation, quadrature, and the stability of the Poly-Sinc approximation were studied in [23,24,32,33]. Furthermore, Poly-Sinc approximation was used to solve BVPs in ordinary and partial differential equations [31,[34][35][36][37][38]. We start with a brief overview of Lagrange interpolation.…”
Section: Poly-sinc Approximationmentioning
confidence: 99%
“…As a study interval we use we choose [a, b] = [−1, 1]. It is known that Poly-Sinc shows high accuracy even with used number of Sinc points [13,14]. So, we will test the eigenvalues for B ± for not so huge numbers, roughly we test up to 41 Sinc points.…”
Section: Poly-sinc Matricesmentioning
confidence: 99%