SEARCH · Search NASA

Results for “3D 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 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2022

A sixth order Mehrstellen scheme with an application to the Method of Local Corrections for the 3D Poisson equation

We present a sixth order finite difference scheme for Poisson’s equation when discretized with the compact 27-point stencil based on Mehrstellen corrections of the forcing function term f. Our approach results in a sixth order accurate solution error as opposed to a fourth-order error imposed by the classical Mehrstellen correction for the 19-point and 27-point stencils. The present study is a continuation of former work of Spotz and Carey (1996) on compact finite difference schemes for Poisson’s equation where sixth order convergence may be obtained under the assumption that the fourth order derivatives of f are determined analytically. Specifically, we show that sixth order convergence can still be attained when only values of f at grid points are available. The sixth order Mehrstellen scheme is further coupled with a Method of Local Corrections (MLC) 3D Poisson solver improving to sixth order accuracy the results reported in Kavouklis and Colella (2019). The MLC test case considered involves an adaptive grid that comprises 7.5 billion cells.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

An Infinite Domain 3D Poisson Solver Based on the Barnes-Hut Algorithm

We present a domain decomposition method for the solution of the 3D Poisson equation with infinite domain boundary conditions. The method is based on an application of the Barnes-Hut tree particle scheme adapted to gridded data. Long range interactions are computed using the first two terms in the Cartesian multipole expansion of Green’s function convoluted with the charge while short range computations are performed using Hockney’s domain doubling algorithm. A standard domain decomposition strategy requires O(N 2 ) applications of Hockney’s algorithm, where N is the number of subdomains that intersect that charge support, while in the present approach only O(Nlog 2 N) such computations suffice. The discretization scheme employed is a sixth order Mehrstellen approximation of the 3D Laplace opera tor. The method exhibits satisfactory accuracy at a substantially reduced computational cost compared to the full domain decomposition Hockney’s algorithm.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Block encoding of the three-dimensional heterogeneous Poisson equation with application to fracture flow

Quantum linear system (QLS) algorithms offer the potential to solve large-scale linear systems exponentially faster than classical methods. However, applying QLS algorithms to real-world problems remains challenging due to issues such as state preparation, data loading, and efficient information extraction. In this work, we study the feasibility of applying QLS algorithms to solve discretized three-dimensional (3D) heterogeneous Poisson equations, with specific examples relating to groundwater flow through geologic fracture networks. We explicitly construct a block encoding for the 3D heterogeneous Poisson matrix by leveraging the sparse local structure of the discretized operator. While classical solvers benefit from preconditioning, we show that block encoding the system matrix and preconditioner separately does not improve the effective condition number that dominates the QLS run-time. This differs from classical approaches where the preconditioner and the system matrix can often be implemented independently. Nevertheless, due to the structure of the problem in three dimensions, the quantum algorithm achieves a run-time of 𝑂⁡(𝑁 2/3 polylog 𝑁 ⋅log (1/𝜖)), outperforming the best classical methods (with run times of 𝑂⁡(𝑁⁢log 𝑁 ⋅log (1/𝜖))) and offering exponential memory savings. These results highlight both the promise and limitations of QLS algorithms for practical scientific computing, and point to effective condition-number reduction as a key barrier in achieving quantum advantages.

58 GEOSCIENCES↗

DOE OSTI2025

A nonhydrostatic formulation for MPAS-Ocean

The Model for Prediction Across Scales-Ocean (MPAS-Ocean) is an open-source, global ocean model and is one component of a family of climate models within the MPAS framework, including atmosphere, sea-ice, and land-ice models. Here, in this work, a new formulation for the ocean model is presented that solves the nonhydrostatic, incompressible Boussinesq equations on an unstructured, staggered, z-level grid. The introduction of this nonhydrostatic capability is necessary for the resolution of internal wave dynamics and large eddy simulations. Compared to the standard, hydrostatic formulation, a nonhydrostatic pressure solver and a vertical momentum equation are added, where the PETSc (Portable Extensible Toolkit for Scientific Computation) library is used for the inversion of a large sparse system for the nonhydrostatic pressure. Numerical results on a stratified seiche, internal solitary wave, overflow and lock-exchange test cases are presented, and the parallel efficiency of the code is evaluated using up to 1024 processors.

3D Poisson equation↗

DOE OSTI2025

A nonhydrostatic formulation for MPAS-Ocean

3D Poisson equation↗

DOE OSTI2022

A 6th Order Mehrstellen Finite Volume Discretization of Poisson's Equation in Three Dimensions

We discuss the derivation of a new, sixth-order finite volume scheme for Poisson’s equation on 3D Cartesian equispaced grids. The scheme is based on a discretization of the Laplace operator with a compact (Mehrstellen) 27-point stencil. To achieve sixth order convergence the right hand side of the equation is replaced with a discrete operator that involves the discrete Laplace and Biharmonic operators and the sum of discrete fourth-order cross derivatives applied to the charge function. Numerical tests demonstrate the superiority of the proposed method compared to the well known schemes associated with the 7-point and 19-point discretizations of the Laplacian.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1992

Cell volume control at a surface for three-dimensional grid generation packages

An alternate method of calculating the cell size for orthogonality control in the solution of Poisson's 3D space equations is presented. The method provides the capability to enforce a better initial guess for the grid distribution required for boundary layer resolution. This grid point distribution is accomplished by enforcing grid spacing from a grid block boundary where orthogonality is required. The actual grid spacing or cell size for that boundary is determined by the two or four adjacent boundaries in the grid block definition, which are two dimensional grids. These two dimensional grids are in turn defined by the user using insight into the flow field and boundary layer characteristics. The adjoining boundaries are extended using a multifunctional blending scheme, with user control of the blending and interpolating functions to be used. This grid generation procedure results in an enhanced computational fluid dynamics calculation by allowing a quicker resolution of the configuration's boundary layer and flow field and by limiting the number of grid re-adaptations. The cell size specification calculation was applied to a variety of configurations ranging from axisymmetric to complex three-dimensional configurations. Representative grids are shown for the Space Shuttle and the Langley Lifting Body (HL-20).

Alter, Stephen J.↗

NASA NTRS1993

Bgridi - Interactive three-dimensional turbomachinery grid generation system with applications

An interactive, graphics-based grid generation system for 3D turbomachinery geometries has been developed. The system consists of separate modules for geometry modeling and grid generation. The grid generation method generates a series of 2D grids in the blade-to-blade passage to build up the 3D grid. A Poisson equation with forcing functions selected to control orthogonality and spacing on all boundaries is solved to generate the grid. Interactive definition of Bezier curves and surfaces as internal boundaries is used to improve control of grid quality. A multi-block data structure simpifies the creation of structured H-grids about complex turbomachinery geometries. The multi-block strategy facilitates the creation of a grid in the tip flow region, which is an important contributor to losses within the passage. The grid generation system is applied to several complex geometries including a simple radial impeller, a conventional turbine rotor, the SSME LOX turbine rotor with and without a tip flow grid, a multi-passage inducer-impeller, and a tip-flow cascade. In addition, a calculation of the tip-flow cascade flow field is shown.

Shoemaker, J. M.↗

DOE OSTI2022

SPACE: 3D parallel solvers for Vlasov-Maxwell and Vlasov-Poisson equations for relativistic plasmas with atomic transformations

A parallel, relativistic, three-dimensional particle-in-cell code SPACE has been developed for the simulation of electromagnetic fields, relativistic particle beams, and plasmas. In addition to the standard second-order Particle-in-Cell (PIC) algorithm, SPACE includes efficient novel algorithms to resolve atomic physics processes such as multi-level ionization of plasma atoms, recombination, and electron attachment to dopants in dense neutral gases. SPACE also contains a highly adaptive particle-based method, called Adaptive Particle-in-Cloud (AP-Cloud), for solving the Vlasov-Poisson problems. It eliminates the traditional Cartesian mesh of PIC and replaces it with an adaptive octree data structure. The code's algorithms, structure, capabilities, parallelization strategy, and performance have been discussed. Additionally, typical examples of SPACE applications to accelerator science and engineering problems are described.

43 PARTICLE ACCELERATORS↗

NASA NTRS1992

Multigrid acceleration of a fractional-step solver in generalized curvilinear coordinate systems

The efficiency of the INS3D-fractional step (FS) code has been significantly enhanced by accelerating the Poisson solver with a multigrid (MG) method. This is apparently the first implementation of the MG method for solving the 3D discrete Poisson-like equation obtained in the derivation of FS solution methods for the incompressible Navier-Stokes equations in generalized nonorthogonal coordinate systems using a staggered arrangement of the variables. The MG solver is insensitive to the geometry, even in cases of highly nonorthogonal clustered meshes, as well as to the free parameters of MG methods.

Rosenfeld, Moshe↗

NASA NTRS1999

Random Dopant Induced Threshold Voltage Lowering and Fluctuations in Sub 50 nm MOSFETs: a Statistical 3D 'Atomistic' Simulation Study

A 3D 'atomistic' simulation study of random dopant induced threshold voltage fluctuations and lowering in sub 50 nm MOSFETs is presented. The attention is focused mainly on devices with 30 nm effective channel length which represent the expected level of scaling at the end of the Silicon Roadmap. An efficient algorithm, based on a single 3D ap solution of the Poisson equation and a simplified current continuity equation, is used in the simulations. Large samples of microscopically different devices (typically 200) arc used in order to obtain statistically reliable results. The influence of different aspects of the conventional MOSFET design on the threshold voltage fluctuations and lowering are investigated. Results for fluctuation resistant device architectures based on low-doped epitaxial channel MOSFETs are also presented.

Asenov, Asen↗

DOE OSTI2024

Lattice Green’s Functions for High-Order Finite Difference Stencils

Lattice Green's Functions (LGFs) are fundamental solutions to discretized linear operators, and as such they are a useful tool for solving discretized elliptic PDEs on domains that are unbounded in one or more directions. The majority of existing numerical solvers that make use of LGFs rely on a second-order discretization and operate on domains with free-space boundary conditions in all directions. Under these conditions, fast expansion methods are available that enable precomputation of 2D or 3D LGFs in linear time, avoiding the need for brute-force multi-dimensional quadrature of numerically unstable integrals. Here we focus on higher-order discretizations of the Laplace operator on domains with more general boundary conditions, by (1) providing an algorithm for fast and accurate evaluation of the LGFs associated with high-order dimension-split centered finite differences on unbounded domains, and (2) deriving closed-form expressions for the LGFs associated with both dimension-split and Mehrstellen discretizations on domains with one unbounded dimension. Through numerical experiments we demonstrate that these techniques provide LGF evaluations with near machine-precision accuracy, and that the resulting LGFs allow for numerically consistent solutions to high-order discretizations of the Poisson's equation on fully or partially unbounded 3D domains.

97 MATHEMATICS AND COMPUTING↗

NASA NTRSDate not supplied

Recent Developments to the Porous Microstructure Analysis (PuMA) Software

Introduction The Porous Microstructure Analysis (PuMA) software is an open source framework for image-based simulation, primarily used to determine effective properties based on material microstructure. PuMA was originally developed for the study of NASA thermal protection materials; however, many of the solvers in PuMA have applicability to a broad range of materials science applications. PuMA version 3.2 computes material surface area, pore diameters, effective thermal conductivity, continuum and rarefied tortuosity, and permeability. For anisotropic materials, PuMA can estimate material orientation and compute anisotropic thermal conductivity and elasticity. In this talk, a brief overview of the PuMA software and underlying methods will be presented, as well as some recent and ongoing developments, including the use of immersed boundary methods for image-based simulation and the development of a new weave segmentation tool, called TomoSAM. Cut-Cell method for heat and mass transfer For simulations on complex microstructures, traditional unstructured meshing techniques often prove to be difficult and time-intensive. Voxel-based solvers, which represent the surface as a staircase structure, are relatively simple to implement but can lose accuracy when feature resolution is poor. In this work, we present a novel 3D cut-cell method for solving the variable coefficient Poisson equation on complex microstructures, suitable for the determination of effective thermal conductivity or tortuosity of a material. The method uses a Marching Cubes/Marching Squares surface reconstruction to create cut-cells and determine geometric quantities. A flux-correction method is extended to 3D, with least squares gradient reconstruction, to solve for the boundary fluxes in the cut-cells. Verification cases show the solver achieves globally 2nd order accuracy on complex microstructures. TomoSAM TomoSAM, a module of the PuMA software, has been developed as a plugin for 3D Slicer, a software platform used for 3D image processing and visualization. It utilizes the Segment Anything Model (SAM), a deep learning model capable of identifying objects and generating image masks based on minimal user input. This feature enables efficient segmentation of complex 3D datasets, particularly of woven materials, from tomography or similar imaging methods, reducing the need for manual segmentation.

Tomography↗

NASA NTRSDate not supplied

Recent Developments to the Porous Microstructure Analysis (PuMA) Software

The Porous Microstructure Analysis (PuMA) software is an open source framework for image-based simulation, primarily used to determine effective properties based on material microstructure. PuMA was originally developed for the study of NASA thermal protection materials; however, many of the solvers in PuMA have applicability to a broad range of materials science applications. PuMA version 3.2 computes material surface area, pore diameters, effective thermal conductivity, continuum and rarefied tortuosity, and permeability. For anisotropic materials, PuMA can estimate material orientation and compute anisotropic thermal conductivity and elasticity. In this talk, a brief overview of the PuMA software and underlying methods will be presented, as well as some recent and ongoing developments, including the use of immersed boundary methods for image-based simulation and the development of a new weave segmentation tool, called TomoSAM. Cut-Cell method for heat and mass transfer For simulations on complex microstructures, traditional unstructured meshing techniques often prove to be difficult and time-intensive. Voxel-based solvers, which represent the surface as a staircase structure, are relatively simple to implement but can lose accuracy when feature resolution is poor. In this work, we present a novel 3D cut-cell method for solving the variable coefficient Poisson equation on complex microstructures, suitable for the determination of effective thermal conductivity or tortuosity of a material. The method uses a Marching Cubes/Marching Squares surface reconstruction to create cut-cells and determine geometric quantities. A flux-correction method is extended to 3D, with least squares gradient reconstruction, to solve for the boundary fluxes in the cut-cells. Verification cases show the solver achieves globally 2nd order accuracy on complex microstructures. TomoSAM TomoSAM, a module of the PuMA software, has been developed as a plugin for 3D Slicer, a software platform used for 3D image processing and visualization. It utilizes the Segment Anything Model (SAM), a deep learning model capable of identifying objects and generating image masks based on minimal user input. This feature enables efficient segmentation of complex 3D datasets, particularly of woven materials, from tomography or similar imaging methods, reducing the need for manual segmentation.

Tomography↗

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 OSTI2026

A tensor train-based isogeometric solver for large-scale 3D poisson problems

We introduce a three-dimensional (3D), fully tensor train (TT) assembled isogeometric analysis (IGA) framework, TT-IGA, for solving partial differential equations (PDEs). Our method reformulates IGA discrete operators into TT format, enabling efficient compression and computation. Geometry evaluations use the original NURBS description at sampling points and TT approximation is applied to geometry-derived coefficient fields and discrete operators. We demonstrate the effectiveness of the proposed TT-IGA framework on the three-dimensional Poisson equation, achieving substantial reductions in memory and computational cost without compromising solution quality.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

A computational study of the effects of graphene additions on electrical properties of polycrystalline copper

The addition of graphene has recently shown promise as a route for the significant improvement of the bulk electrical properties of metallic materials. Here, we explore the effects these additions have on the net electrical conductivity of fabricated copper-graphene (Cu-Gr) nanocomposites as a function of grain structure and grain boundary properties. Synthetic 3D microstructures were generated to represent polycrystalline copper with different average grain diameters and twinned grain boundary fractions. Then, the Poisson equation of electrical transport was solved using a finite difference method in order to predict the net electrical conductivity of each microstructure. In this context, the potential effect of graphene on the conductivity of the composite was evaluated as a function of the number of affected grain boundaries. The results of these calculations indicate that 1.) as supported by literature, net electrical conductivity decreases with decreasing grain size, 2.) the presence of twinned grain boundaries results in smaller loss of conductivity than would otherwise be expected, and 3.) the presence of graphene on the grain boundaries can be expected to lead to improvements in net electrical conductivity. However, we also find that 4.) when the Cu grain structure becomes sufficiently refined, the addition of graphene could conceivably result in significant improvements in electrical conductivity over and above coarse-grained Cu. It is estimated from our calculations that, assuming microstructures with average grain sizes between 100 nm and 100 μm and graphene conductivity 1000 to 10,000 that of a typical Cu grain boundary, an improvement in electrical conductivity of approximately 17% over that of bulk Cu may be attainable. Therefore, by performing this study we suggest a possible route for the improvement of Cu electrical properties through the addition of graphene.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1998

Higher-Order Compact Schemes for Numerical Simulation of Incompressible Flows

A higher order accurate numerical procedure has been developed for solving incompressible Navier-Stokes equations for 2D or 3D fluid flow problems. It is based on low-storage Runge-Kutta schemes for temporal discretization and fourth and sixth order compact finite-difference schemes for spatial discretization. The particular difficulty of satisfying the divergence-free velocity field required in incompressible fluid flow is resolved by solving a Poisson equation for pressure. It is demonstrated that for consistent global accuracy, it is necessary to employ the same order of accuracy in the discretization of the Poisson equation. Special care is also required to achieve the formal temporal accuracy of the Runge-Kutta schemes. The accuracy of the present procedure is demonstrated by application to several pertinent benchmark problems.

Wilson, Robert V.↗