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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Implementation of the D1S Methodology for Shutdown Dose Rate Calculations in the OpenMC Monte Carlo Particle Transport Code

We present an implementation of the direct one-step (D1S) methodology for shutdown dose rate (SDR) calculations in the OpenMC Monte Carlo particle transport code. In addition to being the first fully open-source D1S implementation, it is also the first to require no ad hoc source code or nuclear data library modifications. The code can seamlessly switch between production of prompt and decay photons based on a user input parameter, and the decay data needed for decay photon generation are made available through a depletion chain file, which is already used for OpenMC’s built-in depletion/activation solver. A set of Python functions significantly eases the burden of computing and applying time correction factors needed to properly account for the time dependence of radionuclide activity. To assess the accuracy of the D1S implementation, SDR calculations have been carried out for three problems: a prism of iron irradiated by 14-MeV neutrons, the ITER port plug computational benchmark, and the Frascati Neutron Generator (FNG) ITER dose rate benchmark problem from the Shielding INtegral Benchmark Archive and Database (SINBAD). For each of these problems, comparisons were made to calculations using the rigorous two-step (R2S) method. The results on the iron prism problem illustrate how the D1S method achieves superior spatial resolution compared to the R2S method without the need for spatial discretization of the activation regions. The D1S and R2S results for the ITER port plug benchmark agree well with previously reported results in the literature. While the D1S results are 10% to 15% lower than the R2S results, this may be due to stochastic uncertainty and/or spatial discretization in the R2S calculations. On the FNG dose rate benchmark problem, the D1S method produces dose rate estimates that are within 4% of the dose rates predicted using a cell-based R2S workflow. The D1S estimates of the SDR are also in reasonable agreement with the experimental measurements and show the same basic trends that have been observed in previous works. A qualitative analysis of the execution time and uncertainty for the R2S and D1S workflows suggests that the D1S method would attain a higher figure of merit.

D1S method↗
NASA NTRS1992

Parallel solver for trajectory optimization search directions

A key algorithmic element of a real-time trajectory optimization hardware/software implementation is presented, the search step solver. This is one piece of an algorithm whose overall goal is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter or the National Aerospace Plane. Many methods of nonlinear programming require the solution of a quadratic program (QP) at each iteration to determine the search step. In the trajectory optimization case, the QP has a special dynamic programming structure. The algorithm exploits this special structure with a divide- and conquer type of parallel implementation. The algorithm solves a (p.N)-stage problem on N processors in O(p + log2 N) operations. The algorithm yields a factor of 8 speed-up over the fastest known serial algorithm when solving a 1024-stage test problem on 32 processors.

Psiaki, M. L.↗
DOE OSTI2021

A Parallel Cut-Cell Algorithm for the Free-Boundary Grad--Shafranov Problem

A parallel cut-cell algorithm is described to solve the free-boundary problem of the Grad--Shafranov equation. The algorithm reformulates the free-boundary problem in an irregular bounded domain and its important aspects include a searching algorithm for the magnetic axis and separatrix, a surface integral along the irregular boundary to determine the boundary values, an approach to optimize the coil current based on a targeting plasma shape, Picard iterations with Aitken's acceleration for the resulting nonlinear problem, and a Cartesian grid embedded boundary method to handle the complex geometry. Here the algorithm is implemented in parallel using a standard domain-decomposition approach and a good parallel scaling is observed. Numerical results verify the accuracy and efficiency of the free-boundary Grad--Shafranov solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Consistent inclusion of triple substitutions within a coupled cluster based static quantum embedding theory

We have previously proposed the MPCC static embedding framework for quantum chemistry that self-consistently couples a high-level coupled cluster (CC) treatment of the fragment (active region) with a lower level, Møller–Plesset perturbation treatment of the environment. Our initial implementation was limited to single and double (SD) substitutions, with CCSD for the fragment and first-order perturbative SD amplitudes for the environment. Here, we extend the MPCC embedding treatment to triple substitutions, which is essential for achieving chemical accuracy in energy differences. To this end, we employ a CCSDT solver for the fragment subsystem. For the environment subsystem, we construct a perturbative estimate of the triples amplitudes, explicitly accounting for feedback from all fragment amplitudes. The resulting approach is denoted MPCCSDT(pt). We further introduce a more complete formulation in which feedback from the environment amplitudes to the fragment amplitudes is also included. This scheme involves an iterative treatment of the environment triples amplitudes and is denoted MPCCSDT(it). In addition, we assess the accuracy of the previously proposed low-level method by introducing a modified low-level approach that incorporates a lowest-order treatment of selected long-range effects, including spin fluctuations and charge polarization. All resulting approaches may be viewed as post-CCSD(T) methods. We therefore consider test cases for which CCSD(T) exhibits substantial deviations from CCSDT. These include (i) single- and triple-bond stretching in F 2 and N 2 , (ii) bond dissociation energies of selected molecules from the W4-11 dataset, and (iii) total atomization energies of transition metal hydrides. Our results demonstrate that inclusion of triples amplitudes at the fragment level alone is insufficient; a perturbative treatment of the environment triples amplitudes is required. For many energy-difference applications, feedback from the environment triples amplitudes to the fragment amplitudes is not essential, but it does play a role in the very challenging CoH and FeH molecules. A very interesting finding from our study is that in some challenging cases, we need an improved (second-order) perturbative method for the SD amplitudes, going beyond the first-order one used in our earlier work. In conclusion, considering both cost and accuracy, the MP2CCSDT(pt) model is the most promising for future applications among the candidates considered here.

Shee, Avijit [University of California, Berkeley, ↗
NASA NTRS1992

Parallel computational fluid dynamics - Implementations and results

The present volume on parallel CFD discusses implementations on parallel machines, numerical algorithms for parallel CFD, and performance evaluation and computer science issues. Attention is given to a parallel algorithm for compressible flows through rotor-stator combinations, a massively parallel Euler solver for unstructured grids, a fast scheme to analyze 3D disk airflow on a parallel computer, and a block implicit multigrid solution of the Euler equations. Topics addressed include a 3D ADI algorithm on distributed memory multiprocessors, clustered element-by-element computations for fluid flow, hypercube FFT and the Fourier pseudospectral method, and an investigation of parallel iterative algorithms for CFD. Also discussed are fluid dynamics using interface methods on parallel processors, sorting for particle flow simulation on the connection machine, a large grain mapping method, and efforts toward a Teraflops capability for CFD.

Simon, Horst D.↗
NASA NTRSDate not supplied

USM3D-ME Revised SA-neg Implementation and Assessment for Seventh Drag Prediction Workshop Solutions

Simulations performed by an unstructured-grid, cell-centered, finite-volume, mixed-element flow solver USM3D-MEwere presented at the Seventh Drag Prediction Workshop (DPW-7). Reynolds-averaged Navier-Stokes (RANS) solutions for the NASA high-speed common research model wing-body configuration were computed using a new implementation of the negative variant of the Spalart-Allmaras turbulence model (SA-neg) with hierarchical adaptive nonlinear iteration method (HANIM).ThisUSM3D-ME enhancement improved efficiency and robustness of RANS solutions resulting in fast iterative convergence to machine zero residuals on mixed-element unstructured grids provided by the DPW-7 organizing committee. This paper presents theoretical foundations for the new implementation of the SA-neg model and analyzesUSM3D-ME solutions for flow conditions corresponding to the required DPW-7 cases.

Boris Diskin↗
DOE OSTI2020

Scalable Deep-Learning-Accelerated Topology Optimization for Additively Manufactured Materials

Topology optimization (TO) is a popular and powerful computational approach for designing novel structures, materials, and devices. Two computational challenges have limited the applicability of TO to a variety of industrial applications. First, a TO problem often involves a large number of design variables to guarantee sufficient expressive power. Second, many TO problems require a large number of expensive physical model simulations, and those simulations cannot be parallelized. To address these issues, we propose a general scalable deep-learning (DL) based TO framework, referred to as SDL-TO, which utilizes parallel schemes in high performance computing (HPC) to accelerate the TO process for designing additively manufactured (AM) materials. Unlike the existing studies of DL for TO, our framework accelerates TO by learning the iterative history data and simultaneously training on the mapping between the given design and its gradient. The surrogate gradient is learned by utilizing parallel computing on multiple CPUs incorporated with a distributed DL training on multiple GPUs. The learned TO gradient enables a fast online update scheme instead of an expensive update based on the physical simulator or solver. Using a local sampling strategy, we achieve to reduce the intrinsic high dimensionality of the design space and improve the training accuracy and the scalability of the SDL-TO framework. The method is demonstrated by benchmark examples and AM materials design for heat conduction. The proposed SDL-TO framework shows competitive performance compared to the baseline methods but significantly reduces the computational cost by a speed up of around 8.6x over the standard TO implementation.

Bi, Sirui↗
NASA NTRS1990

A finite element solver for 3-D compressible viscous flows

Computation of the flow field inside a space shuttle main engine (SSME) requires the application of state of the art computational fluid dynamic (CFD) technology. Several computer codes are under development to solve 3-D flow through the hot gas manifold. Some algorithms were designed to solve the unsteady compressible Navier-Stokes equations, either by implicit or explicit factorization methods, using several hundred or thousands of time steps to reach a steady state solution. A new iterative algorithm is being developed for the solution of the implicit finite element equations without assembling global matrices. It is an efficient iteration scheme based on a modified nonlinear Gauss-Seidel iteration with symmetric sweeps. The algorithm is analyzed for a model equation and is shown to be unconditionally stable. Results from a series of test problems are presented. The finite element code was tested for couette flow, which is flow under a pressure gradient between two parallel plates in relative motion. Another problem that was solved is viscous laminar flow over a flat plate. The general 3-D finite element code was used to compute the flow in an axisymmetric turnaround duct at low Mach numbers.

Reddy, K. C.↗
DOE OSTI2022

maestro

MÆSTRO stands for Multi-fidelity Adaptive Ensemble Stochastic Trust Region Optimization and it is a plug n play derivate fee stochastic optimization solver. The problem being considered in MÆSTRO involves fitting Monte Carlo simulations that describe complex phenomena to experiments. This is done by finding parameters of the resource intensive and noisy simulation that yield the least squares objective function value to the noisy experimental data. This problem is solved using a stochastic trust-region optimization algorithm where in each iteration, a local approximation of the simulation signal and of the simulation noise is constructed over data, which is obtained by running the simulation at strategically placed design points within the trust-region around the current iterate. Then the simulation components of the objective are replaced by their approximations and this analytical and closed-form optimization problem is solved to find the next iterate within the trust-region. Then the trust region is moved and the iterations continue until a satisfactory convergence criteria is met.

KRISHNAMOORTHY, MOHAN↗
DOE OSTI2020

Solving Coupled Cluster Equations by the Newton Krylov Method

We describe using the Newton Krylov method to solve the coupled cluster equation. The method uses a Krylov iterative method to compute the Newton correction to the approximate coupled cluster amplitude. The multiplication of the Jacobian with a vector, which is required in each step of a Krylov iterative method such as the Generalized Minimum Residual (GMRES) method, is carried out through a finite difference approximation, and requires an additional residual evaluation. The overall cost of the method is determined by the sum of the inner Krylov and outer Newton iterations. We discuss the termination criterion used for the inner iteration and show how to apply pre-conditioners to accelerate convergence. We will also examine the use of regularization technique to improve the stability of convergence and compare the method with the widely used direct inversion of iterative subspace (DIIS) methods through numerical examples.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

An Efficient Numerical Algorithm for Solving Coupled Time-Dependent Ginzburg-Landau Equation for Superconductivity and Elasticity

A decoupled finite element algorithm is developed for simulating the vortex dynamics on an elastic superconductor which couples the time-dependent Ginzburg- Landau equation with the complex-valued superconducting order parameter and the vector-valued magnetic potential, and the elasticity equation. We present an iterative algorithm for the decoupled system arising from the time and spatial discretization using a combination of preconditioner, algebraic multigrid method (AMG) and preconditioned conjugate gradient method (PCG). The iterative algorithm allows us to perform large-scale three-dimensional simulations of mesoscale pattern formation during superconducting phase transitions with arbitrary elastic boundary conditions. Here, the performance and efficiency of the algorithm are numerically verified by several benchmark problems, exhibiting up to two orders of magnitude improvement depending on the scale of discrete system compared to the exact solver.

Efficiency↗
NASA NTRS1993

Methodology for CFD Design Analysis of National Launch System Nozzle Manifold

The current design environment dictates that high technology CFD (Computational Fluid Dynamics) analysis produce quality results in a timely manner if it is to be integrated into the design process. The design methodology outlined describes the CFD analysis of an NLS (National Launch System) nozzle film cooling manifold. The objective of the analysis was to obtain a qualitative estimate for the flow distribution within the manifold. A complex, 3D, multiple zone, structured grid was generated from a 3D CAD file of the geometry. A Euler solution was computed with a fully implicit compressible flow solver. Post processing consisted of full 3D color graphics and mass averaged performance. The result was a qualitative CFD solution that provided the design team with relevant information concerning the flow distribution in and performance characteristics of the film cooling manifold within an effective time frame. Also, this design methodology was the foundation for a quick turnaround CFD analysis of the next iteration in the manifold design.

Haire, Scot L.↗
NASA NTRSDate not supplied

Enabling Metric-Based Mesh Adaptation for Advanced Compressible Flow Simulations Using US3D

This work presents a metric-based mesh adaptation capability added to the flow solver US3D that is used to improve the accuracy of atmospheric entry simulations. Flow past an entry vehicle in free-flight is usually unsteady and characterized by anisotropic flow features like a strong bow shock and small-scale isotropic flow features like turbulent eddies in the wake. The results presented in this paper demonstrate that we are currently able to iteratively apply metric-based mesh adaptation to improve the solution accuracy by simultaneously targeting isotropic and anisotropic flow features. A simplified workflow of running CFD simulations for entry vehicles is presented where we start off with a coarse initial mesh to compute a first approximation of the flow. This coarse mesh is then iteratively refined using the newly developed metric to improve the resolution of the CFD computation. Furthermore, we demonstrate that we are able to adapt large mesh sizes in a timely fashion which allows us to start thinking about applying this adaptive framework to unsteady atmospheric entry CFD simulations.

Mesh adaptation↗
DOE OSTI2021

Limited-angle computed tomography with deep image and physics priors

Computed tomography is a well-established x-ray imaging technique to reconstruct the three-dimensional structure of objects. It has been used extensively in a variety of fields, from diagnostic imaging to materials and biological sciences. One major challenge in some applications, such as in electron or x-ray tomography systems, is that the projections cannot be gathered over all the angles due to the sample holder setup or shape of the sample. This results in an ill-posed problem called the limited angle reconstruction problem. Typical image reconstruction in this setup leads to distortion and artifacts, thereby hindering a quantitative evaluation of the results. To address this challenge, we use a generative model to effectively constrain the solution of a physics-based approach. Our approach is self-training that can iteratively learn the nonlinear mapping from partial projections to the scanned object. Because our approach combines the data likelihood and image prior terms into a single deep network, it is computationally tractable and improves performance through an end-to-end training. We also complement our approach with total-variation regularization to handle high-frequency noise in reconstructions and implement a solver based on alternating direction method of multipliers. We present numerical results for various degrees of missing angle range and noise levels, which demonstrate the effectiveness of the proposed approach.

47 OTHER INSTRUMENTATION↗
NASA NTRS2001

Development of an Unstructured Mesh Code for Flows About Complete Vehicles

This report describes the research work undertaken at the Massachusetts Institute of Technology, under NASA Research Grant NAG4-157. The aim of this research is to identify effective algorithms and methodologies for the efficient and routine solution of flow simulations about complete vehicle configurations. For over ten years we have received support from NASA to develop unstructured mesh methods for Computational Fluid Dynamics. As a result of this effort a methodology based on the use of unstructured adapted meshes of tetrahedra and finite volume flow solvers has been developed. A number of gridding algorithms, flow solvers, and adaptive strategies have been proposed. The most successful algorithms developed from the basis of the unstructured mesh system FELISA. The FELISA system has been extensively for the analysis of transonic and hypersonic flows about complete vehicle configurations. The system is highly automatic and allows for the routine aerodynamic analysis of complex configurations starting from CAD data. The code has been parallelized and utilizes efficient solution algorithms. For hypersonic flows, a version of the code which incorporates real gas effects, has been produced. The FELISA system is also a component of the STARS aeroservoelastic system developed at NASA Dryden. One of the latest developments before the start of this grant was to extend the system to include viscous effects. This required the development of viscous generators, capable of generating the anisotropic grids required to represent boundary layers, and viscous flow solvers. We show some sample hypersonic viscous computations using the developed viscous generators and solvers. Although this initial results were encouraging it became apparent that in order to develop a fully functional capability for viscous flows, several advances in solution accuracy, robustness and efficiency were required. In this grant we set out to investigate some novel methodologies that could lead to the required improvements. In particular we focused on two fronts: (1) finite element methods and (2) iterative algebraic multigrid solution techniques.

Peraire, Jaime↗
NASA NTRSDate not supplied

Flow Characterization of the NASA Langley Unitary Plan Wind Tunnel, Test Section 2: Computational Results

This is an abstract for an invited paper at the AIAA Aviation Conference, June 2021. The work described here is part of an effort of coordinated experiments in the Unitary Plan Wind Tunnel (UPWT) facility at the NASA Langley Research Center (LaRC) and matching CFD simulations. The primary goal of the work is to assess the productivity and true predictive accuracy of CFD, absent any guidance from experiment, in the high supersonic speed range as compared to experiments performed at the NASA LaRC’s UPWT facility. This report concerns CFD simulation of the primary flow-path in the empty wind tunnel, including the settling chamber, nozzle, test section, and some of the tunnel downstream of the test section. The Mach number in the test section ranges from M~2.4 to M~4.6, and the required area ratio variation is achieved by translation of a nozzle block which constricts the area of a loosely S-shaped throat. Flow past protuberances in the settling chamber and into this S-bend throat are predicted by CFD to generate streamwise vorticity that may, or may not, persist through the throat and into the test section as coherent vortices. Some flow conditions are notably unsteady at frequencies well below those of turbulence, due to unsteady separated flow ahead of the nozzle block. The bulk flow moves at velocities ranging from 'walking speed' in the settling chamber to M~4.6 in the test section. Heat transfer to the settling chamber walls and buoyancy are significant at high Mach number. Subtle variations in surface curvature in the nozzle generate Mach waves that propagate into the test section. CFD of the empty tunnel serves two purposes. Firstly, the full-tunnel simulations are used to provide upstream boundary conditions for CFD of vehicle aerodynamics which are generally performed in a domain confined to the wind tunnel test section; these companion studies are addressed in other papers. Secondly, it is a challenging test for CFD to resolve all of the empty tunnel flow phenomena relevant to flow in the test section. It requires a more complete definition of geometry than was originally anticipated. In addition, it requires good spatial and temporal accuracy, and turbulence modeling that performs well on specific phenomena such as corner flows. The boundary conditions and solution algorithms must perform well from incompressible to almost hypersonic speeds. The final state of the pre-test CFD was a product of an iterative self-improvement process. The initial simulations of the empty tunnel were deficient in many respects, but hints to those deficiencies were recognized in the solutions, and remedies were implemented. Possible further improvements will be studied in the post-test phase when comparisons with experimental data are possible. The CFD was performed by five separate collaborative teams using four different flow solvers: FUN3D, Overflow, Star-CCM+ and USM3D. The level of effort of these teams varied significantly, but each made important contributions to the goals of the work. A concerted effort to use uncertainty quantification methods (UQ) in CFD is also a goal of this work. To this end, variations in CFD results due to grid refinement, turbulence modeling, and boundary conditions have been characterized. Code-to-code variation is another means of assessing CFD uncertainty. All CFD solvers predict similarity among the primary flow features; these include the variation of Mach number due to changes in Reynolds number, and the bulk flow angularity due to tunnel-wall curvature. All CFD solvers also predict similar trends in secondary flows, such as the downwash in the side-wall boundary layers. Three of the high-spatial resolution simulations give similar predictions of a complex secondary flow phenomena, streamwise vortices generated in the S-bend throat that persist into the side-wall boundary layers of the test section. Two of the highest-resolution simulations, run with the same turbulence model in different CFD solvers, gave encouragingly similar predictions of a complex tertiary flow phenomenon, small transient "sprites" of upwash flows, resulting from vortices that presumably originate in the separated flow near the leading edge of the nozzle block. While the CFD was done in a "blind pre-test" mode, requests from the experimental team for CFD results pertaining to unsteadiness and total temperature variations in the test section resulted in CFD runs that included a cooled wall in settling chamber. This then led to a change in the standard practice for running the Overflow results, which would not have occurred without this "release" of this experimental information. CFD was also used to guide some measurements. The paper will focus on establishing the consensus among CFD results and understanding differences among those results. Initial findings from the efforts to characterize CFD uncertainty have been done and will be included in the paper.

Robert Edward Childs↗
DOE OSTI2024

Enhancing predictive capabilities in fusion burning plasmas through surrogate-based optimization in core transport solvers

Abstract This work presents the PORTALS framework (Rodriguez-Fernandez et al 2022 Nucl. Fusion 62 076036), which leverages surrogate modeling and optimization techniques to enable the prediction of core plasma profiles and performance with nonlinear gyrokinetic simulations at significantly reduced cost, with no loss of accuracy. The efficiency of PORTALS is benchmarked against standard methods, and its full potential is demonstrated on a unique, simultaneous 5-channel (electron temperature, ion temperature, electron density, impurity density and angular rotation) prediction of steady-state profiles in a DIII-D ITER Similar Shape plasma with GPU-accelerated, nonlinear CGYRO (Candy et al 2016 J. Comput. Phys. 324 73–93). This paper also provides general guidelines for accurate performance predictions in burning plasmas and the impact of transport modeling in fusion pilot plants studies.

Physics↗
DOE OSTI2024

An Iterative Approach for Solving the SCOPF Problem Applying LP, SOCP, and NLP Subproblems

We propose to develop efficient algorithms and software for the SCOPF problem. We will employ an iterative approach that will: a) use linear subproblems and other active set filtering techniques to identify the most important contingencies and drastically reduce the SCOPF model size; b) solve SOCP relaxations of the reduced SCOPF to converge to the neighborhood of the global optimal solution and establish a lower bound on the solution, and; c) use a non-convex, nonlinear interior-point solver, Artelys Knitro, to converge quickly to the optimal solution. To identify the most effective approach, we will experiment with several techniques to identify the tradeoffs between contingency subproblem complexity and fast solvability.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗