Boundary value problems for the Laplacian in the Euclidean space solved by symbolic computation
暂无分享,去创建一个
By means of the symbolic manipulation language REDUCE, a complete set of harmonic polynomials in Euclidean space is constructed. The method relies on the theory of monogenic functions defined in ℝn+1 and taking values in a Clifford algebra An. An approximate solution for the Dirichlet and Neumann problems in the form of a harmonic polynomial may be obtained. The method is applied to solying a Dirichlet problem in a cube.
[1] J. Walsh. The approximation of harmonic functions by harmonic polynomials and by harmonic rational functions , 1929 .
[2] Ralph W. Wilkerson,et al. Symbolic Computation and the Dirichlet Problem , 1984, Symbolic and Algebraic Computation.
[3] S. Bergmann. Über die Entwicklung der harmonischen Funktionen der Ebene und des Raumes nach Orthogonalfunktionen , 1922 .
[4] Fred Brackx,et al. Clifford algebra with Reduce , 1987 .