Abstract
Super computers together with low cost 32 bit machines with graphics render more actual the challenge of designing a general purpose Fluid Dynamic code. Such an approach was the key to the introduction of computational structural mechanics into the design cycle. There FEM codes have replaced experiments and are evaluation tools at every stage. Except for a very limited domain (low Reynolds numbers for instance) this “black box” concept cannot be aplied in fluid mechanics. Nevertheless the success of the modular approach of FIDAP, the addition of new models and the extension of its pre and post-processing capabilities bring a new bridge between the fluid mechanics engineer and the design floor shop. It is now the task of the scientific community to design acceptable models in domains like turbulent flows,multiphase flows slightly compressible flows and so on. At the same time faster and robust algorithms for highly non linear problems must be devised.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Brezzi F. ‘On the Existence Uniqueness and Approximation of Saddle Point Problems arising from Lagrangian Multipliers.’ RAIRO (An. Numerique) 8,129–151,1974.
Bercovier M.and Engelman M., ‘A Finite Element for the Numerical Solution of Viscous Incompressible Flows.’ J. of Comp. Phys.,36, 181–201,1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Bercovier, M., Engelman, M. (1986). Simulation of large incompressible flows by the finite element method. In: Zhuang, F.G., Zhu, Y.L. (eds) Tenth International Conference on Numerical Methods in Fluid Dynamics. Lecture Notes in Physics, vol 264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0041775
Download citation
DOI: https://doi.org/10.1007/BFb0041775
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17172-0
Online ISBN: 978-3-540-47233-9
eBook Packages: Springer Book Archive