A Fast Algorithm for the Electromagnetic Scattering from a Large Cavity
A fast algorithm is presented for solving electromagnetic scattering from a rectangular open cavity embedded in an infinite ground plane. The medium inside the cavity is assumed to be (vertically) la...
A fast algorithm is presented for solving electromagnetic scattering from a rectangular open cavity embedded in an infinite ground plane. The medium inside the cavity is assumed to be (vertically) la...
On the Nonnormality of Subiteration for a Fluid-Structure-Interaction Problem
Subiteration forms the basic iterative method for solving the aggregated equations in fluid-structure-interaction problems, in which the fluid and structure equations are solved alternatingly subject...
Subiteration forms the basic iterative method for solving the aggregated equations in fluid-structure-interaction problems, in which the fluid and structure equations are solved alternatingly subject...
You are not logged in to this journal. Log in
Optimal Superconvergent One Step Nodal Cubic Spline Collocation Methods
SIAM J. Sci. Comput. Volume 27, Issue 2, pp. 575-598 (2005)
Issue Date: 2005
Connotea
CiteULike
del.icio.us
BibSonomy
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.
©2005 Society for Industrial and Applied Mathematics| Permalink: | http://dx.doi.org/10.1137/040609793 |
KEYWORDS and AMS
PUBLICATION DATA
1064-8275 (print)
1095-7197 (online)
SIAM