Displaying similar documents to “Numerical analysis of the MFS for certain harmonic problems”

On the Schwarz algorithms for the Elliptic Exterior Boundary Value Problems

Faker Ben Belgacem, Michel Fournié, Nabil Gmati, Faten Jelassi (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

Tuning the alternating Schwarz method to the exterior problems is the subject of this paper. We present the original algorithm and we propose a modification of it, so that the solution of the subproblem involving the condition at infinity has an explicit integral representation formulas while the solution of the other subproblem, set in a bounded domain, is approximated by classical variational methods. We investigate many of the advantages of the new Schwarz approach: a geometrical...

On the Schwarz algorithms for the elliptic exterior boundary value problems

Faker Ben Belgacem, Miche Fournié, Nabil Gmati, Faten Jelassi (2005)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

Tuning the alternating Schwarz method to the exterior problems is the subject of this paper. We present the original algorithm and we propose a modification of it, so that the solution of the subproblem involving the condition at infinity has an explicit integral representation formulas while the solution of the other subproblem, set in a bounded domain, is approximated by classical variational methods. We investigate many of the advantages of the new Schwarz approach: a geometrical...

Certified reduced-basis solutions of viscous Burgers equation parametrized by initial and boundary values

Alexandre Janon, Maëlle Nodet, Clémentine Prieur (2013)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

We present a reduced basis offline/online procedure for viscous Burgers initial boundary value problem, enabling efficient approximate computation of the solutions of this equation for parametrized viscosity and initial and boundary value data. This procedure comes with a fast-evaluated rigorous error bound certifying the approximation procedure. Our numerical experiments show significant computational savings, as well as efficiency of the error bound.