Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative solvers”

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 235 records · Page 13

Predicting Flow in Fracture Networks With Quantum Algorithms

Uncertainty quantification plays a crucial role in the modeling of subsurface flow. For instance, uncertainties in the properties of geologic fracture networks significantly impact flow, requiring numerous simulations to accurately estimate quantities of interest. However, each simulation is computationally expensive because it requires solving a large linear system to capture features that involve both small and large fractures. An example is in percolation, where the interaction of many small fractures (which cumulatively can have a large surface area) with the rock matrix must be modeled precisely. Quantum computing is an emerging tool with the potential to address this issue. Quantum algorithms offer a significant speedup in solving linear systems, achieving efficiencies that are challenging to match with classical approaches. These classical approaches include direct solvers, such as LU decomposition, and iterative methods, notably preconditioned conjugate gradient, commonly used in subsurface modeling to solve large sparse systems. However, applying quantum algorithms to geologic fracture flow requires careful attention to algorithmic and problem-specific constraints to fully realize this quantum advantage. In this work we describe a quantum algorithm for generalized Monte Carlo applications with a quadratic speedup over the classical approaches which can be combined with the quantum speedup, currently under investigation, for solving quantum linear systems for subsurface flow. We show that for quantum algorithms the computational cost of estimating a quantity of interest for a statistical ensemble of networks is roughly the same as that of a single realization, essentially implying that one can get uncertainty quantification for free.

58 GEOSCIENCES↗

Game theoretic modeling and optimization of competition and collaboration in dual channel electronic waste supply chains

The rapid growth of electronic waste (e-waste) presents critical challenges for sustainable resource recovery and environmental protection. This study develops a dual-channel closed-loop supply chain (CLSC) model formulated as a hierarchical Stackelberg game, that integrates dynamic pricing and cost-sharing mechanisms to optimize both economic and environmental outcomes. The model explicitly captures strategic interactions between manufacturer-led and third-party recycling channels, accounting for consumer behavior, regulatory incentives, and market competition. Numerical simulations conducted (implemented over a four-iteration horizon using a commercial optimization solver) show that, relative to the baseline equilibrium, manufacturer profit increases from 11.6 thousand USD to 37.9 thousand USD (+226.8%), total recycled volume rises from 7,848 to 7,942 units (+1.2%), and collector profit nearly doubles under cost-sharing, enabling more equitable profit distribution. Furthermore, scenario-based simulations across Sub-Saharan Africa, high-income economies, and emerging Asian industrial countries reveal that infrastructure quality, policy intensity, and labor costs critically shape recycling efficiency and profit allocation. These findings demonstrate that subsidies alone are insufficient to ensure system efficiency. Instead, coordinated strategies that integrate internal incentive alignment with context-sensitive policy support are required. Overall, this study offers a robust framework for designing resilient, efficient, and regionally adaptable e-waste management systems.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Discrete modeling of a transformer with ALEGRA

We report progress on a task to model transformers in ALEGRA using the “Transient Magnetics” option. We specifically evaluate limits of the approach resolving individual coil wires. There are practical limits to the number of turns in a coil that can be numerically modeled, but calculated inductance can be scaled to the correct number of turns in a simple way. Our testing essentially confirmed this “turns scaling” hypothesis. We developed a conceptual transformer design, representative of practical designs of interest, and that focused our analysis. That design includes three coils wrapped around a rectangular ferromagnetic core. The secondary and tertiary coils have multiple layers. The tertiary has three layers of 13 turns each; the secondary has five layers of 44 turns; the primary has one layer of 20 turns. We validated the turns scaling of inductance for simple (one-layer) coils in air (no core) by comparison to available independent calculations for simple rectangular coils. These comparisons quantified the errors versus reduced number of turns modeled. For more than 3 turns, the errors are <5%. The magnetic field solver failed to converge (within 5000 iterations) for >10 turns. Including the core introduced some complications. It was necessary to capture the core surfaces in thin grid sheaths to minimize errors in computed magnetic energy. We do not yet have quantitative benchmarks with which to compare, but calculated results are qualitatively reasonable.

42 ENGINEERING↗

A fast semidirect method for computing transonic aerodynamic flows

A fast, semidirect, iterative computational method, previously introduced for finite-difference solution of subsonic and slightly supercritical flow over airfoils, is extended both to apply to strongly supercritical conditions and to include full second-order accuracy in computing inviscid flows over airfoils. The nonlinear small-disturbance equations are solved iteratively by a direct, linear, elliptic solver. General, fully conservative, type-dependent difference equations are formulated, including parabolic- and shock-point transition operators that provide consistency with the integral conservation laws. These equations specialize to either first-order or to fully second-order-accurate equations. Various free parameters are evaluated for rapid convergence of the first-order scheme. Resulting pressure distributions and computing times are compared with the improved Murman-Cole line-relaxation method.

Martin, E. D.↗

Variants and extensions of a fast direct numerical cauchy-riemann solver, with illustrative applications

Revised and extended versions of a fast, direct (noniterative) numerical Cauchy-Riemann solver are presented for solving finite difference approximations of first order systems of partial differential equations. Although the difference operators treated are linear and elliptic, one significant application of these extended direct Cauchy-Riemann solvers is in the fast, semidirect (iterative) solution of fluid dynamic problems governed by the nonlinear mixed elliptic-hyperbolic equations of transonic flow. Different versions of the algorithms are derived and the corresponding FORTRAN computer programs for a simple example problem are described and listed. The algorithms are demonstrated to be efficient and accurate.

Martin, E. D.↗

Pseudo-time methods for constrained optimization problems governed by PDE

In this paper we present a novel method for solving optimization problems governed by partial differential equations. Existing methods are gradient information in marching toward the minimum, where the constrained PDE is solved once (sometimes only approximately) per each optimization step. Such methods can be viewed as a marching techniques on the intersection of the state and costate hypersurfaces while improving the residuals of the design equations per each iteration. In contrast, the method presented here march on the design hypersurface and at each iteration improve the residuals of the state and costate equations. The new method is usually much less expensive per iteration step since, in most problems of practical interest, the design equation involves much less unknowns that that of either the state or costate equations. Convergence is shown using energy estimates for the evolution equations governing the iterative process. Numerical tests show that the new method allows the solution of the optimization problem in a cost of solving the analysis problems just a few times, independent of the number of design parameters. The method can be applied using single grid iterations as well as with multigrid solvers.

Taasan, Shlomo↗

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↗

Coupled Solid Rocket Motor Ballistics and Trajectory Modeling for Higher Fidelity Launch Vehicle Design

Multi-stage launch vehicles with solid rocket motors (SRMs) face design optimization challenges, especially when the mission scope changes frequently. Significant performance benefits can be realized if the solid rocket motors are optimized to the changing requirements. While SRMs represent a fixed performance at launch, rapid design iterations enable flexibility at design time, yielding significant performance gains. The streamlining and integration of SRM design and analysis can be achieved with improved analysis tools. While powerful and versatile, the Solid Performance Program (SPP) is not conducive to rapid design iteration. Performing a design iteration with SPP and a trajectory solver is a labor intensive process. To enable a better workflow, SPP, the Program to Optimize Simulated Trajectories (POST), and the interfaces between them have been improved and automated, and a graphical user interface (GUI) has been developed. The GUI enables real-time visual feedback of grain and nozzle design inputs, enforces parameter dependencies, removes redundancies, and simplifies manipulation of SPP and POST's numerous options. Automating the analysis also simplifies batch analyses and trade studies. Finally, the GUI provides post-processing, visualization, and comparison of results. Wrapping legacy high-fidelity analysis codes with modern software provides the improved interface necessary to enable rapid coupled SRM ballistics and vehicle trajectory analysis. Low cost trade studies demonstrate the sensitivities of flight performance metrics to propulsion characteristics. Incorporating high fidelity analysis from SPP into vehicle design reduces performance margins and improves reliability. By flying an SRM designed with the same assumptions as the rest of the vehicle, accurate comparisons can be made between competing architectures. In summary, this flexible workflow is a critical component to designing a versatile launch vehicle model that can accommodate a volatile mission scope.

Ables, Brett↗

PCLAM: a Python Module for Computing Surface Lineloads and Moments

Lineloads serve a unique and important role in aerodynamic database development as well as configuration design and analysis. A new software suite was constructed which can compute lineloads rapidly enough that the calculations can run in tandem with high-fidelity fluid flow solvers. This enables the calculation of iteration- or time-dependent lineloads, which have thus far been too computationally costly to create for complicated systems like launch vehicles. The suite is organized into a standalone Python module named PCLAM (PCLAM Computes Lineloads And Moments) which can be imported into other software with minimal restructuring by the user or developer. The computed lineloads are integrated with a $C^0$ numerical quality and exhibit the expected sensitivity to underlying grid resolution. Even at low grid and lineload resolutions, the computed lineloads were found to be in strong agreement with several analytical test cases.

sectional loads↗

Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.

97 MATHEMATICS AND COMPUTING↗

An iterative multidisciplinary analysis for rotor blade shape determination

A CFD solver called ADPAC-APES is coupled with a NASTRAN structural analysis and a MARC thermal/heat transfer analysis to determine rotor blade shape. Nonlinear blade displacements due to centrifugal loads, aerodynamic pressures, and nonuniform temperature distribution are determined simultaneously. The effect of blade displacements on aerodynamic pressures and temperatures is then analyzed. These calculations are iterated till a steady state is reached across all the disciplines. This iterative procedure is applied to a ducted fan rotor blade and the manufactured shape is determined from a given operating shape. Effect of a part-span shroud on blade deflections is also analyzed.

Mahajan, Aparajit J.↗

Design of P-3 Nadir Port

This project details the design and analysis of a structure to replace the interface of the P-3B nadir port with an optimized interface for science installations. A new nadir port plug has been designed to replace the OEM (Original Equipment Manufacturer) plug (Lockheed PN 910169) currently used in Nadir ports 1 and 2 on the NASA P-3B aircraft. The plug consists of a milled frame that can be outfitted with customizable flat plates to meet a broad range of science needs. The frame slides into place using the existing P-3B rail system using a lever and tie-rod assembly. The seal interface will contact the Fuselage skin of the aircraft and consists of a bulb E-seal that is riveted around the perimeter of the frame. The flat plate (20 inches x 31 inches) provides a large profile that can be outfitted based on science mission goals and requirements to attach multiple instruments. This is a significant increase to the aircraft capability. Previously, the OEM plug had to be modified to hold very small plates, windows, or instruments limiting the use of the ports.There were several challenges for this project that included a constrained schedule, lack of historical references, and reverse engineering. The unusually tight schedule for design, manufacture, and install limited potential approaches. In addition, design of a new interface to replace the existing plug, on an aircraft designed in the 1960's by Lockheed for the Navy with little to no documentation, required substantial reverse engineering. In order to accomplish this, a suitable method to determine interface requirements with the aircraft had to be solved. After several iterations, the solution was to implement laser scanning techniques to scan the aircraft and the OEM plug and generate a 3D model to capture the design envelope. The structure is designed to maintain a positive margin of safety when subjected to the inertial, pressure, and aerodynamic load requirements for an external installation on the P-3B, as described in the Wallops' P-3B Design Requirements 548-RQMT-0001 Rev. A . A finite element model is created in FEMAP (Finite Element Modeling And Postprocessing) and is run through NX Nastran solver to analyze the structure. After several iterations of analysis, the structure was enveloped to hold 115 pounds evenly distributed on the plate.

Chance, Monica↗

Scaled ILU Smoothers for Navier-Stokes Pressure Projection

Incomplete LU (ILU) smoothers are effective in the algebraic multigrid (AMG) V-cycle for reducing high-frequency components of the error. However, the requisite direct triangular solves are comparatively slow on GPUs. Previous work has demonstrated the advantages of Jacobi iteration as an alternative to direct solution of these systems. Depending on the threshold and fill-level parameters chosen, the factors can be highly nonnormal and Jacobi is unlikely to converge in a low number of iterations. We demonstrate that row scaling can reduce the departure from normality, allowing us to replace the inherently sequential solve with a rapidly converging Richardson iteration. There are several advantages beyond the lower compute time. Scaling is performed locally for a diagonal block of the global matrix because it is applied directly to the factor. Further, an ILUT Schur complement smoother maintains a constant GMRES iteration count as the number of MPI ranks increases, and thus parallel strong-scaling is improved. Our algorithms have been incorporated into hypre, and we demonstrate improved time to solution for linear systems arising in the Nalu-Wind and PeleLM pressure solvers. For large problem sizes, GMRES+AMG executes at least five times faster when using iterative triangular solves compared with direct solves on massively parallel GPUs.

algebraic multigrid↗

Parallel-in-Time Solution of Hyperbolic PDE Systems via Characteristic-Variable Block Preconditioning

We consider the parallel-in-time solution of both linear and nonlinear hyperbolic partial differential equation (PDE) systems in one spatial dimension. In the nonlinear setting, the discretized equations are solved with a preconditioned residual iteration based on a global linearization. The linear(ized) equation systems are approximately solved parallel-in-time using a block preconditioner applied in the characteristic variables of the underlying linear(ized) hyperbolic PDE. This change of variables is motivated by the observation that intervariable coupling between characteristic variables is weak, at least locally where spatio-temporal variations in the eigenvectors of the associated flux Jacobian are sufficiently small, while that between the original variables is not. For an ℓ-dimensional system of PDEs, applying the preconditioner consists of solving a sequence of ℓ scalar linear(ized)-advection-like problems, each associated with a different characteristic wave-speed in the underlying linear(ized) PDE. Furthermore, we approximately solve these linear advection problems using multigrid reduction-in-time (MGRIT); however, any other suitable parallel-in-time method could be used. Numerical examples are shown for the (linear) acoustics equations in heterogeneous media and for the (nonlinear) shallow water equations and Euler equations of gas dynamics with shocks and rarefactions. For many test problems, the solver converges in just a handful of iterations and with mesh-independent convergence rates.

97 MATHEMATICS AND COMPUTING↗

Finite Volume Discretization of the Euler Equations in Pronghorn

Modeling flow and heat transfer in high temperature gas reactors (HTGR) requires the ability to model a wide range of flow speeds from slow (natural convection), to intermediate (forced-flow conditions), to supersonic regimes (depressurization) for a wide range of geometries including the pebble bed, upper and lower plenum, and risers. In previous work, Pronghorn has effectively modeled low-to-medium speed flows in scenarios such as the one described in the two-dimensional PBMR-400 benchmark, using its finite-element-based streamline-upwind Petrov-Galerkin (SUPG) stabilized implementation of the Euler equations. However, limitations of this method become apparent when dealing with more complicated geometries (e.g. imposing slip boundary conditions at nodes belonging to two different boundaries) and when gas speeds are fast enough for shocks and supersonic flow to occur. For these problems, the finite-element-based solver lacks robustness and is plagued by slow iterative convergence or even divergence. In order to address these challenges, the Pronghorn code at INL has been updated with new, modified versions of its original equations. The new Pronghorn models are built on the finite volume method with a Harten-Lax-van Leer-Contact (HLLC) Riemann solver based numerical flux method, which (1) allows imposing slip boundary conditions much more robustly and (2) performs well for a wide range of flow speeds. The finite-volume-based flow solver will form the basis for a robust coarse-mesh thermal-hydraulics capability in Pronghorn.

97 MATHEMATICS AND COMPUTING↗

A Simplified FANG Cell-Centered Finite-Volume Method and Comparison with Other Methods for Trouble-Prone Grids

We propose a simplication of the face-averaged nodal-gradient (FANG) method for a cell-centered finite-volume Euler/Navier-Stokes solver on arbitrary grids, and compare it with other gradient methods for trouble-prone grids in two dimensions. The implementation of the FANG method is simplified by adding the face-neighbor cells of the cells around a node to a least-squares gradient stencil. The resulting method is stable for both triangular and quadrilateral grids. Although it increases the residual stencil for triangular grids, it allows the solver to work seamlessly for mixed grids and greatly simplifies the implementation, especially in three dimensions. For comparison, only explicit weighted/unweighted least-squares cell-centered and nodal gradient methods are considered. These gradients are used in both inviscid and viscous schemes, and we investigate their impact on the iterative convergence of an implicit defect-correction solver on difficult grids such as highly-curved-and-thin grids and highly distorted anisotropic grids. Finally, we will also consider a face-stencil-based limiter and compare it with a conventional cell-stencil-based limiter.

Hiroaki Nishikawa↗

Trajectory Engineering with Modular Patched Conics for Entry Systems and TPS (TEMPEST)

Brief Presenter Biography (35 word limit): Bohdan Wesely is an Aerospace Engineer in the Entry Systems and Technology Division at Ames. He has worked on a variety of projects for NASA including integrated TPS (thermal protection system) flight hardware deliveries and testing services for commercial partners. Introduction: TEMPEST is a new trajectory analysis framework that is designed to fill the gap between dedicated flight mechanics tools and aerothermal and TPS sizing tools. The project started as an SJSU master’s thesis and has since evolved into a general conceptual design tool capable of studying a wide variety of entry problems. Development is ongoing in the Entry Systems and Technology Division at NASA ARC. Why TEMPEST: Space missions involving entry into a planetary atmosphere involve a series of unique requirements across multiple disciplines. Whether it is traditional entry descent and landing (EDL), or aerocapture, the vehicle must navigate to its target landing location or orbit state, and the TPS must protect the payload during entry. The design process typically involves iterative handoffs between various flight mechanics, flow solver, and material response level tools. During the early conceptual phase, a wide variety of feasible trajectories are simulated in a Monte Carlo scenario which broadly satisfy the mission or landing requirements. Next, computational fluid dynamics (CFD), direct simulation Monte Carlo (DSMC), and other flow solver analyses are performed at various key trajectory points to generate an aero-database, heating and TPS design requirements also emerge at this stage. At this point, with updated aerodynamics from the various flow solvers, trajectories can be re-run, this in turn can change the required freestream conditions for the CFD tools, and as a project progresses, these analyses converge, and uncertainty is reduced. However, there is always a “hand-off” occurring between two inherently coupled phenomena. Analysis Description: One of the goals with TEMPEST is to use a variety of first principles estimation methods coupled with an atmosphere model to predict vehicle aerothermodynamics across the entire flight regime while propagating a 3 or 6 degree of freedom (DoF) trajectory. Aerodynamics methods include modified Newtonian, Maxwell and Cercignani- Lampis-Lord (CLL) for continuum, transitional, and free molecular flow regimes. Aerothermodynamics include boundary layer and reference enthalpy methods, and Mutation++ for non-equilibrium chemistry modeling. TEMPEST is also capable of stitching multiple trajectory segments together to study mission scenarios like multi-pass aerocapture and aero-gravity assists. Most of the program is implemented in MATLAB using modern system objects, it relies on several C++ shared libraries for supporting tools like Gmsh, the Global Reference Atmospheric Model (GRAM), and Mutation++. The various first principles aerothermal estimation methods are discretized across either a structured axisymmetric panel mesh or an unstructured tri-mesh generated from an open-source tool such as Gmsh, this allows solutions on the same mesh to be compared across tools such as CB-Aero. CFD Coupling. A physics-aware, gaussian process CFD anchoring scheme is proposed to adjust the various first principles methods as a CFD database is populated. One goal for this anchoring module is to inform the project where CFD should be run. Full knowledge of the entire trajectory, atmosphere, and aerothermodynamics allows for easier identification of high sensitivity areas and uncertainty quantification. While the first principles effects are well known and proven accurate in existing tools such as CB- Aero and Cart3D, a physics aware CFD anchoring scheme increases tool credibility across a project lifecycle. Material Response Modeling. Correct TPS sizing is critical for optimizing mass for science payloads and ensuring mission success. The process typically involves a thermal analysis along the trajectory with surface heating environments as a boundary condition. Several design constraints are maximum bondline temperature and maximum recession with various margining techniques. The material response tool FIAT, developed out of NASA Ames, is currently being integrated into the TEMPEST environment. TPS recession, shape change, mass loss, and mass property alteration are all factors that can perturb an entry trajectory. For missions like Mars 2020, recession was minimal and was safely handled separately as a post process. For missions such as Jupiter Galileo with a high TPS mass fraction or asteroid entries, recession plays a major role. The proposed fully coupled scheme is to use an epoch-based approach where the trajectory integration is halted after a recession threshold, the energy balance and FIAT are solved at each panel, the mesh, aerodynamics, and mass properties are updated, and the trajectory continues. Several computational tradeoffs have been made during the development of TEMPEST to limit the cost of a single trajectory and preserve its utility as a conceptual, rapid iteration tool. Conclusion: Development of TEMPEST is ongoing and the project is still in its infancy. This talk aims to showcase its unique capabilities to support future NASA entry systems missions.

Bohdan O Wesely↗