Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Poisson solver”

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 55 records · Page 3

Characteristics of 0.8- and 0.2-microns gate length In(x)Ga(1-x) As/In(0.52)Al(0.48)As/InP (0.53 less than or equal to x less than or equal to 0.70) modulation-doped field-effect transistors at cryogenic temperatures

The performance characteristics of InP-based In(x)Ga(1-x)As/In(0.52)Al(0.48)As (0.53 is less than or equal to x is less than or equal to 0.70) pseudomorphic modulation-doped field-effect transistors (MODFET's) as a function of strain in the channel, gate, length, and temperature were investigated analytically and experimentally. The strain in the channel was varied by varying the In composition x. The temperature was varied in the range of 40-300 K and the devices have gate lengths L(sub g) of 0.8 and 0.2 microns. Analysis of the device was done using a one-dimensional self consistent solution of the Poisson and Schroedinger equations in the channel, a two-dimensional Poisson solver to obtain the channel electric field, and a Monte Carlo simulation to estimate the carrier transit times in the channel. An increase in the value of the cutoff frequency is predicted for an increase in In composition, a decrease in temperature, and a decrease in gate length. The improvements seen with decreasing temperature, decreasing gate length, and increased In composition were smaller than those predicted by analysis. The experimental results on pseudomorphic InGaAs/InAlAs MODFET's showed that there is a 15-30 percent improvement in cutoff frequency in both the 0.8- and 0.2-micron gate length devices when the temperature is lowered from 300 to 40 K.

Lai, Richard↗

A High Order Discontinuous Galerkin Method for 2D Incompressible Flows

In this paper we introduce a high order discontinuous Galerkin method for two dimensional incompressible flow in vorticity streamfunction formulation. The momentum equation is treated explicitly, utilizing the efficiency of the discontinuous Galerkin method The streamfunction is obtained by a standard Poisson solver using continuous finite elements. There is a natural matching between these two finite element spaces, since the normal component of the velocity field is continuous across element boundaries. This allows for a correct upwinding gluing in the discontinuous Galerkin framework, while still maintaining total energy conservation with no numerical dissipation and total enstrophy stability The method is suitable for inviscid or high Reynolds number flows. Optimal error estimates are proven and verified by numerical experiments.

Liu, Jia-Guo↗

Parallel Unsteady Turbopump Flow Simulations for Reusable Launch Vehicles

An efficient solution procedure for time-accurate solutions of Incompressible Navier-Stokes equation is obtained. Artificial compressibility method requires a fast convergence scheme. Pressure projection method is efficient when small time-step is required. The number of sub-iteration is reduced significantly when Poisson solver employed with the continuity equation. Both computing time and memory usage are reduced (at least 3 times). Other work includes Multi Level Parallelism (MLP) of INS3D, overset connectivity for the validation case, experimental measurements, and computational model for boost pump.

Kiris, Cetin↗

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↗

Advances in Application of Fast Semidirect Computational Methods in Transonic Flow

This paper is intended as a review and summary of the advances made in a recently developed approach for rapid numerical solution of the equations of inviscid transonic aerodynamics. The investigation has been limited to two-dimensional, steady, inviscid flow over airfoils in a subsonic free stream, with emphasis on development of a rapid computational technique, rather than on generality of application. The approach uses finite-difference algorithms called "fast direct elliptic solvers" within an iteration scheme. "Direct" means that the entire computation field is solved at once, rather than in successive traverses over the field as in a point- or line-relaxation method. Such an iterative method is referred to as "semidirect." The iterative convergence can be faster than in other relaxation methods because changes are felt simultaneously at all points in each succeeding iteration. Direct elliptic solvers and semidirect methods have restrictions, but these are gradually being removed. Direct solvers were first developed for solving Poisson's equation on a rectangle without interior boundaries. A method to treat first-order systems, a direct Cauchy-Riemann solver has also been developed. Numerical treatment of part of a system of nonlinear equations by a Poisson solver has been reported. Also Poisson solvers in semidirect methods were used for nonseparable elliptic equations. The semidirect method was extended to the solution of a problem of mixed type, where the improved Murman-Cole transonic small-disturbance difference equations were solved. A slightly supercritical flow over a biconvex airfoil was treated successfully, but the iterations did not converge for more strongly supercritical conditions In another work the addition of terms ot both sides of the difference equations stabilized the iteration for supercritical conditions with large supersonic zones. For this, the Cauchy-Riemann solver was revised to incl,ude the needed terms. Most recently, the evaluation of parameters for rapid convergence and comparisons, with Murman's line-relaxation method was described. The method was extended to full second order accuracy in a fully conservative formulation in another work.

Martin, E. Dale↗

A robust multilevel simultaneous eigenvalue solver

Multilevel (ML) algorithms for eigenvalue problems are often faced with several types of difficulties such as: the mixing of approximated eigenvectors by the solution process, the approximation of incomplete clusters of eigenvectors, the poor representation of solution on coarse levels, and the existence of close or equal eigenvalues. Algorithms that do not treat appropriately these difficulties usually fail, or their performance degrades when facing them. These issues motivated the development of a robust adaptive ML algorithm which treats these difficulties, for the calculation of a few eigenvectors and their corresponding eigenvalues. The main techniques used in the new algorithm include: the adaptive completion and separation of the relevant clusters on different levels, the simultaneous treatment of solutions within each cluster, and the robustness tests which monitor the algorithm's efficiency and convergence. The eigenvectors' separation efficiency is based on a new ML projection technique generalizing the Rayleigh Ritz projection, combined with a technique, the backrotations. These separation techniques, when combined with an FMG formulation, in many cases lead to algorithms of O(qN) complexity, for q eigenvectors of size N on the finest level. Previously developed ML algorithms are less focused on the mentioned difficulties. Moreover, algorithms which employ fine level separation techniques are of O(q(sub 2)N) complexity and usually do not overcome all these difficulties. Computational examples are presented where Schrodinger type eigenvalue problems in 2-D and 3-D, having equal and closely clustered eigenvalues, are solved with the efficiency of the Poisson multigrid solver. A second order approximation is obtained in O(qN) work, where the total computational work is equivalent to only a few fine level relaxations per eigenvector.

Costiner, Sorin↗

Multi-Dimensional Quantum Effect Simulation Using a Density-Gradient Model and Script-Level Programming Techniques

A density-gradient (DG) model is used to calculate quantum-mechanical corrections to classical carrier transport in MOS (Metal Oxide Semiconductor) inversion/accumulation layers. The model is compared to measured data and to a fully self-consistent coupled Schrodinger and Poisson equation (SCSP) solver. Good agreement is demonstrated for MOS capacitors with gate oxide as thin as 21 A. It is then applied to study carrier distribution in ultra short MOSFETs (Metal Oxide Semiconductor Field Effect Transistor) with surface roughness. This work represents the first implementation of the DG formulation on multidimensional unstructured meshes. It was enabled by a powerful scripting approach which provides an easy-to-use and flexible framework for solving the fourth-order PDEs (Partial Differential Equation) of the DG model.

Rafferty, Connor S.↗

Charge collected by diffusion from an ion track under mixed boundary conditions

Charge-carrier diffusion from an ion track in a silicon substrate at least a few hundred microns thick is analyzed. The substrate upper surface is treated as reflective except for a small section, intended to represent a reverse-biased junction, which is treated as a sink. Total charge collected by the sink is calculated by assuming transport to be governed by an ambipolar diffusion equation with temporally constant and spatially uniform carrier lifetime and diffusion coefficient. Present results apply to a normally incident track but could easily be generalized to arbitrary track direction. The collected charge is found to depend on track length and on the electrostatic capacitance, rather than the area, of the sink. Theoretical predictions are compared to the results of a numerical simulation called the Poisson and Continuity Equation Solver (PISCES) for three cases and are found to agree within a factor of two in the worst case.

Edmonds, Larry D.↗

Computations of Wall Distances Based on Differential Equations

The use of differential equations such as Eikonal, Hamilton-Jacobi and Poisson for the economical calculation of the nearest wall distance d, which is needed by some turbulence models, is explored. Modifications that could palliate some turbulence-modeling anomalies are also discussed. Economy is of especial value for deforming/adaptive grid problems. For these, ideally, d is repeatedly computed. It is shown that the Eikonal and Hamilton-Jacobi equations can be easy to implement when written in implicit (or iterated) advection and advection-diffusion equation analogous forms, respectively. These, like the Poisson Laplacian term, are commonly occurring in CFD solvers, allowing the re-use of efficient algorithms and code components. The use of the NASA CFL3D CFD program to solve the implicit Eikonal and Hamilton-Jacobi equations is explored. The re-formulated d equations are easy to implement, and are found to have robust convergence. For accurate Eikonal solutions, upwind metric differences are required. The Poisson approach is also found effective, and easiest to implement. Modified distances are not found to affect global outputs such as lift and drag significantly, at least in common situations such as airfoil flows.

Tucker, Paul G.↗

Transport Equation Based Wall Distance Computations Aimed at Flows With Time-Dependent Geometry

Eikonal, Hamilton-Jacobi and Poisson equations can be used for economical nearest wall distance computation and modification. Economical computations may be especially useful for aeroelastic and adaptive grid problems for which the grid deforms, and the nearest wall distance needs to be repeatedly computed. Modifications are directed at remedying turbulence model defects. For complex grid structures, implementation of the Eikonal and Hamilton-Jacobi approaches is not straightforward. This prohibits their use in industrial CFD solvers. However, both the Eikonal and Hamilton-Jacobi equations can be written in advection and advection-diffusion forms, respectively. These, like the Poisson s Laplacian, are commonly occurring industrial CFD solver elements. Use of the NASA CFL3D code to solve the Eikonal and Hamilton-Jacobi equations in advective-based forms is explored. The advection-based distance equations are found to have robust convergence. Geometries studied include single and two element airfoils, wing body and double delta configurations along with a complex electronics system. It is shown that for Eikonal accuracy, upwind metric differences are required. The Poisson approach is found effective and, since it does not require offset metric evaluations, easiest to implement. The sensitivity of flow solutions to wall distance assumptions is explored. Generally, results are not greatly affected by wall distance traits.

Tucker, Paul G.↗

Transport Equation Based Wall Distance Computations Aimed at Flows With Time-Dependent Geometry

Eikonal, Hamilton-Jacobi and Poisson equations can be used for economical nearest wall distance computation and modification. Economical computations may be especially useful for aeroelastic and adaptive grid problems for which the grid deforms, and the nearest wall distance needs to be repeatedly computed. Modifications are directed at remedying turbulence model defects. For complex grid structures, implementation of the Eikonal and Hamilton-Jacobi approaches is not straightforward. This prohibits their use in industrial CFD solvers. However, both the Eikonal and Hamilton-Jacobi equations can be written in advection and advection-diffusion forms, respectively. These, like the Poisson's Laplacian, are commonly occurring industrial CFD solver elements. Use of the NASA CFL3D code to solve the Eikonal and Hamilton-Jacobi equations in advective-based forms is explored. The advection-based distance equations are found to have robust convergence. Geometries studied include single and two element airfoils, wing body and double delta configurations along with a complex electronics system. It is shown that for Eikonal accuracy, upwind metric differences are required. The Poisson approach is found effective and, since it does not require offset metric evaluations, easiest to implement. The sensitivity of flow solutions to wall distance assumptions is explored. Generally, results are not greatly affected by wall distance traits.

Tucker, Paul G.↗

Numerical algorithms for steady and unsteady incompressible Navier-Stokes equations

The numerical analysis of the incompressible Navier-Stokes equations are becoming important tools in the understanding of some fluid flow problems which are encountered in research as well as in industry. With the advent of the supercomputers, more realistic problems can be studied with a wider choice of numerical algorithms. An alternative formulation is presented for viscous incompressible flows. The incompressible Navier-Stokes equations are cast in a velocity/vorticity formulation. This formulation consists of solving the Poisson equations for the velocity components and the vorticity transport equation. Two numerical algorithms for the steady two-dimensional laminar flows are presented. The first method is based on the actual partial differential equations. This uses a finite-difference approximation of the governing equations on a staggered grid. The second method uses a finite element discretization with the vorticity transport equation approximated using a Galerkin approximation and the Poisson equations are obtained using a least squares method. The equations are solved efficiently using Newton's method and a banded direct matrix solver (LINPACK). The method is extended to steady three-dimensional laminar flows and applied to a cubic driven cavity using finite difference schemes and a staggered grid arrangement on a Cartesian mesh. The equations are solved iteratively using a plane zebra relaxation scheme. Currently, a two-dimensional, unsteady algorithm is being developed using a generalized coordinate system. The equations are discretized using a finite-volume approach. This work will then be extended to three-dimensional flows.

Hafez, Mohammed↗

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↗

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↗

Flow Solver for Incompressible 2-D Drive Cavity

This software solves the Navier-Stokes equations for the incompressible driven cavity flow problem. The code uses second-order finite differencing on a staggered grid using the Chorin projection method. The resulting intermediate Poisson equation is efficiently solved using the fast Fourier transform. Time stepping is done using fourth-order Runge-Kutta for stability at high Reynolds numbers. Features include check-pointing, periodic field snapshots, ongoing reporting of kinetic energy and changes between time steps, time histories at selected points, and optional streakline generation.

Kalb, Virginia L.↗

Approximate factorization with an elliptic pressure solver for incompressible flow

Two-dimensional curvilinear coordinates are used to solve the incompressible Navier-Stokes equations, in conjunction with approximate factorization for the solution of the momentum equation and the successive overrelaxation by lines method for the solution of a Poisson equation for the pressure. The combined algorithm, although not fully explicit, is marginally stable at Reynolds numbers lower than 10,000 and time increments of 0.01. Pressure distributions calculated for attack angles of zero and 6 deg are of the same shape as the experimental curves, but are shifted to one side.

Bernard, R. S.↗

A Navier-Stokes boundary element solver

Using global interpolation functions (GIF's) boundary element solutions are obtained for two-dimensional laminar flows. Two schemes are proposed for handling the convective terms. The first treats convection as a forcing function, and converts the flow equations to pseudo-Poisson equations. In the second scheme, some convective effect is incorporated into the fundamental solution used in constructing the pertinent integral equations. The lid-driven cavity flow is selected as the benchmark problem.

Reddy, D. R.↗

Three-dimensional elliptic grid generation for an F-16

A case history depicting the effort to generate a computational grid for the simulation of transonic flow about an F-16 aircraft at realistic flight conditions is presented. The flow solver for which this grid is designed is a zonal one, using the Reynolds averaged Navier-Stokes equations near the surface of the aircraft, and the Euler equations in regions removed from the aircraft. A body conforming global grid, suitable for the Euler equation, is first generated using 3-D Poisson equations having inhomogeneous terms modeled after the 2-D GRAPE code. Regions of the global grid are then designated for zonal refinement as appropriate to accurately model the flow physics. Grid spacing suitable for solution of the Navier-Stokes equations is generated in the refinement zones by simple subdivision of the given coarse grid intervals. That grid generation project is described, with particular emphasis on the global coarse grid.

Reese L. Sorenson↗