Skip to main content
Top
Published in: Engineering with Computers 2/2013

01-04-2013 | Original Article

Developing an ordering-based renumbering approach for triangular unstructured grids

Authors: Masoud Darbandi, Nematollah Fouladi

Published in: Engineering with Computers | Issue 2/2013

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Kallinderis Y, Vijayan P (1993) Adaptive refinement–coarsening scheme for three-dimensional unstructured meshes. AIAA J 31(8):1440–1447CrossRef Kallinderis Y, Vijayan P (1993) Adaptive refinement–coarsening scheme for three-dimensional unstructured meshes. AIAA J 31(8):1440–1447CrossRef
2.
go back to reference Farhat C, Pierson K, Degand C (2001) Multidisciplinary simulation of the maneuvering of an aircraft. Eng Comput 17:16–27MATHCrossRef Farhat C, Pierson K, Degand C (2001) Multidisciplinary simulation of the maneuvering of an aircraft. Eng Comput 17:16–27MATHCrossRef
3.
go back to reference 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–141MathSciNetMATHCrossRef 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–141MathSciNetMATHCrossRef
4.
go back to reference 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–40MathSciNetMATH 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–40MathSciNetMATH
5.
go back to reference Burgess DA, Giles MB (1997) Renumbering unstructured grids to improve the performance of codes on hierarchical memory machines. Adv Eng Softw 28(3):189–201CrossRef Burgess DA, Giles MB (1997) Renumbering unstructured grids to improve the performance of codes on hierarchical memory machines. Adv Eng Softw 28(3):189–201CrossRef
6.
go back to reference Mavriplis D (1998) Multigrid strategies for viscous flow solvers on anisotropic unstructured meshes. J Comput Phys 145(1):141–165MathSciNetMATHCrossRef Mavriplis D (1998) Multigrid strategies for viscous flow solvers on anisotropic unstructured meshes. J Comput Phys 145(1):141–165MathSciNetMATHCrossRef
7.
go back to reference 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 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.
go back to reference 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 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.
go back to reference Gloth O, Hanel D, Tran L, Vilsmeier R (2003) A front tracking method on unstructured grids. Comput Fluid 32(4):547–570MATHCrossRef Gloth O, Hanel D, Tran L, Vilsmeier R (2003) A front tracking method on unstructured grids. Comput Fluid 32(4):547–570MATHCrossRef
11.
go back to reference 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–109MathSciNetCrossRef 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–109MathSciNetCrossRef
12.
go back to reference Lohner R, Galle M (2003) Minimization of indirect addressing for edge-based field solvers. Commun Numer Meth Eng 18(5):335–343MathSciNetCrossRef Lohner R, Galle M (2003) Minimization of indirect addressing for edge-based field solvers. Commun Numer Meth Eng 18(5):335–343MathSciNetCrossRef
13.
go back to reference 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 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.
go back to reference 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–460MATHCrossRef 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–460MATHCrossRef
15.
go back to reference 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–459MATHCrossRef 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–459MATHCrossRef
16.
go back to reference 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 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.
go back to reference George A (1971) Computer implementation of the finite element method. Technical Report STAN-CS-71-208, Computer Science Department, Stanford University, California George A (1971) Computer implementation of the finite element method. Technical Report STAN-CS-71-208, Computer Science Department, Stanford University, California
18.
go back to reference 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–250MathSciNetMATHCrossRef 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–250MathSciNetMATHCrossRef
19.
go back to reference Farhat C (1988) A simple and efficient automatic FEM domain decomposer. Comput Struct 28(5):579–602CrossRef Farhat C (1988) A simple and efficient automatic FEM domain decomposer. Comput Struct 28(5):579–602CrossRef
20.
go back to reference 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–1000MATHCrossRef 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–1000MATHCrossRef
21.
go back to reference Giotis AP, Giannakoglou KC (1998) An unstructured grid partitioning method based on genetic algorithms. Adv Eng Softw 29(2):129–138CrossRef Giotis AP, Giannakoglou KC (1998) An unstructured grid partitioning method based on genetic algorithms. Adv Eng Softw 29(2):129–138CrossRef
23.
go back to reference Sloan SW, Randolph MF (1983) Automatic element reordering for finite element analysis with frontal solution schemes. Int J Numer Methods Eng 19(8):1153–1181MATHCrossRef Sloan SW, Randolph MF (1983) Automatic element reordering for finite element analysis with frontal solution schemes. Int J Numer Methods Eng 19(8):1153–1181MATHCrossRef
24.
go back to reference Mavriplis DJ (2008) Unstructured mesh discretizations and solvers for computational aerodynamics. AIAA J 46(6):1281–1298CrossRef Mavriplis DJ (2008) Unstructured mesh discretizations and solvers for computational aerodynamics. AIAA J 46(6):1281–1298CrossRef
25.
go back to reference 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–1751MATHCrossRef 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–1751MATHCrossRef
27.
go back to reference 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 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.
go back to reference Soto O, Löhner R, Camelli F (2003) A linelet preconditioner for incompressible flow solvers. Int J Heat Fluid Flow 13(1):133–147MATHCrossRef Soto O, Löhner R, Camelli F (2003) A linelet preconditioner for incompressible flow solvers. Int J Heat Fluid Flow 13(1):133–147MATHCrossRef
29.
30.
go back to reference Torres DJ, Li YH, Kong SC (2010) Partitioning strategies for parallel KIVA-4 engine simulations. Comput Fluid 39(2):301–309MATHCrossRef Torres DJ, Li YH, Kong SC (2010) Partitioning strategies for parallel KIVA-4 engine simulations. Comput Fluid 39(2):301–309MATHCrossRef
31.
go back to reference 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–1012MathSciNetMATH 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–1012MathSciNetMATH
32.
go back to reference 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 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
33.
go back to reference Hradek J, Kuchar M, Skala V (2003) Hash functions and triangular mesh reconstruction. Comput Geosci 29(6):741–751CrossRef Hradek J, Kuchar M, Skala V (2003) Hash functions and triangular mesh reconstruction. Comput Geosci 29(6):741–751CrossRef
34.
go back to reference 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 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
36.
go back to reference Baker TJ (1999) Delaunay–Voronoi methods. In: Thompson JF, Soni BK, Weatherill NP (eds) Handbook of grid generation. CRC Press, Boca Raton Baker TJ (1999) Delaunay–Voronoi methods. In: Thompson JF, Soni BK, Weatherill NP (eds) Handbook of grid generation. CRC Press, Boca Raton
37.
go back to reference Slawig T (2000) Domain optimization of a multi-element airfoil using automatic differentiation. Adv Eng Softw 32(3):225–237CrossRef Slawig T (2000) Domain optimization of a multi-element airfoil using automatic differentiation. Adv Eng Softw 32(3):225–237CrossRef
38.
go back to reference Landman D, Britcher CP (2000) Experimental geometry optimization techniques for multi-element airfoils. J Aircraft 37(4):707–713CrossRef Landman D, Britcher CP (2000) Experimental geometry optimization techniques for multi-element airfoils. J Aircraft 37(4):707–713CrossRef
Metadata
Title
Developing an ordering-based renumbering approach for triangular unstructured grids
Authors
Masoud Darbandi
Nematollah Fouladi
Publication date
01-04-2013
Publisher
Springer-Verlag
Published in
Engineering with Computers / Issue 2/2013
Print ISSN: 0177-0667
Electronic ISSN: 1435-5663
DOI
https://doi.org/10.1007/s00366-012-0259-9

Other articles of this Issue 2/2013

Engineering with Computers 2/2013 Go to the issue