2020
DOI: 10.1137/19m1239593
|View full text |Cite
|
Sign up to set email alerts
|

A Sequential Least Squares Method for Poisson Equation Using a Patch Reconstructed Space

Abstract: We propose a new least squares finite element method to solve the Poisson equation. By using a piecewisely irrotational space to approximate the flux, we split the classical method into two sequential steps. The first step gives the approximation of flux in the new approximation space and the second step can use flexible approaches to give the pressure. The new approximation space for flux is constructed by patch reconstruction with one unknown per element consisting of piecewisely irrotational polynomials. Th… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 34 publications
0
5
0
Order By: Relevance
“…In this section, we propose a sequential least squares finite element method to solve the Stokes problem based on the first-order system (2.4). We are motivated by the idea in [16,27] to decouple the system (2.4) into two steps. The first first-order system is defined to seek the numerical approximations to the gradient U and the pressure p, which reads…”
Section: Sequential Least Squares Methods For Stokes Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…In this section, we propose a sequential least squares finite element method to solve the Stokes problem based on the first-order system (2.4). We are motivated by the idea in [16,27] to decouple the system (2.4) into two steps. The first first-order system is defined to seek the numerical approximations to the gradient U and the pressure p, which reads…”
Section: Sequential Least Squares Methods For Stokes Problemmentioning
confidence: 99%
“…The novelty is that we construct three specific approximation spaces which allow us to solve the Stokes problem in two sequential steps. The sequential process is motivated from the idea in [16,27] to define two least-squares-type functionals to approximate unknowns sequentially. The feasibility of this method is based on new approximation spaces which are obtained by solving local least squares problems on each element.…”
Section: Introductionmentioning
confidence: 99%
“…In this section, we define three types of reconstruction operators that will be used in numerically solving (2.4). The first one is the reconstruction operator which has been used in [24,22,25] and the other two operators are extensions from the first one. The reconstruction procedure includes two parts.…”
Section: Reconstructed Approximation Spacementioning
confidence: 99%
“…We refer to [9] and the references therein for an overview of least squares finite element methods. Based on discontinuous approximation, the discontinuous least squares finite element methods have also been developed for many problems including the Stokes problem, and we refer to [7,6,4,3,25] for more details.…”
Section: Introductionmentioning
confidence: 99%
“…The discontinuous Galerkin method by patch reconstruction (PRDG) was firstly introduced in [12] by Li et al to solve elliptic equations. The method has been successfully applied into the biharmonic problem [11], the Stokes problem [13,14], the eigenvalue problem [15], the linear elasticity problem [16], the convection-diffusion problem [19] and the sequential least square method [17]. This method was originally motivated by the patch reconstruction technique in the finite volume scheme for the hydrodynamic solver [20].…”
mentioning
confidence: 99%