Abstract
The numerical solution of the first biharmonic problem on polygonal plane domains is considered. A method is derived, which allows an arbitrary degree of finite-element approximation and the discretized system is solved by a fast iterative procedure. Theoretical estimates for the computational complexity are derived and a number of test examples are examined.

This publication has 0 references indexed in Scilit: