Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear scaling”

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 307 records · Page 17

A Computationally Efficient Algorithm for Computing Convex Hull Prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may execute side payments when a participant’s cost is not covered through energy sale settlements from locational marginal pricing schemes, or when a participant incurs lost opportunity costs to follow the dispatch signal. Convex hull pricing minimizes these and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. However, computing convex hull prices involves solving either a large-scale linear program - which in turn requires explicit descriptions of market participants’ convex hulls -or the Lagrangian dual of the corresponding non-convex scheduling problem. Here, we propose a computationally feasible and industrially scalable Benders decomposition approach to computing convex hull prices at least an order of magnitude faster than the current state-of-the-art while leveraging recent advances in convex hull formulations for thermal generating units.

61 RADIATION PROTECTION AND DOSIMETRY↗

Dark Energy Survey Year 6 Results: MagLim++ Lens Sample Selection and Measurements of Galaxy Clustering

Galaxy clustering is a sensitive probe of the expansion history and growth of structure of the universe, and key degeneracies can be broken by combining these data with measurements of cosmic shear and galaxy-galaxy lensing (a so-called 3$\times$2pt analysis). The largest and least biased statistical samples of galaxies for use in clustering analyses can be collected photometrically through large imaging surveys. However, selecting clean photometric subsamples for cosmology are crucial for avoiding contamination that can bias cosmological constraints. Here we present the MagLim++ galaxy sample, selected to optimize for cosmological constraining power and incorporating an array of novel quality cuts to identify and remove residual contamination. This sample comes from the full six years of observations from the Dark Energy Survey. We present measurements of the two-point angular clustering ($w(θ)$) of 9,186,205 galaxies distributed over 4031 sq. degrees and in six tomographic redshift bins centered at $\bar{z}\approx$ [0.31, 0.44, 0.62, 0.78, 0.90, 1.01]. These measurements are used as part of the 3$\times$2pt and other DES Y6 legacy cosmological analyses in companion works. We describe the battery of null tests and mitigation schemes implemented to address observational, astrophysical, and methodological systematics in the analysis. The resulting $w(θ)$ measurements have a S/N = 149 (90.2 for linear scales only), which we use to place galaxy-clustering-only constraints on the matter density of the Universe, $Ω_m=0.311^{+0.023}_{-0.035}$, and amplitude of galaxy clustering in each redshift bin, $b_iσ_8=[1.16^{+0.04}_{-0.06},\ 1.40^{+0.04}_{-0.06},\ 1.57^{+0.04}_{-0.06},\ 1.59^{+0.04}_{-0.05},\ 1.50^{+0.04}_{-0.05},\ 1.74^{+0.06}_{-0.08}]$.

Weaverdyck, N. [BCCP, Berkeley; UC, Berkeley; LBL,↗

Universal monitored dynamics in multimode bosonic systems

We propose a route to study monitored many-body dynamics in multimode bosonic systems using circuit quantum electrodynamics. In this experimental setting, we construct several bosonic models comprising brickwork circuits built from beam-splitter gates, local parity measurements, and optional on-site Hubbard interactions, and diagnose their monitored dynamics via ancilla purification and a learnability-based probe. Under parity measurements, generic gate sets exhibit behavior that is largely consistent with a conventional measurement-induced phase transition, while a special class of beam-splitter circuits shows an apparent critical-like high-measurement regime in which purification times scale linearly with system size. We show that for realistic noise, gate, and measurement rates, these signatures are observable with near-term circuit QED hardware.

Patel, Shivam [Rutgers U., Piscataway]↗

ForestFlow: predicting the Lyman-α forest clustering from linear to nonlinear scales

On large scales, the Lyman-α forest provides insights into the expansion history of the Universe, while on small scales, it imposes strict constraints on the growth history, the nature of dark matter, and the sum of neutrino masses. This work introduces ForestFlow, a novel framework that bridges the gap between large- and small-scale analyses, which have traditionally relied on distinct modeling approaches. Using conditional normalizing flows, ForestFlow predicts the two Lyman-α linear biases (b δ and b η ) and six parameters describing small-scale deviations of the three-dimensional flux power spectrum (P 3D ) from linear theory as a function of cosmology and intergalactic medium physics. These are then combined with a Boltzmann solver to make consistent predictions, from arbitrarily large scales down to the nonlinear regime, for P 3D and any other statistics derived from it. Trained on a suite of 30 fixed-and-paired cosmological hydrodynamical simulations spanning redshifts from z = 2 to 4.5, ForestFlow achieves 3 and 1.5% precision in describing P 3D and the one-dimensional flux power spectrum (P 1D ) from linear scales to k = 5 Mpc −1 and k ∥ = 4 Mpc −1 , respectively. Thanks to its conditional parameterization, ForestFlow shows similar performance for ionization histories and two ΛCDM model extensions – massive neutrinos and curvature – even though none of these are included in the training set. This framework will enable full-scale cosmological analyses of Lyman-α forest measurements from the DESI survey.

79 ASTRONOMY AND ASTROPHYSICS↗

Linear ion-scale microstability analysis of high and low-collisionality NSTX discharges and NSTX-U projections

Linear gyrokinetic simulations were conducted to investigate ion-gyroradius-scale micro-instability predictions for high-beta NSTX discharges and NSTX-U projections that span over an order of magnitude variation in collisionality. A complex mix of microtearing modes and hybrid trapped electron modes/kinetic ballooning modes (TEM/KBM) is predicted for all experimental or projected conditions. Ion temperature gradient (ITG) instabilities are typically stable in the NSTX discharges investigated, consistent with the observed neoclassical ion thermal transport. ITG thresholds inferred from the simulations are typically much higher than the experimental NSTX gradients, as well as the projected gradients in the NSTX-U scenario, which assumed ion temperatures limited by neoclassical transport only. The analysis suggests ITG instabilities are unlikely to contribute significant anomalous thermal losses in high-beta, lower collisionality NSTX-U scenarios. On the other hand, the NSTX experimental profiles and NSTX-U projections are predicted to be very close to the predicted onset of unstable KBM at most radii investigated. The proximity of the various discharges to the KBM instability threshold implies it may play an important role in setting profile shapes and limiting global energy confinement. Here, it remains to be understood and predicted how KBM contributes to multi-channel transport (thermal and particle transport, for both ions and electrons) in a way that is consistent with experimental inferences.

36 MATERIALS SCIENCE↗

Linear and Nonlinear Solvers for Simulating Multiphase Flow within Large-Scale Engineered Subsurface Systems

Simulation of multiphase flow in the subsurface is well-known to be computationally challenging. While there have been many studies that have explored approaches to overcoming these challenges, they often utilize relatively simple case studies. In this paper, we focus on the unique numerical challenges posed by modeling large-scale engineered subsurface systems, characterized by discrete features embedded in a heterogeneous natural subsurface setting. The man-made features such as shafts, tunnels, and barriers often cause multiple challenges in modeling the domain for multiphase porous media flow. This flow scenario can have a wide range of applications such as nuclear waste repositories, enhanced recovery of a petroleum reservoir, geothermal engineering, and carbon sequestration. An example of these severe numerical challenges is the case of performance assessment (PA) for Waste Isolation Pilot Plant (WIPP), the only operating deep geological repository in the US, which simulates extreme material properties of bedded salt rock formation and extreme contrast due to open excavation next to the formation. The models have extremes not only of permeability and porosity but also of the constitutive models needed for multiphase flow; additionally, they have process models like salt creep closure reducing porosity over time, fracturing in clay and anhydrite interbeds of the bedded salt, gas generation from the waste materials, and unintentional human borehole intrusions in some scenarios. Numerical simulations require the solution of coupled systems of nonlinear PDEs; in our work, we use the open-source simulator PFLOTRAN which is based on Finite Volume discretization. The solution of the nonlinear equations requires use of the Newton-Raphson iteration at each time step, which entails the solution of the linearized Jacobian system at each iteration. The effects of all the processes (i.e., large number of unknowns, highly nonlinear constitutive relations, large contrasts in material properties in short distances) lead to an ill-conditioned Jacobian matrix that severely challenges traditional linear solver, i.e., stabilized biconjugate gradient with block Jacobi incomplete LU preconditioner (BCGS-ILU) leading to non-convergence for traditional Newton-Raphson nonlinear solver causing unacceptably long computation time for each model. This paper presents linear solvers such as constrained pressure residual (CPR) two-stage preconditioner with alternate-block-factorization (ABF) and quasi- implicit pressure and explicit saturation (QIMPES) decouplers and flexible generalized residual solver (FGMRES). The new general-purpose nonlinear solver, Newton trust-region dogleg Cauchy (NTRDC), is also introduced to resolve extreme nonlinearities in the models. We demonstrate the effectiveness of each method relative to the default BCGS-Newton solver. The two best cases had nearly 50 times speed-up and achieved completion of a simulation in 14 hours that never completed due to non-convergence with the default solver. We also investigate the strong scalability of each method and discuss some of the deficiencies found for Block Jacobi preconditioner using parallel domain decomposition, and node packing effects of modern processor architecture.

Preconditioner, Nonlinear, Porous media, Multiphas↗

Sparse Linear Solvers for Large-scale Electromagnetic Transient Simulations

Linear solvers form the basis for electromagnetic transient (EMT) simulations. There is a need to speed up EMT simulations as larger regions are analyzed using EMT simulations. For the same, the performance of linear solvers plays an important role. Exploiting the sparsity of the matrices generated in EMT simulations could assist with speed-up. Scalability is also crucial as power grids expand, demanding solutions capable of accommodating the increasing system size. Recent studies from the North American Electric Reliability Corporation (NERC) increasingly emphasize that EMT simulation models of the power grid will grow larger with the inclusion of power electronics components. Parallelisms in sparsity patterns exploit modern central processing units (CPUs), multi-core CPUs, and graphics processing units (GPUs) architectures in sparse solver designs. Therefore, this paper explores publicly available existing linear solvers and investigates their efficiency in large-scale power grid simulations. A large-scale power grid is developed by increasing the size of the IEEE 39 bus test system to up to 39000 bus systems.

Hsu, Kuan-Chieh↗

Temperature scaling behavior of the linear magnetoresistance observed in high-temperature superconductors

An analytical model invoking variations in the charge-carrier density is used to generate magnetoresistance curves that are almost indistinguishable from those produced by sophisticated numerical models. This demonstrates that, though disorder is pivotal in causing linear magnetoresistance, the form of the magnetoresistance thus generated is insensitive to details of the disorder. Additionally, taken in conjunction with the temperature (T) dependence of the zero-field resistivity, realistic levels of disorder are shown to be sufficient to explain the linear magnetoresistance and field-T resistance scaling observed in high-temperature pnictide and cuprate superconductors. Hence, though the T-linear zero-field resistance is a definite signature of the “strange metal” state of high-temperature superconductors, their linear magnetoresistance and its scaling is unlikely to be so.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation

For optimization problems with linear equality constraints, we prove that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraint matrix. In this work, we develop reduced compact representations of the limited-memory inverse BFGS Hessian to compute search directions efficiently when the constraint Jacobian is sparse. Orthogonal projections are implemented by a sparse QR factorization or a preconditioned LSQR iteration. In numerical experiments two proposed trust-region algorithms improve in computation times, often significantly, compared to previous implementations of related algorithms and compared to IPOPT.

97 MATHEMATICS AND COMPUTING↗

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Comparison of Multi-Scale Nonlinear and Conventional Linear Methods for Stress Analysis of Nb 3 Sn Superconducting Magnets

Here this is an extension of the work on a multi-scale nonlinear procedure that demonstrated how to conduct nonlinear stress analysis of Nb 3 Sn superconducting accelerator magnets. The nonlinear procedure uses measured stress-strain curves of annealed copper, Nb 3 Sn strands and coil samples as inputs, which reduces the number of assumptions made for material properties—key uncertainties of any engineering analysis. The results from nonlinear analysis, semi-nonlinear analysis, and linear analysis of the same QFFB2 Nb 3 Sn quadrupole magnet under the same temperature and loads, were compared and discussed. The comparison illustrates that nonlinear stress analysis is significantly more accurate than other methods. As the superconducting coil block is a complex, composite material, it would be inadequate to assume the whole coil block to be linear, either isotropic or orthotropic. It is imperative to conduct nonlinear analysis by simulating the superconducting coil to the level of detail of the individual cables and individual strands. The nonlinear stress analysis procedure can be used to simulate not only Nb 3 Sn magnets, but also NbTi and HTS magnets.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Image Gradient Decomposition for Parallel and Memory-Efficient Ptychographic Reconstruction

Ptychography is a popular microscopic imaging modality for many scientific discoveries and sets the record for highest image resolution. Unfortunately, the high image resolution for ptychographic reconstruction requires significant amount of memory and computations, forcing many applications to compromise their image resolution in exchange for a smaller memory footprint and a shorter reconstruction time. In this paper, we propose a novel image gradient decomposition method that significantly reduces the memory footprint for ptychographic reconstruction by tessellating image gradients and diffraction measurements into tiles. In addition, we propose a parallel image gradient decomposition method that enables asynchronous point-to-point communications and parallel pipelining with minimal overhead on a large number of GPUs. Our experiments on a Titanate material dataset (PbTiO3) with 16632 probe locations show that our Gradient Decomposition algorithm reduces memory footprint by 51 times. In addition, it achieves time-to-solution within 2.2 minutes by scaling to 4158 GPUs with a super-linear strong scaling efficiency at 364% compared to runtimes at 6 GPUs. This performance is 2.7 times more memory efficient, 9 times more scalable and 86 times faster than the state-of-the-art algorithm.

Wang, Xiao↗

Fast Magnetic Reconnection with Turbulence in High Lundquist Number Limit

Here, we use extensive 3D resistive MHD simulations to study how large-scale current sheets will undergo fast reconnection in the high Lundquist number S limit (above ~104), when the system is subject to different externally driven turbulence levels and the self-generated turbulence produced by 3D reconnection dynamics. We find that the normalized global reconnection rate ~0.01–0.13 is weakly dependent on S. Global reconnection with the classic inflow/outflow configurations is observed, and 3D flux ropes are hierarchically formed and ejected from reconnection regions. A statistical separation of the reconnected magnetic field lines follows a superdiffusive behavior, from which the rate is measured to be very similar to that obtained from the mixing of tracer populations. We find that the reconnection rate scales roughly linearly with the turbulence level during the peak of reconnection. This scaling is consistent with the turbulence properties produced by both the externally driven and self-generation processes. These results imply that large-scale thin current sheets tend to undergo rigorous reconnection.

79 ASTRONOMY AND ASTROPHYSICS↗

Towards exascale for wind energy simulations

We examine large-eddy-simulation modeling approaches and computational performance of two open-source computational fluid dynamics codes for the simulation of atmospheric boundary layer flows that are of direct relevance to wind energy production. The first code, NekRS, is a high-order, unstructured-grid, spectral element code. The second code, AMR-Wind, is a second-order, block-structured, finite-volume code with adaptive mesh refinement capabilities. The objective of this study is to co-develop these codes in order to improve model fidelity and performance for each. These features will be critical for running ABL-based applications such as wind farm analysis on advanced computing architectures. To this end, we investigate the performance of NekRS and AMR-Wind on the Oak Ridge Leadership Facility supercomputers Summit, using 4 to 800 nodes (24 to 4,800 NVIDIA V100 GPUs), and Crusher, the testbed for the Frontier exascale system, using 18 to 384 Graphics Compute Dies on AMD MI250X GPUs. We compare strong- and weak-scaling capabilities, linear solver performance, and time to solution. We also identify leading inhibitors to parallel scaling.

17 WIND ENERGY↗

Scale-bridging with the extended/generalized finite element method for linear elastodynamics

This paper presents an extended/generalized finite element method for bridging scales in linear elastodynamics in the absence of scale separation. More precisely, the GFEMgl framework is expanded to enable the numerical solution of multiscale problems through the automated construction of specially-tailored shape functions, thereby enabling high-fidelity finite element modeling on simple, fixed finite element meshes. Furthermore, this introduces time-dependencies in the shape functions in that they are subject to continuous adaptation with time. The temporal aspects of the formulation are investigated by considering the Newmark-β time integration scheme, and the efficacy of mass lumping strategies is explored in an explicit time-stepping scheme. This method is demonstrated on representative wave propagation examples as well as a dynamic fracture problem to assess its accuracy and flexibility.

36 MATERIALS SCIENCE↗

Static Subspace Approximation for Random Phase Approximation Correlation Energies: Implementation and Performance

Developing theoretical understanding of complex reactions and processes at interfaces requires using methods that go beyond semilocal density functional theory to accurately describe the interactions between solvent, reactants and substrates. Methods based on many-body perturbation theory, such as the random phase approximation (RPA), have previously been limited due to their computational complexity. However, this is now a surmountable barrier due to the advances in computational power available, in particular through modern GPU-based supercomputers. In this work, we describe the implementation of RPA calculations within BerkeleyGW and show its favorable computational performance on large complex systems relevant for catalysis and electrochemistry applications. Our implementation builds off of the static subspace approximation which, by employing a compressed representation of the frequency dependent polarizability, enables the evaluation of the RPA correlation energy with significant acceleration and systematically controllable accuracy. We find that the computational cost of calculating the RPA correlation energy scales only linearly with system size for systems containing up to 50 thousand bands, and is expected to scale quadratically thereafter. We also show excellent strong scaling results across several supercomputers, demonstrating the performance and portability of this implementation.

algorithmic development↗