Abstract
In this paper the new numerical algorithm for solving fundamental solutions i.e. Green’s functions is proposed. By direct discreting after integrating differential equation, it is possible for one to get the numerical solutions of Green’s functions satisfying the governing differential equation. Owing to avoidance of the integral transform in the method proposed in this paper, it is natural that there exists no ill-possed mathematical problem of the inverse integral transform. As a result of this not only a great quantity of calculation can be reduced but also the accuracy and steadiness of calculation improved. It is suitable for various classes of differential equation and varieties of boundary condition. The paper gives a numerical result. The new algorithm is fully proved to be available in practical applicâtion. It is worth pointing out as Green’s functions are expressed in this paper in an inverse matrix form, it is not only fairly easy to be accepted and mastered by engineers and technicians, but also convenient to be realized on computers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C.A.Brebbia: Progress in Boundary Element Method (1981).
Liu Jiaqi: Inverse Probleme and Numerical Method for Differential Equation (1986).
D.Evanenko and A.Sokolov: Classical Field Theory (1958).
Liang Kunmiao: Mathematical and Physical Method (1978).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fengsheng, B., Jiaqi, L. (1987). A New Numerical Algorithm for Solving Fundamental Solutions. In: Brebbia, C.A., Wendland, W.L., Kuhn, G. (eds) Mathematical and Computational Aspects. Boundary Elements IX, vol 9/1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21908-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-662-21908-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-21910-2
Online ISBN: 978-3-662-21908-9
eBook Packages: Springer Book Archive