Convergence analysis of numerical schemes for the Darcy-Forchheimer problem

by   Toni Sayah, et al.

This paper deals with the Darcy-Forchheimer problem with two kinds of boundary conditions. We discretize the system by using the finite element methods and we propose two iterative schemes to solve the discrete problems. The well-posedness and the convergence of the corresponding iterative problems are then proven. Finally, several numerical experiments are performed to validate the proposed numerical schemes.



page 1

page 2

page 3

page 4


Auxiliary iterative schemes for the discrete operators on de Rham complex

The main difficulty in solving the discrete source or eigenvalue problem...

A C^0 finite element approximation of planar oblique derivative problems in non-divergence form

This paper proposes a C^0 (non-Lagrange) primal finite element approxima...

FDTD schemes for Maxwell interface problems with perfect electric conductors based on the correction function method

In this work, we propose FDTD schemes based on the correction function m...

Entrywise convergence of iterative methods for eigenproblems

Several problems in machine learning, statistics, and other fields rely ...

Convergence analysis of discrete high-index saddle dynamics

Saddle dynamics is a time continuous dynamics to efficiently compute the...

A neural network based policy iteration algorithm with global H^2-superlinear convergence for stochastic games on domains

In this work, we propose a class of numerical schemes for solving semili...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.