A Cascadic Multigrid Algorithm on the Shishkin Mesh for a Singularly Perturbed Elliptic Problem
نویسندگان
چکیده
منابع مشابه
Analysis of a Streamline-Diffusion Finite Element Method on Bakhvalov-Shishkin Mesh for Singularly Perturbed Problem
Abstract. In this paper, a bilinear Streamline-Diffusion finite element method on Bakhvalov-Shishkin mesh for singularly perturbed convection – diffusion problem is analyzed. The method is shown to be convergent uniformly in the perturbation parameter ǫ provided only that ǫ ≤ N. An O(N(lnN)) convergent rate in a discrete streamline-diffusion norm is established under certain regularity assumpti...
متن کاملA Cascadic Algorithm for Nonlinearly Perturbed Elliptic Dirichlet Problems
In this paper we propose a cascadic algorithm for nonlinearly perturbed elliptic Dirichlet problems. The nonlinear equations arising from certain nite element discretizations are solved by Newton's method. The cascadic algorithm starts on a comparatively coarse grid where the number of unknowns is small enough to obtain an approximate solution within suu-ciently high precision without substanti...
متن کاملA Cascadic Multigrid Method for Eigenvalue Problem
A cascadic multigrid method is proposed for eigenvalue problems based on the multilevel correction scheme. With this new scheme, an eigenvalue problem on the finest space can be solved by linear smoothing steps on a series of multilevel finite element spaces and nonlinear correcting steps on special coarsest spaces. Once the sequence of finite element spaces and the number of smoothing steps ar...
متن کاملExperiments with a Shishkin Algorithm for a Singularly Perturbed Quasilinear Parabolic Problem with a Moving Interior Layer
In Russ. Acad. Dokl. Math., 48, 1994, 346–352, Shishkin presented a numerical algorithm for a quasilinear time dependent singularly perturbed differential equation, with an internal layer in the solution. In this paper, we implement this method and present numerical results to illustrate the convergence properties of this numerical method.
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1901/1/012052