A note on the capacitance matrix algorithm, substructuring, and mixed or Neumann boundary conditions

Abstract We develop in this work variants of the capacitance matrix algorithm which can be used to solve discretizations of elliptic partial differential equations when either the original system of equations or one which arises from substructuring has a rank-deficient matrix.

[1]  L. Kramarz.  Stability of collocation methods for the numerical solution ofy″=f (x,y) , 1980 .

[2]  R. Hockney.  The potential calculation and some applications , 1970 .

[3]  T. Chan.  Analysis of preconditioners for domain decomposition , 1987 .

[4]  B. L. Buzbee,et al.  The direct solution of the discrete Poisson equation on irregular regions , 1970 .

[5]  O. Widlund,et al.  A Finite Element-Capacitance Matrix Method for the Neumann Problem for Laplace's Equation , 1980 .

[6]  Ben P. Sommeijer,et al.  Explicit Runge-Kutta (-Nyström) methods with reduced phase errors for computing oscillating solutions , 1987 .

[7]  O. Widlund,et al.  On the Numerical Solution of Helmholtz's Equation by the Capacitance Matrix Method , 1976 .

[8]  R. G. Voigt,et al.  A methodology for exploiting parallelism in the finite element process , 1983 .

[9]  R. Nicolaides,et al.  On substructuring algorithms and solution techniques for the numerical approximation of partial differential equations , 1986 .

[10]  M. Rizea,et al.  A numerov-like scheme for the numerical solution of the Schrödinger equation in the deep continuum spectrum of energies , 1980 .

[11]  John Gregg Lewis,et al.  The Numerical Solution of a Nonseparable Elliptic Partial Differential Equation by Preconditioned Conjugate Gradients. , 1980, Journal of research of the National Bureau of Standards.

[12]  Alston S. Householder,et al.  The Theory of Matrices in Numerical Analysis , 1964 .

[13]  G. P. Astrakhantsev.  Method of fictitious domains for a second-order elliptic equation with natural boundary conditions , 1978 .