Name
Abstract | ||
|---|---|---|
We formulate new optimal (fourth) order one step nodal cubic spline collocation methods for the solution of various elliptic boundary value problems in the unit square. These methods are constructed so that the respective collocation equations can be solved using matrix decomposition algorithms (MDAs). MDAs are fast, direct methods which employ fast Fourier transforms and require O(N2 log N) operations on an $N \times N$ uniform partition of the unit square. The results of numerical experiments exhibit expected global optimal orders of convergence as well as desired superconvergence phenomena. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1137/040609793 | SIAM J. Scientific Computing |
Keywords | Field | DocType |
matrix decomposition algorithm,collocation method,optimal superconvergent,numerical experiment,respective collocation equation,new optimal,collocation methods,global optimal order,unit square,step nodal cubic spline,direct method,n2 log,superconvergence,matrix decomposition,fast fourier transforms,cubic spline | Spline (mathematics),Mathematical optimization,Mathematical analysis,Matrix decomposition,Superconvergence,Fast Fourier transform,Unit square,Numerical analysis,Collocation method,Mathematics,Collocation | Journal |
Volume | Issue | ISSN |
27 | 2 | 1064-8275 |
Citations | PageRank | References |
5 | 0.84 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernard Bialecki | 1 | 114 | 18.61 |
| Graeme Fairweather | 2 | 142 | 33.42 |
| Andreas Karageorghis | 3 | 204 | 47.54 |