Search

This paper proposes a density-based topology optimization method for natural convection problems using the lattice Boltzmann method (LBM). As the LBM can be developed as a completely explicit scheme, its attractive features over the traditional ones, such as the finite element method, are (1) suitability for solving unsteady flow problems and (2) scalability for large-scale parallel computing. We develop an LBM code for solving unsteady natural convection problems and provide its sensitivity analysis based on the so-called adjoint lattice Boltzmann method. Notably, the adjoint equation is derived from the discrete particle velocity Boltzmann equation and can be solved similarly to the original LBM concerning unsteady natural convection problems. We first show that the proposed method can produce similar results to the previous work in a steady-state natural convection problem. We then demonstrate the efficacy of the proposed method through 2D numerical examples concerning unsteady natural convection. As a large-scale problem, we tackle a 3D unsteady natural convection problem on a parallel supercomputer. All the developed codes written in C++ are available at . [ABSTRACT FROM AUTHOR]

A finite difference method for a time-dependent singularly perturbed convection–diffusion–reaction problem involving two small parameters in one space dimension is considered. We use the classical implicit Euler method for time discretization and upwind scheme on the Shishkin–Bakhvalov mesh for spatial discretization. The method is analysed for convergence and is shown to be uniform with respect to both the perturbation parameters. The use of the Shishkin–Bakhvalov mesh gives first-order convergence unlike the Shishkin mesh where convergence is deteriorated due to the presence of a logarithmic factor. Numerical results are presented to validate the theoretical estimates obtained. [ABSTRACT FROM PUBLISHER]

Weak Galerkin (WG method) is a numerical method based on the weak functions and weak partial derivatives, which has been widely developed in recent decades. In the implementation, different degrees of freedom (DOFs) are distributed in the element interior and boundary respectively, which leads to a great impact on the computational complexity. In our work, we propose a new reduced-order weak galerkin finite element (RO-WG) method with seldom DOFs, where the proper orthogonal decomposition (POD) technique is adopted to save CPU time. The parabolic equation is considered for a test problem. Some numerical examples are given to prove the superiority of this method, where the CPU time can be reduced a lot. [ABSTRACT FROM AUTHOR]