Symbolic Analysis and Computational Algorithm Construction
In this paper an analysis is presented that, in the Maurice Holt tradition, provides the means of obtaining specific information about the system of governing equations that can be exploited to construct more efficient computational algorithms. Symbolic analysis is very easy to apply, robust and usually produces considerable insight into the likely behaviour of the solution of the governing equations.
KeywordsConvection Enthalpy Vorticity sinO
Unable to display preview. Download preview PDF.
- 1.S.W. Armfield and C.A.J. Fletcher: “Symbolic Analysis of Partial Differential Equations” Comp. Math. Applic, to appear, 1989.Google Scholar
- 4.C.A.J. Fletcher: “Computational Exploitation of the Reduced Navier-Stokes Equations”, Proc. ISCFD-Sydney (eds G. de Vahl Davis and C.A.J. Fletcher), North-Holland, Amsterdam, 407–416, 1988.Google Scholar
- 7.M. Holt: Numerical Methods in Fluid Dynamics, Springer-Verlag, Heidelberg, 1984.Google Scholar
- 8.R.A. Platfoot and C.A.J. Fletcher: “Curvilinear Coordinate System-fitted to the Three-Dimensional Navier-Stokes Equations for Flows in Duets” Proc. CTAC-85 (eds. B.J. Noye and R.L. May), North-Holland, Amsterdam, 312–325, 1986.Google Scholar
- 9.R.A. Platfoot and C.A.J. Fletcher: “Prediction of Three-Dimensional Turbulent Flow in a Circular-Arc Duct using Transformed Equations”, Proc. ISCFD — Sydney (eds G. de Vahl Davis and C.A.J. Fletcher), North-Holland, Amsterdam, 599–608, 1988.Google Scholar
- 12.Y.C. Vigneron, J.V. Rackich and J.C. Tannehill: NASA Tech Memo 78500, 1978.Google Scholar