β Scribed by P. Jones; J. Ma; V. Rokhlin
No coin nor oath required. For personal study only.
An algorithm is presented for the rapid direct solution of the Laplace equation on regions with fractal boundaries. In a typical application, the numerical simulation has to be on a very large scale involving at least tens of thousands of equations with as many unknowns, in order to obtain any meaningful results. Attempts to use conventional techniques have encountered insurmountable difficulties, due to excessive CPU time requirements of the computations involved. Indeed, conventional direct algorithms for the solution of linear systems require order (O\left(N^{3}\right)) operations for the solution of an (N \times N)-problem, while classical iterative methods require order (O\left(N^{2}\right)) operations, with the constant strongly dependent on the problem in question. In either case, the computational expense is prohibitive for large-scale problems. The direct algorithm of the present paper requires (O(N)) operations with a constant dependent only on the geometry of the boundary, making it considerably more practical for large-scale problems encountered in the computation of harmonic measure of fractals, complex iteration theory, potential theory, and growth phenomena such as crystallization, electrodeposition, viscous fingering, and diffusion-limited aggregation. (c) 1994 Academic Press, inc.
π SIMILAR VOLUMES
We study the boundedness and a priori bounds of global solutions of the problem u"0 in ;(0, ΒΉ ), j S j R # j S j "h(u) on j ;(0, ΒΉ ), where is a bounded domain in 1,, is the outer normal on j and h is a superlinear function. As an application of our results we show the existence of sign-changing sta