Skip to main content
SpringerLink
Log in

Developing an ordering-based renumbering approach for triangular unstructured grids

  • Original Article
  • Published:
Engineering with Computers Aims and scope Submit manuscript

Abstract

The unstructured grid generation and employment have become very common in computational fluid dynamics applications since a few decades ago. Comparing with the structured grid data, the unstructured grid has a random data structure known as unstructured data structure (USDS). In this work, we develop a new method to convert the USDS of a triangular unstructured grid to a quasi-structured data structure (QSDS) using an ordering-based renumbering approach. In this method, the unstructured grid data is re-ordered in a manner to represent several bands in the original unstructured grid domain. Each band presents one element layer and two node lines. Then, the indices of elements and nodes are renumbered in a unified direction for the entire constructed element layers and node lines, respectively. These numbers eventually present ascending sets of element and node indices in each element layer and every node line of the resulting QSDS. This method alleviates the random USDS drawbacks because the scattered node and element numbers in the original USDS are reordered and renumbered properly. To show the robustness of the current method, we construct a few arbitrary unstructured grid distributions and convert their ordinary USDS to our innovated QSDS without requiring additional data storage.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

References

  1. Kallinderis Y, Vijayan P (1993) Adaptive refinement–coarsening scheme for three-dimensional unstructured meshes. AIAA J 31(8):1440–1447

    Article  Google Scholar 

  2. Farhat C, Pierson K, Degand C (2001) Multidisciplinary simulation of the maneuvering of an aircraft. Eng Comput 17:16–27

    Article  MATH  Google Scholar 

  3. Darbandi M, Vakilipour S (2008) Developing implicit pressure-weighted upwinding scheme to calculate steady and unsteady flows on unstructured grids. Int J Numer Methods Fluid 56(2):115–141

    Article  MathSciNet  MATH  Google Scholar 

  4. Douglas CC, Hu J, Kowarschik M, Rude U, Weiss C (2000) Cache optimization for structured and unstructured grid multigrid. Electron Trans Numer Anal 10:21–40

    MathSciNet  MATH  Google Scholar 

  5. Burgess DA, Giles MB (1997) Renumbering unstructured grids to improve the performance of codes on hierarchical memory machines. Adv Eng Softw 28(3):189–201

    Article  Google Scholar 

  6. Mavriplis D (1998) Multigrid strategies for viscous flow solvers on anisotropic unstructured meshes. J Comput Phys 145(1):141–165

    Article  MathSciNet  MATH  Google Scholar 

  7. Gropp WD, Kaushik DK, Keyes DE, Smith B (2000) Performance modeling and tuning of an unstructured mesh CFD application. In: proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM), p 34-es, November 04–10, Dallas, Texas

  8. White BS, McKee SA, Supinski BR de, Miller B, Quinlan D, Schulz M (2005) Improving the computational intensity of unstructured mesh applications. In: proceedings of the 19th annual international conference on Supercomputing, June 20–22, 2005, Cambridge, Massachusetts

  9. Gloth O, Hanel D, Tran L, Vilsmeier R (2003) A front tracking method on unstructured grids. Comput Fluid 32(4):547–570

    Article  MATH  Google Scholar 

  10. Darbandi M, Fouladi N (2011) A reduced domain strategy for local mesh movement application in unstructured grids. App Numer Math 61(9):1001–1016. doi:10.1016/j.apnum.2011.04.005

  11. Lohner R (1998) Renumbering strategies for unstructured-grid solvers operating on shared-memory, cache-based parallel machines. Comput Methods Appl Mech Eng 163(1–4):95–109

    Article  MathSciNet  Google Scholar 

  12. Lohner R, Galle M (2003) Minimization of indirect addressing for edge-based field solvers. Commun Numer Meth Eng 18(5):335–343

    Article  MathSciNet  Google Scholar 

  13. Darbandi M, Schneider GE, Bostandoost SM (2004) Parallel computation of a fully implicit finite volume method using different ordering strategies, AIAA Paper 2004-0994, In: The 42nd AIAA Aerospace Sciences Meeting and Exhibit, Reno, Nevada, 2004

  14. Coutinho ALGA, Martins MAD, Sydenstricker RM, Elias RN (2006) Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured grid computations. Int J Numer Methods Eng 66(3):431–460

    Article  MATH  Google Scholar 

  15. Martí R, Laguna M, Glover F, Campos V (2001) Reducing the bandwidth of a sparse matrix with tabu search. Eur J Oper Res 135(2):450–459

    Article  MATH  Google Scholar 

  16. Cuthill E, McKee J (1969) Reducing the bandwidth of sparse symmetric matrices. In: Proceeding of ACM National Conference, Association for Computing Machinery, New York, pp 157–172

  17. George A (1971) Computer implementation of the finite element method. Technical Report STAN-CS-71-208, Computer Science Department, Stanford University, California

  18. Gibbs NE, Poole WG, Stockmeyer PK (1976) An algorithm for reducing the bandwidth and profile of sparse matrix. SIAM J Numer Anal 13(2):236–250

    Article  MathSciNet  MATH  Google Scholar 

  19. Farhat C (1988) A simple and efficient automatic FEM domain decomposer. Comput Struct 28(5):579–602

    Article  Google Scholar 

  20. Farhat C, Maman N, Brown GW (1995) Mesh partitioning for implicit computations via iterative domain decomposition: impact and optimization of the subdomain aspect ratio. Int J Numer Methods Eng 38(6):989–1000

    Article  MATH  Google Scholar 

  21. Giotis AP, Giannakoglou KC (1998) An unstructured grid partitioning method based on genetic algorithms. Adv Eng Softw 29(2):129–138

    Article  Google Scholar 

  22. Seol ES, Shephard MS (2006) Efficient distributed mesh data structure for parallel automated adaptive analysis. Eng Comput 22:197–213. doi:10.1007/s00366-006-0048-4

    Article  Google Scholar 

  23. Sloan SW, Randolph MF (1983) Automatic element reordering for finite element analysis with frontal solution schemes. Int J Numer Methods Eng 19(8):1153–1181

    Article  MATH  Google Scholar 

  24. Mavriplis DJ (2008) Unstructured mesh discretizations and solvers for computational aerodynamics. AIAA J 46(6):1281–1298

    Article  Google Scholar 

  25. Rehman M ur, Vuik C, Segal G (2008) A comparison of preconditioners for incompressible Navier–Stokes solvers. Int J Numer Meth Fluids 57(12):1731–1751

    Article  MATH  Google Scholar 

  26. Hassan O, Morgan K, Peraire J (1991) An implicit finite-element method for high-speed flows. Int J Numer Met Eng 32(1):183–205. http://onlinelibrary.wiley.com/doi/10.1002/nme.v32:1/issuetoc

    Google Scholar 

  27. Lohner R (1991) Simple elements and linelets for incompressible flows. In: Onate E, Periaux J, Samucisson A CIMNE finite elements in the 90’s. Barcelona

  28. Soto O, Löhner R, Camelli F (2003) A linelet preconditioner for incompressible flow solvers. Int J Heat Fluid Flow 13(1):133–147

    Article  MATH  Google Scholar 

  29. Zhou M, Xie T, Seol S, Shephard MS, Sahni O, Jansen KE (2011) Tools to support mesh adaptation on massively parallel computers. Eng Comput. doi:10.1007/s00366-011-0218-x

    Google Scholar 

  30. Torres DJ, Li YH, Kong SC (2010) Partitioning strategies for parallel KIVA-4 engine simulations. Comput Fluid 39(2):301–309

    Article  MATH  Google Scholar 

  31. Ramezani A, Mazaheri K (2010) Multigrid convergence acceleration for implicit and explicit solution of Euler equations on unstructured grids. Int J Numer Methods Fluid 62(9):994–1012

    MathSciNet  MATH  Google Scholar 

  32. Zhou M, Sahni O, Shephard MS, Carothers CD, Jansen KE (2010) Adjacency-based data reordering algorithm for acceleration of finite element computations. Scientific Program 18(2):107–123

    Google Scholar 

  33. Hradek J, Kuchar M, Skala V (2003) Hash functions and triangular mesh reconstruction. Comput Geosci 29(6):741–751

    Article  Google Scholar 

  34. Formaggia L (1999) Data structure for unstructured mesh generation. In: Thompson JF, Soni BK, Weatherill NP (eds) Handbook of grid generation. CRC Press, Boca Raton

    Google Scholar 

  35. Borouchaki H, George PL (1997) Aspects of 2-D Delaunay mesh generation. Int J Numer Methods Eng 40:1957–1975

    Article  MathSciNet  MATH  Google Scholar 

  36. Baker TJ (1999) Delaunay–Voronoi methods. In: Thompson JF, Soni BK, Weatherill NP (eds) Handbook of grid generation. CRC Press, Boca Raton

    Google Scholar 

  37. Slawig T (2000) Domain optimization of a multi-element airfoil using automatic differentiation. Adv Eng Softw 32(3):225–237

    Article  Google Scholar 

  38. Landman D, Britcher CP (2000) Experimental geometry optimization techniques for multi-element airfoils. J Aircraft 37(4):707–713

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Aerospace Engineering, Center of Excellence in Aerospace Systems, Sharif University of Technology, Azadi Ave., P. O. Box 11365-8639, Tehran, Iran

    Masoud Darbandi & Nematollah Fouladi

Authors
  1. Masoud Darbandi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nematollah Fouladi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masoud Darbandi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Darbandi, M., Fouladi, N. Developing an ordering-based renumbering approach for triangular unstructured grids. Engineering with Computers 29, 225–243 (2013). https://doi.org/10.1007/s00366-012-0259-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00366-012-0259-9

Keywords

Search

Navigation