Name
Abstract | ||
|---|---|---|
A cascadic multigrid method for semilinear elliptic problem is analysed. It has been proved that the algorithm has optimal order of convergence in energy norm and quasi-optimal computational complexity under more general conditions. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.amc.2003.10.022 | Applied Mathematics and Computation |
Keywords | Field | DocType |
computational complexity,cascadic multigrid method,semilinear elliptic problem,order of convergence,multigrid method | Convergence (routing),Mathematical optimization,Mathematical analysis,Decomposition method (constraint satisfaction),Rate of convergence,Partial differential equation,Mathematics,Domain decomposition methods,Multigrid method,Elliptic curve,Computational complexity theory | Journal |
Volume | Issue | ISSN |
159 | 2 | Applied Mathematics and Computation |
Citations | PageRank | References |
5 | 0.49 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shuzi Zhou | 1 | 53 | 7.19 |
| Hexing Hu | 2 | 5 | 0.49 |