pith. sign in

arxiv: 2604.25111 · v1 · submitted 2026-04-28 · 🧮 math.NA · cs.NA

Numerical Analysis of Stochastic Elliptic Variational Inequalities of the First Kind

Chenhui Zhu , Fei Wang , Weimin Han This is my paper

Pith reviewed 2026-05-07 15:43 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords stochastic variational inequalitiesstochastic Galerkin methodfinite element methodobstacle problemerror estimateswell-posednessnumerical analysis
0
0 comments X

The pith

The stochastic Galerkin method with linear finite elements yields a well-posed discretization of stochastic elliptic variational inequalities and an optimal O(h) error bound in the H1-norm.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper develops a stochastic Galerkin approach to solve stochastic obstacle problems, which are elliptic variational inequalities with random coefficients. Because solutions have low regularity, the method uses linear finite elements for both the physical domain and the random variables. The authors prove that the resulting discrete problem is well-posed and derive an optimal error bound of order h in the H1 norm for both the expectation and second-moment errors. Numerical tests confirm these convergence rates, demonstrating the method's practical effectiveness for handling uncertainty in obstacle-type constraints.

Core claim

The paper establishes well-posedness of the stochastic Galerkin discretization for the stochastic obstacle problem and derives an optimal error estimate of O(h) in the H1-norm for the numerical solution. This is achieved by employing linear finite element spaces in both physical and stochastic domains and using properties of random fields and variational inequalities of the first kind.

What carries the argument

The stochastic Galerkin formulation, which combines finite element approximation in the physical space with approximation in the random space to discretize the stochastic variational inequality of the first kind.

If this is right

  • The discrete stochastic Galerkin problem admits a unique solution.
  • The numerical solution satisfies an optimal error estimate of O(h) in the H1-norm.
  • Both the expectation error and the second-moment error converge at rate O(h) in the H1-norm, as confirmed by numerical experiments.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same low-order discretization strategy could be applied to stochastic variational inequalities with other convex constraints.
  • Higher-order elements would not raise the convergence rate without stronger regularity assumptions on the random data.
  • The framework offers a practical route to uncertainty quantification for engineering problems that involve random obstacles or unilateral constraints.

Load-bearing premise

Standard properties of the random fields are sufficient to guarantee well-posedness of the continuous and discrete variational inequalities even when the solution has only low regularity.

What would settle it

A manufactured-solution test in which the computed H1-norm error for the expectation or second moment fails to decrease at rate O(h) with mesh size h would disprove the error estimate.

Figures

Figures reproduced from arXiv: 2604.25111 by Chenhui Zhu, Fei Wang, Weimin Han.

Figure 1
Figure 1. Figure 1: Comparison of statistical properties: expectation and variance of the exact solu view at source ↗
Figure 2
Figure 2. Figure 2: Absolute error in the expectation: comparison between the SG and MC solutions view at source ↗
Figure 3
Figure 3. Figure 3: Comparison of statistical properties: expectation and variance of the exact solu view at source ↗
Figure 4
Figure 4. Figure 4: Absolute error in the expectation: comparison between the SG and MC solutions view at source ↗
read the original abstract

This paper presents a numerical approach to the stochastic obstacle problem using the stochastic Galerkin (SG) method. Due to the low regularity of the solution, linear finite elements are employed in both the physical and random variable spaces. Properties of random fields and variational inequalities of the first kind are employed to establish the well-posedness of the problem. Finite element spaces are introduced to construct suitable approximation subspaces, and a comprehensive SG formulation is proposed to solve the stochastic obstacle problem. Well-posedness of the discrete formulation is shown and an optimal error estimate for the numerical solution in the $H^1$-norm is derived. Numerical experiments validate the effectiveness of the SG method, showing that both the expectation error and second moment error converge at a rate of $O(h)$ in the $H^1$-norm, consistent with theoretical predictions.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper develops a stochastic Galerkin (SG) finite-element method for stochastic elliptic variational inequalities of the first kind (obstacle problems). Linear elements are used in both physical and random spaces owing to low solution regularity. Well-posedness of the continuous and discrete problems is established via standard random-field properties and variational-inequality theory; an optimal O(h) error bound in the H¹-norm is derived for both the expectation and second-moment errors; and numerical experiments confirm the predicted convergence rates.

Significance. If the uniformity of coercivity constants with respect to the random parameter can be rigorously justified, the work supplies the first complete numerical analysis (well-posedness plus optimal-rate a priori estimate) for SG approximation of stochastic obstacle problems. Such problems arise in uncertainty quantification for contact and free-boundary models; the explicit O(h) rate for both first- and second-moment errors, together with the numerical validation, would be a useful reference for the stochastic-VI literature.

major comments (2)
  1. [error analysis / Céa estimate] The derivation of the O(h) H¹ error estimate (abstract and the section containing the Céa-type argument) implicitly requires that the coercivity and continuity constants of the random bilinear form a(ω;·,·) be independent of ω (or at least that their expectations remain finite and do not degrade the rate). The manuscript invokes only “standard properties of random fields” and “almost-sure positivity.” If the lower bound α(ω) can approach zero on sets of positive measure, then E[1/α(ω)] may be infinite and the hidden constant in the integrated error inequality can destroy the claimed O(h) rate. A precise statement of the uniform coercivity assumption (or an integrability condition on 1/α(ω)) is needed to close the argument.
  2. [discrete well-posedness] The well-posedness proof for the discrete SG formulation (section on discrete variational inequality) relies on the same random-field properties used for the continuous problem. It is not shown that the discrete coercivity constant remains bounded independently of the mesh size h and the stochastic dimension; without this, the discrete problem may lose uniform well-posedness and the subsequent error analysis becomes conditional.
minor comments (2)
  1. [preliminaries] Notation for the random space and the stochastic Galerkin projection is introduced without an explicit definition of the underlying probability space or the truncation of the Karhunen–Loève expansion; a short paragraph clarifying these objects would improve readability.
  2. [numerical results] The numerical experiments report convergence rates for expectation and second-moment errors but do not state the number of Monte-Carlo samples used for reference solutions or the precise definition of the discrete H¹-norm employed; these details should be added to the figure captions or experimental section.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. We address the two major points below and will revise the manuscript to add the required explicit assumptions and clarifications.

read point-by-point responses

  1. Referee: The derivation of the O(h) H¹ error estimate implicitly requires that the coercivity and continuity constants of the random bilinear form a(ω;·,·) be independent of ω. The manuscript invokes only “standard properties of random fields” and “almost-sure positivity.” If the lower bound α(ω) can approach zero on sets of positive measure, then E[1/α(ω)] may be infinite and the hidden constant can destroy the claimed O(h) rate. A precise statement of the uniform coercivity assumption is needed.

    Authors: We agree that an explicit statement is necessary. The analysis assumes the random field yields a bilinear form satisfying a(ω; v, v) ≥ α ‖v‖_{H¹}² almost surely with α > 0 independent of ω (a standard uniform ellipticity condition on the random coefficient). This ensures the Céa constant is uniform and the integrated O(h) bound holds for both expectation and second-moment errors. We will insert this assumption in the preliminaries and error-analysis sections of the revision. revision: yes

  2. Referee: The well-posedness proof for the discrete SG formulation relies on the same random-field properties. It is not shown that the discrete coercivity constant remains bounded independently of the mesh size h and the stochastic dimension.

    Authors: Because the discrete space is a subspace of the continuous space, the same uniform lower bound α applies directly to the discrete problem and is therefore independent of h. The stochastic Galerkin projection onto a finite-dimensional random space preserves the same coercivity constant under the uniform ellipticity assumption on the random field; the constant does not degrade with the dimension of the random approximation space. We will add a short remark after the discrete well-posedness proof to make this independence explicit. revision: yes

Circularity Check

0 steps flagged

No circularity: standard well-posedness and Céa estimates from external theory

full rationale

The derivation proceeds by invoking standard properties of random fields to obtain coercivity/continuity of the integrated bilinear form, applying classical variational inequality theory for existence/uniqueness of the continuous problem, introducing linear finite-element spaces in physical and random domains, proving discrete well-posedness by the same abstract theory, and obtaining an H^1 error bound via a Céa-type lemma whose constant depends only on the (assumed integrable) continuity/coercivity moduli. The O(h) rate follows directly from the approximation properties of linear elements under the given regularity; neither the error estimate nor the convergence statement is obtained by fitting parameters to data or by renaming an input quantity. Numerical experiments are presented only as validation, not as part of the proof. No self-citation is load-bearing for the central claims, and no step reduces a derived quantity to its own definition by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claims rest on standard domain assumptions about random fields and variational inequalities rather than new free parameters or invented entities.

axioms (1)
  • domain assumption Properties of random fields and variational inequalities of the first kind are sufficient to establish well-posedness of the stochastic obstacle problem.
    Invoked to prove existence and uniqueness before discretization.

pith-pipeline@v0.9.0 · 5440 in / 1277 out tokens · 48105 ms · 2026-05-07T15:43:25.064677+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

43 extracted references · 43 canonical work pages

  1. [1]

    Atkinson and W

    K. Atkinson and W. Han,Theoretical Numerical Analysis: A Functional Analysis Framework, Third Edition, Springer, New York, 2009

    work page 2009

  2. [2]

    Babuˇ ska and P

    I. Babuˇ ska and P. Chatzipantelidis, On solving elliptic stochastic partial differential equations,Computer Methods in Applied Mechanics and Engineering,191(2002), 4093– 4122

    work page 2002

  3. [3]

    Babuˇ ska, F

    I. Babuˇ ska, F. Nobile, and R. Tempone, A stochastic collocation method for elliptic partial differential equations with random input data,SIAM Journal on Numerical Analysis,45(2007), 1005–1034. 31

    work page 2007

  4. [4]

    Babuˇ ska, R

    I. Babuˇ ska, R. Tempone, and G. E. Zouraris, Galerkin finite element approximations of stochastic elliptic partial differential equations,SIAM Journal on Numerical Analysis, 42(2004), 800–825

    work page 2004

  5. [5]

    Babuˇ ska, R

    I. Babuˇ ska, R. Tempone, and G. E. Zouraris, Solving elliptic boundary value problems with uncertain coefficients by the finite element method: the stochastic formulation, Computer Methods in Applied Mechanics and Engineering,194(2005), 1251–1294

    work page 2005

  6. [6]

    Bierig and A

    C. Bierig and A. Chernov, Convergence analysis of multilevel Monte Carlo variance estimators and application for random obstacle problems,Numerische Mathematik,130 (2015), 579–613

    work page 2015

  7. [7]

    S. C. Brenner and L. R. Scott,The Mathematical Theory of Finite Element Methods, Third Edition. Springer, New York, 2008

    work page 2008

  8. [8]

    P. G. Ciarlet,The Finite Element Method for Elliptic Problems, North-Holland, Ams- terdam, 1978

    work page 1978

  9. [9]

    M. K. Deb, I. Babuˇ ska, and J. T. Oden, Solution of stochastic partial differential equa- tions using Galerkin finite element techniques,Computer Methods in Applied Mechanics and Engineering,190(2001), 6359–6372

    work page 2001

  10. [10]

    Durrett,Probability: Theory and Examples, Fifth Edition, Cambridge University Press, Cambridge; New York, 2019

    R. Durrett,Probability: Theory and Examples, Fifth Edition, Cambridge University Press, Cambridge; New York, 2019

    work page 2019

  11. [11]

    Duvaut and J.-L

    G. Duvaut and J.-L. Lions,Inequalities in Mechanics and Physics, Springer-Verlag, Berlin; New York, 1976

    work page 1976

  12. [12]

    C. Eck, J. Jaruˇ sek, and M. Krbec,Unilateral Contact Problems: Variational Methods and Existence Theorems, Monographs and Textbooks in Pure and Applied Mathematics 270, CRC Press, Boca Raton, 2005

    work page 2005

  13. [13]

    O. G. Ernst, C. E. Powell, D. J. Silvester, and E. Ullmann, Efficient solvers for a linear stochastic Galerkin mixed formulation of diffusion problems with random data,SIAM Journal on Scientific Computing,31(2) (2009), 1424–1447

    work page 2009

  14. [14]

    R. S. Falk, Error estimates for the approximation of a class of variational inequalities, Mathematics of Computation,28(1974), 963–971

    work page 1974

  15. [15]

    F. Feng, W. Han, and J. Huang, Virtual element methods for elliptic variational in- equalities of the second kind,Journal of Scientific Computing,80(2019), 60–80

    work page 2019

  16. [16]

    Forster and R

    R. Forster and R. Kornhuber, A polynomial chaos approach to stochastic variational inequalities,Journal of Numerical Mathematics,18(4) (2010), 235–255. 32

    work page 2010

  17. [17]

    Glowinski,Numerical Methods for Nonlinear Variational Problems, Springer-Verlag, New York, 1984

    R. Glowinski,Numerical Methods for Nonlinear Variational Problems, Springer-Verlag, New York, 1984

    work page 1984

  18. [18]

    Gwinner, A class of random variational inequalities and simple random unilat- eral boundary value problems-existence, discretization, finite element approximation

    J. Gwinner, A class of random variational inequalities and simple random unilat- eral boundary value problems-existence, discretization, finite element approximation. Stochastic Analysis and Applications,18(2000), 967–993

    work page 2000

  19. [19]

    Han and B

    W. Han and B. D. Reddy,Plasticity: Mathematical Theory and Numerical Analysis, Second Edition, Springer, New York, 2013

    work page 2013

  20. [20]

    Han and M

    W. Han and M. Sofonea,Quasistatic Contact Problems in Viscoelasticity and Viscoplas- ticity, Studies in Advanced Mathematics30, American Mathematical Society, Provi- dence, RI; International Press, Somerville, MA, 2002

    work page 2002

  21. [21]

    Hlav´ aˇ cek, J

    I. Hlav´ aˇ cek, J. Haslinger, J. Neˇ cas, and J. Lov´ ıˇ sek,Solution of variational inequalities in mechanics, Springer-Verlag, New York, 1988

    work page 1988

  22. [22]

    Hsing, R

    T. Hsing, R. L. Eubank,Theoretical Foundations of Functional Data Analysis, with An Introduction to Linear Operators, John Wiley & Sons, Chichester, 2015

    work page 2015

  23. [23]

    H¨ ueber and B

    S. H¨ ueber and B. I. Wohlmuth, A primal-dual active set strategy for non-linear multi- body contact problems,Computer Methods in Applied Mechanics and Engineering,194 (2005), 3147–3166

    work page 2005

  24. [24]

    K¨ arkk¨ ainen, K

    T. K¨ arkk¨ ainen, K. Kunisch, and P. Tarvainen, Augmented Lagrangian active set meth- ods for obstacle problems,Journal of Optimization Theory and Applications,119(2003), 499–533

    work page 2003

  25. [25]

    Kinderlehrer and G

    D. Kinderlehrer and G. Stampacchia,An Introduction to Variational Inequalities and Their Applications, SIAM, Philadelphia, 2000

    work page 2000

  26. [26]

    Kikuchi and J

    N. Kikuchi and J. T. Oden,Contact Problems in Elasticity: A Study of Variational Inequalities and Finite Element Methods, SIAM, Philadelphia, 1988

    work page 1988

  27. [27]

    Kornhuber, C

    R. Kornhuber, C. Schwab, and M. W. Wolf, Multilevel monte carlo finite element meth- ods for stochastic elliptic variational inequalities,SIAM Journal on Numerical Analysis, 52(2014), 1243–1268

    work page 2014

  28. [28]

    G. J. Lord, C. E. Powell, and T. Shardlow,An Introduction to Computational Stochastic PDEs, Cambridge University Press, New York, 2014

    work page 2014

  29. [29]

    Le Maˆ ıtre and O

    O. Le Maˆ ıtre and O. M. Knio,Spectral Methods for Uncertainty Quantification: with Applications to Computational Fluid Dynamics, Springer, Dordrecht, 2010. 33

    work page 2010

  30. [30]

    Øksendal,Stochastic Differential Equations: An Introduction with Applications, Sixth Edition, Springer, Berlin; Heidelberg, 2013

    B. Øksendal,Stochastic Differential Equations: An Introduction with Applications, Sixth Edition, Springer, Berlin; Heidelberg, 2013

    work page 2013

  31. [31]

    C. E. Powell, and H. C. Elman, Block-diagonal preconditioning for spectral stochastic finite-element systems,IMA Journal of Numerical Analysis,29(2) (2009), 350–375

    work page 2009

  32. [32]

    M. M. Rao, R. J. Swift,Probability Theory with Applications, Second Edition, Springer, New York, 2006

    work page 2006

  33. [33]

    J. F. Rodrigues,Obstacle Problems in Mathematical Physics, North-Holland, Amster- dam, 1987

    work page 1987

  34. [34]

    Rudin,Principles of Mathematical Analysis, Third Edition, McGraw-Hill, New York, 1976

    W. Rudin,Principles of Mathematical Analysis, Third Edition, McGraw-Hill, New York, 1976

    work page 1976

  35. [35]

    Schwab and R

    C. Schwab and R. A. Todor, Karhunen-Lo` eve approximation of random fields by gener- alized fast multipole methods,Journal of Computational Physics,217(2006), 100–122

    work page 2006

  36. [36]

    W. Shen, L. Ge, and W. Liu, Stochastic Galerkin method for optimal control problem governed by random elliptic PDE with state constraints,Journal of Scientific Comput- ing,78(2019), 1571–1600

    work page 2019

  37. [37]

    R. A. Todor and C. Schwab, Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients,IMA Journal of Numerical Analysis,27 (2007), 232–261

    work page 2007

  38. [38]

    Glowinski, J.-L

    R. Glowinski, J.-L. Lions, and R. Tr´ emoli` eres,Numerical Analysis of Variational In- equalities, North-Holland, Amsterdam, 1981

    work page 1981

  39. [39]

    F. Wang, W. Han, and X. Cheng, Discontinuous Galerkin methods for solving elliptic variational inequalities,SIAM Journal on Numerical Analysis,48(2010), 708–733

    work page 2010

  40. [40]

    F. Wang, W. Han, and X. Cheng, Discontinuous Galerkin methods for solving a qua- sistatic contact problem,Numerische Mathematik,126(2014), 771–800

    work page 2014

  41. [41]

    Wang and H

    F. Wang and H. Wei, Virtual element method for simplified friction problem,Applied Mathematics Letters,85(2018), 125–131

    work page 2018

  42. [42]

    Wang and H

    F. Wang and H. Wei, Virtual element methods for the obstacle problem,IMA Journal of Numerical Analysis,40(2020), 708–728

    work page 2020

  43. [43]

    Xiu, Efficient collocational approach for parametric uncertainty analysis,Communi- cations in Computational Physics,2(2007), 293–309

    D. Xiu, Efficient collocational approach for parametric uncertainty analysis,Communi- cations in Computational Physics,2(2007), 293–309. 34

    work page 2007