DeepAI AI Chat

A new convergence proof for approximations of the Stefan problem

06/14/2022

∙

by Robert Eymard, et al.

∙

∙

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.

Robert Eymard
8 publications
Thierry Gallouet
5 publications

page 1

page 2

page 3

page 4

∙ 12/05/2017

Analyzing Individual Proofs as the Basis of Interoperability between Proof Systems

We describe the first results of a project of analyzing in which theorie...

0 Gilles Dowek, et al. ∙

∙ 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...

0 Udi Wieder, et al. ∙

∙ 12/28/2021

Conforming virtual element approximations of the two-dimensional Stokes problem

The virtual element method (VEM) is a Galerkin approximation method that...

0 Gianmarco Manzini, et al. ∙

∙ 04/01/2019

Students' Proof Assistant (SPA)

The Students' Proof Assistant (SPA) aims to both teach how to use a proo...

0 Anders Schlichtkrull, et al. ∙

∙ 01/08/2021

Projection in negative norms and the regularization of rough linear functionals

In order to construct regularizations of continuous linear functionals a...

0 Felipe Millar, et al. ∙

∙ 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...

0 Andreas Krebs, et al. ∙

∙ 01/14/2021

Lebesgue integration. Detailed proofs to be formalized in Coq

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

0 Francois Clément, et al. ∙