2013
DOI: 10.1137/120881592
|View full text |Cite
|
Sign up to set email alerts
|

Iterative Solvers for a Spectral Galerkin Approach to Elliptic Partial Differential Equations with Fuzzy Coefficients

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 42 publications
0
5
0
Order By: Relevance
“…Indeed, it transforms the original problem into a parametric one, as done in the case of pure stochastic and pure fuzzy PDEs; see e.g. [5,38,16]. We can therefore extend the proofs for well-posedness and regularity of deterministic (see e.g.…”
Section: Solution Of the Fuzzy-stochastic Problemmentioning
confidence: 92%
See 2 more Smart Citations
“…Indeed, it transforms the original problem into a parametric one, as done in the case of pure stochastic and pure fuzzy PDEs; see e.g. [5,38,16]. We can therefore extend the proofs for well-posedness and regularity of deterministic (see e.g.…”
Section: Solution Of the Fuzzy-stochastic Problemmentioning
confidence: 92%
“…Proof. Thanks to the uniform positivity assumption (13) Hence, by the Lax-Milgram theorem [20], there is a unique solution u(z) ∈ H 1 0 (D) ⊗ L 2 π (Γ) that satisfies (16). By setting v = u(z) in ( 16) and using Hölder and Poincaré inequalities on the right hand side, we obtain ∀z ∈ S z α ,…”
Section: Well-posednessmentioning
confidence: 99%
See 1 more Smart Citation
“…There are essentially two types of techniques that are used to quantify the uncertainty in the solution. Intrusive methods [9,10,11,12,13,14] are based on polynomial chaos expansions, where the solution is expressed as a spectral expansion of the random variables. The method is cheap in terms of function evaluations for smooth problems, but requires a code, dealing specifically with the uncertainty.…”
Section: Introductionmentioning
confidence: 99%
“…where B = r i=0 f i g T i ∈ R n1×n2 and it is assumed that m, r n 1 , n 2 . The system matrices K i and G i obtained from discretization methods are typically sparse and, thus, for moderately large system matrices, Krylov subspace methods [29,30] and multigrid methods [3,9,21] have been natural choices to solve such systems.…”
mentioning
confidence: 99%