Results 241 to 250 of about 215,493 (276)
Some of the next articles are maybe not open access.
Grid embedding technique using Cartesian grids for Euler solutions
AIAA Journal, 1988Grid-embedding techniques are presently applied to the solutions of the Euler equations on Cartesian grids for the NACA 0012 airfoil and the multielement SKF1.1 airfoil at transonic speeds. Based on comparisons with solutions on fine grids, it is shown that the present scheme, when used in conjunction with the Runge-Kutta time-stepping scheme as well ...
R. A. Mitcheltree +2 more
openaire +1 more source
A uniformly stable conformal FDTD‐method in Cartesian grids
International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, 2003AbstractA conformal finite‐difference time‐domain algorithm for the solution of electrodynamic problems in general perfectly conducting 3D geometries is presented. Unlike previous conformal approaches it has the second‐order convergence without the need to reduce the maximal stable time step of conventional staircase approach.
Zagorodnov, I. A. +2 more
openaire +1 more source
An adaptive Cartesian grid generation method for ‘Dirty’ geometry
International Journal for Numerical Methods in Fluids, 2002AbstractTraditional structured and unstructured grid generation methods need a ‘water‐tight’ boundary surface grid to start. Therefore, these methods are named boundary to interior (B2I) approaches. Although these methods have achieved great success in fluid flow simulations, the grid generation process can still be very time consuming if ‘non‐water ...
Wang, Z. J., Srinivasan, Kumar
openaire +2 more sources
Topology preserving advection of implicit interfaces on Cartesian grids
Journal of Computational Physics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhipeng Qin +3 more
openaire +3 more sources
LES on Cartesian Grids with Anisotropic Refinement
2007Cartesian grids with local anisotropic adaptation are combined with an Immersed Boundary (IB) method and used to perform large eddy simulations. The approach used to generate Cartesian grids with desired normal and tangential resolution to three-dimensional surfaces is described.
Gianluca Iaccarino, Frank Ham
openaire +1 more source
A Hybrid Grid Generation Using Unstructured Prismatic and Cartesian Grids
41st Aerospace Sciences Meeting and Exhibit, 2003A hybrid gri d generation method based on prismatic and Cartesian grid is being developed. The main objective is to generate grid around c omplicated geometry for compressible and viscou s flow simulation , especially that with high Reynolds number . The method is based on unstructured grid, which treats cells as arbitrary, unstructured polyhedra.
openaire +1 more source
A weakly-compressible Cartesian grid approach for hydrodynamic flows
Computer Physics Communications, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. Bigay +3 more
openaire +2 more sources
Cartesian Grid Methods for Moving Geometries
2006Abstract : Many classes of physical problem can be models through the use of sets of linear equations. The solution of the sets of equations is equivalent to calculation ova matrix inverse or generalized inverse, or to the reduction of the matrix to some type of canonical form, including determination of characteristic equation.
openaire +1 more source
The LIR Space Partitioning System Applied to Cartesian Grids
2014We introduce a novel multi-dimensional space partitioning method. A new type of tree combines the advantages of the Octree and the KD-tree without having their disadvantages. We present in this paper a new data structure allowing local refinement, parallelization and proper restriction of transition ratios between cells.
Sven Linden +2 more
openaire +2 more sources
Trajectory Calculations for Spherical Geodesic Grids in Cartesian Space
Monthly Weather Review, 1999Abstract This paper shows how to obtain accurate and efficient trajectory calculations for spherical geodesic grids in Cartesian space. Determination of the departure points is essential to characteristic-based methods that trace the value of a function to the foot of the characteristics and then either integrate or interpolate at this location.
openaire +2 more sources