SEARCH · Engineering Papers

Results for “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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallel-in-time methods, with the most common method, parareal, diverging in many cases. The current state of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be further researched and improved (including with a new relaxation method inspired by on Least Squares Shadowing (LSS)) and explored for more complicated problems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

The ETROC2 as the Final Version for CMS Endcap Timing Layer (ETL) Upgrade

The ETROC (Endcap Timing Readout Chip) is being developed for the LGAD-based CMS Endcap Timing Layer (ETL) at HL-LHC. The ETL on each side of the interaction region will be instrumented with a two-disk system of MIP-sensitive LGAD (Low Gain Avalanche Diodes) silicon devices, read out by ETROCs for precision timing measurement with down to ~30 ps timing resolution per track. The ETROC is designed to handle a 16 x 16 pixel cell matrix, with each pixel being 1.3 mm x 1.3 mm to match the LGAD sensor pixel size. The front-end design for preamplifier and discriminator has been specifically optimized for the reduced LGAD signals, with enough flexibilities to meet the ETL specific needs for time resolution, power budget and radiation profile. The ETROC chip is implemented in a commercial 65nm CMOS process. Each channel consists of a preamplifier, a discriminator, a TDC used for TOA (Time Of Arrival) and TOT (Time Over Threshold) measurements, and a memory for data storage and readout. An in-pixel auto threshold calibration is included, along with a self-testing pattern generator. The TOT is used for time-walk correction of the TOA measurement. The detailed hit information (TOA and TOT) from each cell will be read out from a local circular buffer after each Level-1 Accept (about 1 MHz). In addition, a charge injection circuit is implemented to allow for testing and calibration. For more detailed monitoring of the signal pulses, waveform sampling circuits are included for one pixel. The clock distribution is based on a 16x16 H-tree design with a shielding structure to alleviate potential interference. The global peripheral circuits include a PLL, a phase shifter, an I2C slave controller, a fast control block, a global readout, and a data driver along with an efuse and temperature sensor. The ETROC builds event data frames for each L1A selected event and is also capable of providing L1 trigger information for user-defined delayed hits. The main design challenge is how to extract precision timing information from the small LGAD signals in the presence of high irradiation fluence, while keeping the power consumption and digital activity low. The ETL design goal for the time resolution of 50 ps per hit is required to achieve a 35 ps arrival time measurement for a MIP particle, which has its track registered in two ETL disk layers. The LGAD contribution is known to be about 30 ps, this means that the jitter from the ETROC has to be kept below 40 ps. The ETROC2 is the first full size full functionality prototype design fully compatible with the final chip specifications for CMS ETL and now becomes the final version. The ETROC2 chips have been extensively tested. We will present here new testing results including the bump bonding yield improvement study, the time walk correction (TWC) generality study with one pixel TWC applying to all pixels, the final SEU testing using both heavy ion and proton beam, more beam test studies including different sensors, and readiness for the ETROC2 production for CMS ETL upgrade.

Liu, Tiehui [Fermilab] (ORCID:0009000765225605)↗

DOE OSTI2022

Capturing the interactions between ice sheets, sea level and the solid Earth on a range of timescales: a new “time window” algorithm

Retreat and advance of ice sheets perturb the gravitational field, solid surface and rotation of the Earth, leading to spatially variable sea-level changes over a range of timescales $\textit{O}$ (10 0–6 years), which in turn feed back onto ice-sheet dynamics. Coupled ice-sheet–sea-level models have been developed to capture the interactive processes between ice sheets, sea level and the solid Earth, but it is computationally challenging to capture short-term interactions $\textit{O}$ (10 0–2 years) precisely within longer $\textit{O}$ (10 3–6 years) simulations. The standard forward sea-level modelling algorithm assigns a uniform temporal resolution in the sea-level model, causing a quadratic increase in total CPU time with the total number of input ice history steps, which increases with either the length or temporal resolution of the simulation. In this study, we introduce a new “time window” algorithm for 1D pseudo-spectral sea-level models based on the normal mode method that enables users to define the temporal resolution at which the ice loading history is captured during different time intervals before the current simulation time. Utilizing the time window, we assign a fine temporal resolution $\textit{O}$ (10 0–2 years) for the period of ongoing and recent history of surface ice and ocean loading changes and a coarser temporal resolution $\textit{O}$ (10 3–6 years) for earlier periods in the simulation. This reduces the total CPU time and memory required per model time step while maintaining the precision of the model results. We explore the sensitivity of sea-level model results to the model temporal resolution and show how this sensitivity feeds back onto ice-sheet dynamics in coupled modelling. We apply the new algorithm to simulate sea-level changes in response to global ice-sheet evolution over two glacial cycles and the rapid collapse of marine sectors of the West Antarctic Ice Sheet in the coming centuries and provide appropriate time window profiles for each application. The time window algorithm reduces the total CPU time by ~ 50 % in each of these examples and changes the trend of the total CPU time increase from quadratic to linear. This improvement would increase with longer simulations than those considered here. Our algorithm also allows for coupling time intervals of annual temporal scale for coupled ice-sheet–sea-level modelling of regions such as West Antarctica that are characterized by rapid solid Earth response to ice changes due to the thin lithosphere and low mantle viscosities.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2023

Quantifying and Understanding the Access Time to Dockless Micromobility: A Case Study in Washington, D.C.

Micromobility has been widely deployed in many cities. Similar as how access time/distance affects the travel demand to use public transit and informs transit system design, access time/distance to micromobility service measures its service efficiency and also serves as an equity indicator to inform city agencies from a regulation perspective. Though there is an increasing need to understand it, access to micromobility has not been sufficiently studied. This paper developed a framework to quantity the access time to dockless micromobility service (i.e., the minimum time needed to walk to reach the closest dockless micromobility vehicles). Based on the real-time vehicle location data collected from Washington, DC, this research quantified the access time to dockless micromobility, analyzed its spatial and temporal variation patterns and investigated its relationship with socio-demographic variables (i.e., population density, employment density and low-income population). The results revealed that the access time to dockless micromobility ranges between 0 to 4 minutes with the most frequently observed range of 0.5 to 1 minutes, and the city center area tends to have shorter access time than the outskirts areas. Results also indicate a quite stable access time level in DC with access time standard deviation of 0.2 to 0.5 minutes. After correlating the access time at census-block-group level with socio-demographic data, it was discovered that shorter access time usually aligns with larger population and employment density, and the proportion of low-income population was found not helpful with explaining the access time variation, which indicating a relatively equitable micromobility program.

access time↗

DOE OSTI2021

Scale-Dependent Value of QPF for Real-Time Streamflow Forecasting

Incorporating rainfall forecasts into a real-time streamflow forecasting system extends the forecast lead time. Since quantitative precipitation forecasts (QPFs) are subject to substantial uncertainties, questions arise on the trade-off between the time horizon of the QPF and the accuracy of the streamflow forecasts. This study explores the problem systematically, exploring the uncertainties associated with QPFs and their hydrologic predictability. The focus is on scale dependence of the trade-off between the QPF time horizon, basin-scale, space-time scale of the QPF, and streamflow forecasting accuracy. To address this question, the study first performs a comprehensive independent evaluation of the QPFs at 140 U.S. Geological Survey (USGS) monitored basins with a wide range of spatial scales (~10 – 40,000 km 2 ) over the state of Iowa in the Midwestern United States. The study uses High-Resolution Rapid Refresh (HRRR) and Global Forecasting System (GFS) QPFs for short and medium-range forecasts, respectively. Using Multi-Radar Multi-Sensor (MRMS) quantitative precipitation estimate (QPE) as a reference, the results show that the rainfall-to-rainfall QPF errors are scale-dependent. The results from the hydrologic forecasting experiment show that both QPFs illustrate clear value for real-time streamflow forecasting at longer lead times in the short- to medium-range relative to the no-rain streamflow forecast. The value of QPFs for streamflow forecasting is particularly apparent for basin sizes below 1,000 km 2 . The space-time scale, or reference time t r ) (ratio of forecast lead time to basin travel time) ~ 1 depicts the largest streamflow forecasting skill with a systematic decrease in forecasting accuracy for t r > 1.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2021

An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers

The time integration of the granular phase in coupled computational fluid dynamics (CFD) – discrete element method (DEM) simulations presents a unique computational challenge brought about by the large variations in particle collisional time scales. Particles in the dilute regions of the computational domain can be advanced with large time steps while dense regions require much smaller time increments. However, the time step size in most solvers is globally set as the limit for accuracy and stability imposed by the collisions and is typically orders of magnitude less than that required away from collisions. This work addresses this precise issue and provides a strategy to avoid the use of a global conservative small time step size for the entire set of particles.A novel time stepping algorithm for CFD-DEM solvers using a partitioning approach using orthogonal recursive bisection (ORB) that allows for variable time steps among particles is described and its computational performance is compared against baseline explicit methods, typically used in several CFD-DEM solvers. ORB has advantages of being relatively quick and easy to update incrementally and has the required heuristic behavior (i.e., it will split the region in half with a cluster on each side) when groups of particles are well separated (clustered). The algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for subsets of particles that are present at the leaves of the ORB, thereby resulting in substantial reduction of computational cost. The parallel implementation of this method where a ``knapsack” algorithm is used in tandem with ORB for effective load-balancing is also presented, where a best possible partitioning is obtained based on number of particles and local time-stepping costs. The algorithm is tested against benchmark problems with varying particle distributions that include fluidized bed and riser flow scenarios. Preliminary results indicate that the approach is 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

adaptive timestepping↗

DOE OSTI2022

THE DESIGN OF LAYER TIME OPTIMIZATION IN LARGE SCALE ADDITIVE MANUFACTURING WITH FIBER REINFORCED POLYMER COMPOSITES

In this study, we have developed a method to optimize a layer deposition time (a.k.a. layer time) for large-scale additive manufacturing (AM) via physics-based simulations. A long layer time leads to an over-cooled surface on which a new layer is deposited, and therefore, it may result in a weak bonding or debonding between layers, cracking, or warping. A short layer time leads to a high temperature of the structure due to insufficient cooling, and therefore, the structure may not be stiff enough and may collapse during manufacturing. Therefore, it is important to estimate the optimal layer time in additive manufacturing for a high-quality product. The temperature of a top layer right before deposition is recommended to be slightly higher than the glass temperature of the material. A temperature cooling was approximated to an exponential function of time, and the optimized layer time was obtained based on a target temperature while maintaining a minimal printing time. The material used is carbon fiber-reinforced polycarbonate (CF/PC), and the large-scale deposition system used is LSAM TM from Thermwood Corporation. Three different layer time cases were used for experiments, and a series of thermal images were obtained via an infra-red (IR) camera during the entire AM processes. AM process simulations were performed using a finite element method and the temperature profiles from the simulation were in good agreement with those from experiments. The layer time optimization was performed based on the temperature profiles from the simulations. A layer temperature with the optimal layer time was confirmed as the target temperature through simulation.

Jo, Eonyeon↗

DOE OSTI2022

Using dynamic mode decomposition to predict the dynamics of a two-time non-equilibrium Green’s function

Computing the numerical solution of the Kadanoff–Baym equations, a set of nonlinear integral differential equations satisfied by the two-time Green's functions derived from many-body perturbation theory for a quantum many-body system away from equilibrium, is a challenging task. Recently, we have successfully applied dynamic mode decomposition (DMD) to construct a data driven reduced order model that can be used to extrapolate the time-diagonal of a two-time Green's function from numerical solutions of the KBE within a small time window. In this paper, we extend the previous work and use DMD to predict off-diagonal elements of the two-time Green's function. We partition the two-time Green's function into a number of one-time functions along the diagonal and subdiagonals of the two-time window as well as in horizontal and vertical directions. We use DMD to construct separate reduced order models to predict the dynamics of these one-time functions in a two-step procedure. We extrapolate along diagonal and several subdiagonals within a subdiagonal band of a two-time window in the first step. In the second step, we use DMD to extrapolate the Green's function outside of the sub-diagonal band. In conclusion, we demonstrate the efficiency and accuracy of this approach by applying it to a two-band Hubbard model problem.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Investigation of a digitizer for the plastic scintillation detectors of time-of-flight mass measurements

A CAEN DT5742 digitizer has been investigated to process the fast signals from the photomultiplier tubes of the time-of-flight detectors for fast ion beams. A test setup consisting of two plastic scintillation detectors and a pulsed laser source provided signals which were recorded by the digitizer and systematically analyzed with different algorithms to derive the amplitude, rise time and arrival time of the detection signal. To obtain the best amplitude and time resolutions, various optimization techniques including peak fitting and signal smoothing, interpolation improvement, and time-walk correction by amplitude and rise time have been performed and compared in detail. Here we compared the time resolutions obtained by three digital algorithms of leading-edge, zero-crossing constant-fraction (ZC-CFD) and direct constant-fraction discriminations. Finally, we found that the best time-of-flight resolution between two PMTs can be achieved as 12 ps by the method using sample minimum for peak location and using the time-walk-resistant ZC-CFD with 4-point interpolation for timing.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2025

Assessing methods in fusion and fitting for time series construction in remote sensing-based earth observations

This study evaluates the comparative performance of spatiotemporal fusion and time-series fitting methods for constructing high-spatiotemporal-resolution remote sensing time-series data. Due to in-class similarity of fusion methods and fitting methods, we employ the Fit-FC (Fitting, spatial Filtering, and residual Compensation) model as a representative fusion method and the linear harmonic fitting model as a representative fitting method. Both Fit-FC and the linear harmonic fitting are widely used for high-spatiotemporal-resolution time-series data construction, and we modify the original Fit-FC model to enable automatic time-series fusion. To ensure data representativeness, we use 3 years (2019–2021) of Harmonized Landsat and Sentinel-2 surface reflectance datasets and Terra MCD43A4 products. Eight experimental regions are selected worldwide to guarantee generalization of the comparative performance between fusion and fitting methods, covering diverse land-use types (cropland, developed land, forest, and grassland) and varying climatological conditions. Time-series of NDVI and surface reflectance are analyzed under both actual observations and simulated data-missing scenarios. The constructed time-series data reveals that (1) the modified Fit-FC and linear harmonic fitting model achieve excellent performance in constructing high-resolution time-series images; (2) the fusion method outperforms the fitting method in constructing time-series of NDVI and surface reflectance images in cropland-, forest-, and grassland-dominated regions; (3) both methods achieve comparable performance in developed-dominated regions; (4) the fusion method is more robust to missing data, and better captures abrupt phenological transitions under conditions of continuous missing data; (5) the fitting method is computationally more efficient, making it suitable for large-scale time-series image reconstruction. This study provides valuable insights for selecting optimal strategies to generate high-resolution time-series images across diverse application scenarios and lays a foundation for extensions to other vegetation indices or land surface variables.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Electric Vehicles Charging Time Constrained Deliverable Provision of Secondary Frequency Regulation

Aggregation of electric vehicles (EVs) is a promising technique for providing secondary frequency regulation (SFR) in highly renewable energy-penetrated power systems. Equipped with energy storage devices, EV aggregation can provide reliable SFR. However, the main challenge is to guarantee reliable intra-interval SFR capacities and inter-interval delivery following the automatic generation control (AGC) signal. Furthermore, aggregated EV SFR provision will be further complicated by the EV charging time anxiety because SFR provision might extend EV's charging time. This paper proposes a deliverable EV SFR provision with a charging-time-constrained control strategy. First, a charging-time-constrained EV aggregation is proposed to address the uncertainty of EV capacity based on the state-space model considering the charging-time restriction of EV owners. Second, a real-time economic dispatch and time domain simulation (RTED-TDS) cosimulation framework is proposed to verify financial results and the dynamic performance of the EV SFR provision. Last, the proposed charging time-constrained EV aggregation is validated on the IEEE 39-bus system. In conclusion, the results demonstrate that with charging time-constrained EV aggregation, the dynamic performance of the system can be improved with a marginal increase in total cost. More importantly, the charging time constraint can be respected in the proposed SFR provision of the EV aggregation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2022

Jet timing

The measurement of the arrival time of a particle, such as a lepton, a photon, or a pion, reaching the detector provides valuable information. A similar measurement for a hadronic final state, however, is much more challenging as one has to extract the relevant information from a collection of particles. In this paper, we explore various possibilities in defining the time of a jet through the measurable arrival times of the jet constituents. We find that a definition of jet time based on a transverse momentum weighted sum of the times of the constituents has the best performance. For prompt jets, the performance depends on the jet trajectory. For delayed jets, the performance depends on the trajectory of the jet, the trajectory of the mother particle, and the location of the displaced vertex. Compared to the next-best-performing jet time definition, the transverse momentum weighted sum has roughly a factor of ten times better jet time resolution. We give a detailed discussion of the relevant effects and characterize the full geometrical dependence of the performance. These results highlight the critical importance of using a proper definition of jet time with its corresponding detector-dependent calibration and the exciting possibility of deepening our understanding of jets in the time domain.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Early-time measure in eternal inflation

In a situation like eternal inflation, where our data is replicated at infinitely-many other space-time events, it is necessary to make a prior assumption about our location to extract predictions. The principle of mediocrity entails that we live at asymptotic late times, when the occupational probabilities of vacua has settled to a near-equilibrium distribution. In this paper we further develop the idea that we instead exist during the approach to equilibrium, much earlier than the exponentially-long mixing time. In this case we are most likely to reside in vacua that are easily accessed dynamically. Using first-passage statistics, we prove that vacua that maximize their space-time volume at early times have: 1. maximal ever-hitting probability; 2. minimal mean first-passage time; and 3. minimal decay rate. These requirements are succinctly captured by an early-time measure. The idea that we live at early times is a predictive guiding principle, with many phenomenological implications. First, our vacuum should lie deep in a funneled region, akin to folding energy landscapes of proteins. Second, optimal landscape regions are characterized by relatively short-lived vacua, with lifetime of order the de Sitter Page time. For our vacuum, this lifetime is ~ 10 130 years, which is consistent with the Standard Model estimate due to Higgs metastability. Third, the measure favors vacua with small, positive vacuum energy. This can address the cosmological constant problem, provided there are sufficiently many vacua in the entire ensemble of funnels. As a concrete example, we study the Bousso-Polchinski lattice of flux vacua, and find that the early-time measure favors lattices with the fewest number of flux dimensions. This favors compactifications with a large hierarchy between the lightest modulus and all other Kähler and complex structure moduli.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

Parallel Multigrid in Time and Space for Extreme-Scale Computational Science: Chaotic and Hyperbolic Problems

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current stateof-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, we take inspiration from the Least Squares Shadowing (LSS by Wang) approach for solving chaotic problems. Here, an optimization approach is able to find “well-conditioned” shadow trajectories/solutions to the original “ill-conditioned” chaotic problem. Thus, the new multigrid methods researched here also arise in an optimization context.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Comparing computational times for simulations when using PBPK model template and stand-alone implementations of PBPK models

Introduction We previously developed a PBPK model template that consists of a single model “superstructure” with equations and logic found in many physiologically based pharmacokinetic (PBPK) models. Using the template, one can implement PBPK models with different combinations of structures and features. Methods To identify factors that influence computational time required for PBPK model simulations, we conducted timing experiments using various implementations of PBPK models for dichloromethane and chloroform, including template and stand-alone implementations, and simulating four different exposure scenarios. For each experiment, we measured the required computational time and evaluated the impacts of including various model features (e.g., number of output variables calculated) and incorporating various design choices (e.g., different methods for estimating blood concentrations). Results We observed that model implementations that treat body weight and dependent quantities as constant (fixed) parameters can result in a 30% time savings compared with options that treat body weight and dependent quantities as time-varying. We also observed that decreasing the number of state variables by 36% in our PBPK model template led to a decrease of 20–35% in computational time. Other factors, such as the number of output variables, the method for implementing conditional statements, and the method for estimating blood concentrations, did not have large impacts on simulation time. In general, simulations with PBPK model template implementations of models required more time than simulations with stand-alone implementations, but the flexibility and (human) time savings in preparing and reviewing a model implemented using the PBPK model template may justify the increases in computational time requirements. Conclusion Our findings concerning how PBPK model design and implementation decisions impact computational speed can benefit anyone seeking to develop, improve, or apply a PBPK model, with or without the PBPK model template.

Bernstein, Amanda S.↗

DOE OSTI2023

Interface flux recovery framework for constructing partitioned heterogeneous time-integration methods

A common approach for the development of partitioned schemes employing different time integrators on different subdomains is to lag the coupling terms in time. This can lead to accuracy issues, especially in multistage methods. Here, in this article, we present a novel framework for partitioned heterogeneous time-integration methods, which allows the coupling of arbitrary multistage and multistep methods without reducing their order of accuracy. At the core of our approach are accurate estimates of the interface flux obtained from the Schur complement of an auxiliary monolithic system. We use these estimates to construct a polynomial-in-time approximation of the interface flux over the current time coupling window. This approximation provides the interface boundary conditions necessary to decouple the subdomain problems at any point within the coupling window. In so doing our framework enables a flexible choice of time-integrators for the individual subproblems without compromising the time-accuracy at the coupled problem level. This feature is the main distinction between our framework and other approaches. To demonstrate the framework, we construct a family of partitioned heterogeneous time-integration methods, combining multistage and multistep methods, for a simplified tracer transport component of the coupled air-sea system in Earth system models. We report numerical tests evaluating accuracy and flux conservation for different pairs of time-integrators from the explicit Runge-Kutta and Adams-Moulton families.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Multigrid Reduction in Time for Chaotic Dynamical Systems

As CPU clock speeds have stagnated and high performance computers continue to have ever higher core counts, increased parallelism is needed to take advantage of these new architectures. Traditional serial time-marching schemes can be a significant bottleneck, as many types of simulations require large numbers of time-steps which must be computed sequentially. Parallel-in-time schemes, such as the Multigrid Reduction in Time (MGRIT) method, remedy this by parallelizing across time-steps and have shown promising results for parabolic problems. However, chaotic problems have proved more difficult, since chaotic initial value problems (IVPs) are inherently ill-conditioned. MGRIT relies on a hierarchy of successively coarser time-grids to iteratively correct the solution on the finest time-grid, but due to the nature of chaotic systems, small inaccuracies on the coarser levels can be greatly magnified and lead to poor coarse-grid corrections. Here we introduce a modified MGRIT algorithm based on an existing quadratically converging nonlinear extension to the multigrid Full Approximation Scheme (FAS), as well as a novel time-coarsening scheme. Together, these approaches better capture long-term chaotic behavior on coarse-grids and greatly improve convergence of MGRIT for chaotic IVPs. Further, we introduce a novel low-memory variant of the algorithm for solving chaotic PDEs with MGRIT which not only solves the IVP, but also provides estimates for the unstable Lyapunov vectors of the system. Finally, we provide supporting numerical results for the Lorenz system and demonstrate parallel speedup for the chaotic Kuramoto–Sivashinsky PDE over a significantly longer time-domain than in previous works.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

A prototype scintillator real‐time beam monitor for ultra‐high dose rate radiotherapy

Background: FLASH Radiotherapy (RT) is an emergent cancer RT modality where an entire therapeutic dose is delivered at more than 1000 times higher dose rate than conventional RT. For clinical trials to be conducted safely, a precise and fast beam monitor that can generate out-of-tolerance beam interrupts is required. This paper describes the overall concept and provides results from a prototype ultra-fast, scintillator-based beam monitor for both proton and electron beam FLASH applications. Purpose: A FLASH Beam Scintillator Monitor (FBSM) is being developed that employs a novel proprietary scintillator material. The FBSM has capabilities that conventional RT detector technologies are unable to simultaneously provide: (1) large area coverage; (2) a low mass profile; (3) a linear response over a broad dynamic range; (4) radiation hardness; (5) real-time analysis to provide an IEC-compliant fast beam-interrupt signal based on true two-dimensional beam imaging, radiation dosimetry and excellent spatial resolution. Methods: The FBSM uses a proprietary low mass, less than 0.5 mm water equivalent, non-hygroscopic, radiation tolerant scintillator material (designated HM: hybrid material) that is viewed by high frame rate CMOS cameras. Folded optics using mirrors enable a thin monitor profile of ∼10 cm. A field programmable gate array (FPGA) data acquisition system generates real-time analysis on a time scale appropriate to the FLASH RT beam modality: 100–1000 Hz for pulsed electrons and 10–20 kHz for quasi-continuous scanning proton pencil beams. An ion beam monitor served as the initial development platform for this work and was tested in low energy heavy-ion beams ( 86 Kr +26 and protons). A prototype FBSM was fabricated and then tested in various radiation beams that included FLASH level dose per pulse electron beams, and a hospital RT clinic with electron beams. Results: Results presented in this report include image quality, response linearity, radiation hardness, spatial resolution, and real-time data processing. Furthermore, the HM scintillator was found to be highly radiation damage resistant. It exhibited a small 0.025%/kGy signal decrease from a 216 kGy cumulative dose resulting from continuous exposure for 15 min at a FLASH compatible dose rate of 237 Gy/s. Measurements of the signal amplitude versus beam fluence demonstrate linear response of the FBSM at FLASH compatible dose rates of >40 Gy/s. Comparison with commercial Gafchromic film indicates that the FBSM produces a high resolution 2D beam image and can reproduce a nearly identical beam profile, including primary beam tails. The spatial resolution was measured at 35–40 µm. Tests of the firmware beta version show successful operation at 20 000 Hz frame rate or 50 µs/frame, where the real-time analysis of the beam parameters is achieved in less than 1 µs. Conclusions: The FBSM is designed to provide real-time beam profile monitoring over a large active area without significantly degrading the beam quality. A prototype device has been staged in particle beams at currents of single particles up to FLASH level dose rates, using both continuous ion beams and pulsed electron beams. Using a novel scintillator, beam profiling has been demonstrated for currents extending from single particles to 10 nA currents. Radiation damage is minimal and even under FLASH conditions would require ≥50 kGy of accumulated exposure in a single spot to result in a 1% decrease in signal output. Beam imaging is comparable to radiochromic films, and provides immediate images without hours of processing. Real-time data processing, taking less than 50 µs (combined data transfer and analysis times), has been implemented in firmware for 20 kHz frame rates for continuous proton beams.

2D beam imaging↗