girdap: Open source object-oriented autonomous grid management library for solving equations of conservation laws

Date

2017-10-12

Author

Uzgoren, Eray

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

28
views

0
downloads

girdap is an object-oriented grid generation and management library that uses finite volume operator objects to provide researchers and educators a framework to solve different sets of algebraic and differential equations on multiple grid objects, which are allowed to interact with each other. Grid objects have the capability of performing local anisotropic grid refinement (h-adaptation) as well as relocating their vertices (r-adaptation) to resolve length scales based on solution field obtained using algebraic and finite volume based differential operator objects. This paper provides an overview of girdap with the focus on software-related aspects. Its capabilities are illustrated through examples, including steady heat diffusion equation on adaptive grids and laminar lid-driven cavity flow using fractional step method.

Subject Keywords

General Engineering, General Computer Science

URI

https://hdl.handle.net/11511/63375

Journal

COMPUTERS & FLUIDS

DOI

https://doi.org/10.1016/j.compfluid.2017.06.027

Collections

Engineering, Article

Suggestions

OpenMETU
Core

A robust bi-objective mathematical model for disaster rescue units allocation and scheduling with learning effect Tirkolaee, Erfan Babaee; Aydin, Nadi Serhan; Ranjbar-Bourani, Mehdi; Weber, Gerhard Wilhelm (Elsevier BV, 2020-11-01) This paper proposes a novel bi-objective mixed-integer linear programming (MILP) model for allocating and scheduling disaster rescue units considering the learning effect. When a natural phenomenon (e.g., earthquake or flood) occurs, the presented decision support model is expected to help decision-makers of emergency relief centers to provide efficient planning for rescue units to minimize the total weighted completion time of rescue operations, as well as the total delay in rescue operations. The problem ...
GMDH2: Binary Classification via GMDH-Type Neural Network Algorithms-R Package and Web-Based Tool DAĞ, OSMAN; KARABULUT, ERDEM; Alpar, Reha (Atlantis Press, 2019-01-01) Group method of data handling (GMDH)-type neural network algorithms are the self-organizing algorithms for modeling complex systems. GMDH algorithms are used for different objectives; examples include regression, classification, clustering, forecasting, and so on. In this paper, we present GMDH2 package to perform binary classification via GMDH-type neural network algorithms. The package offers two main algorithms: GMDH algorithm and diverse classifiers ensemble based on GMDH (dce-GMDH) algorithm. GMDH algo...
A unifying grid approach for solving potential flows applicable to structured and unstructured grid configurations Cete, A. Ruhsen; Yuekselen, M. Adil; Kaynak, Uenver (Elsevier BV, 2008-01-01) In this study, an efficient numerical method is proposed for unifying the structured and unstructured grid approaches for solving the potential flows. The new method, named as the "alternating cell directions implicit - ACDI", solves for the structured and unstructured grid configurations equally well. The new method in effect applies a line implicit method similar to the Line Gauss Seidel scheme for complex unstructured grids including mixed type quadrilateral and triangle cells. To this end, designated al...
Parallel Scalable PDE Constrained Optimization Antenna Identification in Hyperthermia Cancer Treatment Planning SCHENK, Olaf; Manguoğlu, Murat; CHRİSTEN, Matthias; SATHE, Madan (Springer Science and Business Media LLC, 2009-01-01) We present a PDE-constrained optimization algorithm which is designed for parallel scalability on distributed-memory architectures with thousands of cores. The method is based on a line-search interior-point algorithm for large-scale continuous optimization, it is matrix-free in that it does not require the factorization of derivative matrices. Instead, it uses a new parallel and robust iterative linear solver on distributed-memory architectures. We will show almost linear parallel scalability results for t...
Personnel assignment problem with hierarchical ordering constraints Toroslu, İsmail Hakkı (Elsevier BV, 2003-10-01) In the standard assignment problem, there is no constraint on the partitions of the bipartite graph. The only objective is to maximize the summation of the weights of the matched edges. Any node in one partition can be matched with any node in the other partition without any restriction. In this paper, we study a variation of the standard assignment problem, having some ordering constraints on the partitions of the bipartite graph. We call this problem as 'assignment problem with hierarchical ordering const...

Citation Formats

E. Uzgoren, “girdap: Open source object-oriented autonomous grid management library for solving equations of conservation laws,” COMPUTERS & FLUIDS, pp. 642–652, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/63375.