An efficient solution algorithm for boundary element equations

Boundary element techniques result in the solution of a linear system of equations of the type HU = GQ + B, which can be transformed into a system of equations of the type AX = F. The coefficient matrix A requires the storage of a full matrix on the computer. This storage requirement, of the order of n^*n memory positions (n = number of equations), for a very large n is often considered negative for the boundary element method. Here, two algorithms are presented where the memory requirements to solve the system are only n^*(n - 1)/2 and n^*n/4 respectively. The algorithms do not necessitate any external storage devices nor do they increase the computational efforts.