The Closest Point Method and Multigrid Solvers for Elliptic Equations on Surfaces
نویسندگان
چکیده
Elliptic partial differential equations are important both from application and analysis points of views. In this paper we apply the Closest Point Method to solving elliptic equations on general curved surfaces. Based on the closest point representation of the underlying surface, we formulate an embedding equation for the surface elliptic problem, then discretize it using standard finite differences and interpolation schemes on banded, but uniform Cartesian grids. We prove the convergence of the difference scheme for the Poisson’s equation on a smooth closed curve. In order to solve the resulting large sparse linear systems, we propose a specific geometric multigrid method in the setting of the Closest Point Method. Convergence studies both in the accuracy of the difference scheme and the speed of the multigrid algorithm show that our approaches are effective.
منابع مشابه
Introduction to Multigrid Methods for Elliptic Boundary Value Problems
We treat multigrid methods for the efficient iterative solution of discretized elliptic boundary value problems. Two model problems are the Poisson equation and the Stokes problem. For the discretization we use standard finite element spaces. After discretization one obtains a large sparse linear system of equations. We explain multigrid methods for the solution of these linear systems. The bas...
متن کاملHigher-dimensional Nonnested Multigrid Methods
Nonnested multigrid methods are shown to be optimal-order solvers for systems of finite element equations arising from elliptic boundary problems in any space dimension. Results are derived for Lagrange-type elements of arbitrary degree.
متن کاملConvergence Analysis of V-Cycle Multigrid Methods for Anisotropic Elliptic Equations
Fast multigrid solvers are considered for the linear systems arising from the bilinear finite element discretizations of second order elliptic equations with anisotropic diffusion. Optimal convergence of Vcycle multigrid method in the semi-coarsening case and nearly optimal convergence of V-cycle multigrid method with line smoothing in the uniformly coarsening case are established using the XZ ...
متن کاملOn Red-Black SOR Smoothing in Multigrid
Optimal relaxation parameters are obtained for red-black Gauss-Seidel relaxation in multigrid solvers of a family of elliptic equations. The resulting relaxation schemes are found to retain very high ef-ciency over an appreciable range of coeecients of the elliptic differential operator, yielding simple, inexpensive and fully paralleliz-able smoothers in many situations where less cost-eeective...
متن کاملOptimal-order Nonnested Multigrid Methods for Solving Finite Element Equations Ii: on Non-quasi-uniform Meshes
Nonnested multigrid methods are proved to be optimal-order solvers for finite element equations arising from elliptic problems in the presence of singularities caused by re-entrant corners and abrupt changes in the boundary conditions, where the multilevel grids are appropriately refined near singularities and are not necessarily nested. Therefore, optimal and realistic finer grids (compared wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 37 شماره
صفحات -
تاریخ انتشار 2015