Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 361 records · Page 20

Constrained Self-adaptive Solutions Procedures for Structure Subject to High Temperature Elastic-plastic Creep Effects

This paper will develop a new solution strategy which can handle elastic-plastic-creep problems in an inherently stable manner. This is achieved by introducing a new constrained time stepping algorithm which will enable the solution of creep initiated pre/postbuckling behavior where indefinite tangent stiffnesses are encountered. Due to the generality of the scheme, both monotone and cyclic loading histories can be handled. The presentation will give a thorough overview of current solution schemes and their short comings, the development of constrained time stepping algorithms as well as illustrate the results of several numerical experiments which benchmark the new procedure.

Padovan, J.↗

Finding cycles and trees in sublinear time.

We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k {ge} 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is related to the distance of the graph from being C{sub k}-minor-free (resp., free from having the corresponding tree-minor). In particular, if the graph is far (i.e., {Omega}(1)-far) from being cycle-free, i.e. if one has to delete a constant fraction of edges to make it cycle-free, then the algorithm finds a cycle of polylogarithmic length in time {tilde O}({radical}N), where N denotes the number of vertices. This time complexity is optimal up to polylogarithmic factors. The foregoing results are the outcome of our study of the complexity of one-sided error property testing algorithms in the bounded-degree graphs model. For example, we show that cycle-freeness of N-vertex graphs can be tested with one-sided error within time complexity {tilde O}(poly(1/{epsilon}) {center_dot} {radical}N). This matches the known {Omega}({radical}N) query lower bound, and contrasts with the fact that any minor-free property admits a two-sided error tester of query complexity that only depends on the proximity parameter {epsilon}. For any constant k {ge} 3, we extend this result to testing whether the input graph has a simple cycle of length at least k. On the other hand, for any fixed tree T, we show that T -minor-freeness has a one-sided error tester of query complexity that only depends on the proximity parameter {epsilon}. Our algorithm for finding cycles in bounded-degree graphs extends to general graphs, where distances are measured with respect to the actual number of edges. Such an extension is not possible with respect to finding tree-minors in o({radical}N) complexity.

99 GENERAL AND MISCELLANEOUS↗

A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs

We describe parallel algorithms for computing maximal cardinality matching in a bipartite graph on distributed-memory systems. Unlike traditional algorithms that match one vertex at a time, our algorithms process many unmatched vertices simultaneously using a matrix-algebraic formulation of maximal matching. This generic matrix-algebraic framework is used to develop three efficient maximal matching algorithms with minimal changes. The newly developed algorithms have two benefits over existing graph-based algorithms. First, unlike existing parallel algorithms, cardinality of matching obtained by the new algorithms stays constant with increasing processor counts, which is important for predictable and reproducible performance. Second, relying on bulk-synchronous matrix operations, these algorithms expose a higher degree of parallelism on distributed-memory platforms than existing graph-based algorithms. We report high-performance implementations of three maximal matching algorithms using hybrid OpenMP-MPI and evaluate the performance of these algorithm using more than 35 real and randomly generated graphs. On real instances, our algorithms achieve up to 200 × speedup on 2048 cores of a Cray XC30 supercomputer. Even higher speedups are obtained on larger synthetically generated graphs where our algorithms show good scaling on up to 16,384 cores.

97 MATHEMATICS AND COMPUTING↗

Multiple time step integrators in ab initio molecular dynamics

Multiple time-scale algorithms exploit the natural separation of time-scales in chemical systems to greatly accelerate the efficiency of molecular dynamics simulations. Although the utility of these methods in systems where the interactions are described by empirical potentials is now well established, their application to ab initio molecular dynamics calculations has been limited by difficulties associated with splitting the ab initio potential into fast and slowly varying components. Here we present two schemes that enable efficient time-scale separation in ab initio calculations: one based on fragment decomposition and the other on range separation of the Coulomb operator in the electronic Hamiltonian. We demonstrate for both water clusters and a solvated hydroxide ion that multiple time-scale molecular dynamics allows for outer time steps of 2.5 fs, which are as large as those obtained when such schemes are applied to empirical potentials, while still allowing for bonds to be broken and reformed throughout the dynamics. This permits computational speedups of up to 4.4x, compared to standard Born-Oppenheimer ab initio molecular dynamics with a 0.5 fs time step, while maintaining the same energy conservation and accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dynamic PRA-Based Estimation of PWR Coping Time Using a Surrogate Model for Accident Tolerant Fuel

In this study, we propose an interpolation-based response surface surrogate methodology to manage a large number of scenarios in dynamic probabilistic risk assessment. It adopts the shape Dynamic Time Warping algorithm to cluster the interpolation neighborhood from time series sample data. The interpolation method was adapted from Taylor Kriging to allow a reduced-order model of the Taylor series. In order to demonstrate its applicability to complex issues in risk assessment for nuclear engineering, an example risk response surface to estimate emergency core cooling system (ECCS) criteria for triplex silicon carbide (SiC) accident-tolerant fuel was constructed. The response surface was exploited to estimate the cumulative failure probability of the fuel cladding structure due to the uncertainties in operator actions and safety systems. The functional failures were assessed based on a combination of individual layer failures computed by coupling Risk Analysis Virtual Environment software with a pressurized water reactor 1000-MW(electric) RELAP5 model and the in-house fuel performance assessment module. Results showed that SiC cladding failure probability spiked less than 1 min after a large-break loss-of- coolant accident whenever the current ECCS criteria for Zircaloy-4 (Zr-4) cladding was used. However, it still provides an increased safety margin of three orders of magnitude compared to Zr-4. This positive margin could be utilized to relax active ECCS requirements by allowing deviations of up to 450 s in its actuation time. The proposed surrogate methodology generated a response surface of SiC cladding failure probability reasonably well, with a significant savings of computation time. This methodology is expected to be useful in the analysis of system response with complex uncertainty sources.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Processing of DMSP magnetic data and its use in geomagnetic field modeling

The DMSP F-7 satellite is an operational Air Force meteorological satellite which carried a magnetometer for geophysical measurements. The magnetometer was located within the body of the spacecraft in the presence of large spacecraft fields. In addition to stray magnetic fields, the data have inherent position and time inaccuracies. Algorithms were developed to identify and remove time varying magnetic field noise from the data. Techniques developed for Magsat were then modified and used to attempt determination of the spacecraft fields, of any rotation between the magnetometer axes and the spacecraft axes, and of any scale changes within the magnetometer itself. The corrected data were then used to attempt to model the geomagnetic field. This was done in combination with data from Magsat, from the standard magnetic observatories, from aeromagnetic and other survey data, and from DE-2 spacecraft field data. Future DMSP missions can be upgraded in terms of geomagnetic measurements by upgrading the time and position information furnished with the data, placing the magnetometer at the end of the boom, upgrading the attitude determination at the magnetometer, and increasing the accuracy of the magnetometer.

Ridgway, J. R.↗

CFD analyses of combustor and nozzle flowfields

The objectives of the research are to improve design capabilities for low thrust rocket engines through understanding of the detailed mixing and combustion processes. A Computational Fluid Dynamic (CFD) technique is employed to model the flowfields within the combustor, nozzle, and near plume field. The computational modeling of the rocket engine flowfields requires the application of the complete Navier-Stokes equations, coupled with species diffusion equations. Of particular interest is a small gaseous hydrogen-oxygen thruster which is considered as a coordinated part of an ongoing experimental program at NASA LeRC. The numerical procedure is performed on both time-marching and time-accurate algorithms, using an LU approximate factorization in time, flux split upwinding differencing in space. The integrity of fuel film cooling along the wall, its effectiveness in the mixing with the core flow including unsteady large scale effects, the resultant impact on performance and the assessment of the near plume flow expansion to finite pressure altitude chamber are addressed.

Tsuei, Hsin-Hua↗

Re-evaluation of an Optimized Second Order Backward Difference (BDF2OPT) Scheme for Unsteady Flow Applications

Recent experience in the application of an optimized, second-order, backward-difference (BDF2OPT) temporal scheme is reported. The primary focus of the work is on obtaining accurate solutions of the unsteady Reynolds-averaged Navier-Stokes equations over long periods of time for aerodynamic problems of interest. The baseline flow solver under consideration uses a particular BDF2OPT temporal scheme with a dual-time-stepping algorithm for advancing the flow solutions in time. Numerical difficulties are encountered with this scheme when the flow code is run for a large number of time steps, a behavior not seen with the standard second-order, backward-difference, temporal scheme. Based on a stability analysis, slight modifications to the BDF2OPT scheme are suggested. The performance and accuracy of this modified scheme is assessed by comparing the computational results with other numerical schemes and experimental data.

Vatsa, Veer N.↗

A numerical simulation of finite-length Taylor-Couette flow

The processes leading to laminar-turbulent transition in finite-channel-length Taylor-Couette flow are investigated analytically, solving the unsteady incompressible Navier-Stokes equations by spectral-collocation methods. A time-split algorithm, implementable in both axisymmetric and fully three-dimensional time-accurate versions, and an algorithm based on the staggered-mesh discretization of Bernardi and Maday (1986) are described in detail, and results obtained by applying the axisymmetric version of the first algorithm and a steady-state version of the second are presented graphically and compared with published experimental data. The feasibility of full three-dimensional simulations of the progression through chaotic states to turbulence under the constraints of Taylor-Couette flow is demonstrated.

Streett, C. L.↗

Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation

Motivated by various applications, unbounded Hamiltonian simulation has recently garnered great attention. Quantum Magnus algorithms, designed to achieve commutator scaling for time-dependent Hamiltonian simulation, have been found to be particularly efficient for such applications. When applied to unbounded Hamiltonian simulation in the interaction picture, they exhibit an unexpected superconvergence phenomenon. However, existing proofs are limited to the spatially continuous setting and do not extend to discrete spatial discretizations. Here, in this work, we provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points N, and show that it holds with an error constant uniform in N. The proof is based on the two-parameter symbol class, which, to our knowledge, is applied for the first time in algorithm analysis. The key idea is to establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm, such that the semiclassical uniformity guarantees the uniformity of both. This approach may have broader applications in numerical analysis beyond the specific context of this work.

Borns-Weil, Yonah [University of California, Berke↗

Toward active disruption avoidance via real-time estimation of the safe operating region and disruption proximity in tokamaks

This paper describes a real-time capable algorithm for identifying the safe operating region around a tokamak operating point. The region is defined by a convex set of linear constraints, from which the distance of a point from a disruptive boundary can be calculated. The disruptivity of points is calculated from an empirical machine learning predictor that generates the likelihood of disruption. While the likelihood generated by such empirical models can be compared to a threshold to trigger a disruption mitigation system, the safe operating region calculation enables active optimization of the operating point to maintain a safe margin from disruptive boundaries. The proposed algorithm is tested using a random forest disruption predictor fit on data from DIII-D. The safe operating region identification algorithm is applied to historical data from DIII-D showing the evolution of disruptive boundaries and the potential impact of optimization of the operating point. Real-time relevant execution times are made possible by parallelizing many of the calculation steps and implementing the algorithm on a graphics processing unit. Lastly, a real-time capable algorithm for optimizing the target operating point within the identified constraints is also proposed and simulated.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A time-implicit numerical method and benchmarks for the relativistic Vlasov–Ampere equations

We present a time-implicit numerical method to solve the relativistic Vlasov–Ampere system of equations on a two dimensional phase space grid. The time-splitting algorithm we use allows the generalization of the work presented here to higher dimensions keeping the linear aspect of the resulting discrete set of equations. The implicit method is benchmarked against linear theory results for the relativistic Landau damping for which analytical expressions using the Maxwell-Jüttner distribution function are derived. We note that, independently from the shape of the distribution function, the relativistic treatment features collective behaviours that do not exist in the nonrelativistic case. The numerical study of the relativistic two-stream instability completes the set of benchmarking tests.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Software implementation of detection algorithms for the MCSA

The NASA Multichannel Spectrum Analyzer supplies data in several formats and in a wide range of frequency resolutions. To decide if an extraterrestrial signal is present, this data is searched using detection algorithms particularly sensitive to signals concentrated in frequency and/or time. The algorithms, whose ultimate sensitivities are determined by theoretical considerations, are also constrained by available computing power. At present, practical detection of repetitive pulses is possible at an average power about five times lower than that for incoherent CW detection. After a period of field testing, the best detection algorithms, presently implelmented in software, will be converted to hardware to increase their speed.

Cullers, D. K.↗

Development of a Near-Real Time Hail Damage Swath Identification Algorithm for Vegetation

The Midwest is home to one of the world's largest agricultural growing regions. Between the time period of late May through early September, and with irrigation and seasonal rainfall these crops are able to reach their full maturity. Using moderate to high resolution remote sensors, the monitoring of the vegetation can be achieved using the red and near-infrared wavelengths. These wavelengths allow for the calculation of vegetation indices, such as Normalized Difference Vegetation Index (NDVI). The vegetation growth and greenness, in this region, grows and evolves uniformly as the growing season progresses. However one of the biggest threats to Midwest vegetation during the time period is thunderstorms that bring large hail and damaging winds. Hail and wind damage to crops can be very expensive to crop growers and, damage can be spread over long swaths associated with the tracks of the damaging storms. Damage to the vegetation can be apparent in remotely sensed imagery and is visible from space after storms slightly damage the crops, allowing for changes to occur slowly over time as the crops wilt or more readily apparent if the storms strip material from the crops or destroy them completely. Previous work on identifying these hail damage swaths used manual interpretation by the way of moderate and higher resolution satellite imagery. With the development of an automated and near-real time hail swath damage identification algorithm, detection can be improved, and more damage indicators be created in a faster and more efficient way. The automated detection of hail damage swaths will examine short-term, large changes in the vegetation by differencing near-real time eight day NDVI composites and comparing them to post storm imagery from the Moderate Resolution Imaging Spectroradiometer (MODIS) aboard Terra and Aqua and Visible Infrared Imaging Radiometer Suite (VIIRS) aboard Suomi NPP. In addition land surface temperatures from these instruments will be examined as for hail damage swath identification. Initial validation of the automated algorithm is based upon Storm Prediction Center storm reports but also the National Severe Storm Laboratory (NSSL) Maximum Estimated Size Hail (MESH) product. Opportunities for future work are also shown, with focus on expansion of this algorithm with pixel-based image classification techniques for tracking surface changes as a result of severe weather.

Bell, Jordan R.↗

Hybrid algorithm for the time-dependent Hartree–Fock method using the Yang–Baxter equation on quantum computers *

Abstract The time-dependent Hartree–Fock (TDHF) method is an approach to simulate the mean field dynamics of electrons within the assumption that the electrons move independently in their self-consistent average field and within the space of single Slater determinants. One of the major advantages of performing time dynamics within Hartree–Fock theory is the free fermionic nature of the problem, which makes TDHF classically simulatable in polynomial time. Here, we present a hybrid TDHF implementation for quantum computers. This quantum circuit grows with time; but with our recent work on circuit compression via the Yang–Baxter equation (YBE), the resulting circuit is constant depth. This study provides a new way to simulate TDHF with the aid of a quantum device as well as provides a new direction for the application of YBE symmetry in quantum chemistry simulations.

97 MATHEMATICS AND COMPUTING↗

Variability in Ocean Color Associated with Phytoplankton and Terrigenous Matter: Time Series Measurements and Algorithm Development at the FRONT Site on the New England Continental Shelf

Fronts in the coastal ocean describe areas of strong horizontal gradients in both physical and biological properties associated with tidal mixing and freshwater estuarine output (e.g. Simpson, 1981 and O Donnell, 1993). Related gradients in optically important constituents mean that fronts can be observed from space as changes in ocean color as well as sea surface temperature (e.g., Dupouy et al., 1986). This research program is designed to determine which processes and optically important constituents must be considered to explain ocean color variations associated with coastal fronts on the New England continental shelf, in particular the National Ocean Partnership Program (NOPP) Front Resolving Observational Network with Telemetry (FRONT) site. This site is located at the mouth of Long Island sound and was selected after the analysis of 12 years of AVHRR data showed the region to be an area of strong frontal activity (Ullman and Cornillon, 1999). FRONT consists of a network of modem nodes that link bottom mounted Acoustic Doppler Current Profilers (ADCPs) and profiling arrays. At the center of the network is the Autonomous Vertically Profiling Plankton Observatory (AVPPO) (Thwaites et al. 1998). The AVPPO consists of buoyant sampling vehicle and a trawl-resistant bottom-mounted enclosure, which holds a winch, the vehicle (when not sampling), batteries, and controller. Three sampling systems are present on the vehicle, a video plankton recorder, a CTD with accessory sensors, and a suite of bio-optical sensors including Satlantic OCI-200 and OCR-200 spectral radiometers and a WetLabs ac-9 dual path absorption and attenuation meter. At preprogrammed times the vehicle is released, floats to the surface, and is then winched back into the enclosure with power and data connection maintained through the winch cable. Communication to shore is possible through a bottom cable and nearby surface telemetry buoy, equipped with a mobile modem, giving the capability for near-real time data transmission and interactive sampling control.

Morrison, John R.↗

Flow-induced vibration analysis of a helical coil steam generator experiment using large eddy simulation

This paper describes a numerical study of flow-induced vibration in a helical coil steam generator experiment conducted at Argonne National Laboratory in the 1980s. In the experiment, a half-scale sector model of a steam generator helical coil tube bank was subjected to still and flowing air and water, and the vibrational characteristics were recorded. The research detailed in this document utilizes the multi-physics simulation toolkit SHARP developed at Argonne National Laboratory, in cooperation with Lawrence Livermore National Laboratory, to simulate the experiment. SHARP uses the spectral element code Nek5000 for fluid dynamics analysis and the finite element code DIABLO for structural analysis. The flow around the coil tubes is modeled in Nek5000 by using a large eddy simulation turbulence model. Transient pressure data on the tube surfaces is sampled and transferred to DIABLO for the structural simulation. The structural response is simulated in DIABLO via an implicit time-marching algorithm and a combination of continuum elements and structural shells. Tube vibration data (acceleration and frequency) are sampled and compared with the experimental data. Currently, only one-way coupling is used, which means that pressure loads from the fluid simulation are transferred to the structural simulation but the resulting structural displacements are not fed back to the fluid simulation

CFD↗