DG-Mesh-Optimization

KO | EN

gitlite — search

#javascript #hacktoberfest #ai #typescript #llm #golang #nodejs #windows #awesome #vue #security #mcp #openai #open-source

DG-Mesh-Optimization

(★ 11)

Discontinuous Galerkin (DG) solver (C++) coupled with a Quasi-Newton line-search algorithm (Python) to optimize the DG mesh.

DG-Mesh-Optimization 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

**Date written: December 2020**

This project was pursued as my final project for MECH 579 (Multidisciplinary Design Optimization, i.e. MDO) at McGill University, taught by Professor Nadarajah of the Mechanical Engineering department.

# Discontinous Galerkin Mesh Optimization

## Introduction

In the field of computational fluid dynamics (CFD), the discontinuous Galerkin (DG) method is a widely used high-order numerical method for discretizing partial differential equations (PDEs). In the DG method, the computational domain is discretized into elements, this is referred to as the mesh, and within each element, the solution is locally reconstructed by polynomials of order P. Favourably, the method allows for discontinuities between elements by employing a numerical flux (i.e. an approximate Riemann solver). For a problem in which high-gradient regions are present, a mesh that conforms to these high-gradient locations would reduced the error between the numerical and exact solution, while keeping the number of elements and P constant. It is such a mesh that is the motivation of this project, to use an optimization algorithm to determine the optimal location of the element vertices such that the DG solution error is minimized.

## Project Description

In this project, the equation to be solved using DG is the **steady-state linear advection** equation, in which a manufactured high-gradient solution is chosen. An unconstrained optimization algorithm, the Quasi-Newton line-search algorithm, is employed to minimize the error of the DG solution, computing the gradient numerically using the finite-difference method, while the hessian is computed numerically using the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method. For more details, refer to the report by clicking [here](https://drive.google.com/file/d/1GbJ9X1QdWYxXuT8GbWvLEF5mlCfxHY86/view?usp=sharing).

## DG Solver Spectral Convergence

## Mesh Optimization

### Convergence of Gradient and Minimization of L2-error

### Optimization Path of Mesh Vertices

#### Equispaced Mesh Vertices

#### Optimized Mesh Vertices

### Remarks

From the results above we see that the initial L2-error has been successfully decreased by 2 orders of magnitude by optimizing the vertex locations. From the optimization path of vertices with the exact solution superimposed, we see that the vertices move towards the closest high-gradient region, as expected.

The DG solver parameters were selected such that the DG solution is sufficiently smooth to apply finite- difference for computing the gradient of the objective function, while having an initial L2-error that does not lie on the spectral convergence asymptote. In addition, the need for an initial sufficiently smooth DG solution was needed to avoid having vertex overlap as an unconstrained optimization algorithm was used and cannot guarantee this will never occur.

On the other hand, the optimization parameters were selected such that the algorithm performed acceptably; these were determined by trial and error.

DG-Mesh-Optimization

DG-Mesh-Optimization 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

DG-Mesh-Optimization

DG-Mesh-Optimization 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README