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 865 records · Page 48

Hydrogen Production System Scaling Using a High-Fidelity Simulation-Optimization Framework

Proton exchange membrane (PEM) electrolyzers are widely used for hydrogen production, yet few validated, high-fidelity tools can reliably guide scale-up. Using measured performance from a 50-hour hardware-in-the-loop pilot test, a physics-based, plant-level model of a 1.25 MW PEM electrolyzer and its balance-of-plant (BoP) subsystems is developed and validated. The model couples electrochemistry and thermal/flow submodels and is calibrated against pilot test data via a genetic algorithm (GA) workflow. Validation yields a mean absolute percentage error (APE) of 0.43% for cell voltage and stack power. Two scale-out strategies are then benchmarked under a common 7-day wind-and-photovoltaic (PV) profile: (i) linear duplication of 1.25 MW blocks and (ii) shared-BoP architectures. Sharing BoP between stacks reduces BoP energy by 27% at 10 MW and 34% at 100 MW (vs. linear duplication) and improves system specific energy consumption (SEC) to 52.9 and 52.6 kWh/kg, respectively (from 54.0 kWh/kg with linear duplication). Partial-load studies (25-100% set-point) show that cumulative hydrogen production remains nearly constant down to 50% load because all cases use the same weekly renewable-energy input. Below 50%, the power cap limits how much energy can be used within 168 h, which reduces hydrogen output. The model further indicates that the practical operating optimum lies between 50% and 85% load, where efficiency gains begin to appear without significant loss in hydrogen output. Moreover, the efficiency gains at lower loads are offset by reduced production. The validated framework supports scenario-based engineering trade-off studies for large configurations (10-100 MW) and for operating policies under variable renewables.

08 HYDROGEN↗

Demonstration of Vertical 2T-nC FeRAM Hybrid Cell and Its Scalability for High-Density 3-D Ferroelectric Capacitor Memory

In this work, we present a comprehensive experimental and modeling study on the scaling of vertical 2T-nC ferroelectric random access memory (FeRAM) hybrid cells, comprising n metal-ferroelectric–metal (MFM) capacitors, to demonstrate a high-performance and high-density 3-D capacitor memory. Our contributions include: 1) successful process integration of vertical 2T-3C FeRAM cells by stacking MFM structures on top of Si CMOS transistors; 2) experimental validation of memory cell functionality, confirming the feasibility of the vertical 2T-nC FeRAM architecture; 3) an analysis of scaling effects on parasitic capacitance in densely integrated 3-D arrays, using 3-D technology computer-aided design (TCAD) simulations; 4) exploration of aggressive stacking of write bitlines (WBLs) to enhance memory density, where ferroelectric linear capacitance ( C FE ) enables self-boosted inhibition under the V W /2 scheme, but renders the V W /3 scheme ineffective due to intolerable write disturbances; and 5) assessment of horizontal scaling, revealing significant increases in read disturbances caused by interplane capacitance between adjacent WBLs ( C Z ). This work represents an early exploration into the potential of 2T-nC FeRAM as a scalable and efficient 3-D memory solution.

42 ENGINEERING↗

Reducing communication in algebraic multigrid with multi-step node aware communication

Algebraic multigrid (AMG) is often viewed as a scalable [Formula: see text] solver for sparse linear systems. Yet, AMG lacks parallel scalability due to increasingly large costs associated with communication, both in the initial construction of a multigrid hierarchy and in the iterative solve phase. This work introduces a parallel implementation of AMG that reduces the cost of communication, yielding improved parallel scalability. It is common in Message Passing Interface (MPI), particularly in the MPI-everywhere approach, to arrange inter-process communication, so that communication is transported regardless of the location of the send and receive processes. Performance tests show notable differences in the cost of intra- and internode communication, motivating a restructuring of communication. In this case, the communication schedule takes advantage of the less costly intra-node communication, reducing both the number and the size of internode messages. Node-centric communication extends to the range of components in both the setup and solve phase of AMG, yielding an increase in the weak and strong scaling of the entire method.

Computer Science↗

Numerical solution of large scale Hartree–Fock–Bogoliubov equations

The Hartree–Fock–Bogoliubov (HFB) theory is the starting point for treating superconducting systems. However, the computational cost for solving large scale HFB equations can be much larger than that of the Hartree–Fock equations, particularly when the Hamiltonian matrix is sparse, and the number of electrons N is relatively small compared to the matrix size N b . We first provide a concise and relatively self-contained review of the HFB theory for general finite sized quantum systems, with special focus on the treatment of spin symmetries from a linear algebra perspective. We then demonstrate that the pole expansion and selected inversion (PEXSI) method can be particularly well suited for solving large scale HFB equations. For a Hubbard-type Hamiltonian, the cost of PEXSI is at most $\mathcal{O}$(N b 2 ) for both gapped and gapless systems, which can be significantly faster than the standard cubic scaling diagonalization methods. We show that PEXSI can solve a two-dimensional Hubbard-Hofstadter model with N b up to 2.88 × 10 6 , and the wall clock time is less than 100 s using 17 280 CPU cores. Finally, this enables the simulation of physical systems under experimentally realizable magnetic fields, which cannot be otherwise simulated with smaller systems.

97 MATHEMATICS AND COMPUTING↗

Luminosity and beam-induced background studies for the Cool Copper Collider

A high-energy electron-positron collider has been widely recognized by the particle physics community to be the next crucial step for detailed studies of the Higgs boson and other fundamental particles and processes. Several proposals for such colliders, either linear or circular, are currently under evaluation. Any such collider will be required to reach high lumimosities, in order to collect enough data at a reasonable time scale, while at the same time coping with high rates of background particles produced from beam-beam interactions during the collisions. In this paper, we analyze the luminosity and beam-beam interaction characteristics of the Cool Copper Collider ( C 3 ) and perform a comparison with other linear collider proposals. We conclude that C 3 can reach the same or higher collision rates as the other proposals, without having to cope with higher beam-induced background fluxes. Thus, C 3 emerges as an attractive option for a future electron-positron collider, benefiting from the collective advancements in beam delivery and final focus system technologies developed by other linear collider initiatives. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

Dynamics of polymer segments, polymer chains, and nanoparticles in polymer nanocomposite melts: A review

The addition of nanoparticles (NPs) to a polymer matrix, forming a polymer nanocomposite (PNC), is known to alter the microscopic dynamic processes of both species which leads to unique macroscopic material properties of the PNC. Because the NPs and polymers have overlapping characteristic length, time, and energy scales, the interactions within these materials are complex and the dynamics are interrelated. In this review, we present an overview of experimental, simulation, and theoretical results that probe multi-scale polymer and nanoparticle dynamics in polymer nanocomposites and navigate the dense parameter space presented by these multicomponent systems. Although a variety of PNC systems are mentioned, we focus this discussion on linear thermoplastics filled with hard spherical or cylindrical NPs in the melt state. We begin by introducing PNCs, the dynamic processes within them, and the importance of dynamics for properties and processing. At the smallest length and time scales, we discuss segmental dynamics in PNCs, including the role of polymer attributes, NP attributes, and NP-polymer interactions. Then, we present measurements of collective motions and intermediate (Rouse) dynamics in various PNC materials. At longer length and time scales, we discuss polymer center-of-mass diffusion in PNCs with either spherical or anisotropic NPs. We then explore the dynamics of the NPs in PNCs and polymer melts, including theoretical predictions, simulation results, and experimental observations. Lastly, we note some of the remaining challenges in probing dynamics in PNC materials and fundamentally studying PNCs more generally.

36 MATERIALS SCIENCE↗

Topological enhancement of nonlinear transport in unconventional point-node semimetals

The topological singularity of the Bloch states close to the Fermi level significantly enhances nonlinear electric responses in topological semimetals. Here, we systematically characterize this enhancement for a large class of topological nodal-point fermions, including those with linear, linear-quadratic, and quadratic dispersions. Specifically, we determine the leading power-law dependence of the nonlinear response functions on the chemical potential μ defined relative to the nodal point. We identify two characteristics that qualitatively improve nonlinear transports compared to those of conventional Dirac and Weyl fermions. First, the type-II (overtilted) spectrum leads to the log μ enhancement of nonlinear response functions having zero scaling dimension with respect to μ, which is not seen in a type-I (moderately or not tilted) spectrum. Second, the anisotropic linear-quadratic dispersion increases the power of small-μ divergence for the nonlinear response tensors along the linearly dispersing direction. Furthermore, our work reveals new experimental signatures of unconventional nodal points in topological semimetals as well as provides a guiding principle for giant nonlinear electric responses.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

4-Clique network minor embedding for quantum annealers

Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network minor embedding. This method is in contrast to the standard minor embedding technique of using a path of linearly connected qubits in order to represent a logical variable state. The 4-clique minor embedding is possible on Pegasus graph connectivity, which is the native hardware graph for some of the current D-Wave quantum annealers. The Pegasus hardware graph contains many cliques of size 4, making it possible to form a graph composed entirely of paths of connected 4-cliques on which a problem can be minor-embedded. The 4-clique chains come at the cost of additional qubit usage on the hardware graph, but they allow for stronger coupling within each chain, thereby increasing chain integrity, reducing chain breaks, and allow for greater usage of the available energy scale for programming logical problem coefficients on current quantum annealers. The 4-clique minor embedding technique is compared with the standard linear path minor embedding with experiments on two D-Wave quantum annealing processors with Pegasus hardware graphs. We show proof-of-concept experiments where the 4-clique minor embeddings can use weak chain strengths while successfully carrying out the computation of minimizing random all-to-all spin glass problem instances. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Deer Vigilance and Movement Behavior Are Affected by Edge Density and Connectivity

ABSTRACT Animal behavior is an important component of individual, population, and community responses to anthropogenic habitat alteration. For example, antipredator behavior (e.g., vigilance) and animal movement behavior may both be important behavioral responses to the increased density of habitat edges and changes in patch connectivity that characterize highly modified habitats. Importantly, edge density and connectivity might interact, and this interaction is likely to mediate animal behavior: linear, edge‐rich landscape features often provide structural connectivity between patches, but the functional connectedness of patches for animal use could depend upon how edge density modifies animal vigilance and movement. Using remote cameras in large‐scale experimental landscapes that manipulate edge density (high‐ vs. low‐density edges) and patch connectivity (isolated or connected patches), we examined the effects of edge density and connectivity on the antipredator behavior and movement behavior of white‐tailed deer ( Odocoileus virginianus ). Deer vigilance was 1.38 times greater near high‐density edges compared to low‐density edges, regardless of whether patches were connected or isolated. Deer were also more likely to move parallel to connected high‐density edges than all other edge types, suggesting that connectivity promotes movement along high‐density edges. These results suggest that increases in edge density that accompany human fragmentation of existing habitats may give rise to large‐scale changes in the antipredator behavior of deer. These results also suggest that conservation strategies that simultaneously manipulate edge density and connectivity (i.e., habitat corridors) may have multiple effects on different aspects of deer behavior: linear habitat corridors were areas of high vigilance, but also areas where deer movement behavior implied increased movement along the habitat edge.

Bartel, Savannah L. [University of Wisconsin‐Madis↗

New insights into supradense matter from dissecting scaled stellar structure equations

The strong-field gravity in general relativity (GR) realized in neutron stars (NSs) renders the equation of state (EOS) P(ε) of supradense neutron star matter to be essentially nonlinear and refines the upper bound for Φ ≡ P/ε to be much smaller than the special relativity (SR) requirement with linear EOSs, where P and ε are respectively the pressure and energy density of the system considered. Specifically, a tight bound Φ ≲ 0.374 is obtained by perturbatively anatomizing the intrinsic structures of the scaled Tolman–Oppenheimer–Volkoff (TOV) equations without using any input nuclear EOS. New insights gained from this novel analysis provide EOS-model-independent constraints on the properties (e.g., density profiles of the sound speed squared s 2 = dP/dε and trace anomaly Δ = 1/3 – Φ) of cold supradense matter in NS cores. Using the gravity-matter duality in theories describing NSs, we investigate the impact of gravity on supradense matter EOS in NSs. In particular, we show that the NS mass M NS , radius R, and compactness ξ ≡ M NS /R scale with certain combinations of its central pressure and energy density (encapsulating its central EOS). Thus, observational data on these properties of NSs can straightforwardly constrain NS central EOSs without relying on any specific nuclear EOS model.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The Adjoint Petrov–Galerkin method for non-linear model reduction

Here, we formulate a new projection-based reduced-order modeling technique for non-linear dynamical systems. The proposed technique, which we refer to as the Adjoint Petrov–Galerkin (APG) method, is derived by decomposing the generalized coordinates of a dynamical system into a resolved coarse-scale set and an unresolved fine-scale set. A Markovian finite memory assumption within the Mori–Zwanzig formalism is then used to develop a reduced-order representation of the coarse scales. This procedure leads to a closed reduced-order model that displays commonalities with the adjoint stabilization method used in finite elements. The formulation is shown to be equivalent to a Petrov–Galerkin method with a non-linear, time-varying test basis, thus sharing some similarities with the Least-Squares Petrov–Galerkin method. Theoretical analysis examining a priori error bounds and computational cost is presented. Numerical experiments on the compressible Navier–Stokes equations demonstrate that the proposed method can lead to improvements in numerical accuracy, robustness, and computational efficiency over the Galerkin method on problems of practical interest. Improvements in numerical accuracy and computational efficiency over the Least-Squares Petrov–Galerkin method are observed in most cases.

42 ENGINEERING↗

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

Security-constrained unit commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via mixed-integer linear programming (MIP), sometimes multiple times per day, with only minor changes in input data. In this work, we propose a number of machine learning techniques to effectively extract information from previously solved instances in order to significantly improve the computational performance of MIP solvers when solving similar instances in the future. Based on statistical data, we predict redundant constraints in the formulation, good initial feasible solutions, and affine subspaces where the optimal solution is likely to lie, leading to a significant reduction in problem size. Computational results on a diverse set of realistic and large-scale instances show that using the proposed techniques, SCUC can be solved on average 4.3 times faster with optimality guarantees and 10.2 times faster without optimality guarantees, with no observed reduction in solution quality. Out-of-distribution experiments provide evidence that the method is somewhat robust against data-set shift. Summary of Contribution. The paper describes a novel computational method, based on a combination of mixed-integer linear programming (MILP) and machine learning (ML), to solve a challenging and fundamental optimization problem in the energy sector. The method advances the state-of-the-art, not only for this particular problem, but also, more generally, in solving discrete optimization problems via ML. We expect that the techniques presented can be readily used by practitioners in the energy sector and adapted, by researchers in other fields, to other challenging operations research problems that are solved routinely.

Machine Learning↗

An experimental comparison of a space-time multigrid method with PFASST for a reaction-diffusion problem

We consider two parallel-in-time approaches applied to a (reaction) diffusion problem, possibly non-linear. In particular, we consider PFASST (Parallel Full Approximation Scheme in Space and Time) and space-time multigrid strategies. For both approaches, we start from an integral formulation of the continuous time dependent problem. Then, a collocation form for PFASST and a discontinuous Galerkin discretization in time for the space-time multi-grid are employed, resulting in the same discrete solution at the time nodes. Strong and weak scaling of both multilevel strategies are compared for varying orders of the temporal discretization. Moreover, we investigate the respective convergence behavior for non-linear problems and highlight quantitative differences in execution times

97 MATHEMATICS AND COMPUTING↗

Mapping Spiking Neural Networks to Heterogeneous Crossbar Architectures using Integer Linear Programming

Advances in novel hardware devices and architectures allow Spiking Neural Network (SNN) evaluation using ultra-low power, mixed-signal, memristor crossbar arrays. As individual network sizes quickly scale beyond the dimensional capabilities of single crossbars, networks must be mapped onto multiple crossbars. Crossbar sizes within modern Memristor Crossbar Architectures (MCAs) are determined predominately not by device technology but by network topology; more, smaller crossbars consume less area thanks to the high structural sparsity found in larger, brain-inspired SNNs. Motivated by continuing increases in SNN sparsity due to improvements in training methods, we propose utilizing heterogeneous crossbar sizes to further reduce area consumption. This approach was previously unachievable as prior compiler studies only explored solutions targeting homogeneous MCAs. Our work improves on the state-of-the-art by providing Integer Linear Programming (ILP) formulations supporting arbitrarily heterogeneous architectures. By modeling axonal interactions between neurons, our methods produce better mappings while removing inhibitive a priori knowledge requirements. We first show a 16.7-27.6% reduction in area consumption for square-crossbar homogeneous architectures. Then, we demonstrate 66.9-72.7% further reduction when using a reasonable configuration of heterogeneous crossbar dimensions. Next, we present a new optimization formulation capable of minimizing the number of inter-crossbar routes. When applied to solutions already near-optimal in area, an 11.9-26.4% routing reduction is observed without impacting area consumption. Finally, we present a profile-guided optimization capable of minimizing the number of runtime spikes between crossbars. Compared to the best-area-then-route optimized solutions, we observe a further 0.5-14.8% inter-crossbar spike reduction while requiring 1–3 orders of magnitude less solver time.

Pohl, Devin [ORNL] (ORCID:0009000040149027)↗

Scaled ILU Smoothers for Navier-Stokes Pressure Projection

Incomplete LU (ILU) smoothers are effective in the algebraic multigrid (AMG) V-cycle for reducing high-frequency components of the error. However, the requisite direct triangular solves are comparatively slow on GPUs. Previous work has demonstrated the advantages of Jacobi iteration as an alternative to direct solution of these systems. Depending on the threshold and fill-level parameters chosen, the factors can be highly nonnormal and Jacobi is unlikely to converge in a low number of iterations. We demonstrate that row scaling can reduce the departure from normality, allowing us to replace the inherently sequential solve with a rapidly converging Richardson iteration. There are several advantages beyond the lower compute time. Scaling is performed locally for a diagonal block of the global matrix because it is applied directly to the factor. Further, an ILUT Schur complement smoother maintains a constant GMRES iteration count as the number of MPI ranks increases, and thus parallel strong-scaling is improved. Our algorithms have been incorporated into hypre, and we demonstrate improved time to solution for linear systems arising in the Nalu-Wind and PeleLM pressure solvers. For large problem sizes, GMRES+AMG executes at least five times faster when using iterative triangular solves compared with direct solves on massively parallel GPUs.

algebraic multigrid↗

Urbanization effects on the spatial patterns of spring vegetation phenology depend on the climatic background

Cities have been considered ideal surrogates for evaluating ecological responses to climate warming. Although research has revealed that the urban heat island effect is not the only determinant that drives the rural-urban difference in spring phenology, limited attempts further explore the effect of complex interactions between urbanization and climates on the start of the season (SOS). Here, we employed the percentage of impervious surface area as an indicator of urbanization levels, incorporating the urban heat island (UHI) effect and climates to decipher the multiple effects on the temporal shift in SOS. Our results suggest that urbanization, the UHI effect, and climates jointly drive the phenological timing in cities. Further, the SOS is highly linearly correlated with urbanization levels and UHI effects (p<0.001) in the zones with warm and humid climates, whereas relatively warmer, cooler, or arid climates break down the linearity. Geographically, the SOS is north-south symmetrical for the rural-urban ecosystem at the national scale, which initiates at the mid-latitudes (around 30 °N, 67.58 DOY ± 2.23 days) first and then towards the low (around 20 °N, 105.25 DOY ± 1.31 days) and high-latitudes (45 °N, 123.01 DOY ± 1.45 days). Chilling accumulation and spring temperature jointly contribute to this phenomenon. As the UHI effect is similar to the projected global warming in the future, understanding the phenological responses to urbanization in various climates is insightful for evaluating the impact of future warming on plants' phenological behavior in the global ecosystem.

54 ENVIRONMENTAL SCIENCES↗

A fully implicit, asymptotic-preserving, semi-Lagrangian algorithm for the time dependent anisotropic heat transport equation

In this paper, we extend the operator-split asymptotic-preserving, semi-Lagrangian algorithm for time dependent anisotropic heat transport equation proposed in Chacón et al. (2014) [18] to use a fully implicit time integration with backward differentiation formulas. The proposed implicit method can deal with arbitrary heat-transport anisotropy ratios $\mathcal{X}$∥ /$ \mathcal{X}$⟂ $\ggg$ 1 (with $\mathcal{X}$∥, $ \mathcal{X}$⟂ the parallel and perpendicular heat diffusivities, respectively) in complicated magnetic field topologies in an accurate and efficient manner. Further, the implicit algorithm is second-order accurate temporally and demonstrates an accurate treatment at boundary layers (e.g., island separatrices), which was not ensured by the operator-split implementation. The condition number of the resulting algebraic system is independent of the anisotropy ratio, and is inverted with preconditioned GMRES. We propose a simple preconditioner that renders the finite-dimensional linear operator compact, resulting in mesh-independent convergence rates for topologically simple magnetic fields, and convergence rates scaling as ~ (NΔt) 1/4 (with N the total mesh size and Δt the timestep) in topologically complex magnetic-field configurations. We demonstrate the accuracy and performance of the approach with test problems of varying complexity, including an analytically tractable boundary-layer problem in a straight magnetic field, and a topologically complex magnetic field featuring magnetic islands with extreme anisotropy ratios $\mathcal{X}$∥ /$ \mathcal{X}$⟂ = 10 10 ) .

97 MATHEMATICS AND COMPUTING↗

Emergence of local scaling relations in adsorption energies on high-entropy alloys

Alloying has been proposed to circumvent scaling relations between the adsorption energies thus allowing for the complete optimization of multistep reactions. Herein the fidelity of scaling rules on high-entropy alloy (HEA) surfaces is assessed focusing on hydrogen-containing molecules, *AH x for A = C and N (x = 0, 1, 2, 3), A = S (x = 0, 1, 2) and A = O (x = 0, 1). Using an adsorbate- and site-specific deep learning model to rapidly compute the adsorption energies on CoMoFeNiCu HEA surfaces, the energies of *AH x and *A are shown to be linearly correlated if *A and *AH x have identical adsorption site symmetry. However, a local linear dependence emerges between the configuration-averaged adsorption energies irrespective of the site symmetry. Although these correlations represent a weaker form of the scaling relationships, they are sufficient to prohibit the optimization of multistep reactions. The underpinning of this behavior is twofold (1) the nearsightedness principle and (2) the narrow distribution of the adsorption energies around the mean-field value. While the nearsightedness is general for all electronic systems, the second criterion applies in HEAs with relatively strong reactive elements. The present findings strongly suggest that alloys may not generally enable the breaking of scaling relationships.

36 MATERIALS SCIENCE↗