Search NASA⌕ Search

SEARCH · Search NASA

Results for “direct 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 253 records · Page 14

An Adaptively-Refined, Cartesian, Cell-Based Scheme for the Euler and Navier-Stokes Equations

A Cartesian, cell-based scheme for solving the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal 'cut' cells are created. The geometry of the cut cells is computed using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded, with a limited linear reconstruction of the primitive variables used to provide input states to an approximate Riemann solver for computing the fluxes between neighboring cells. A multi-stage time-stepping scheme is used to reach a steady-state solution. Validation of the Euler solver with benchmark numerical and exact solutions is presented. An assessment of the accuracy of the approach is made by uniform and adaptive grid refinements for a steady, transonic, exact solution to the Euler equations. The error of the approach is directly compared to a structured solver formulation. A non smooth flow is also assessed for grid convergence, comparing uniform and adaptively refined results. Several formulations of the viscous terms are assessed analytically, both for accuracy and positivity. The two best formulations are used to compute adaptively refined solutions of the Navier-Stokes equations. These solutions are compared to each other, to experimental results and/or theory for a series of low and moderate Reynolds numbers flow fields. The most suitable viscous discretization is demonstrated for geometrically-complicated internal flows. For flows at high Reynolds numbers, both an altered grid-generation procedure and a different formulation of the viscous terms are shown to be necessary. A hybrid Cartesian/body-fitted grid generation approach is demonstrated. In addition, a grid-generation procedure based on body-aligned cell cutting coupled with a viscous stensil-construction procedure based on quadratic programming is presented.

Coirier, William John↗

Modeling MTS pyrolysis and SiC deposition kinetics using principal component analysis and neural networks

Accurate chemical kinetics modeling is crucial for improving the efficiency of chemical processing and synthesis of ceramic matrix composites. Detailed kinetic models are computationally expensive due to the large number of transported chemical species, while the simplified physics-based models, such as single-step global mechanisms, are efficient but often overlook key chemical intermediates and pathways. Recent deep learning approaches promise accurate and cost-effective models. Yet, they require additional closures for the transported nonlinear latent variables, complicating integration with existing solvers. In this work, we develop a hybrid linear—nonlinear reduced model for silicon carbide deposition from methyltrichlorosilane precursor by combining principal component analysis (PCA) and autoencoder (AE) neural network (NN) approaches. PCA is used to identify a smaller set of linear transport variables, enabling direct reuse of conventional transport solvers. NNs then reconstruct the full chemical state from these reduced variables. We demonstrate the method on a chemical vapor deposition reactor—comprising a gas-phase pyrolysis plug flow reactor and a heterogeneous surface reactor—over a wide range of temperatures, pressures, and residence times. Our PCA–AE model achieves high accuracy with only five transported scalars, achieving an eightfold cost reduction compared to detailed mechanisms, in both a priori (using data from the test set only) and a posteriori (coupled with a differential equation solver). In conclusion, notable errors arise primarily near training domain boundaries and for long residence times, indicating the need for domain shift indicators and better long-horizon predictions in future reduced chemistry model development.

autoencoder neural networks↗

GCAM Regional Tuning: A framework to tune GCAM parameters

GCAM assumptions typically generate scenarios that are designed to be internally consistent and globally coherent. The gcamdata tool which facilitates the compilation of data sets and user assumptions is not well suited to tailoring to specific country or regional realities, sponsor requirements, or perform harmonization for model intercomparison needs. As described in this report, the GCAM Regional Tuning project develops a computational framework that enables users to adjust GCAM parameters, so model outputs match targeted outcomes at user-defined spatial, temporal, and sectoral resolutions. The framework integrates GCAM, gcamdata, and gcamwrapper with a set of flexible “tuning directives” and an iterative numerical solver. Users can define targets (e.g., technology shares in power generation, BEV uptake, sectoral service demands), select tuners that manipulate relevant GCAM parameters (e.g., share weights, cost adders, elasticities), and export tuned parameters as reusable GCAM XML inputs for future runs. We demonstrate the approach and document usage, diagnostics, and known limitations, and we outline potential future directions.

97 MATHEMATICS AND COMPUTING↗

Some fast elliptic solvers on parallel architectures and their complexities

The discretization of separable elliptic partial differential equations leads to linear systems with special block triangular matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconsistant coefficients. A method was recently proposed to parallelize and vectorize BCR. Here, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches, including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational complexity lower than that of parallel BCR.

Gallopoulos, E.↗

Some fast elliptic solvers on parallel architectures and their complexities

The discretization of separable elliptic partial differential equations leads to linear systems with special block tridiagonal matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconstant coefficients. A method was recently proposed to parallelize and vectorize BCR. In this paper, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational compelxity lower than that of parallel BCR.

Gallopoulos, E.↗

A Formalization of Core Why3 in Coq

Intermediate verification languages like Why3 and Boogie have made it much easier to build program verifiers, transforming the process into a logic compilation problem rather than a proof automation one. Why3 in particular implements a rich logic for program specification with polymorphism, algebraic data types, recursive functions and predicates, and inductive predicates; it translates this logic to over a dozen solvers and proof assistants. Accordingly, it serves as a backend for many tools, including Frama-C, EasyCrypt, and GNATProve for Ada SPARK. But how can we be sure that these tools are correct? The alternate foundational approach, taken by tools like VST and CakeML, provides strong guarantees by implementing the entire toolchain in a proof assistant, but these tools are harder to build and cannot directly take advantage of SMT solver automation. As a first step toward enabling automated tools with similar foundational guarantees, we give a formal semantics in Coq for the logic fragment of Why3. We show that our semantics are useful by giving a correct-by-construction natural deduction proof system for this logic, using this proof system to verify parts of Why3's standard library, and proving sound two of Why3's transformations used to convert terms and formulas into the simpler logics supported by the backend solvers.

97 MATHEMATICS AND COMPUTING↗

A Fast Solver for Implicit Integration of the Vlasov--Poisson System in the Eulerian Framework

In this paper, we present a domain decomposition algorithm to accelerate the solution of Eulerian-type discretizations of the linear, steady-state Vlasov equation. The steady-state solver then forms a key component in the implementation of fully implicit or nearly fully implicit temporal integrators for the nonlinear Vlasov--Poisson system. The solver relies on a particular decomposition of phase space that enables the use of sweeping techniques commonly used in radiation transport applications. The original linear system for the phase space unknowns is then replaced by a smaller linear system involving only unknowns on the boundary between subdomains, which can then be solved efficiently with Krylov methods such as GMRES. Steady-state solves are combined to form an implicit Runge--Kutta time integrator, and the Vlasov equation is coupled self-consistently to the Poisson equation via a linearized procedure or a nonlinear fixed-point method for the electric field. Finally, numerical results for standard test problems demonstrate the efficiency of the domain decomposition approach when compared to the direct application of an iterative solver to the original linear system.

97 MATHEMATICS AND COMPUTING↗

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↗

On the role of artificial viscosity in Navier-Stokes solvers

A method is proposed to determine directly the amount of artificial viscosity needed for stability using an eigenvalue analysis for a finite difference representation of the Navier-Stokes equations. The stability and growth of small perturbations about a steady flow over the airfoils are analyzed for various amounts of artificial viscosity. The eigenvalues were determined for a small perturbation about a steady inviscid flow over a NACA 0012 airfoil at a Mach number of 0.8 and angle of attack of 0 degrees. The movement of the eigenvalue constellation with respect to the amount of artificial viscosity is studied. The stability boundries as a function of the amount of artificial viscosity from both the eigenvalue analysis and the time marching scheme are also presented. This procedure not only allows for determining the effect of varying amounts of artificial viscosity, but also for the effects of different forms of terms for artificial viscosity.

Mahajan, Aparajit J.↗

Role of artificial viscosity in Euler and Navier-Stokes solvers

A method is proposed to determine directly the amount of artificial viscosity needed for stability using an eigenvalue analysis for a finite difference representation of the Navier-Stokes equations. The stability and growth of small perturbations about a steady flow over airfoils are analyzed for various amounts of artificial viscosity. The eigenvalues were determined for a small time-dependent perturbation about a steady inviscid flow over an NACA 0012 airfoil at a Mach number of 0.8 and angle of attack of 0 deg. The method has been applied to inviscid flows here, but as discussed is also applicable to viscous flows. The movement of the eigenvalue constellation with respect to the amount of artificial viscosity is studied. The stability boundaries as a function of the amount of artificial viscosity from both the eigenvalue analysis and the time-marching scheme are also presented. The eigenvalue procedure not only allows for determining the effect of varying amounts of artificial viscosity, but also for the effects of different forms of artificial viscosity.

Mahajan, Aparajit J.↗

Development of a Detailed Surface Chemistry Framework in DSMC

A generalized finite-rate surface chemistry framework incorporating a comprehensive list of reaction mechanisms is developed and implemented into the Direct Simulation Monte Carlo (DSMC) solver SPARTA (Stochastic PArallel Rarefied-gas Time-accurate Analyzer). The various mechanisms include adsorption, desorption, Eley-Rideal (ER), and several types of Langmuir-Hinshelwood (LH) mechanisms. The approach is to stochastically model the various competing reactions occurring on a set of active sites. Both gas-surface (e.g., adsorption, ER) and pure-surface (e.g., desorption) reaction mechanisms are incorporated, and the framework also includes catalytic or surface altering mechanisms involving the participation of the bulk-phase species (e.g., bulk carbon atoms). Marschall and MacLean developed a general formulation in which multiple phases and surface sites are used and a similar convention is adopted in the current work. Expressions for the microscopic parameters of reaction probabilities (for gas-surface reactions) and frequencies (for pure-surface reactions) that are required for DSMC are derived from the surface properties and macroscopic parameters such as rate constants, sticking coefficients, etc. The energy and angular distributions of the products are specified according to the reaction type and input parameters. This framework also presents physically consistent procedures to accurately compute the reaction probabilities and frequencies in the case of multiple reactions. The result is a modeling tool with a wide variety of surface reactions characterized via user-specified reaction rate constants, surface properties and parameters.

Surface Chemistry↗

Direct multiscale coupling of a transport code to gyrokinetic turbulence codes

Direct coupling between a transport solver and local, nonlinear gyrokinetic calculations using the multiscale gyrokinetic code TRINITY[M. Barnes, 'TRINITY: A unified treatment of turbulence, transport, and heating in magnetized plasmas', Ph.D. thesis, University of Maryland, 2008 (eprint arXiv:0901.2868)] is described. The coupling of the microscopic and macroscopic physics is done within the framework of multiscale gyrokinetic theory, of which we present the assumptions and key results. An assumption of scale separation in space and time allows for the simulation of turbulence in small regions of the space-time grid, which are embedded in a coarse grid on which the transport equations are implicitly evolved. This leads to a reduction in computational expense of several orders of magnitude, making first-principles simulations of the full fusion device volume over the confinement time feasible on current computing resources. Numerical results from TRINITY simulations are presented and compared with experimental data from JET [M. Keilhacker, Plasma Phys. Controlled Fusion 41, B1 (1999)] and ASDEX Upgrade [O. Gruber, Nucl. Fusion 47, S622 (2007)] plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimal Water-Power Flow Problem: Formulation and Distributed Optimal Solution

This paper formalizes an optimal water-power flow (OWPF) problem to optimize the use of controllable assets across power and water systems while accounting for the couplings between the two infrastructures. Tanks and pumps are optimally managed to satisfy water demand while improving power grid operations; {for the power network, an AC optimal power flow formulation is augmented to accommodate the controllability of water pumps.} Unfortunately, the physics governing the operation of the two infrastructures and coupling constraints lead to a nonconvex (and, in fact, NP-hard) problem; however, after reformulating OWPF as a nonconvex, quadratically-constrained quadratic problem, a feasible point pursuit-successive convex approximation approach is used to identify feasible and optimal solutions. In addition, a distributed solver based on the alternating direction method of multipliers enables water and power operators to pursue individual objectives while respecting the couplings between the two networks. The merits of the proposed approach are demonstrated for the case of a distribution feeder coupled with a municipal water distribution network.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Embedding Python for In-Situ Analysis

We describe our work to embed a Python interpreter in S3D, a highly scalable parallel direct numerical simulation reacting flow solver written in Fortran. Although S3D had no in-situ capability when we began, embedding the interpreter was surprisingly easy, and the result is an extremely flexible platform for conducting machine-learning experiments in-situ.

97 MATHEMATICS AND COMPUTING↗

Dynamic population balance in molecular-level simulations of hypersonic flows

This report summarizes the work towards developing stochastic weighted particle methods (SWPM) for future application in hypersonic flows. Extensive changes to Sandia’s direct simulation Monte Carlo (DSMC) solver, SPARTA (Stochastic Particle Real Time Analyzer), were made to enable the necessary particle splitting and reduction capabilities for SWPM. The results from one-dimensional Couette and Fourier flows suggest that SWPM can reproduce the correct transport for a large range of Knudsen numbers with adequate accuracy. The associated velocity and temperature profiles are in good agreement with DSMC. An issue with particle placement during particle number reduction, is identified, to which, a simple but effective solution based on minimizing the center of mass error is proposed. High Mach wheel flows are simulated using the SWPM and DSMC methods. SWPM is capable of providing nearly an order of magnitude increase in efficiency over DSMC while retaining high accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Integrated geometry and grid generation system for complex configurations

A grid generation system was developed that enables grid generation for complex configurations. The system called ICEM/CFD is described and its role in computational fluid dynamics (CFD) applications is presented. The capabilities of the system include full computer aided design (CAD), grid generation on the actual CAD geometry definition using robust surface projection algorithms, interfacing easily with known CAD packages through common file formats for geometry transfer, grid quality evaluation of the volume grid, coupling boundary condition set-up for block faces with grid topology generation, multi-block grid generation with or without point continuity and block to block interface requirement, and generating grid files directly compatible with known flow solvers. The interactive and integrated approach to the problem of computational grid generation not only substantially reduces manpower time but also increases the flexibility of later grid modifications and enhancements which is required in an environment where CFD is integrated into a product design cycle.

Akdag, Vedat↗

The semi-discrete Galerkin finite element modelling of compressible viscous flow past an airfoil

A method is developed to solve the two-dimensional, steady, compressible, turbulent boundary-layer equations and is coupled to an existing Euler solver for attached transonic airfoil analysis problems. The boundary-layer formulation utilizes the semi-discrete Galerkin (SDG) method to model the spatial variable normal to the surface with linear finite elements and the time-like variable with finite differences. A Dorodnitsyn transformed system of equations is used to bound the infinite spatial domain thereby permitting the use of a uniform finite element grid which provides high resolution near the wall and automatically follows boundary-layer growth. The second-order accurate Crank-Nicholson scheme is applied along with a linearization method to take advantage of the parabolic nature of the boundary-layer equations and generate a non-iterative marching routine. The SDG code can be applied to any smoothly-connected airfoil shape without modification and can be coupled to any inviscid flow solver. In this analysis, a direct viscous-inviscid interaction is accomplished between the Euler and boundary-layer codes, through the application of a transpiration velocity boundary condition. Results are presented for compressible turbulent flow past NACA 0012 and RAE 2822 airfoils at various freestream Mach numbers, Reynolds numbers, and angles of attack. All results show good agreement with experiment, and the coupled code proved to be a computationally-efficient and accurate airfoil analysis tool.

Meade, Andrew J., Jr.↗

Semi-discrete Galerkin solution of the compressible boundary-layer equations with viscous-inviscid interaction

A semi-discrete Galerkin (SDG) method is under development to model attached, turbulent, and compressible boundary layers for transonic airfoil analysis problems. For the boundary-layer formulation the method models the spatial variable normal to the surface with linear finite elements and the time-like variable with finite differences. A Dorodnitsyn transformed system of equations is used to bound the infinite spatial domain thereby providing high resolution near the wall and permitting the use of a uniform finite element grid which automatically follows boundary-layer growth. The second-order accurate Crank-Nicholson scheme is applied along with a linearization method to take advantage of the parabolic nature of the boundary-layer equations and generate a non-iterative marching routine. The SDG code can be applied to any smoothly-connected airfoil shape without modification and can be coupled to any inviscid flow solver. In this analysis, a direct viscous-inviscid interaction is accomplished between the Euler and boundary-layer codes through the application of a transpiration velocity boundary condition. Results are presented for compressible turbulent flow past RAE 2822 and NACA 0012 airfoils at various freestream Mach numbers, Reynolds numbers, and angles of attack.

Day, Brad A.↗