.png){kind=icon}
.png){kind=icon}
Return
Discretization schemes on triangular grids
.png){kind=icon}
PRE
AI
DOI：10.1016/S0045-7825(97)00191-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Physical applications posed on irregular domains have caused difficulties in the use of many, otherwise effective, discretization schemes. In two-dimensional examples, we consider discretization schemes on triangles to approximate irregular domains. Although finite element, mixed finite element, and finite volume schemes for triangles are well understood, efficient solvers are essential for their effective use. In this paper, we consider certain cell-centered finite difference schemes on triangles, both for their theoretical properties on regular grids, and as effective preconditioners for other discretization schemes for more general triangulations. Two cell-centered finite difference schemes (four-point star stencils) are derived from the simplification of the lowest-order Raviart-Thomas mixed finite element discretization on certain triangular grids. Optimal and superconvergence error estimates for both the solution and the gradient of the solution are established. The accuracy of these schemes is also discussed in the case of discontinuous coefficients. Computational experiments verify the error estimates. Finally, the use of these methods as preconditioners is also discussed.
Keywords:
2ND-ORDER ELLIPTIC PROBLEMS
FINITE-DIFFERENCE SCHEME
MULTIGRID ALGORITHMS
PRECONDITIONERS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.3W
Citations:
5.6W
Organization
No organization information available