zbMATH — the first resource for mathematics

An evaluation of several differencing methods for inviscid fluid flow problems. (English) Zbl 0155.21102

PDF BibTeX Cite
Full Text: DOI
[1] Bohachevsky, I.; Rubin, E., Aiaa j., 4, 600-607, (1966)
[2] Bohachevsky, I.; Mates, R., Aiaa j., 4, 776-782, (1966)
[3] {\scJ. Kurzrock} and {\scR. Mates} Exact Numerical Solutions of the Time-Dependent Compressible Navier-Stokes Equations. AIAA Paper No. 66-30.
[4] Fromm, J., The time-dependent flow of an incompressible viscous fluid, (), 345-382
[5] Lax, P., Commun. pure appl. math., 7, 159-193, (1954)
[6] von Neumann, J.; Richtmyer, R.D., J. appl. phys., 21, 232-237, (1950)
[7] Longley, H.J., Methods of differencing in Eulerian hydrodynamics, Los alamos scientific laboratory, LAMS-2379, (1960)
[8] Richtmyer, R.D., Difference methods for initial value problems, (1957), Interscience New York · Zbl 0155.47502
[9] Rusanov, V., Calculation of interaction of non-steady shock waves with obstacles, National research council of Canada, translation no. 1027, (1962)
[10] Burstein, S., Finite difference calculations for hydrodynamic flows containing discontinuities, () · Zbl 0166.22103
[11] Emery, A.F., An evaluation of several differencing methods for inviscid fluid flow problems, () · Zbl 0155.21102
[12] Lax, P.; Wendroff, B., Commun. pure appl. math., 13, 217-237, (1960)
[13] Richtmyer, R.D., A survey of difference methods for non-steady fluid dynamics, () · Zbl 0256.76044
[14] {\scA. F. Emery}, NUFF, A Program for Computing Numerical Flow Fields. SCL-DR-67-66 (to be published). Sandia Corporation, Livermore, California.
[15] Miles, J.W.; Mirels, H.; Wang, H.E., Aiaa j., 4, 1127-1128, (1966)
[16] {\scP. D. Lax}, Private communication, September 1967.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.