Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative methods”

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 1,387 records · Page 77
All sourcesNASA NTRSDOE OSTI
NASA NTRS2023

NASA Kennedy Space Center Swamp Works: Innovation Methods for Advanced Research & Technology Development

Kennedy Space Center’s (KSC) Swamp Works, provides government and commercial space ventures with the technologies required for working and living on the surfaces of the Moon or other planets and bodies in our solar system. The Swamp Works team establishes agile, innovative and cost effective exploration mission solutions through leveraging of partnerships across NASA, industry and academia. Concepts start small and build up efficiently, with lean development processes and a hands on approach. Testing is performed in early stages to drive design improvements and progressively increase Technology Readiness Levels (TRL). Swamp Works provides concepts, architecture studies and trades, designs, data, technology development, technology demonstration hardware, flight hardware, testing, flight support and knowledge in support of the development of surface systems. This paper will summarize the state of the art in innovation methods, and it will compare the various other methods to how innovation is accomplished at the NASA KSC Swamp Works. Since 2013, Swamp Works has developed a wide variety of technologies, and has demonstrated viable methods for innovation while also collaborating with other government agencies, industry and academia to support space exploration. These methods focus on agile design, test, build iterations where each cycle of prototyping results in improved knowledge and designs. Failures are tole rated in the early stages of these iterations, since the overall development cycle is shorter more efficient and cost effective by retiring risk early in the cycle. Momentum is maintained and the development teams remain highly motivated by the high level of team work, technical excellence, engagement and creative freedom.

Robotic Mining↗
DOE OSTI2024

Development of a Practical Secondary Control for Hardware Microgrids

Practical, vendor-agnostic interoperability guidelines for the secondary control architecture of microgrids (MGs) with multiple grid-forming (GFM) inverter-based resources (IBRs) have not yet been developed. Therefore, this paper proposes a generic and vendor-agnostic secondary control architecture that operates with all GFM IBRs and synchronous generators. This secondary control does not require the use of additional measurement devices in the MG and utilizes the inherent communication systems of the GFM units, such as Modbus TCP/IP. The practical challenges of Modbus registers, such as packet loss and quantization error, and their detrimental impacts on secondary control actions are investigated. The proposed three-stage modification for any secondary control architecture to mitigate these impacts includes: 1) averaging the data read, 2) situational event-triggering of the controller, and 3) finite iteration of the controlling action. The proposed method is validated using a three-phase electric power, 480 V, 60 Hz, 500 kVA laboratory hardware microgrid with commercial two GFM IBRs and one diesel generator. The experimental results corroborates the fact the proposed modification in the secondary control architecture is advantageous for practical usage under erroneous measurements.

grid-forming inverter↗
DOE OSTI2024

Development of a Practical Secondary Control for Hardware Microgrids: Preprint

Practical vendor-agnostic interoperability guidelines for the secondary control architecture of microgrids (MGs) with multiple grid-forming (GFM) inverter-based resources (IBRs) have not yet been developed. Therefore, this paper proposes a generic and vendor-agnostic secondary control architecture that works with all GFM IBRs and synchronous generators. This secondary control does not need to employ any additional measurement devices in the MG and uses the inherent communication systems of the GFM units, such as Modbus TCP/IP. The practical challenges of Modbus holding registers such as packet loss, quantization error, etc. and their deteriorating impacts on the secondary control action are investigated. The proposed three-stage modification of any secondary control architecture to eliminate these impacts includes 1) averaging the data read, 2) situational event-triggering of the controller, and 3) the finite iteration of the controlling action. The proposed method is validated using a laboratory hardware MG with commercial GFM units.

inverter based resources↗
NASA NTRS1993

Nested Krylov methods and preserving the orthogonality

Recently the GMRESR inner-outer iteraction scheme for the solution of linear systems of equations was proposed by Van der Vorst and Vuik. Similar methods have been proposed by Axelsson and Vassilevski and Saad (FGMRES). The outer iteration is GCR, which minimizes the residual over a given set of direction vectors. The inner iteration is GMRES, which at each step computes a new direction vector by approximately solving the residual equation. However, the optimality of the approximation over the space of outer search directions is ignored in the inner GMRES iteration. This leads to suboptimal corrections to the solution in the outer iteration, as components of the outer iteration directions may reenter in the inner iteration process. Therefore we propose to preserve the orthogonality relations of GCR in the inner GMRES iteration. This gives optimal corrections; however, it involves working with a singular, non-symmetric operator. We will discuss some important properties, and we will show by experiments that, in terms of matrix vector products, this modification (almost) always leads to better convergence. However, because we do more orthogonalizations, it does not always give an improved performance in CPU-time. Furthermore, we will discuss efficient implementations as well as the truncation possibilities of the outer GCR process. The experimental results indicate that for such methods it is advantageous to preserve the orthogonality in the inner iteration. Of course we can also use iteration schemes other than GMRES as the inner method; methods with short recurrences like GICGSTAB are of interest.

Desturler, Eric↗
NASA NTRS1978

Comparative study of the convergence rates of two numerical techniques

The paper examines the applicability of the three-step Stetter (1968) method to the problem of hypersonic viscous flow over a blunt axisymmetric body used for planetary entry probes at zero angle of attack. The flow-field results using the two-step finite-difference MacCormack (1969) method are reported by Kumar and Graves (1977). Only the computational efficiency of Stetter's method is compared with that of MacCormack's in terms of the iterative time steps and computing time required for the steady-state solution. Advantages of Stetter's method over MacCormack's are established.

Kumar, A.↗
DOE OSTI2021

Iterative Linearization for Phasor-Defined Optimal Power Dispatch

Optimal power flow (OPF) problems, which dispatch power targets to controllable generating units across a network, must generally account for non-convex constraints on power flow. Furthermore, adapting those problems so as to make them solvable with convex optimization techniques is an area of much academic and operational interest. In this paper, we present a method for solving OPF as a quadratic program by iteratively refining and re-initializing a linearized model of power flow based on the outputs of an associated nonlinear solver. The linear model on which we demonstrate this method is an adapted version of an approximation designed for use with unbalanced distribution networks. As an important benefit, the model allows for the explicit inclusion of nodal voltage phasor values in both the OPF problem's objective and its constraints, which opens the door to the idea of phasor-based control (PBC) design. We show in simulations on the IEEE 13-node test feeder that our method quickly converges to a set of phasor targets that are sufficiently precise for use in operations at the distribution level.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Novel SOLPS-ITER simulations of X-point target and snowflake divertors

Abstract The design and understanding of alternative divertor configurations may be crucial for achieving acceptable steady-state heat and particle material loads for magnetic confinement fusion reactors. Multiple X-point alternative divertor geometries such as snowflakes and X-point targets have great potential in reducing power loads, but have not yet been simulated widely in codes with kinetic neutrals. This paper discusses recent changes made to the SOLPS-ITER code to allow for the simulation of X-point target and low-field side snowflake divertor geometries. Snowflake simulations using this method are presented, in addition to the first SOLPS-ITER simulation of the X-point target. Analysis of these results show reasonable consistency with the simple modelling and theoretical predictions, supporting the validity of the methodology implemented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

A time-parallel method for scalable heat transfer simulations of additive manufacturing

Here, a major challenge in simulating the thermal behavior in additive manufacturing processes is the disparate length and time scales between transport phenomena occurring in the melt pool and the component. A common simulation approach relies on spatial decomposition for parallel computing, but due to the nature of heat transfer in AM, where most of the computational expenditure is localized near the melt pool, the computational speedup from spatial parallelization saturates quickly. Therefore, additional parallelism by means of time-domain decomposition is needed to fully take advantage of high-performance computing (HPC) resources. This work introduces a time-parallel method to improve the computational scalability of additive manufacturing simulations on HPC systems, while maintaining high temporal resolution of heat transfer near the melt pool. The method, inspired by the nonlinear paraexp formalism, performs an iterative superposition of nonlinear solutions to the initial value problem, integrating the heat equation across overlapping time-parallel intervals. For a single layer of the NIST AMB2018–01 L7 benchmark problem, the method achieves a 38.51x speedup in wall-clock time with a maximum error in the global temperature solution of 0.99%. This reduces the total solution time from 196.72 min to 5.11 min on 128 nodes of the ORNL Frontier supercomputer. The tradeoff between accuracy and total wall-clock time is investigated and recommendations for time-parallel deployment for AM problems are made.

Additive manufacturing↗
DOE OSTI2022

Compressed basis GMRES on high-performance graphics processing units

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in current computer architectures, motivating the investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures). This article leverages Ginkgo’s memory accessor in order to integrate a communication-reduction strategy into the (Krylov) GMRES solver that decouples the storage format (i.e., the data representation in memory) of the orthogonal basis from the arithmetic precision that is employed during the operations with that basis. Given that the execution time of the GMRES solver is largely determined by the memory accesses, the cost of the datatype transforms can be mostly hidden, resulting in the acceleration of the iterative step via a decrease in the volume of bits being retrieved from memory. Together with the special properties of the orthonormal basis (whose elements are all bounded by 1), this paves the road toward the aggressive customization of the storage format, which includes some floating-point as well as fixed-point formats with mild impact on the convergence of the iterative process. We develop a high-performance implementation of the “compressed basis GMRES” solver in the Ginkgo sparse linear algebra library using a large set of test problems from the SuiteSparse Matrix Collection. We demonstrate robustness and performance advantages on a modern NVIDIA V100 graphics processing unit (GPU) of up to 50% over the standard GMRES solver that stores all data in IEEE double-precision.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Robust and Simple ADMM Penalty Parameter Selection

We present a new method for online selection of the penalty parameter for the alternating direction method of multipliers (ADMM) algorithm. ADMM is a widely used method for solving a range of optimization problems, including those that arise in signal and image processing. In its standard form, ADMM includes a scalar hyperparameter, known as the penalty parameter, which usually has to be tuned to achieve satisfactory empirical convergence. In this work, we develop a framework for analyzing the ADMM algorithm applied to a quadratic problem as an affine fixed point iteration. Using this framework, we develop a new method for automatically tuning the penalty parameter by detecting when it has become too large or small. We analyze this and several other methods with respect to their theoretical properties, i.e., robustness to problem transformations, and empirical performance on several optimization problems. Our proposed algorithm is based on a theoretical framework with clear, explicit assumptions and approximations, is theoretically covariant/invariant to problem transformations, is simple to implement, and exhibits competitive empirical performance.

42 ENGINEERING↗
NASA NTRS1990

Analysis of energy states in modulation doped multiquantum well heterostructures

A precise and effective numerical procedure to model the band diagram of modulation doped multiquantum well heterostructures is presented. This method is based on a self-consistent iterative solution of the Schroedinger equation and the Poisson equation. It can be used rather easily in any arbitrary modulation-doped structure. In addition to confined energy subbands, the unconfined states can be calculated as well. Examples on realistic device structures are given to demonstrate capabilities of this procedure. The numerical results are in good agreement with experiments. With the aid of this method the transitions involving both the confined and unconfined conduction subbands in a modulation doped AlGaAs/GaAs superlattice, and in a strained layer InGaAs/GaAs superlattice are identified. These results represent the first observation of unconfined transitions in modulation doped multiquantum well structures.

Ji, G.↗
DOE OSTI2020

Nonlinear Elimination Applied to Radiation Diffusion

We apply a nonlinearly preconditioned, quasi-Newton framework to accelerate the numerical solution of the thermal radiative transfer (TRT) equations. This framework was inspired by the unpublished method that has existed for years in Teton, Lawrence Livermore National Laboratory’s deterministic TRT code. In this paper, we cast this iteration scheme within a formal nonlinear preconditioning framework and compare its performance against other iteration schemes in the framework. With proper choices of iteration controls for the various levels of the solver, we can recover the standard linearized one-step method, a full nonlinear Newton scheme, as well as the method in Teton. In brief, the nonlinear preconditioning TRT scheme formally eliminates the material temperature equation from the nonlinear system in a nonlinear analog of a Schur complement. This nonlinear elimination step involves solving a decoupled nonlinear equation for each spatial degree of freedom and is therefore inexpensive. By applying a quasi-Newton iteration scheme on the new system, we obtain a three-level iteration scheme that is at least as efficient as commonly used TRT schemes. The new method allows full convergence to the nonlinear backward Euler time-discretized system, increasing accuracy and robustness, while using a similar number of linear iterations as the more common linearized one-step methods Eq. (4).

77 NANOSCIENCE AND NANOTECHNOLOGY↗
NASA NTRS1980

Temperature retrievals from TIROS-N

A nonstatistical, nonlinear iterative scheme, has been developed, based on the methods of Chahine (1970), to retrieve surface temperature, vertical temperature profile and cloud distribution from TIROS-N HIRS 2/MSU observations. Fundamental to the technique is the ability to accurately calculate clear column radiances given atmospheric and surface characteristics. The cloud filtering algorithm, making simultaneous use of IR 15 micron channels and microwave channels, allows accurate infrared retrievals in the presence of up to 80 percent cloud cover. Details for the iterative scheme are presented together with preliminary results from analysis of TIROS-N data.

Susskind, J.↗
DOE OSTI2022

A Prospective Design Method for Nuclear Power: The Evaluation, Requirements, and Goals Outline for Nuclear (ERGON) Method

Human factors researchers at Idaho National Laboratory (INL) have worked on projects spanning control room modernization, operator support systems, visualization design, and novel system creation. These projects demonstrated the need for an explicit design method for nuclear power. Human factors teams found a high standard in the Human Factors Engineering Program Review Model (NUREG-0711) and needed a design methodology which could be successful in gaining approval. Previous work has been synthesized as the Evaluation, Requirements, and Goals Outline for Nuclear (ERGON) method here. Design tasks are broken into four phases: Context and Orientation, Human Factors Review, Prototyping and Evaluation, Iteration and Improvement. ERGON is intended as a flexible and direct design method for many applications in nuclear power. ERGON has been vetted through collaborative research and development with nuclear utilities and as such, the ERGON method can assist utilities to achieve approval from a NUREG-0711 summative evaluation for HSI implementations.

42 ENGINEERING↗
NASA NTRS1999

Ames Optimized TCA Configuration

Configuration design at Ames was carried out with the SYN87-SB (single block) Euler code using a 193 x 49 x 65 C-H grid. The Euler solver is coupled to the constrained (NPSOL) and the unconstrained (QNMDIF) optimization packages. Since the single block grid is able to model only wing-body configurations, the nacelle/diverter effects were included in the optimization process by SYN87's option to superimpose the nacelle/diverter interference pressures on the wing. These interference pressures were calculated using the AIRPLANE code. AIRPLANE is an Euler solver that uses a unstructured tetrahedral mesh and is capable of computations about arbitrary complete configurations. In addition, the buoyancy effects of the nacelle/diverters were also included in the design process by imposing the pressure field obtained during the design process onto the triangulated surfaces of the nacelle/diverter mesh generated by AIRPLANE. The interference pressures and nacelle buoyancy effects are added to the final forces after each flow field calculation. Full details of the (recently enhanced) ghost nacelle capability are given in a related talk. The pseudo nacelle corrections were greatly improved during this design cycle. During the Ref H and Cycle 1 design activities, the nacelles were only translated and pitched. In the cycle 2 design effort the nacelles can translate vertically, and pitch to accommodate the changes in the lower surface geometry. The diverter heights (between their leading and trailing edges) were modified during design as the shape of the lower wing changed, with the drag of the diverter changing accordingly. Both adjoint and finite difference gradients were used during optimization. The adjoint-based gradients were found to give good direction in the design space for configurations near the starting point, but as the design approached a minimum, the finite difference gradients were found to be more accurate. Use of finite difference gradients was limited by the CPU time limit available on the Cray machines. A typical optimization run using finite difference gradients can use only 30 to 40 design variables and one optimization iteration within the 8 hour queue limit for the chosen grid size and convergence level. The efficiency afforded by the adjoint method allowed for 50-120 design variables and 5-10 optimization iterations in the 8 hour queue. Geometric perturbations to the wing and fuselage were made using the Hicks/Henne (HH) shape functions. The HH functions were distributed uniformly along the chords of the wing defining sections and lofted linearly. During single-surface design, constraints on thickness and volume at selected wing stations were imposed. Both fuselage camber and cross-sectional area distributions were permitted to change during design. The major disadvantage to the use of these functions is the inherent surface waviness produced by repeated use of such functions. Many smoothing operations were required following optimization runs to produce a configuration with reasonable smoothness. Wagner functions were also used on the wing sections but were never used on the fuselage. The Wagner functions are a family of increasingly oscillatory functions that have also been used extensively in airfoil design. The leading and trailing edge regions of the wing were designed by use of polynomial and monomial functions respectively. Twist was attempted but was abandoned because of little performance improvement available from changing the baseline twist.

Cliff, Susan E.↗
NASA NTRS2019

Streamlined Convergence Acceleration for CFD Codes

Enigma, a simplified interface to the PETSc library, is shown to enable the rapid solution of discrete partial differential equations. Two CFD codes, LAURA and HyperSolve, use Enigma to compute steady solutions of the Navier-Stokes equations. Using PETSc, Enigma is shown to provide a Jacobian-Free Newton-Krylov method (JFNK), globalized with pseudotransient continuation, that improves efficiency over the point-implicit relaxation method traditionally used by LAURA. It is shown that iterative error has a large impact on surface heat transfer predicted by LAURA on an axisymmetric sphere-cone geometry. Also, the convergence rate of HyperSolve simulating subsonic flow over a delta wing geometry with the JFNK method is shown to be more efficient than employing a defect correction method as the nonlinear solver.

Thompson, Kyle B.↗
NASA NTRS1989

Effects of nonlinear aerodynamics and static aeroelasticity on mission performance calculations for a fighter aircraft

During conceptual design studies of advanced aircraft, the usual practice is to use linear theory to calculate the aerodynamic characteristics of candidate rigid (nonflexible) geometric external shapes. Recent developments and improvements in computational methods, especially computational fluid dynamics (CFD), provide significantly improved capability to generate detailed analysis data for the use of all disciplines involved in the evaluation of a proposed aircraft design. A multidisciplinary application of such analysis methods to calculate the effects of nonlinear aerodynamics and static aeroelasticity on the mission performance of a fighter aircraft concept is described. The aircraft configuration selected for study was defined in a previous study using linear aerodynamics and rigid geometry. The results from the previous study are used as a basis of comparison for the data generated herein. Aerodynamic characteristics are calculated using two different nonlinear theories, potential flow and rotational (Euler) flow. The aerodynamic calculations are performed in an iterative procedure with an equivalent plate structural analysis method to obtain lift and drag data for a flexible (nonrigid) aircraft. These static aeroelastic data are then used in calculating the combat and mission performance characteristics of the aircraft.

Giles, Gary L.↗
DOE OSTI2023

Iterative multi-task learning and inference from seismic images

Seismic interpretation aims to extract quantitative and interpretable attributes from a seismic image produced using some migration method to inform characteristics of a subsurface reservoir or target of interest. Current paradigms for computing seismic attributes mostly rely on single-task algorithms. We develop an iterative, multi-task machine learning method to learn and infer multiple attributes from a seismic image. This method is composed of two stages: a multi-task inference stage and a multi-modal, multi-task refinement stage. The basic mechanism of this method is that we train a multi-task inference neural network (NN) to estimate a set of attributes, including a relative geological time (RGT), a denoised higher-resolution (DHR) seismic image, and multiple fault attributes (including probability, dip, and strike), from a low-resolution, noisy seismic image; then we input the inferred attributes to a multi-task refinement NN to enhance the raw inference results iteratively. The two multi-task NNs are trained separately based on synthetic seismic images and associated attributes generated by a geological modeling algorithm. The software we intend to release is a PyTorch implementation of this multi-task learning method for both 2D and 3D cases along with scripts to run the training/validation. The algorithm and software can be a useful tool for automatic seismic interpretation.

Gao, Kai↗