Nonlinear Galerkin methods and mixed finite elements: Two-grid algorithms for the Navier-Stokes equations (Q1338799): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s002110050056 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s002110050056 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970723296 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S002110050056 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:22, 10 December 2024

scientific article
Language Label Description Also known as
English
Nonlinear Galerkin methods and mixed finite elements: Two-grid algorithms for the Navier-Stokes equations
scientific article

    Statements

    Nonlinear Galerkin methods and mixed finite elements: Two-grid algorithms for the Navier-Stokes equations (English)
    0 references
    0 references
    0 references
    3 May 1995
    0 references
    A nonlinear Galerkin method using mixed finite elements is presented for the two-dimensional incompressible Navier-Stokes equations. The scheme is based on two finite element spaces \(X_ H\) and \(X_ h\) for the approximation of the velocity, defined respectively on one coarse grid with grid size \(H\) and on fine grid with grid size \(h\ll H\), and one finite element space \(M_ h\) for the approximation of the pressure. Nonlinearity and time dependence are both treated on the coarse space. We prove that the difference between the new nonlinear Galerkin method and the standard Galerkin solution is of the order of \(H^ 2\), both in velocity \((H^ 1(\Omega)\) norm) and pressure \((L^ 2(\Omega)\) norm). We also discuss a penalized version of our algorithm which enjoys similar properties.
    0 references
    finite element spaces
    0 references
    approximation of the velocity
    0 references
    coarse grid
    0 references
    fine grid
    0 references
    penalized version of algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references