Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative refinement”

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

Advanced Newton methods for geodynamical models of Stokes flow with viscoplastic rheologies

Strain localization and resulting plasticity and failure play an important role in the evolution of the lithosphere. These phenomena are commonly modeled by Stokes flows with viscoplastic rheologies. The nonlinearities of these rheologies make the numerical solution of the resulting systems challenging, and iterative methods often converge slowly or not at all. Yet accurate solutions are critical for representing the physics. Moreover, for some rheology laws, aspects of solvability are still unknown. We study a basic but representative viscoplastic rheology law. The law involves a yield stress that is independent of the dynamic pressure, referred to as von Mises yield criterion. Two commonly used variants, perfect/ideal and composite viscoplasticity, are compared. We derive both variants from energy minimization principles, and we use this perspective to argue when solutions are unique. We propose a new stress-velocity Newton solution algorithm that treats the stress as an independent variable during the Newton linearization but requires solution only of Stokes systems that are of the usual velocity-pressure form. To study different solution algorithms, we implement 2-D and 3-D finite element discretizations, and we generate Stokes problems with up to 7 orders of magnitude viscosity contrasts, in which compression or tension results in significant nonlinear localization effects. Comparing the performance of the proposed Newton method with the standard Newton method and the Picard fixed-point method, we observe a significant reduction in the number of iterations and improved stability with respect to problem nonlinearity, mesh refinement, and the polynomial order of the discretization.

Rudi, Johann↗

Robust Refinement as Implemented in TOPAS

A robust refinement procedure is implemented in the program TOPAS through an iterative reweighting of the data. Examples are given of the procedure as applied to fitting partially overlapped peaks by full and partial models and also of the structures of ibuprofen and acetaminophen in the presence of unmodeled impurity contributions

36 MATERIALS SCIENCE↗

Dynamics and Adaptive Control for Stability Recovery of Damaged Aircraft

This paper presents a recent study of a damaged generic transport model as part of a NASA research project to investigate adaptive control methods for stability recovery of damaged aircraft operating in off-nominal flight conditions under damage and or failures. Aerodynamic modeling of damage effects is performed using an aerodynamic code to assess changes in the stability and control derivatives of a generic transport aircraft. Certain types of damage such as damage to one of the wings or horizontal stabilizers can cause the aircraft to become asymmetric, thus resulting in a coupling between the longitudinal and lateral motions. Flight dynamics for a general asymmetric aircraft is derived to account for changes in the center of gravity that can compromise the stability of the damaged aircraft. An iterative trim analysis for the translational motion is developed to refine the trim procedure by accounting for the effects of the control surface deflection. A hybrid direct-indirect neural network, adaptive flight control is proposed as an adaptive law for stabilizing the rotational motion of the damaged aircraft. The indirect adaptation is designed to estimate the plant dynamics of the damaged aircraft in conjunction with the direct adaptation that computes the control augmentation. Two approaches are presented 1) an adaptive law derived from the Lyapunov stability theory to ensure that the signals are bounded, and 2) a recursive least-square method for parameter identification. A hardware-in-the-loop simulation is conducted and demonstrates the effectiveness of the direct neural network adaptive flight control in the stability recovery of the damaged aircraft. A preliminary simulation of the hybrid adaptive flight control has been performed and initial data have shown the effectiveness of the proposed hybrid approach. Future work will include further investigations and high-fidelity simulations of the proposed hybrid adaptive Bight control approach.

Nguyen, Nhan↗

An adaptive discontinuous Petrov-Galerkin method for the Grad-Shafranov equation

In this work, we propose and develop an arbitrary-order adaptive discontinuous Petrov--Galerkin (DPG) method for the nonlinear Grad--Shafranov equation. An ultraweak formulation of the DPG scheme for the equation is given based on a minimal residual method. The DPG scheme has the advantage of providing more accurate gradients compared to conventional finite element methods, which is desired for numerical solutions to the Grad--Shafranov equation. The numerical scheme is augmented with an adaptive mesh refinement approach, and a criterion based on the residual norm in the minimal residual method is developed to achieve dynamic refinement. Nonlinear solvers for the resulting system are explored and a Picard iteration with Anderson acceleration is found to be efficient to solve the system. Finally, the proposed algorithm is implemented in parallel on MFEM using a domain-decomposition approach, and our implementation is general, supporting arbitrary order of accuracy and general meshes. Furthermore, numerical results are presented to demonstrate the efficiency and accuracy of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

A refined methodology for stress inversions of earthquake focal mechanisms: Refined Stress Inversion Methodology

We develop an improved methodology for reliable high-resolution inversions of focal mechanisms to background stress field orientation and stress ratio R in two or three dimensions. The earthquake catalog is declustered to remove events likely affected strongly by local stress interactions rather than reflecting the large-scale background stress field. The declustered data are discretized with the k-means algorithm into groups containing a number of focal mechanisms between a minimum number N min and 2N min . Synthetic tests indicate that N min ≈ 30 provides stable inversion results under different stress regimes and noise conditions when R ≈ 0.5, while N min ≈ 45 is needed for R near 0 or 1. Additional synthetic tests compare the performance of selecting the fault plane of each focal mechanism using (a) the plane with lowest misfit angle between the slip vector from the focal mechanism and shear traction from the stress tensor and (b) the plane with highest instability coefficient representing proximity to the optimally oriented fault for given stress field and friction coefficient. The instability criterion is found to provide more accurate inversion results under all tested stress regimes, stress ratios, and noise conditions. The refined inversion methodology combines selecting fault planes using the instability criterion iteratively with a damped simultaneous inversion of different focal mechanism groups. Results characterizing neighborhoods of discretized domains merged during the damped inversion provide high-resolution information independent of the discretization. Some aspects of the methodology are illustrated with focal mechanism data from the San Jacinto Fault Zone in Southern California.

58 GEOSCIENCES↗

Advancing the STS Neutron Moderator Design with an Automated Optimization Workflow and Unstructured Mesh Modeling

With the Second Target Station approaching its final design phase, a detailed neutronics evaluation of its critical components is necessary. Optimizing the dimensions of the two cold-source moderators that are at the heart of this facility presents a multi-objective optimization problem for which an accurate geometric description is crucial. We have applied a fully automated optimization workflow in which a detailed unstructured mesh geometry is automatically generated with Attila4MC, starting from a parametrized CREO geometry followed by preprocessing with SpaceClaim. With this geometry, a MCNP run is performed to calculate the brightness metrics, which are subsequently provided to the optimization algorithm in DAKOTA that provides new parameters and drives the optimization loop until convergence. In this paper, we show the results of the analysis that are used for the final design of the cylindrical and tube moderator. The optimization simulations provide a refinement to and confirmation of the conclusions of the previous design iteration. Additional to the optimization, a sensitivity study is performed to study the effect of minor geometry changes, which is important for the final engineering design. In conclusion, with these studies, we demonstrate that the automated workflow and high-fidelity unstructured mesh modeling are efficient tools for a thorough design evaluation.

DAKOTA↗

Learning with Adaptive Conservativeness for Distributionally Robust Optimization: Incentive Design for Voltage Regulation

Information asymmetry between the Distribution System Operator (DSO) and Distributed Energy Resource Aggregators (DERAs) obstructs designing effective incentives for voltage regulation. To capture this effect, we employ a Stackelberg game-theoretic framework, where the DSO seeks to overcome the information asymmetry and refine its incentive strategies by learning from DERA behavior over multiple iterations. We introduce a model-based online learning algorithm for the DSO, aimed at inferring the relationship between incentives and DERA responses. Given the uncertain nature of these responses, we also propose a distributionally robust incentive design model to control the probability of voltage regulation failure and then reformulate it into a convex problem. This model allows the DSO to periodically revise distribution assumptions on uncertain parameters in the decision model of the DERA. Finally, we present a gradient-based method that permits the DSO to adaptively modify its conservativeness level, measured by the size of a Wasserstein metric-based ambiguity set, according to historical voltage regulation performance. The effectiveness of our proposed method is demonstrated through numerical experiments.

adaptation models↗

Integrating Theory and Practice: Applying the Quality Improvement Paradigm to Product Line Engineering

My assertion is that not only are product lines a relevant research topic, but that the tools used by empirical software engineering researchers can address observed practical problems. Our experience at NASA has been there are often externally proposed solutions available, but that we have had difficulties applying them in our particular context. We have also focused on return on investment issues when evaluating product lines, and while these are important, one can not attain objective data on success or failure until several applications from a product family have been deployed. The use of the Quality Improvement Paradigm (QIP) can address these issues: (1) Planning an adoption path from an organization's current state to a product line approach; (2) Constructing a development process to fit the organization's adoption path; (3) Evaluation of product line development processes as the project is being developed. The QIP consists of the following six steps: (1) Characterize the project and its environment; (2) Set quantifiable goals for successful project performance; (3) Choose the appropriate process models, supporting methods, and tools for the project; (4) Execute the process, analyze interim results, and provide real-time feedback for corrective action; (5) Analyze the results of completed projects and recommend improvements; and (6) Package the lessons learned as updated and refined process models. A figure shows the QIP in detail. The iterative nature of the QIP supports an incremental development approach to product lines, and the project learning and feedback provide the necessary early evaluations.

Stark, Michael↗

Attributes from NMIS Time Coincidence, Fast-Neutron Imaging, Fission Mapping, And Gamma-Ray Spectrometry Data

This work tests a systematic procedure for analyzing data acquired by the Nuclear Materials Identification System (NMIS) at Oak Ridge National Laboratory with fast-neutron imaging and high-purity germanium (HPGe) gamma spectrometry capabilities. NMIS has been under development by the US Department of Energy Office of Nuclear Verification since the mid-1990s, and prior to that by the National Nuclear Security Administration Y-12 National Security Complex, with NMIS having been used at Y-12 for template matching to confirm inventory and receipts. In this present work, a complete set of NMIS time coincidence, fast-neutron imaging, fission mapping, and HPGe gamma-ray spectrometry data was obtained from Monte Carlo simulations for a configuration of fissile and nonfissile materials. The data were then presented for analysis to someone who had no prior knowledge of the unknown object to accurately determine the description of the object by applying the previously mentioned procedure to the simulated data. The best approximation indicated that the unknown object was composed of concentric cylinders: a void inside highly enriched uranium (HEU) (84.7 {+-} 1.9 wt % 235 U), surrounded by depleted uranium, surrounded by polyethylene. The final estimation of the unknown object had the correct materials and geometry, with error in the radius estimates of material regions varying from 1.58% at best and 4.25% at worst; error in the height estimates varied from 2% to 12%. The error in the HEU enrichment estimate was 5.9 wt % (within 2.5Σ of the true value). The accuracies of the determinations could be adequate for arms control applications. Future work will apply this iterative reconstructive procedure to other unknown objects to further test and refine it.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Learning with Adaptive Conservativeness for Distributionally Robust Optimization: Incentive Design for Voltage Regulation: Preprint

Information asymmetry between the Distribution System Operator (DSO) and Distributed Energy Resource Aggregators (DERAs) obstructs designing effective incentives for voltage regulation. To capture this effect, we employ a Stackelberg game-theoretic framework, where the DSO seeks to overcome the information asymmetry and refine its incentive strategies by learning from DERA behavior over multiple iterations. We introduce a model-based online learning algorithm for the DSO, aimed at inferring the relationship between incentives and DERA responses. Given the uncertain nature of these responses, we also propose a distributionally robust incentive design model to control the probability of voltage regulation failure and then reformulate it into a convex problem. This model allows the DSO to periodically revise distribution assumptions on uncertain parameters in the decision model of the DERA. Finally, we present a gradient-based method that permits the DSO to adaptively modify its conservativeness level, measured by the size of a Wasserstein metric-based ambiguity set, according to historical voltage regulation performance. The effectiveness of our proposed method is demonstrated through numerical experiments.

distribution system operator↗

Standalone Hazard Evaluation and Refinement From Instrument Findings (S.H.E.R.I.F)

SHERIF is a novel algorithm which defines a unique, non-iterative method for the combination of LiDAR scans into a Digital Elevation Map (DEM) and the simultaneous evaluation of that DEM for Safe Site Selection (SSL) and Hazard Detection (HD). This creates a sensor independent method for a spacecraft conducting Entry Descent and Landing (EDL) operations to synthesize terrain scans and generate a more complete and evolving understanding of the landing site topography as well as the associated hazards. SHERIF aims to increase safety and mission success probability by more effectively using the data from a single sensor to increase situational awareness, knowledge of the landing site and its hazards, as well as informing a more streamlined transition from Terrain Relative Navigation (TRN) to Hazard Relative Navigation (HRN) during descent.

Hazard Detection↗

Space-Time Block Preconditioning for Incompressible Flow

Parallel-in-time methods have become increasingly popular in the simulation of time-dependent numerical PDEs, allowing for the efficient use of additional message passing interface processes when spatial parallelism saturates. Most methods treat the solution and parallelism in space and time separately. In contrast, all-at-once methods solve the full space-time system directly, largely treating time as simply another spatial dimension. All-at-once methods offer a number of benefits over separate treatment of space and time, most notably significantly increased parallelism and faster time to solution (when applicable). However, the development of fast, scalable all-at-once methods has largely been limited to time-dependent (advection-)diffusion problems. This paper introduces the concept of space-time block preconditioning for the all-at-once solution of incompressible flow. By extending well-known concepts of spatial block preconditioning to the space-time setting, we develop a block preconditioner whose application requires the solution of a space-time (advection-)diffusion equation in the velocity block, coupled with a pressure Schur complement approximation consisting of independent spatial solves at each time-step, and a space-time matrix-vector multiplication. The new method is tested on four classical models in incompressible flow. Finally, the results indicate perfect scalability in refinement of spatial and temporal mesh spacing, perfect scalability in nonlinear Picard iteration count when applied to a nonlinear Navier--Stokes problem, and minimal overhead in terms of number of preconditioner applications compared with sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Kepler Equation solver

Kepler's Equation is solved over the entire range of elliptic motion by a fifth-order refinement of the solution of a cubic equation. This method is not iterative, and requires only four transcendental function evaluations: a square root, a cube root, and two trigonometric functions. The maximum relative error of the algorithm is less than one part in 10(exp 18), exceeding the capability of double-precision computer arithmetic. Roundoff errors in double-precision implementation of the algorithm are addressed, and procedures to avoid them are developed.

Markley, F. Landis↗

Advanced Free Flight Planner and Dispatcher's Workstation: Preliminary Design Specification

The National Aeronautics and Space Administration (NASA) has implemented the Advanced Air Transportation Technology (AATT) program to investigate future improvements to the national and international air traffic management systems. This research, as part of the AATT program, developed preliminary design requirements for an advanced Airline Operations Control (AOC) dispatcher's workstation, with emphasis on flight planning. This design will support the implementation of an experimental workstation in NASA laboratories that would emulate AOC dispatch operations. The work developed an airline flight plan data base and specified requirements for: a computer tool for generation and evaluation of free flight, user preferred trajectories (UPT); the kernel of an advanced flight planning system to be incorporated into the UPT-generation tool; and an AOC workstation to house the UPT-generation tool and to provide a real-time testing environment. A prototype for the advanced flight plan optimization kernel was developed and demonstrated. The flight planner uses dynamic programming to search a four-dimensional wind and temperature grid to identify the optimal route, altitude and speed for successive segments of a flight. An iterative process is employed in which a series of trajectories are successively refined until the LTPT is identified. The flight planner is designed to function in the current operational environment as well as in free flight. The free flight environment would enable greater flexibility in UPT selection based on alleviation of current procedural constraints. The prototype also takes advantage of advanced computer processing capabilities to implement more powerful optimization routines than would be possible with older computer systems.

Wilson, J.↗

Defining Gas Turbine Engine Performance Requirements for the Large Civil TiltRotor (LCTR2)

Defining specific engine requirements is a critical part of identifying technologies and operational models for potential future rotary wing vehicles. NASA's Fundamental Aeronautics Program, Subsonic Rotary Wing Project has identified the Large Civil TiltRotor (LCTR) as the configuration to best meet technology goals. This notional vehicle concept has evolved with more clearly defined mission and operational requirements to the LCTR-iteration 2 (LCTR2). This paper reports on efforts to further review and refine the LCTR2 analyses to ascertain specific engine requirements and propulsion sizing criteria. The baseline mission and other design or operational requirements are reviewed. Analysis tools are described to help understand their interactions and underlying assumptions. Various design and operational conditions are presented and explained for their contribution to defining operational and engine requirements. These identified engine requirements are discussed to suggest which are most critical to the engine sizing and operation. The most-critical engine requirements are compared to in-house NASA engine simulations to try to ascertain which operational requirements define engine requirements versus points within the available engine operational capability. Finally, results are summarized with suggestions for future efforts to improve analysis capabilities, and better define and refine mission and operational requirements.

Snyder, Christopher A.↗

The NASA JSC Hypervelocity Impact Technology (HVIT) Office

- HVIT’s operational objectives for NASA, commercial, and international partners are to 1) help to define MMOD risk requirements 2) provide assessments that identify risk drivers for a specific spacecraft design, and 3) work to design and optimize shielding technologies based on increasing performance and reducing mass. - The use of Bumper-code underpins all risk assessments provided by HVIT – by using a complete FEM model, Bumper can provide a wholistic view of risk for a given design and mission profile. - A full risk assessment, however, requires an iterative approach, where Bumper is first used to identify potential risk drivers. Subsequent analysis can focus on iterating the shield design in highest risk areas. And may include the refinement of BLEs through testing, design modification, or reexamination of the failure criteria. - HVIT utilizes a wide-range of expertise to provide the most accurate risk assessments possible – areas of active research are highlighted below.

hypervelocity impact↗

Domain decomposition methods in computational fluid dynamics

The divide-and-conquer paradigm of iterative domain decomposition, or substructuring, has become a practical tool in computational fluid dynamic applications because of its flexibility in accommodating adaptive refinement through locally uniform (or quasi-uniform) grids, its ability to exploit multiple discretizations of the operator equations, and the modular pathway it provides towards parallelism. These features are illustrated on the classic model problem of flow over a backstep using Newton's method as the nonlinear iteration. Multiple discretizations (second-order in the operator and first-order in the preconditioner) and locally uniform mesh refinement pay dividends separately, and they can be combined synergistically. Sample performance results are included from an Intel iPSC/860 hypercube implementation.

Gropp, William D.↗

Domain decomposition methods in computational fluid dynamics

The divide-and-conquer paradigm of iterative domain decomposition, or substructuring, has become a practical tool in computational fluid dynamic applications because of its flexibility in accommodating adaptive refinement through locally uniform (or quasi-uniform) grids, its ability to exploit multiple discretizations of the operator equations, and the modular pathway it provides towards parallelism. These features are illustrated on the classic model problem of flow over a backstep using Newton's method as the nonlinear iteration. Multiple discretizations (second-order in the operator and first-order in the preconditioner) and locally uniform mesh refinement pay dividends separately, and they can be combined synergistically. Sample performance results are included from an Intel iPSC/860 hypercube implementation.

Gropp, William D.↗