A new convergence proof for approximations of the Stefan problem

06/14/2022
by   Robert Eymard, et al.
0

We consider the Stefan problem, firstly with regular data and secondly with irregular data. In both cases is given a proof for the convergence of an approximation obtained by regularising the problem. These proofs are based on weak formulations and on compactness results in some Sobolev spaces with negative exponents.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/14/2023

Temporal approximation of stochastic evolution equations with irregular nonlinearities

In this paper we prove convergence for contractive time discretisation s...
research
06/06/2018

Another Proof of Cuckoo hashing with New Variants

We show a new proof for the load of obtained by a Cuckoo Hashing data st...
research
12/28/2021

Conforming virtual element approximations of the two-dimensional Stokes problem

The virtual element method (VEM) is a Galerkin approximation method that...
research
04/01/2019

Students' Proof Assistant (SPA)

The Students' Proof Assistant (SPA) aims to both teach how to use a proo...
research
07/08/2023

What is the meaning of proofs? A Fregean distinction in proof-theoretic semantics

The origins of proof-theoretic semantics lie in the question of what con...
research
08/22/2022

Regular languages defined by first-order formulas without quantifier alternation

We give a simple new proof that regular languages defined by first-order...
research
01/14/2021

Lebesgue integration. Detailed proofs to be formalized in Coq

To obtain the highest confidence on the correction of numerical simulati...

Please sign up or login with your details

Forgot password? Click here to reset