Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Poisson equation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17

Numerical prediction of three-dimensional juncture region flow using the parabolic Navier-Stokes equations

A numerical solution algorithm is established for prediction of subsonic turbulent three-dimensional flows in aerodynamic configuration juncture regions. A turbulence closure model is established using the complete Reynolds stress. Pressure coupling is accomplished using the concepts of complementary and particular solutions to a Poisson equation. Specifications for data input juncture geometry modification are presented.

Baker, A. J.↗

Numerical Solution of Incompressible Navier-Stokes Equations Using a Fractional-Step Approach

A fractional step method for the solution of steady and unsteady incompressible Navier-Stokes equations is outlined. The method is based on a finite volume formulation and uses the pressure in the cell center and the mass fluxes across the faces of each cell as dependent variables. Implicit treatment of convective and viscous terms in the momentum equations enables the numerical stability restrictions to be relaxed. The linearization error in the implicit solution of momentum equations is reduced by using three subiterations in order to achieve second order temporal accuracy for time-accurate calculations. In spatial discretizations of the momentum equations, a high-order (3rd and 5th) flux-difference splitting for the convective terms and a second-order central difference for the viscous terms are used. The resulting algebraic equations are solved with a line-relaxation scheme which allows the use of large time step. A four color ZEBRA scheme is employed after the line-relaxation procedure in the solution of the Poisson equation for pressure. This procedure is applied to a Couette flow problem using a distorted computational grid to show that the method minimizes grid effects. Additional benchmark cases include the unsteady laminar flow over a circular cylinder for Reynolds Numbers of 200, and a 3-D, steady, turbulent wingtip vortex wake propagation study. The solution algorithm does a very good job in resolving the vortex core when 5th-order upwind differencing and a modified production term in the Baldwin-Barth one-equation turbulence model are used with adequate grid resolution.

Kiris, Cetin↗

Computation of turbine flowfields with a Navier-Stokes code

A new technique has been developed for the solution of the incompressible Navier-Stokes equations. The numerical technique, derived from a pressure substitution method (PSM), overcomes many of the deficiencies of the pressure crrection method. This technique allows for the direct solution of the actual pressure in the form of a Poisson equation which is derived from the pressure weighted substitution of the full momentum equations into the continuity equation. In two-dimensions a turbine flowfield, including heat transfer, has been computed with this method and the prediction of the cascade performance is presented. The extension of the pressure correction method for the solution of three-dimensional flows is also presented for laminar flow in an S-shaped duct and turbulent flow in the end-wall region of a turbine cascade.

Hobson, G. V.↗

A pressure based method for the solution of viscous incompressible turbomachinery flows

A new technique was developed for the solution of the incompressible Navier-Stokes equations. The numerical technique, derived from a pressure substitution method (PSM), overcomes many of the deficiencies of the pressure correction method. This technique allows for the direct solution of the actual pressure in the form of a Poisson equation which is derived from the pressure weighted substitution of the full momentum equations into the continuity equation. Two dimensional internal flows are computed with this method. The prediction of cascade performance is presented. The extention of the pressure correction method for the solution of three dimensional flows is also presented.

Hobson, Garth Victor↗

Spectral multigrid methods for the solution of homogeneous turbulence problems

New three-dimensional spectral multigrid algorithms are analyzed and implemented to solve the variable coefficient Helmholtz equation. Periodicity is assumed in all three directions which leads to a Fourier collocation representation. Convergence rates are theoretically predicted and confirmed through numerical tests. Residual averaging results in a spectral radius of 0.2 for the variable coefficient Poisson equation. In general, non-stationary Richardson must be used for the Helmholtz equation. The algorithms developed are applied to the large-eddy simulation of incompressible isotropic turbulence.

Erlebacher, G.↗

Spectral multigrid methods for the solution of homogeneous turbulence problems

New three-dimensional spectral multigrid algorithms are analyzed and implemented to solve the variable coefficient Helmholtz equation. Periodicity is assumed in all three directions which leads to a Fourier collocation representation. Convergence rates are theoretically predicted and confirmed through numerical tests. Residual averaging results in a spectral radius of 0.2 for the variable coefficient Poisson equation. In general, non-stationary Richardson must be used for the Helmholtz equation. The algorithms developed are applied to the large-eddy simulation of incompressible isotropic turbulence.

Erlebacher, G.↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

Perturbation solution of the Navier-Stokes equations and its relation to the Lighthill-Curle solution of aerodynamic sound

The aerodynamic sound described by the Lighthill-Curle solution is reexamined using a method of matched asymptotic expansions. The governing Navier-Stokes equations written in nondimensional form are expanded for a small Mach number. First- and second-order solutions for the pressure field are obtained, and the singular nature of the expansion at large distances is indicated. The nearfield pressure is governed by the Poisson equation, whereas the farfield equations describe a linear wave system in a dissipative medium. The pseudosound is related to the incompressible Reynolds stresses associated with a solenoidal velocity field, the velocity, the pressure perturbation, and their derivatives on the boundaries. A uniformly valid first-order solution for the pressure is obtained. It is shown that viscosity, thermal conductivity, and entropy in the flow do not contribute to the first-order noise generation, while the viscous stress contributes to noise only from some boundaries. The application of the proposed perturbation method to a subsonically moving surface and a hot jet is discussed.

Pan, Y. S.↗

Numerical simulation of the leading-edge separation vortex for a wing and strake-wing configuration

In the present investigation, the 'thin layer' Navier-Stokes equations are used to compute the flow about a delta wing and a strake-delta wing configuration. Both configurations possess blunt noses and rounded leading edges. The computational grid about these configurations is generated using a newly developed three-dimensional grid-generation code which solves a set of Poisson equations with spherical coordinate variables using an alternating direction implicit (ADI) scheme. Computational results are obtained for an isolated wing with 60 deg sweep and a strake-wing configuration with 80-60 deg sweep. Computations for angles of attack in the range from 6 to 30 deg are presented. Attention is given to the effect of the angle of attack, the Mach number, and the Reynolds number. Theoretical results are compared with experimental data.

Fujii, K.↗

A high-order numerical algorithm for DNS of low-Mach-number reactive flows with detailed chemistry and quasi-spectral accuracy

A novel and efficient algorithm is presented in this paper to deal with DNS of turbulent reacting flows under the low-Mach-number assumption, with detailed chemistry and a quasi-spectral accuracy. The temporal integration of the equations relies on an operating-split strategy, where chemical reactions are solved implicitly with a stiff solver and the convection-diffusion operators are solved with a Runge-Kutta-Chebyshev method. The spatial discretisation is performed with high-order compact schemes, and a FFT based constant-coefficient spectral solver is employed to solve a variable-coefficient Poisson equation. The numerical implementation takes advantage of the 2DECOMP&FFT libraries developed by, which are based on a pencil decomposition method of the domain and are proven to be computationally very efficient. An enhanced pressure-correction method is proposed to speed up the achievement of machine precision accuracy. It is demonstrated that a second-order accuracy is reached in time, while the spatial accuracy ranges from fourth-order to sixth-order depending on the set of imposed boundary conditions. In conclusion, the software developed to implement the present algorithm is called HOLOMAC, and its numerical efficiency opens the way to deal with DNS of reacting flows to understand complex turbulent and chemical phenomena in flames.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On mass conservation and solvability of the discretized variable-density zero-Mach Navier-Stokes equations

This paper presents a study of a variable-density zero-Mach Navier-Stokes discretization and subtle difficulties associated with the pressure. A consistent compatibility condition between the temperature and velocity is first derived. It is shown that one can accurately and efficiently solve all primitive variables with the uniform order of accuracy of the specified discretization and time-marching schemes. It is shown that higher density ratios than those commonly reported are achievable, and it is, in part, traced to the solvability of the pressure Poisson equation. Numerical properties are assessed with the method of manufactured solutions, and several classical testing cases are carried out to validate the code, ranging from variable-density mixing problems to premixed flames with forcing.

42 ENGINEERING↗

A fast, matrix-based method to perform omnidirectional pressure integration

Abstract Experimentally-measured pressure fields play an important role in understanding many fluid dynamics problems. Unfortunately, pressure fields are difficult to measure directly with non-invasive, spatially resolved diagnostics, and calculations of pressure from velocity have proven sensitive to error in the data. Omnidirectional line integration methods are usually more accurate and robust to these effects as compared to implicit Poisson equations, but have seen slower uptake due to the higher computational and memory costs, particularly in 3D domains. This paper demonstrates how omnidirectional line integration approaches can be converted to a matrix inversion problem. This novel formulation uses an iterative approach so that the boundary conditions are updated each step, preserving the convergence behavior of omnidirectional schemes while also keeping the computational efficiency of Poisson solvers. This method is implemented in Matlab and also as a GPU-accelerated code in CUDA-C++. The behavior of the new method is demonstrated on 2D and 3D synthetic and experimental data. Three-dimensional grid sizes of up to 125 million grid points are tractable with this method, opening exciting opportunities to perform volumetric pressure field estimation from 3D PIV measurements.

42 ENGINEERING↗

A fast parallel 3D Poisson solver with longitudinal periodic and transverse open boundary conditions for space-charge simulations

A three-dimensional (3D) Poisson solver with longitudinal periodic and transverse open boundary conditions can have important applications in beam physics of particle accelerators. Here, we present a fast efficient method to solve the Poisson equation using a spectral finite-difference method. This method uses a computational domain that contains the charged particle beam only and has a computational complexity of $O(N_u (logN_{mode}))$, where $N_u$ is the total number of unknowns and $N_{mode}$ is the maximum number of longitudinal or azimuthal modes. This saves both the computational time and the memory usage of using an artificial boundary condition in a large extended computational domain. The new 3D Poisson solver is parallelized using a message passing interface (MPI) on multi-processor computers and shows a reasonable parallel performance up to hundreds of processor cores.

97 MATHEMATICS AND COMPUTING↗

High-precision quantum algorithms for partial differential equations

Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity poly(1/ϵ), where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be poly(d,log(1/ϵ)), where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.

97 MATHEMATICS AND COMPUTING↗

Massively Parallel Algorithms for Real-Time Wavefront Control of a Dense Adaptive Optics System

In this paper massively parallel algorithms and architectures for real-time wavefront control of a dense adaptive optic system (SELENE) are presented. We have already shown that the computation of a near optimal control algorithm for SELENE can be reduced to the solution of a discrete Poisson equation on a regular domain. Although this represents an optimal computation, due the large size of the system and the high sampling rate requirement, the implementation of this control algorithm poses a computationally challenging problem since it demands a sustained computational throughput of the order of 10 GFlops. We develop a novel algorithm, designated as Fast Invariant Imbedding algorithm, which offers a massive degree of parallelism with simple communication and synchronization requirements. Due to these features, our algorithm is significantly more efficient than other Fast Poisson Solvers for implementation on massively parallel architectures.

massively↗

Numerical simulation of turbulence in the presence of shear

The numerical calculations are presented of the large eddy structure of turbulent flows, by use of the averaged Navier-Stokes equations, where averages are taken over spatial regions small compared to the size of the computational grid. The subgrid components of motion are modeled by a local eddy-viscosity model. A new finite-difference scheme is proposed to represent the nonlinear average advective term which has fourth-order accuracy. This scheme exhibits several advantages over existing schemes with regard to the following: (1) the scheme is compact as it extends only one point away in each direction from the point to which it is applied; (2) it gives better resolution for high wave-number waves in the solution of Poisson equation, and (3) it reduces programming complexity and computation time. Examples worked out in detail are the decay of isotropic turbulence, homogeneous turbulent shear flow, and homogeneous turbulent shear flow with system rotation.

Shaanan, S.↗

Estimating the local dark matter density in a non-axisymmetric wobbling disc

The density of dark matter near the Sun, ρDM, ⊙, is important for experiments hunting for dark matter particles in the laboratory, and for constraining the local shape of the Milky Way’s dark matter halo. Estimates to date have typically assumed that the Milky Way’s stellar disc is axisymmetric and in a steady-state. Yet the Milky Way disc is neither, exhibiting prominent spiral arms and a bar, and vertical and radial oscillations. Here, we assess the impact of these assumptions on determinations of ρDM, ⊙ by applying a free-form, steady-state, Jeans method to two different N-body simulations of Milky Way-like galaxies. In one, the galaxy has experienced an ancient major merger, similar to the hypothesized Gaia–Sausage–Enceladus; in the other, the galaxy is perturbed more recently by the repeated passage and slow merger of a Sagittarius-like dwarf galaxy. We assess the impact of each of the terms in the Jeans–Poisson equations on our ability to correctly extract ρDM, ⊙ from the simulated data. We find that common approximations employed in the literature – axisymmetry and a locally flat rotation curve – can lead to significant systematic errors of up to a factor ~1.5 in the recovered surface mass density ~2 kpc above the disc plane, implying a fractional error on ρDM, ⊙ of the order of unity. However, once we add in the tilt term and the rotation curve term in our models, we obtain an unbiased estimate of ρDM, ⊙, consistent with the true value within our 95 percent confidence intervals for realistic 20 percent uncertainties on the baryonic surface density of the disc. Other terms – the axial tilt, 2nd Poisson and time-dependent terms – contribute less than 10 percent to ρDM, ⊙ (given current data) and can be safely neglected for now. In the future, as more data become available, these terms will need to be included in the analysis.

79 ASTRONOMY AND ASTROPHYSICS↗

Overcoming element quality dependence of finite elements with adaptive extended stencil FEM (AES‐FEM)

Summary The finite element methods (FEMs) are important techniques in engineering for solving partial differential equations, but they depend heavily on element shape quality for stability and good performance. In this paper, we introduce the Adaptive Extended Stencil Finite Element Method (AES‐FEM) as a means for overcoming this dependence on element shape quality. Our method replaces the traditional basis functions with a set of generalized Lagrange polynomial basis functions , which we construct using local weighted least‐squares approximations. The method preserves the theoretical framework of FEM and allows imposing essential boundary conditions and integrating the stiffness matrix in the same way as the classical FEM. In addition, AES‐FEM can use higher‐degree polynomial basis functions than the classical FEM, while virtually preserving the sparsity pattern of the stiffness matrix. We describe the formulation and implementation of AES‐FEM and analyze its consistency and stability. We present numerical experiments in both 2D and 3D for the Poisson equation and a time‐independent convection–diffusion equation. The numerical results demonstrate that AES‐FEM is more accurate than linear FEM, is also more efficient than linear FEM in terms of error versus runtime, and enables much better stability and faster convergence of iterative solvers than linear FEM over poor‐quality meshes. Copyright © 2016 John Wiley & Sons, Ltd.

Conley, Rebecca↗