pbutils.c File Reference

More...

#include <stdio.h>
#include <stdlib.h>
#include "pbutils.h"
#include "queue.h"

Include dependency graph for pbutils.c:

Go to the source code of this file.

Functions
void	make_nei_ele (const int m, const int n, const int l, int **nei_ele)
	Computes neighbor cell elements array. More...
int	searcharr (int val, int *arr, int size)
	Search element in the given array. If element exists, return 1. More...
void	make_reordering (const int nele, const int nface, int **nei_ele, int *mapping, int *unmapping)
	Reverse Cuthill-McKee algorithm using neighbor elements. More...
void	make_coloring (const int m, const int n, const int l, int *icolor, int *lcolor)
	Coloring algorithm for unstructured grid. More...

Detailed Description

======================================================================================================================

This file contains utility functions to construct arrays used in example. Shape and size of each array are identical to the pyBaram formulation, and each function was modified for the unstructured hexahedral mesh format.

Author

• Namhyoung Kim (knhks.nosp@m.e@in.nosp@m.ha.ed.nosp@m.u), Department of Aerospace Engineering, Inha University
• Jin Seok Park (jinse.nosp@m.ok.p.nosp@m.ark@i.nosp@m.nha..nosp@m.ac.kr), Department of Aerospace Engineering, Inha University

Date

July 2024

Version

1.0

Copyright

Copyright (c) 2024, Namhyoung Kim and Jin Seok Park, Inha University, All rights reserved.

License

This project is release under the terms of the MIT License (see LICENSE file).

---

Definition in file pbutils.c.

Function Documentation

make_coloring()

void make_coloring	(	const int	m,
		const int	n,
		const int	l,
		int *	icolor,
		int *	lcolor
	)

Coloring algorithm for unstructured grid.

Note

In this function, original multi-coloring algorithm is simplified into Red-Black coloring (checkerboard) scheme due to the properties of hexahedral mesh.

Parameters

m	number of elements in x-direction
n	number of elements in y-direction
l	number of elements in z-direction
icolor	Color Index of each cell
lcolor	Color level of each cell

Definition at line 153 of file pbutils.c.

Here is the call graph for this function:

Here is the caller graph for this function:

make_nei_ele()

void make_nei_ele	(	const int	m,
		const int	n,
		const int	l,
		int **	nei_ele
	)

Computes neighbor cell elements array.

Parameters

m	number of elements in x-direction
n	number of elements in y-direction
l	number of elements in z-direction
nei_ele	array storing neighbor elements

Definition at line 36 of file pbutils.c.

Here is the call graph for this function:

Here is the caller graph for this function:

make_reordering()

void make_reordering	(	const int	nele,
		const int	nface,
		int **	nei_ele,
		int *	mapping,
		int *	unmapping
	)

Reverse Cuthill-McKee algorithm using neighbor elements.

Parameters

nele	Number of element cells
nface	Number of faces depends on element type
nei_ele	Indices for neighbor cells [nface, neles]
mapping	Reordered index by Reverse Cuthill-McKee algorithm [neles]
unmapping	Original index before Reverse Cuthill-McKee algorithm [neles]

Queue data structure

Last element index

Indexing variables

Definition at line 99 of file pbutils.c.

Here is the call graph for this function:

Here is the caller graph for this function:

searcharr()

int searcharr	(	int	val,
		int *	arr,
		int	size
	)

Search element in the given array. If element exists, return 1.

Parameters

val	Value for searching
arr	Object array
size	Size of array

Definition at line 78 of file pbutils.c.

Here is the caller graph for this function: