Localization schemes in 2D boundary-fitted grids (Q1201052): Difference between revisions

The author disusses locusses localization shemes in two-dimensional struchemes in two-dimensional structured grids onsisting of consisting of convex four-point meshes. The algorithms are appliable to particable to particle-in-ell cell codes based on two-dimensional boundary-fitted oordinates in order to locoordintaes in order to localize particles inside the grid. They are fully vecles inside the grid. They are fully vectorizable and two of them are directly applictly applicable also to triangular meshes. Sine all of them are exace all of them are exact, they avoid an overhead for a special treatment of particial treatment of particles near the boundary. This makes them suitable for omplicomplicated geometries with outer and inner urved boundaries. A speedup of 3.5 to 8 curved boundaries. A speedup of 3.5 to 8 can be ahieved for the fastest algorithm, depending on the vechieved for the fastest algorithm, depending on the vector omputer used.