Splitting extrapolation method for solving second-order parabolic equations with curved boundaries by using domain decomposition and d-quadratic isoparametric finite elements

Authors:
Xiaoming He;Tao Lü
Affiliations:
Department of Mathematics, Virginia Tech, Blacksburg, VA, U.S.A;Department of Mathematics, Sichuan University, Chengdu, Sichuan, P.R, China
Venue:
International Journal of Computer Mathematics - Splitting Methods for Differential Equations
Year:
2007

Citing 2
Cited 5

Finite Element Method for Elliptic Problems

Finite Element Method for Elliptic Problems
Splitting extrapolation for solving second order elliptic systems with curved boundary in Rd by using d-quadratic isoparametric finite element

Applied Numerical Mathematics

A splitting extrapolation for solving nonlinear elliptic equations with d-quadratic finite elements

Journal of Computational Physics
A Finite Element Splitting Extrapolation for Second Order Hyperbolic Equations

SIAM Journal on Scientific Computing
An algorithm using the finite volume element method and its splitting extrapolation

Journal of Computational and Applied Mathematics
Splitting extrapolation algorithm for first kind boundary integral equations with singularities by mechanical quadrature methods

Advances in Computational Mathematics
Splitting extrapolation algorithms for solving the boundary integral equations of anisotropic Darcy's equation on polygons by mechanical quadrature methods

Numerical Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

This article discusses a splitting extrapolation method for solving second-order parabolic equations with curved boundaries by using domain decomposition and d-quadratic isoparametric finite elements. This method possesses superconvergence, a high order of accuracy and a high degree of parallelism. First, we prove the multi-variable asymptotic expansion of fully discrete d-quadratic isoparametric finite element errors. Based on the expansion, we generate splitting extrapolation formulas. These formulas generate a numerical solution on a globally fine grid with higher accuracy by solving only a set of smaller discrete subproblems on different coarser grids. Therefore, a large-scale multidimensional problem with a curved boundary is turned into a set of smaller discrete subproblems on a polyhedron. Because these subproblems are independent of each other and have similar scales, our algorithm possesses a high degree of parallelism. In addition, this method is effective for solving discontinuous problems if we regard the interfaces of the problems as the interfaces of the initial domain decomposition. Our numerical results also show that the algorithm is effective for solving nonlinear parabolic equations.