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 343 records · Page 19

Tempus Project (Final Report)

This final technical report tracks the accomplishments of the Tempus Project to the statement of project objectives and resulting deliverables. The objective of the Tempus project was to develop and demonstrate the capabilities of a secure, modular, and customizable time synchronization platform that provides layers of protection from GPS spoofing attacks and other vulnerabilities. These vulnerabilities present a challenge to power system operators utilizing GPS-based time synchronization, as time synchronization increasingly plays a critical role in the efficient and reliable operation of power systems. The Tempus project addressed these concerns through the development of a secure, customizable time synchronization platform. The Tempus platform applies a layered approach to time security that protects from manipulation of timing systems used by power utilities. The Tempus platform consists of a component framework utilizing modularized time sources and customizable manipulation detection algorithms. With multiple time sources, and comparisons between sources and tracking sudden or subtle changes to the timing phase and time information, the Tempus system can detect and mitigate compromised timing sources.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Theorems in Service of Sound Composition, Rapid Modeling and Scalable Analysis

This project extends the state of the art in formal verification modeling with modules and automatically checkable data-sharing patterns such that component modules can retain their assurance case when composed within a larger system. For users, smaller models make reasoning easier and help to ensure they accurately reflect text specifications. For automated methods, smaller models give exponential benefits for verification algorithm execution time.

97 MATHEMATICS AND COMPUTING↗

Ultrafast Laser Material Damage Simulation—A New Look at an Old Problem

The chirped pulse amplification technique has enabled the generation of pulses of a few femtosecond duration with peak powers multi-Tera and Peta–Watt in the near infrared. Its implementation to realize even shorter pulse duration, higher energy, and higher repetition rate laser systems relies on overcoming the limitations imposed by laser damage of critical components. In particular, the laser damage of coatings in the amplifiers and in post-compression optics have become a bottleneck. The robustness of optical coatings is typically evaluated numerically through steady-state simulations of electric field enhancement in multilayer stacks. However, this approach cannot capture crucial characteristics of femtosecond laser induced damage (LID), as it only considers the geometry of the multilayer stack and the optical properties of the materials composing the stack. This approach neglects that in the interaction of an ultrashort pulse and the materials there is plasma generation and associated material modifications. Here, we present a numerical approach to estimate the LID threshold of dielectric multilayer coatings based on strong field electronic dynamics. In this dynamic scheme, the electric field propagation, photoionization, impact ionization, and electron heating are incorporated through a finite-difference time-domain algorithm. We applied our method to simulate the LID threshold of bulk fused silica, and of multilayer dielectric mirrors and gratings. The results are then compared with experimental measurements. The salient aspects of our model, such as the implementation of the Keldysh photoionization model, the impact ionization model, the electron collision model for ‘low’-temperature, dense plasma, and the LID threshold criterion for few-cycle pulses are discussed.

36 MATERIALS SCIENCE↗

CSR Fields: Direct Numerical Solution of the Maxwell___s Equation

We discuss the properties of the coherent electromagnetic fields of a very short, ultra-relativistic bunch in a rectangular vacuum chamber inside a bending magnet. The analysis is based on the results of a direct numerical solution of Maxwell's equations together with Newton's equations. We use a new dispersion-free time-domain algorithm which employs a more efficient use of finite element mesh techniques and hence produces self-consistent and stable solutions for very short bunches. We investigate the fine structure of the CSR fields including coherent edge radiation. This approach should be useful in the study of existing and future concepts of particle accelerators and ultrafast coherent light sources. The coherent synchrotron radiation (CSR) fields have a strong action on the beam dynamics of very short bunches, which are moving in the bends of all kinds of magnetic elements. They are responsible for additional energy loss and energy spread; micro bunching and beam emittance growth. These fields may bound the efficiency of damping rings, electron-positron colliders and ultrafast coherent light sources, where high peak currents and very short bunches are envisioned. This is relevant to most high-brightness beam applications. On the other hand these fields together with transition radiation fields can be used for beam diagnostics or even as a powerful resource of THz radiation. A history of the study of CSR and a good collection of references can be found in [1]. Electromagnetic theory suggests several methods on how to calculate CSR fields. The most popular method is to use Lienard-Wiechert potentials. Other approach is to solve numerically the approximate equations, which are a Schrodinger type equation. These numerical methods are described in [2]. We suggest that a direct solution of Maxwell's equations together with Newton's equations can describe the detailed structure of the CSR fields [3].

43 PARTICLE ACCELERATORS↗

Implementation And Performance of the ATLAS Second Level Jet Trigger

ATLAS is one of the four major LHC experiments, designed to cover a wide range of physics topics. In order to cope with a rate of 40MHz and 25 interactions per bunch crossing, the ATLAS trigger system is divided in three different levels. The jet selection starts at first level with dedicated processors that search for high E{sub T} hadronic energy depositions. At the LVL2, the jet signatures are verified with the execution of a dedicated, fast jet reconstruction algorithm, followed by a calibration algorithm. Three possible granularities have been proposed and are being evaluated: cell based (standard), energy sums calculated at each Front-End Board and the use of the LVL1 Trigger Towers. In this presentation, the design and implementation of the jet trigger of ATLAS will be discussed in detail, emphasazing the major difficulties of each selection step. The performance of the jet algorithm, including timing, efficiencies and rates will also be shown, with detailed comparisons of the different unpacking modes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Framework for Network Co-Simulation

The Framework for Network Co-Simulation (FNCS) uses a federated approach to integrate simulations which may have differing time scales. Special consideration is given to integration with a communication network simulation such that inter-simulation messages may be optionally routed through and delayed by such a simulation. In addition, FNCS uses novel time synchronization algorithms to accelerate co-simulation including the application of speculative multithreading. FNCS accomplishes all of these improvements with minimal end user intervention. Simulations can be integrated using FNCS while maintaining their original model input files simply by linking with the FNCS library and making appropriate calls into the FNCS API.

Daily, Jeff↗

Lifting the Garage Door on Spawn, An Open-Source BEM-Controls Engine

Spawn is the latest whole-building energy simulation engine developed by the US Department of Energy, National Labs and industry. Whereas EnergyPlus was designed as a successor to DOE-2, Spawn is not a direct successor of–nor is it intended as an imminent replacement for– EnergyPlus. Instead, Spawn reuses parts of EnergyPlus while supporting new use cases in HVAC and controls. Spawn is intended to provide several capabilities that significantly advance beyond EnergyPlus. It is intended to support the evaluation of novel HVAC and district energy systems in a more physically realistic way. Critically, it can model control in a physically realistic way, using portable specifications that can be compiled for execution on control platforms. Spawn is also intended to support co-simulation in an intrinsic way to enable integration with third-party models. This paper describes the software architecture of Spawn from model authoring to compilation and simulation. It explains how Spawn reuses the envelope and daylighting modules of EnergyPlus and couples them to HVAC and control models from the Modelica Buildings Library using the Functional Mockup Interface (FMI) standard. It presents a number of examples that: i) validate Spawn’s coupled simulation approach by comparing its results to those of EnergyPlus, ii) illustrate the Spawn methodology for modeling and simulating HVAC systems, and iii) evaluate the performance of Spawn’s Quantized State System (QSS) time integration algorithms

Wetter, Michael↗

Multiphysics Time-Integration for Turbulent Combustion at the Exascale

Turbulent reacting flow systems are often modeled with coupled time-dependent partial differential equations (PDEs). Solving such equations can easily tax the world's largest supercomputers. One pragmatic strategy for attacking such problems is to split the PDEs into components that can more easily be solved in isolation. This generic operator-splitting strategy leads to a set of ordinary differential equations (ODEs) that need to be solved as part of an "outer-loop" time-stepping approach. In many combustion applications, the ODEs to be solved can be very stiff, exhibiting timescales that span many orders of magnitude. The SUNDIALS library provides a plethora of robust time integration algorithms for solving these ODEs on exascale-capable computing hardware, yet for many complex applications (such multicomponent fuels or emissions predictions), the chemical models remain too complex to solve using reasonable resources. The Quasi-Steady State Approximation (QSSA) can be an effective tool for reducing the size and stiffness of the simulations. In this talk, I will discuss the use of the SUDIALS library of ODE solvers together with automatic code generation tools to solve complex turbulent reacting flow problems using QSSA models.

chemistry↗

Time integration of reacting flows with CSP tabulation.

This paper presents recent progress on the use of Computational Singular Perturbation (CSP) techniques for time integration of stiff chemical systems. The CSP integration approach removes fast time scales from the reaction system, thereby enabling integration with explicit time stepping algorithms. For further efficiency improvements, a tabulation strategy was developed to allow reuse of the relevant CSP quantities. This paper outlines the method and demonstrates its use on the simulation of hydrogen-air ignition.

08 HYDROGEN↗

Multigrid methods with space–time concurrency

Here, we consider the comparison of multigrid methods for parabolic partial differential equations that allow space–time concurrency. With current trends in computer architectures leading towards systems with more, but not faster, processors, space–time concurrency is crucial for speeding up time-integration simulations. In contrast, traditional time-integration techniques impose serious limitations on parallel performance due to the sequential nature of the time-stepping approach, allowing spatial concurrency only. This paper considers the three basic options of multigrid algorithms on space–time grids that allow parallelism in space and time: coarsening in space and time, semicoarsening in the spatial dimensions, and semicoarsening in the temporal dimension. We develop parallel software and performance models to study the three methods at scales of up to 16K cores and introduce an extension of one of them for handling multistep time integration. We then discuss advantages and disadvantages of the different approaches and their benefit compared to traditional space-parallel algorithms with sequential time stepping on modern architectures.

97 MATHEMATICS AND COMPUTING↗

Real-time estimation of the electron temperature profile in DIII-D by leveraging neural-network surrogate models

Control of both the magnitude and the shape of tokamak profiles will be necessary to achieve stable, high-performance plasmas. In order to reject disturbances in real time, feedback-control algorithms rely on accurate real-time knowledge of the plasma state. When diagnostics alone are insufficient, either because they are limited in number or their measurements are too noisy, observers can be used to combine diagnostic data with a response model to provide a better estimation of different plasma properties. An observer has been developed to estimate the electron temperature profile in real time using both diagnostic data from the Thomson scattering system and a model based on the electron heat transport equation describing the evolution of the electron temperature profile. Here, neural network surrogate models are leveraged to help improve the overall model prediction while staying within computation time constraints for real-time use. The observer algorithm is shown in offline tests to produce smooth profiles that are consistent with both the diagnostic data and the electron heat transport equation. When implemented into the real-time plasma control system, this observer will provide valuable information on the electron temperature profile to many potential feedback-control applications.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Cardiac C-arm computed tomography using a 3D + time ROI reconstruction method with spatial and temporal regularization

Purpose: Reconstruction of the beating heart in 3D + time in the catheter laboratory using only the available C-arm system would improve diagnosis, guidance, device sizing, and outcome control for intracardiac interventions, e.g., electrophysiology, valvular disease treatment, structural or congenital heart disease. To obtain such a reconstruction, the patient's electrocardiogram (ECG) must be recorded during the acquisition and used in the reconstruction. In this paper, the authors present a 4D reconstruction method aiming to reconstruct the heart from a single sweep 10 s acquisition. Methods: The authors introduce the 4D RecOnstructiOn using Spatial and TEmporal Regularization (short 4D ROOSTER) method, which reconstructs all cardiac phases at once, as a 3D + time volume. The algorithm alternates between a reconstruction step based on conjugate gradient and four regularization steps: enforcing positivity, averaging along time outside a motion mask that contains the heart and vessels, 3D spatial total variation minimization, and 1D temporal total variation minimization. Results: 4D ROOSTER recovers the different temporal representations of a moving Shepp and Logan phantom, and outperforms both ECG-gated simultaneous algebraic reconstruction technique and prior image constrained compressed sensing on a clinical case. It generates 3D + time reconstructions with sharp edges which can be used, for example, to estimate the patient's left ventricular ejection fraction. Conclusions: 4D ROOSTER can be applied for human cardiac C-arm CT, and potentially in other dynamic tomography areas. It can easily be adapted to other problems as regularization is decoupled from projection and back projection.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A quasi-static particle-in-cell algorithm based on an azimuthal Fourier decomposition for highly efficient simulations of plasma-based acceleration: QPAD

The three-dimensional (3D) quasi-static particle-in-cell (PIC) algorithm is a very efficient method for modeling short-pulse laser or relativistic charged particle beam–plasma interactions. In this algorithm, the plasma response, i.e., plasma wave wake, to a non-evolving laser or particle beam is calculated using a set of Maxwell’s equations based on the quasi-static approximate equations that exclude radiation. The plasma fields are then used to advance the laser or beam forward using a large time step. The algorithm is many orders of magnitude faster than a 3D fully explicit relativistic electromagnetic PIC algorithm. It has been shown to be capable to accurately model the evolution of lasers and particle beams in a variety of scenarios. Additionally, at the same time, an algorithm in which the fields, currents and Maxwell equations are decomposed into azimuthal harmonics has been shown to reduce the algorithmic complexity of a 3D explicit PIC algorithm to that of a 2D algorithm when the expansion is truncated while maintaining accuracy for problems with near azimuthal symmetry. This hybrid algorithm uses a PIC description in r–z and a gridless description in . We describe a novel method that combines the quasi-static and hybrid PIC methods. This algorithm expands the fields, charge and current density into azimuthal harmonics. A set of the quasi-static field equations is derived for each harmonic. The complex amplitudes of the fields are then solved using the finite difference method. The beam and plasma particles are advanced in Cartesian coordinates using the total fields. Details on how this algorithm was implemented using a similar workflow to an existing quasi-static code, QuickPIC, are presented. The new code is called QPAD for QuickPIC with Azimuthal Decomposition. Benchmarks and comparisons between a fully 3D explicit PIC code (OSIRIS), a full 3D quasi-static code (QuickPIC), and the new quasi-static PIC code with azimuthal decomposition (QPAD) are also presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Parallel-in-time quantum simulation via Page and Wootters quantum time

In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here, we present quantum algorithms for parallel-in-time simulations that are inspired by the Page and Wootters formalism. In this framework, and thus in our algorithms, the classical time variable of quantum mechanics is promoted to the quantum realm by introducing a Hilbert space of “clock” qubits that are then entangled with the “system” qubits. We show that our algorithms can compute temporal properties over 𝑁 different times of many-body systems by only using log⁡(𝑁) clock qubits. As such, we achieve an exponential trade-off between time and spatial complexities. In addition, we rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning, as it encodes valuable information about the system’s dynamics. We also provide a circuit depth estimation of all the protocols, showing a running time advantage in computation times over traditional sequential-in-time algorithms. In particular, for the case when the dynamics are determined by the Aubry-Andre model, we present a hybrid method for which our algorithms have a depth that only scales as 𝒪⁡(log⁡(𝑁)⁢𝑛). As a by-product, we can relate the previous schemes to the problem of equilibration of an isolated quantum system, thus indicating that our framework enables a new dimension for studying dynamical properties of many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗