Loading...
Please wait, while we are loading the content...
Similar Documents
Estimates for multigrid methods based on red-black Gauss-Seidel smoothings
| Content Provider | Semantic Scholar |
|---|---|
| Author | Parter, Seymour V. |
| Copyright Year | 1988 |
| Abstract | SummaryTheMGR[v] algorithms of Ries, Trottenberg and Winter, the Algorithms 2.1 and 6.1 of Braess and the Algorithm 4.1 of Verfürth are all multigrid algorithms for the solution of the discrete Poisson equation (with Dirichlet boundary conditions) based on red-black Gauss-Seidel smoothing. Both Braess and Verfürth give explicit numerical upper bounds on the rate of convergence of their methods in convex polygonal domains. In this work we reconsider these problems and obtain improved estimates for theh−2h Algorithm 4.1 as well asW-cycle estimates for both schemes in non-convex polygonal domains. The proofs do not depend on the strengthened Cauchy inequality. |
| Starting Page | 701 |
| Ending Page | 723 |
| Page Count | 23 |
| File Format | PDF HTM / HTML |
| DOI | 10.1007/BF01395819 |
| Volume Number | 52 |
| Alternate Webpage(s) | https://page-one.springer.com/pdf/preview/10.1007/BF01395819 |
| Alternate Webpage(s) | https://doi.org/10.1007/BF01395819 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
