SEARCH · Search NASA

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.

SourceResearch connectionFrom yearThrough year

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

At least 145 records · Page 8

All sources NASA NTRS DOE OSTI

NASA NTRS1999

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↗

NASA NTRS1990

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.↗

NASA NTRS1991

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↗

NASA NTRS1987

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.↗

NASA NTRS1988

Spectral multigrid methods for the solution of homogeneous turbulence problems

Erlebacher, G.↗

DOE OSTI2024

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↗

NASA NTRS1975

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.↗

NASA NTRS1983

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.↗

DOE OSTI2024

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↗

DOE OSTI2021

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↗

NASA NTRS1994

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↗

NASA NTRS1975

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.↗

DOE OSTI2022

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↗

DOE OSTI2024

Learning the boundary-to-domain mapping using Lifting Product Fourier Neural Operators for partial differential equations

Neural operators such as the Fourier Neural Operator (FNO) have been shown to provide resolution-independent deep learning models that can learn mappings between function spaces. For example, an initial condition can be mapped to the solution of a partial differential equation (PDE) at a future time-step using a neural operator. Despite the popularity of neural operators, their use to predict solution functions over a domain given only data over the boundary (such as a spatially varying Dirichlet boundary condition) remains unexplored. In this paper, we refer to such problems as boundary-to-domain problems; they have a wide range of applications in areas such as fluid mechanics, solid mechanics, heat transfer etc. We present a novel FNO-based architecture, named Lifting Product FNO (or LP-FNO) which can map arbitrary boundary functions defined on the lower-dimensional boundary to a solution in the entire domain. Specifically, two FNOs defined on the lower-dimensional boundary are lifted into the higher dimensional domain using our proposed lifting product layer. We demonstrate the efficacy and resolution independence of the proposed LP-FNO for the 2D Poisson equation.

Kashi, Aditya↗

DOE OSTI2024

A numerical Poisson solver with improved radial solutions for a self-consistent locally scaled self-interaction correction method

Abstract The universal applicability of density functional approximations is limited by self-interaction error made by these functionals. Recently, a novel one-electron self-interaction-correction (SIC) method that uses an iso-orbital indicator to apply the SIC at each point in space by scaling the exchange-correlation and Coulomb energy densities was proposed. The locally scaled SIC (LSIC) method is exact for the one-electron densities, and unlike the well-known Perdew–Zunger SIC (PZSIC) method recovers the uniform electron gas limit of the uncorrected density functional approximation, and reduces to PZSIC method as a special case when isoorbital indicator is set to the unity. Here, we present a numerical scheme that we have adopted to evaluate the Coulomb potential of the electron density scaled by the iso-orbital indicator required for the self-consistent LSIC calculations. After analyzing the behavior of the finite difference method (FDM) and the green function solution to the radial part of the Poisson equation, we adopt a hybrid approach that uses the FDM for the Coulomb potential due to the monopole and the GF for all higher-order terms. The performance of the resultant hybrid method is assessed using a variety of systems. The results show improved accuracy than earlier numerical schemes. We also find that, even with a generic set of radial grid parameters, accurate energy differences can be obtained using a numerical Coulomb solver in standard density functional studies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Dark Energy Survey Year 3 results: Constraints on extensions to Λ CDM with weak lensing and galaxy clustering

We constrain six possible extensions to the Λ cold dark matter (CDM) model using measurements from the Dark Energy Survey’s first three years of observations, alone and in combination with external cosmological probes. The DES data are the two-point correlation functions of weak gravitational lensing, galaxy clustering, and their cross-correlation. We use simulated data vectors and blind analyses of real data to validate the robustness of our results to astrophysical and modeling systematic errors. In many cases, constraining power is limited by the absence of theoretical predictions beyond the linear regime that are reliable at our required precision. The Λ CDM extensions are dark energy with a time-dependent equation of state, nonzero spatial curvature, additional relativistic degrees of freedom, sterile neutrinos with eV-scale mass, modifications of gravitational physics, and a binned σ 8 ( z ) model which serves as a phenomenological probe of structure growth. For the time-varying dark energy equation of state evaluated at the pivot redshift we find ( w p , w a ) = ( - 0.9 9 - 0.17 + 0.28 , - 0.9 ± 1.2 ) at 68% confidence with z p = 0.24 from the DES measurements alone, and ( w p , w a ) = ( - 1.0 3 - 0.03 + 0.04 , - 0. 4 - 0.3 + 0.4 ) with z p = 0.21 for the combination of all data considered. Curvature constraints of Ω k = 0.0009 ± 0.0017 and effective relativistic species N eff = 3.1 0 - 0.16 + 0.15 are dominated by external data, though adding DES information to external low-redshift probes tightens the Ω k constraints that can be made without cosmic microwave background observables by 20%. For massive sterile neutrinos, DES combined with external data improves the upper bound on the mass m eff by a factor of 3 compared to previous analyses, giving 95% limits of ( Δ N eff , m eff ) ≤ ( 0.28 , 0.20 eV ) when using priors matching a comparable Planck analysis. For modified gravity, we constrain changes to the lensing and Poisson equations controlled by functions Σ ( k , z ) = Σ 0 Ω Λ ( z ) / Ω Λ , 0 and μ ( k , z ) = μ 0 Ω Λ ( z ) / Ω Λ , 0 , respectively, to Σ 0 = 0. 6 - 0.5 + 0.4 from DES alone and ( Σ 0 , μ 0 ) = ( 0.04 ± 0.05 , 0.0 8 - 0.19 + 0.21 ) for the combination of all data, both at 68% confidence. Overall, we find no significant evidence for physics beyond Λ CDM .

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1992

Aerodynamic simulation on massively parallel systems

This paper briefly addresses the computational requirements for the analysis of complete configurations of aircraft and spacecraft currently under design to be used for advanced transportation in commercial applications as well as in space flight. The discussion clearly shows that massively parallel systems are the only alternative which is both cost effective and on the other hand can provide the necessary TeraFlops, needed to satisfy the narrow design margins of modern vehicles. It is assumed that the solution of the governing physical equations, i.e., the Navier-Stokes equations which may be complemented by chemistry and turbulence models, is done on multiblock grids. This technique is situated between the fully structured approach of classical boundary fitted grids and the fully unstructured tetrahedra grids. A fully structured grid best represents the flow physics, while the unstructured grid gives best geometrical flexibility. The multiblock grid employed is structured within a block, but completely unstructured on the block level. While a completely unstructured grid is not straightforward to parallelize, the above mentioned multiblock grid is inherently parallel, in particular for multiple instruction multiple datastream (MIMD) machines. In this paper guidelines are provided for setting up or modifying an existing sequential code so that a direct parallelization on a massively parallel system is possible. Results are presented for three parallel systems, namely the Intel hypercube, the Ncube hypercube, and the FPS 500 system. Some preliminary results for an 8K CM2 machine will also be mentioned. The code run is the two dimensional grid generation module of Grid, which is a general two dimensional and three dimensional grid generation code for complex geometries. A system of nonlinear Poisson equations is solved. This code is also a good testcase for complex fluid dynamics codes, since the same datastructures are used. All systems provided good speedups, but message passing MIMD systems seem to be best suited for large miltiblock applications.

Haeuser, Jochem↗

DOE OSTI2025

Optimal Polynomial Smoothers and One‐Sided V‐Cycles for Poisson Problems

The solution to the Poisson equation arising from the spectral element discretization of the incompressible Navier‐Stokes equations needs robust preconditioning strategies. One such strategy is multigrid. To realize the potential of multigrid methods, effective smoothing strategies are needed. Chebyshev polynomial smoothers, in conjunction with pointwise Jacobi or additive Schwarz methods (ASMs), prove to be an effective smoother. Other polynomial smoothers, however, may provide superior convergence to the multigrid preconditioner. The authors compare the standard Chebyshev polynomial smoothers to both the novel fourth‐kind Chebyshev polynomial smoothers proposed by Lottes as well as smoothers based on the polynomial of best uniform approximation to as proposed by Kraus, Vassilevski, and Zikatanov. At the cost of symmetry, further improvements may be made. For example, a order polynomial smoother on both sides of the V‐cycle may be substituted with an order polynomial smoother on one side at no additional cost. The choice of omitting the postsmoother in favor of higher‐order polynomial presmoothing is advantageous in cases where the multigrid approximation property constant is large. The authors consider a 2D model problem based on finite differences to motivate the choice of polynomial smoother, order, and whether to apply postsmoothing for the target application of high‐order ‐geometric multigrid methods for GPU architectures. Results from both domains demonstrate the substantial improvement of these approaches over the standard Chebyshev polynomial smoother with a symmetric V‐cycle.

97 MATHEMATICS AND COMPUTING↗