Publication

Stability of time-splitting schemes for the Stokes problem with stabilized finite elements

Jacques Rappaz, Marco Picasso
2001
Journal Articles

Abstract

The time-dependent Stokes problem is solved using continuous, piecewise linear finite elements and a classical stabilization procedure. Four order-one methods are proposed for the time discretization. The first one is nothing but the Euler backward scheme and requires a large linear system involving the velocity and pressure unknowns to be solved. The other three schemes allow velocity and pressure computations to be decoupled, namely the pressure-matrix method, a method based on an inexact LU factorization, and an operator splitting method. Stability and condition number estimates are derived. Numerical experiments in two space dimensions confirm the theoretical predictions. (C) 2001 John Wiley & Sons, Inc.

Official source

https://infoscience.epfl.ch/entities/publication/dcacdc52-25ac-4b8b-826a-abf70ae4ef5b

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Jacques Rappaz, Marco Picasso
2001
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/dcacdc52-25ac-4b8b-826a-abf70ae4ef5b

About this result

Related concepts (32)

Iterative method

In computational mathematics, an iterative method is a mathematical procedure that uses an initial value to generate a sequence of improving approximate solutions for a class of problems, in which the n-th approximation is derived from the previous ones. A specific implementation with termination criteria for a given iterative method like gradient descent, hill climbing, Newton's method, or quasi-Newton methods like BFGS, is an algorithm of the iterative method.

Explicit and implicit methods

Explicit and implicit methods are approaches used in numerical analysis for obtaining numerical approximations to the solutions of time-dependent ordinary and partial differential equations, as is required in computer simulations of physical processes. Explicit methods calculate the state of a system at a later time from the state of the system at the current time, while implicit methods find a solution by solving an equation involving both the current state of the system and the later one.

Finite element method

The finite element method (FEM) is a popular method for numerically solving differential equations arising in engineering and mathematical modeling. Typical problem areas of interest include the traditional fields of structural analysis, heat transfer, fluid flow, mass transport, and electromagnetic potential. The FEM is a general numerical method for solving partial differential equations in two or three space variables (i.e., some boundary value problems).

Related publications (32)

Stability of time-splitting schemes for the Stokes problem with stabilized finite elements

Chat with Graph Search

Postulate‐Driven Neural Networks for Constitutive Modelling of Inelasticity, Internal Variable Discovery and FEM Implementation

Discovering Partial Differential Equations With Neural Cellular Automata

Accelerated Solvers for Neutral Particle Dynamics in Plasma Simulation