On the cibstryctuib of discretizations of elliptic partial differential equations

Algorithmic aspects of a class of finite element collocation methods for the approximate numerical solution of elliptic partial differential equations are described Locall for each finite element the approximate solution is a polynomial. polynomials corresponding toadjacent finite elements need not match continuously but their values and noumal derivatives match at a discrete set of points on the common boundary.High order accuracy can be attained by increasing the number of mathching points and the number of colloction points for each finite element.Forlinear equations the collocation methods can be equivalently definde as generlized finite difference methods. The linear (or linearzed )equations that arise from the discretization lend themselves well to solution by the methods of the methods nested dissection.An implememtation is described and some numerical results are givevn.