Search NASA⌕ Search

SEARCH · Search NASA

Results for “solve time”

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 73 records · Page 4

Tifpack v 1.0

A package for computing and applying algebraic preconditioners in the context of preconditioned iterative methods. It is related to the existing Ifpack package in Trilinos but provides support for template scalar and ordinal types and explicitly relies on Tpetra and Kokkos instead of Epetra. Algebraic preconditioners are used by iterative solvers as solution method in engineering and scientific applications, including nonlinear equation solving, time integration, sensitivity analysis, stability analysis, optimization, and uncertainty quantification.

Heroux, Michael↗

Benders Cut Classification via Support Vector Machines for Solving Two-Stage Stochastic Programs

In this work, we consider Benders decomposition for solving two-stage stochastic programs with complete recourse based on finite samples of the uncertain parameters. We define the Benders cuts binding at the final optimal solution or the ones significantly improving bounds over iterations as valuable cuts. We propose a learning-enhanced Benders decomposition (LearnBD) algorithm, which adds a cut classification step in each iteration to selectively generate cuts that are more likely to be valuable cuts. The LearnBD algorithm includes two phases: (i) sampling cuts and collecting information from training problems and (ii) solving testing problems with a support vector machine (SVM) cut classifier. We run the LearnBD algorithm on instances of capacitated facility location and multicommodity network design under uncertain demand. Our results show that SVM cut classifier works effectively for identifying valuable cuts, and the LearnBD algorithm reduces the total solving time of all instances for different problems with various sizes and complexities.

97 MATHEMATICS AND COMPUTING↗

Advanced System Thermal Fluids Solver Development for SAM

This work summarizes a feasibility study on testing numerical algorithms that are suitable and efficient for advanced system analysis code development under the mutli-physics framework, MOOSE. The key is the implementation of a high-order one-dimensional staggered-grid finite volume method (SG-FVM), and its direct interaction with the linear/nonlinear solver, PETSc. Leveraging the existing capabilities of the SAM code, significant code coverages were established in the finite volume method code. This in turn allows for a suite of test problems with different problem sizes and levels of complexity to be used to quantify the performance improvement of the finite volume method code. As evidently shown in this study, the implemented SG-FVM demonstrated superior performance improvement against a direct finite element method implementation through MOOSE for the wide range of selected problems. On two computer systems, the speedup was observed to be significant, with at least one order of magnitude of solving time reduction. In addition, for a complex reactor model, transient simulation was performed using the finite volume method code, the results of which agree very well with the reference results from the finite element method code. Overall, this study demonstrates a successful feasibility study on the proposed numerical algorithms and software structure to support advanced system analysis tool development. In this work, short-term priority development and testing items were identified, and long-term code adoption and integration plans were made for the eventual deployment of the finite volume method in the SAM code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Full-Height Axial P 3 Solver for the 2D/1D Method in MPACT

This report encompasses the efforts to complete L3:RTM.PRT.P15.04, which relates to improvements to the axial solvers in MPACT. Over the past few years, a number of convergence issues have been encountered throughout the 2D/1D calculation. While many of these were related to transport-corrected stability, which has been much improved through the development of multigroup MOC kernels, there are still some instabilities that are more directly related to the 1D axial nodal solvers. The primary focus of this milestone is on the development of a full-height P 3 solver, which solves for a single linear system for the entire rod, compared to the one- and two-node solvers previously available in MPACT. To provide an efficient full-height solver, the SuperLU direct linear solver was leveraged and an alternative rod decomposition scheme is used in favor over the typically employed axial decomposition. In addition to the full-height solver, a number of stability observations are discussed pertaining to (1) cases with thin planes in the axial reflectors, (2) quadratic radial leakage interpolation, (3) the reset sol capability, which reinitializes the solution before continuing the calculation, and (4) the flux threshold used in the radial transverse leakage splitting logic. The last of these was improved by identifying an acceptable threshold, which greatly help provide stability to the default one-node P 3 solver approach. Results demonstrating the full-height solver are presented for (1) a single assembly case from the AP1000 reactor design, (2) VERA Progression Problem 5a, and (3) a Watts Bar Unit 1, Cycle 1 case that demonstrated convergence issues due to thin planes in the axial reflector. In total, the full-height solver appears to be 3–5× slower for the nodal solve time, yield a roughly 10–20% increase in total problem run time, and requires ~5% more memory. However, these increases may be justifiable if the solver is proven to be more stable than the current default. Additionally, the VERA Progression Problem 4a case with the 252-group library is shown for the one-node P 3 solver with the updated threshold for radial transverse leakage splitting. This case also previous failed very early in the calculation, but is now able to run to completion. Brief details are also included related to the refactoring the nodal sweeper design. Previously, all nodal sweeper options were available in one large module, which was cumbersome and difficult to extend. Before the work here began, the design was refactored to include a number of abstract and extended types, which will help make future extensions easier. All-in-all, this milestone successfully implemented a new axial solver and improved the stability of the current default axial solver. However, additional testing will be necessary on new cases that demonstrate convergence issues before a decision can be made to change the current default in MPACT.

97 MATHEMATICS AND COMPUTING↗

Navier-Stokes computations of cavity aeroacoustics with suppression devices

Effectiveness of two devices to suppress the cavity acoustics was computationally investigated. Two dimensional, computational simulations were performed for the transonic, turbulent flows past a cavity, which was first equipped with a rear face ramp and then with a spoiler. The Reynolds-averaged, unsteady, compressible, full Navier-Stokes equations were solved time accurately by a second-order accurate, implicit, upwind, finite-volume method. The effect of turbulence was included through a Baldwin-Lomax model with modifications for the multiple-wall effects and for the highly vortical flow with a shear layer. The results included instantaneous and time-averaged flow properties, and time-series analyses of the pressure inside the cavity, which compared favorably with the available experimental data. These results were also contrasted with the computed aeroacoustics of the same cavity (length-to-depth ratio of 4.5), but without a device, to demonstrate the suppression effectiveness.

Baysal, Oktay↗

Sloshing dynamics on rotating helium dewar tank

The generalized mathematical formulation of sloshing dynamics for partially filled liquid of cryogenic superfluid helium II in dewar containers driven by both the gravity gradient and jitter accelerations applicable to scientific spacecraft which is eligible to carry out spinning motion and/or slew motion for the purpose to perform scientific observation during the normal spacecraft operation are investigated. An example is given with Gravity Probe-B (GP-B) spacecraft which is responsible for the sloshing dynamics. The jitter accelerations include slew motion, spinning motion, atmospheric drag on the spacecraft, spacecraft attitude motions arising from machinery vibrations, thruster firing, pointing control of spacecraft, crew motion, etc. Explicit mathematical expressions to cover these forces acting on the spacecraft fluid systems are derived. The numerical computation of sloshing dynamics were based on the non-inertia frame spacecraft bound coordinate, and solve time dependent, three-dimensional formulations of partial differential equations subject to initial and boundary conditions. The explicit mathematical expressions of boundary conditions to cover capillary force effect on the liquid vapor interface in microgravity environments are also derived. The formulations of fluid moment and angular moment fluctuations in fluid profiles induced by the sloshing dynamics, together with fluid stress and moment fluctuations exerted on the spacecraft dewar containers were derived. Results were widely published in the open journals.

Hung, R. J.↗

Local Discontinuous Galerkin Methods for Partial Differential Equations with Higher Order Derivatives

In this paper we review the existing and develop new continuous Galerkin methods for solving time dependent partial differential equations with higher order derivatives in one and multiple space dimensions. We review local discontinuous Galerkin methods for convection diffusion equations involving second derivatives and for KdV type equations involving third derivatives. We then develop new local discontinuous Galerkin methods for the time dependent bi-harmonic type equations involving fourth derivatives, and partial differential equations involving fifth derivatives. For these new methods we present correct interface numerical fluxes and prove L(exp 2) stability for general nonlinear problems. Preliminary numerical examples are shown to illustrate these methods. Finally, we present new results on a post-processing technique, originally designed for methods with good negative-order error estimates, on the local discontinuous Galerkin methods applied to equations with higher derivatives. Numerical experiments show that this technique works as well for the new higher derivative cases, in effectively doubling the rate of convergence with negligible additional computational cost, for linear as well as some nonlinear problems, with a local uniform mesh.

Yan, Jue↗

Free Molecular Heat Transfer Programs for Setup and Dynamic Updating the Conductors in Thermal Desktop

The programs, arrays and logic structure were developed to enable the dynamic update of conductors in thermal desktop. The MatLab program FMHTPRE.m processes the Thermal Desktop conductors and sets up the arrays. The user needs to manually copy portions of the output to different input regions in Thermal Desktop. Also, Fortran subroutines are provided that perform the actual updates to the conductors. The subroutines are setup for helium gas, but the equations can be modified for other gases. The maximum number of free molecular conductors allowed is 10,000 for a given radiation task. Additional radiation tasks for FMHT can be generated to account for more conductors. Modifications to the Fortran subroutines may be warranted, when the mode of heat transfer is in the mixed or continuum mode. The FMHT Thermal Desktop model should be activated by using the "Case Set Manager" once the model is setup. Careful setup of the model is needed to avoid excessive solve times.

Malroy, Eric T.↗

Parallel Monotonic Basin Hopping for Low Thrust Trajectory Optimization

Monotonic Basin Hopping has been shown to be an effective method of solving low thrust trajectory optimization problems. This paper outlines an extension to the common serial implementation by parallelizing it over any number of available compute cores. The Parallel Monotonic Basin Hopping algorithm described herein is shown to be an effective way to more quickly locate feasible solutions, and improve locally optimal solutions in an automated way without requiring a feasible initial guess. The increased speed achieved through parallelization enables the algorithm to be applied to more complex problems that would otherwise be impractical for a serial implementation. Low thrust cislunar transfers and a hybrid Mars example case demonstrate the effectiveness of the algorithm. Finally, a preliminary scaling study quantifies the expected decrease in solve time compared to a serial implementation.,

McCarty, Steven L.↗

Parallel Monotonic Basin Hopping for Low Thrust Trajectory Optimization

Monotonic Basin Hopping has been shown to be an effective method of solving low thrust trajectory optimization problems. This paper outlines an extension to the common serial implementation by parallelizing it over any number of available compute cores. The Parallel Monotonic Basin Hopping algorithm described herein is shown to be an effective way to more quickly locate feasible solutions, and improve locally optimal solutions in an automated way without requiring a feasible initial guess. The increased speed achieved through parallelization enables the algorithm to be applied to more complex problems that would otherwise be impractical for a serial implementation. Low thrust cislunar transfers and a hybrid Mars example case demonstrate the effectiveness of the algorithm. Finally, a preliminary scaling study quantifies the expected decrease in solve time compared to a serial implementation.

McCarty, Steven L.↗

Integrated Optimization of Mars Hybrid Solar-Electric/Chemical Propulsion Trajectories

NASA’s Human Exploration and Operation Mission Directorate is developing a reusable hybrid transportation architecture in which both chemical and solar-electric propulsion systems are used to deliver crew and cargo to the Martian sphere of influence. By combining chemical and solar-electric propulsions into a single spacecraft and applying each where it is the most effective, the hybrid architecture enables a series of Mars trajectories that are more fuel efficient than an all chemical propulsion architecture without significant increase to trip time. Solving the complex problem of low-thrust trajectory optimization coupled with the vehicle sizing requires development of an integrated trajectory analysis frame- work. Previous studies have utilized a more segmented optimization framework due to the limitation of the tools available. A new integrated optimization framework was recently developed to address the deficiencies of the previous methods that enables higher fidelity analysis to be performed and increases the efficiency of large design space explorations.

Chai, Patrick R.↗

Tifpack v 1.0

A package for computing and applying algebraic preconditioners in the context of preconditioned iterative methods. It is related to the existing Ifpack package in Trilinos but provides support for template scalar and ordinal types and explicitly relies on Tpetra and Kokkos instead of Epetra. Algebraic preconditioners are used by iterative solvers as solution method in engineering and scientific applications, including nonlinear equation solving, time integration, sensitivity analysis, stability analysis, optimization, and uncertainty quantification.

Heroux, Michael↗

8760-Based Method for Representing Variable Generation Capacity Value in Capacity Expansion Models

Capacity expansion models (CEMs) are widely used to evaluate the least-cost portfolio of electricity generators, transmission, and storage needed to reliably serve load over many years or decades. CEMs can be computationally complex and are often forced to estimate key parameters using simplified methods to achieve acceptable solve times or for other reasons. In this paper, we discuss one of these parameters -- capacity value (CV). We first provide a high-level motivation for and overview of CV. We next describe existing modeling simplifications and an alternate approach for estimating CV that utilizes hourly '8760' data of load and VG resources. We then apply this 8760 method to an established CEM, the National Renewable Energy Laboratory's (NREL's) Regional Energy Deployment System (ReEDS) model (Eurek et al. 2016). While this alternative approach for CV is not itself novel, it contributes to the broader CEM community by (1) demonstrating how a simplified 8760 hourly method, which can be easily implemented in other power sector models when data is available, more accurately captures CV trends than a statistical method within the ReEDS CEM, and (2) providing a flexible modeling framework from which other 8760-based system elements (e.g., demand response, storage, and transmission) can be added to further capture important dynamic interactions, such as curtailment.

14 SOLAR ENERGY↗

8760-Based Method for Representing Variable Generation Capacity Value in Capacity Expansion Models: Preprint

Capacity expansion models (CEMs) are widely used to evaluate the least-cost portfolio of electricity generators, transmission, and storage needed to reliably serve demand over the evolution of many years or decades. Various CEM formulations are used to evaluate systems ranging in scale from states or utility service territories to national or multi-national systems. CEMs can be computationally complex, and to achieve acceptable solve times, key parameters are often estimated using simplified methods. In this paper, we focus on two of these key parameters associated with the integration of variable generation (VG) resources: capacity value and curtailment. We first discuss common modeling simplifications used in CEMs to estimate capacity value and curtailment, many of which are based on a representative subset of hours that can miss important tail events or which require assumptions about the load and resource distributions that may not match actual distributions. We then present an alternate approach that captures key elements of chronological operation over all hours of the year without the computationally intensive economic dispatch optimization typically employed within more detailed operational models. The updated methodology characterizes the (1) contribution of VG to system capacity during high load and net load hours, (2) the curtailment level of VG, and (3) the potential reductions in curtailments enabled through deployment of storage and more flexible operation of select thermal generators. We apply this alternate methodology to an existing CEM, the Regional Energy Deployment System (ReEDS). Results demonstrate that this alternate approach provides more accurate estimates of capacity value and curtailments by explicitly capturing system interactions across all hours of the year. This approach could be applied more broadly to CEMs at many different scales where hourly resource and load data is available, greatly improving the representation of challenges associate with integration of variable generation resources.

14 SOLAR ENERGY↗

Novel Solver Algorithms for Nearly Singular Linear Systems Arising in Combustion Modelling

Direct Numerical Simulations of realistic combustion devices are extremely challenging due to the wide separation of scales in the simulation, for example an internal combustion (IC) engine chamber, and the flame thickness of a high-pressure flame. The PeleLMeX solver uses adaptive mesh refinement (AMR) to evolve multi-species reacting flows in the low Mach number limit at the Exascale and relies on an embedded boundary (EB) approach to represent complex geometries. In that framework, the EB geometries often give rise to very small cut-cells along the boundary, which translate into extreme ill-conditioning of the pressure-projection, with eigenvalues that span 15-16 orders of magnitude. In this talk, we focus on the case of a typical IC piston bowl geometry for which we present on a novel approach towards solving these nearly singular linear systems with ILU-based, C-AMG smoothers on massively parallel architectures. In particular, we use scaling and equilibration algorithms to handle the non-normality of the upper triangular factors. This enables us to approximate the highly sequential triangular solve algorithm, embedded in the AMG smoothing-solve phase, with Jacobi iterations. This approximation can be written as a convergent Neumann series whose terms are composed of highly parallel sparse matrix vector multiplications. The result is an algorithm that substantially decreases setup and solve time, compared to state-of-the-art, for these challenging linear systems.

combustion modelling↗

Parallel and Highly Innovative Simulation for INL Code System

The software is capable of performing: - Solution of neutron transport equations 1) using second order spherical harmonics and hybrid finite element or 2) using discrete ordinate and continuous finite element approach (INSTANT module) - Solve Bateman equation for an arbitrary number of isotopes (MRTAU module) - Solve time dependent transport equation using the INSTANT solver for the pseudo steady state equation - Provide power feedback to the RELAP5-3D code for nuclear reactor transient analysis - Provide cross section manipulation capability (interpolation, extraction, micro to macro)

Rabiti, Cristian↗