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 37 records · Page 2

Grid generation for time dependent problems: Criteria and methods

The problem of generating local mesh refinements when solving time dependent partial differential equations was examined. The problem of creating an appropriate grid, given a mesh function h defined over the spatial domain is discussed. A data structure which permits efficient use of the resulting grid is described. A good choice for h is an estimate of the local truncation error, and several ways to estimate it are discussed. The efficiency and implementation problems of these error estimates were compared.

Berger, M.↗

A dynamically bi-orthogonal method for time-dependent stochastic partial differential equations I: Derivation and algorithms

We propose a dynamically bi-orthogonal method (DyBO) to solve time dependent stochastic partial differential equations (SPDEs). The objective of our method is to exploit some intrinsic sparse structure in the stochastic solution by constructing the sparsest representation of the stochastic solution via a bi-orthogonal basis. It is well-known that the Karhunen–Loeve expansion (KLE) minimizes the total mean squared error and gives the sparsest representation of stochastic solutions. However, the computation of the KL expansion could be quite expensive since we need to form a covariance matrix and solve a large-scale eigenvalue problem. The main contribution of this paper is that we derive an equivalent system that governs the evolution of the spatial and stochastic basis in the KL expansion. Unlike other reduced model methods, our method constructs the reduced basis on-the-fly without the need to form the covariance matrix or to compute its eigendecomposition. In the first part of our paper, we introduce the derivation of the dynamically bi-orthogonal formulation for SPDEs, discuss several theoretical issues, such as the dynamic bi-orthogonality preservation and some preliminary error analysis of the DyBO method. We also give some numerical implementation details of the DyBO methods, including the representation of stochastic basis and techniques to deal with eigenvalue crossing. In the second part of our paper [11], we will present an adaptive strategy to dynamically remove or add modes, perform a detailed complexity analysis, and discuss various generalizations of this approach. An extensive range of numerical experiments will be provided in both parts to demonstrate the effectiveness of the DyBO method.

97 MATHEMATICS AND COMPUTING↗

Three Dimensional Simulations of Multiphase Flows Using a Lattice Boltzmann Method Suitable for High Density Ratios - 12126

Multiphase flows involving gas and liquid phases can be observed in engineering operations at various Department of Energy sites, such as mixing of slurries using pulsed-air mixers and hydrogen gas generation in liquid waste tanks etc. The dynamics of the gas phase in the liquid domain play an important role in the mixing effectiveness of the pulsed-air mixers or in the level of gas pressure build-up in waste tanks. To understand such effects, computational fluid dynamics methods (CFD) can be utilized by developing a three-dimensional computerized multiphase flow model that can predict accurately the behavior of gas motion inside liquid-filled tanks by solving the governing mathematical equations that represent the physics of the phenomena. In this paper, such a CFD method, lattice Boltzmann method (LBM), is presented that can model multiphase flows accurately and efficiently. LBM is favored over traditional Navier-Stokes based computational models since interfacial forces are handled more effectively in LBM. The LBM is easier to program, more efficient to solve on parallel computers, and has the ability to capture the interface between different fluid phases intrinsically. The LBM used in this paper can solve for the incompressible and viscous flow field in three dimensions, while at the same time, solve the Cahn-Hillard equation to track the position of the gas-liquid interface specifically when the density and viscosity ratios between the two fluids are high. This feature is of primary importance since the previous LBM models proposed for multiphase flows become unstable when the density ratio is larger than 10. The ability to provide stable and accurate simulations at large density ratios becomes important when the simulation case involves fluids such as air and water with a density ratio around 1000 that are common to many engineering problems. In order to demonstrate the capability of the 3D LBM method at high density ratios, a static bubble simulation is conducted to solve for the pressure difference between the inside and outside of a gas bubble in a liquid domain. Once the results show that the method is in agreement with the Laplace law, buoyant bubble simulations are conducted. The initial results obtained for bubble shape during the rising process was found to be in agreement with the theoretical expectations. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

ReEDS Performance Improvement

The Regional Energy Deployment System (ReEDS) is an open-source, spatially explicit, long-term capacity expansion model for the bulk electric power system of the contiguous United States, encompassing multiple scenarios with technological and political assumptions (see https://github.com/NREL/ReEDS-2.0). With the increased needs for capabilities, higher temporal and spatial resolutions to model the evolution of the power system with modern technologies and low-carbon pathways, ReEDS' model solution times have increased significantly from 4-6 hours in 2018 to 18-48+ hours in 2023 . Also, the model size for commonly-run ReEDS scenarios reached 22 and 28 million equations and variables, respectively. These runtimes can be especially challenging under certain scenario settings (e.g., very high temporal or spatial resolution) or with limited computational power. In this presentation, we will discuss several methods we used to improve model runtime, including data preparation, model modification, and solver tuning. The implementation of these methods shrank the model size to 7.2 and 7.3 million equations and variables, respectively. Furthermore, this led to a 77% reduction in the model's run time for commonly-run ReEDS scenarios. We will discuss the process of identifying areas for solve time improvements and how the specific enhancements for the ReEDS model might be applied to other similar large-scale models.

ENERGY PLANNING, POLICY, AND ECONOMY,MATHEMATICS A↗

Optimal, centralized dynamic curbside parking space zoning

In this paper we formulate a dynamic mixed integer program for optimally zoning curbside parking spaces subject to transportation policy-inspired constraints and regularization terms. First, we illustrate how given some objective of curb zoning valuation as a function of zone type (paid parking, bus stop, etc.), dynamically rezoning involves unrolling this optimization program over a fixed time horizon. Second, we implement two different solution methods given an example curb zoning valuation. In the first method, we solve long horizon dynamic zoning problems via approximate dynamic programming. In the second method, we employ Dantzig-Wolfe decomposition to break-up the mixed-integer program into a master problem and several sub-problems that can be solved in parallel. This speeds up the computational solve-time of the MIP considerably. We present simulation results and comparisons of the different employed techniques on vehicle arrival-rate data obtained for a neighborhood in downtown Seattle, Washington, USA.

Nazir, Mohammad Nawaf↗

A solution of Mx(double dot) + Cx(dot) + Kx = 0 applicable to the design of active dampers

A solution is presented for the equations of motion for the damped linear oscillator, Mx(double dot) + Cx(dot) + Kx = 0. The algorithm solves a transformed set of equations in terms of the modal variables of the undamped system and, at the same time, solves the adjoint equation of the transformed problem. The adjoint solution is normalized to give the inverse of the solution matrix of the transformed problem. The normalized inverse is useful in design for direct computation of sensitivity derivatives of damping ratios with respect to damping rates. The algorithm is programmed to reduce storage requirements by a factor of three-fourths compared to standard complex eigenvalue subroutines. A numerical example is included.

Thurston, G. A.↗

Effective Control of Computationally Simulated Wing Rock in Subsonic Flow

The unsteady compressible, full Navier-Stokes (NS) equations and the Euler equations of rigid-body dynamics are sequentially solved to simulate the delta wing rock phenomenon. The NS equations are solved time accurately, using the implicit, upwind, Roe flux-difference splitting, finite-volume scheme. The rigid-body dynamics equations are solved using a four-stage Runge-Kutta scheme. Once the wing reaches the limit-cycle response, an active control model using a mass injection system is applied from the wing surface to suppress the limit-cycle oscillation. The active control model is based on state feedback and the control law is established using pole placement techniques. The control law is based on the feedback of two states: the roll-angle and roll velocity. The primary model of the computational applications consists of a 80 deg swept, sharp edged, delta wing at 30 deg angle of attack in a freestream of Mach number 0.1 and Reynolds number of 0.4 x 10(exp 6). With a limit-cycle roll amplitude of 41.1 deg, the control model is applied, and the results show that within one and one half cycles of oscillation, the wing roll amplitude and velocity are brought to zero.

Kandil, Osama A.↗

MPACT Subgroup Self-Shielding Efficiency Improvements

Recent developments to improve the efficiency of the MOC solvers in MPACT have yielded effective kernels that loop over several energy groups at once, rather that looping over one group at a time. These kernels have produced roughly a 2x speedup on the MOC sweeping time during eigenvalue calculation. However, the self-shielding subgroup calculation had not been reevaluated to take advantage of these new kernels, which typically requires substantial solve time. The improvements covered in this report start by integrating the multigroup kernel concepts into the subgroup calculation, which are then used as the basis for further extensions. The next improvement that is covered is what is currently being termed as “Lumped Parameter MOC”. Because the subgroup calculation is a purely fixed source problem and multiple sweeps are performed only to update the boundary angular fluxes, the sweep procedure can be condensed to allow for the instantaneous propagation of the flux across a spatial domain, without the need to sweep along all segments in a ray. Once the boundary angular fluxes are considered to be converged, an additional sweep that will tally the scalar flux is completed. The last improvement that is investigated is the possible reduction of the number of azimuthal angles per octant in the shielding sweep. Typically 16 azimuthal angles per octant are used for self-shielding and eigenvalue calculations, but it is possible that the self-shielding sweeps are less sensitive to the number of angles than the full eigenvalue calculation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Optimized FPGA Implementation of Multi-Rate FIR Filters Through Thread Decomposition

Multi-rate finite impulse response (MRFIR) filters are among the essential signal-processing components in spaceborne instruments where finite impulse response filters are often used to minimize nonlinear group delay and finite precision effects. Cascaded (multistage) designs of MRFIR filters are further used for large rate change ratio in order to lower the required throughput, while simultaneously achieving comparable or better performance than single-stage designs. Traditional representation and implementation of MRFIR employ polyphase decomposition of the original filter structure, whose main purpose is to compute only the needed output at the lowest possible sampling rate. In this innovation, an alternative representation and implementation technique called TD-MRFIR (Thread Decomposition MRFIR) is presented. The basic idea is to decompose MRFIR into output computational threads, in contrast to a structural decomposition of the original filter as done in the polyphase decomposition. A naive implementation of a decimation filter consisting of a full FIR followed by a downsampling stage is very inefficient, as most of the computations performed by the FIR state are discarded through downsampling. In fact, only 1/M of the total computations are useful (M being the decimation factor). Polyphase decomposition provides an alternative view of decimation filters, where the downsampling occurs before the FIR stage, and the outputs are viewed as the sum of M sub-filters with length of N/M taps. Although this approach leads to more efficient filter designs, in general the implementation is not straightforward if the numbers of multipliers need to be minimized. In TD-MRFIR, each thread represents an instance of the finite convolution required to produce a single output of the MRFIR. The filter is thus viewed as a finite collection of concurrent threads. Each of the threads completes when a convolution result (filter output value) is computed, and activated when the first input of the convolution becomes available. Thus, the new threads get spawned at exactly the rate of N/M, where N is the total number of taps, and M is the decimation factor. Existing threads retire at the same rate of N/M. The implementation of an MRFIR is thus transformed into a problem to statically schedule the minimum number of multipliers such that all threads can be completed on time. Solving the static scheduling problem is rather straightforward if one examines the Thread Decomposition Diagram, which is a table-like diagram that has rows representing computation threads and columns representing time. The control logic of the MRFIR can be implemented using simple counters. Instead of decomposing MRFIRs into subfilters as suggested by polyphase decomposition, the thread decomposition diagrams transform the problem into a familiar one of static scheduling, which can be easily solved as the input rate is constant.

Kobayashi, Kayla N.↗

Optimal Droop Setting for Congestion Reduction in a 100% Grid-Forming Inverter-based Power System

he high penetration of inverter-based resources (IBRs) introduces new challenges to power systems due to the complex inverter control. However, IBRs can be configured to maximize their benefits to improve system resilience and reliability. This paper proposes a steady-state optimization model that aims to mitigate transmission congestion in a 100% grid- forming (GFM) IBR-based power system. This goal is achieved by determining the optimal droop settings for the GFM IBRs under different congestion conditions due to renewable energy and load variations. The numerical solution is rigorously verified by a high-fidelity model of the IEEE 39-bus test system with detailed GFM IBR control in the time-domain electromagnetic transient (EMT) simulation tool PSCAD. The numerical solution and simulation results show a significant congestion reduction while meeting all other operating requirements. It is also observed that the numerical solving time is substantially less compared to the EMT simulation time.

Nguyen, Quan H.↗

Deterministic direct aperture optimization using multiphase piecewise constant segmentation

Purpose Direct aperture optimization (DAO) attempts to incorporate machine constraints in the inverse optimization to eliminate the post‐processing steps in fluence map optimization (FMO) that degrade plan quality. Current commercial DAO methods utilize a stochastic or greedy approach to search a small aperture solution space. In this study, we propose a novel deterministic direct aperture optimization that integrates the segmentation of fluence map in the optimization problem using the multiphase piecewise constant Mumford‐Shah formulation. Methods The Mumford‐Shah based direct aperture optimization problem was formulated to include an L2‐norm dose fidelity term to penalize differences between the projected dose and the prescribed dose, an anisotropic total variation term to promote piecewise continuity in the fluence maps, and the multiphase piecewise constant Mumford‐Shah function to partition the fluence into pairwise discrete segments. A proximal‐class, first‐order primal‐dual solver was implemented to solve the large scale optimization problem, and an alternating module strategy was implemented to update fluence and delivery segments. Three patients of varying complexity—one glioblastoma multiforme (GBM) patient, one lung (LNG) patient, and one bilateral head and neck (H&N) patient with 3 PTVs—were selected to test the new DAO method. For each patient, 20 non‐coplanar beams were first selected using column generation, followed by the Mumford‐Shah based DAO (DAO MS ). For comparison, a popular and successful approach to DAO known as simulated annealing—a stochastic approach—was replicated. The simulated annealing DAO (DAO SA ) plans were then created using the same beam angles and maximum number of segments per beam. PTV coverage, PTV homogeneity , and OAR sparing were assessed for each plan. In addition, high dose spillage, defined as the 50% isodose volume divided by the tumor volume, as well as conformity, defined as the van't Riet conformation number, were evaluated. Results DAO MS achieved essentially the same OAR doses compared with the DAO SA plans for the GBM case. The average difference of OAR D max and D mean between the two plans were within 0.05% of the plan prescription dose. The lung case showed slightly improved critical structure sparing using the DAO MS approach, where the average OAR D max and D mean were reduced by 3.67% and 1.08%, respectively, of the prescription dose. The DAO MS plan substantially improved OAR dose sparing for the H&N patient, where the average OAR D max and D mean were reduced by over 10% of the prescription dose. The DAO MS and DAO SA plans were comparable for the GBM and LNG PTV coverage, while the DAO MS plan substantially improved the H&N PTV coverage, increasing D99 by 6.98% of the prescription dose. For the GBM and LNG patients, the DAO MS and DAO SA plans had comparable high dose spillage but slightly worse conformity with the DAO MS approach. For the H&N plan, DAO MS was considerably superior in high dose spillage and conformity to the DAO SA . The deterministic approach is able to solve the DAO problem substantially faster than the simulated annealing approach, with a 9.5‐ to 40‐fold decrease in total solve time, depending on the patient case. Conclusions A novel deterministic direct aperture optimization formulation was developed and evaluated. It combines fluence map optimization and the multiphase piecewise constant Mumford‐Shah segmentation into a unified framework, and the resulting optimization problem can be solved efficiently. Compared to the widely and commercially used simulated annealing DAO approach, it showed comparable dosimetry behavior for simple plans, and substantially improved OAR sparing, PTV coverage, PTV homogeneity, high dose spillage, and conformity for the more complex head and neck plan.

Nguyen, Dan↗

TSS-Thermal Synthesizer System

Thermal Synthesizer System (TSS) is integrated set of thermal-analysis application programs designed to solve problems encountered by thermal engineers. Combines functionality of Systems Improved Numerical Differencing Analyzer/Fluid Integrator (SINDA/FLUINT) and radiation analysis with friendly and easily understood user-interface environment coupled with powerful interactive color graphics and geometric modeling capability. Enables thermal engineers to spend more time solving engineering problems instead of laboriously constructing and verifying math models. Written in FORTRAN and C language.

Chimenti, Edward↗

A NUMERICAL SCHEME FOR SPECIAL RELATIVISTIC RADIATION MAGNETOHYDRODYNAMICS BASED ON SOLVING THE TIME-DEPENDENT RADIATIVE TRANSFER EQUATION

We develop a numerical scheme for solving the equations of fully special relativistic, radiation magnetohydrodynamics (MHDs), in which the frequency-integrated, time-dependent radiation transfer equation is solved to calculate the specific intensity. The radiation energy density, the radiation flux, and the radiation stress tensor are obtained by the angular quadrature of the intensity. In the present method, conservation of total mass, momentum, and energy of the radiation magnetofluids is guaranteed. We treat not only the isotropic scattering but also the Thomson scattering. The numerical method of MHDs is the same as that of our previous work. The advection terms are explicitly solved, and the source terms, which describe the gas–radiation interaction, are implicitly integrated. Our code is suitable for massive parallel computing. We present that our code shows reasonable results in some numerical tests for propagating radiation and radiation hydrodynamics. Particularly, the correct solution is given even in the optically very thin or moderately thin regimes, and the special relativistic effects are nicely reproduced.

79 ASTRONOMY AND ASTROPHYSICS↗

Investigation of post-injection strategies for diesel engine Catalyst Heating Operation using a vapor-liquid-equilibrium-based spray model

Most multidimensional engine simulations spend much time solving for non-equilibrium spray dynamics (atomization, collision, vaporization). However, their accuracy is limited by significant grid dependency, and the need for extensive calibration. This is critical for modeling cold-start diesel fuel post injections, which occur at low temperatures and pressures, far from typical model validation ranges. At the same time, resolving micron-scale spray phenomena would render full Eulerian multiphase calculations prohibitive. In this study, an improved phase equilibrium based approach was implemented and assessed for simulating diesel catalyst heating operation strategies. A phase equilibrium solver based on the model by Yue and Reitz [1] was implemented: a fully multiphase CFD solver is employed with an engineering-size engine grid, and fuel injection is modeled using the standard Lagrangian parcels approach. Mass and energy from the liquid parcels are released to the Eulerian multiphase mixture according to an equilibrium-based liquid jet model. An improved phase equilibrium solver was developed to handle large real-gas mixtures such as those from accurate chemical kinetics mechanisms. The liquid-jet model was improved such that momentum transfer to the Eulerian solver better reproduces the physical spray jet structure. Validation of liquid/vapor penetration predictions showed that the model yields accurate results with very limited tuning and low sensitivity to the few calibration constants. In-cylinder simulations of diesel catalyst heating operation strategies showed that capturing spray structure is paramount when short, transient injection pulses and low temperatures are present. Furthermore, the EP model provides improved predictions of post-injection spray structure and ignitability, while conventional spray modeling does not capture the increase of liquid penetration during the expansion stroke. Finally, the only important EP model calibration constant, Cliq, does not affect momentum transfer, but it changes the local charge cooling distribution through the local energy transfer, which makes it candidate to additional research. The results confirm that non-equilibrium spray processes do not need to be resolved in engineering simulations of high-pressure diesel sprays.

42 ENGINEERING↗

Initial conditions of inhomogeneous universe and the cosmological constant problem

Deriving the Einstein field equations (EFE) with matter fluid from the action principle is not straightforward, because mass conservation must be added as an additional constraint to make rest-frame mass density variable in reaction to metric variation. This can be avoided by introducing a constraint 0δ(√− g ) = to metric variations δ g {sup μν}, and then the cosmological constant Λ emerges as an integration constant. This is a removal of one of the four constraints on initial conditions forced by EFE at the birth of the universe, and it may imply that EFE are unnecessarily restrictive about initial conditions. I then adopt a principle that the theory of gravity should be able to solve time evolution starting from arbitrary inhomogeneous initial conditions about spacetime and matter. The equations of gravitational fields satisfying this principle are obtained, by setting four auxiliary constraints on δ g {sup μν} to extract six degrees of freedom for gravity. The cost of achieving this is a loss of general covariance, but these equations constitute a consistent theory if they hold in the special coordinate systems that can be uniquely specified with respect to the initial space-like hypersurface when the universe was born. This theory predicts that gravity is described by EFE with non-zero Λ in a homogeneous patch of the universe created by inflation, but Λ changes continuously across different patches. Then both the smallness and coincidence problems of the cosmological constant are solved by the anthropic argument. This is just a result of inhomogeneous initial conditions, not requiring any change of the fundamental physical laws in different patches.

79 ASTRONOMY AND ASTROPHYSICS↗

Automatic Black-Box Model Order Reduction using Radial Basis Functions

Finite elements methods have long made use of model order reduction (MOR), particularly in the context of fast freqeucny sweeps. In this paper, we discuss a black-box MOR technique, applicable to a many solution methods and not restricted only to spectral responses. We also discuss automated methods for generating a reduced order model that meets a given error tolerance. Numerical examples demonstrate the effectiveness and wide applicability of the method. With the advent of improved computing hardware and numerous fast solution techniques, the field of computational electromagnetics are progressed rapidly in terms of the size and complexity of problems that can be solved. Numerous applications, however, require the solution of a problem for many different configurations, including optimization, parameter exploration, and uncertainly quantification, where the parameters that may be changed include frequency, material properties, geometric dimensions, etc. In such cases, thousands of solutions may be needed, so solve times of even a few minutes can be burdensome. Model order reduction (MOR) may alleviate this difficulty by creating a small model that can be evaluated quickly. Many MOR techniques have been applied to electromagnetic problems over the past few decades, particularly in the context of fast frequency sweeps. Recent works have extended these methods to allow more than one parameter and to allow the parameters to represent material and geometric properties. There are still limitations with these methods, however. First, they almost always assume that the finite element method is used to solve the problem, so that the system matrix is a known function of the parameters. Second, although some authors have presented adaptive methods (e.g., [2]), the order of the model is often determined before the MOR process begins, with little insight about what order is actually needed to reach the desired accuracy. Finally, it not clear how to efficiently extend most methods to the multiparameter case. This paper address the above shortcomings be developing a method that uses a block-box approach to the solution method, is adaptive, and is easily extensible to many parameters.

42 ENGINEERING↗