Search NASA⌕ Search

SEARCH · Search NASA

Results for “spatial memory”

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 397 records · Page 22

Adaptive and Efficient Computing for Subsurface Simulation within ParFlow

This project is concerned with the PF.WRF model as a means to enable more accurate predictions of wind fluctuations and subsurface storage. As developed at LLNL, PF.WRF couples a groundwater (subsurface) and surface water flow model (ParFlow) to a mesoscale atmospheric model (WRF, Weather Research and Forecasting Model). It was developed as a unique tool to address coupled water balance and wind energy questions that occur across traditionally separated research regimes of the atmosphere, land surface, and subsurface. PF.WRF is capable of simulating fluid, mass, and energy transport processes in groundwater, vadose zone, root zone, and land surface systems, including overland flow, and allows for the WRF model to both directly drive and respond to surface and subsurface hydrologic processes and conditions. The current PF.WRF model is constrained to have uniform spatial gridding below the land surface and matching areal grids with the WRF model at the land surface. There are often cases where it is advantageous for land surface, overland flow and subsurface models to have finer gridding than their atmospheric counterparts. Finer vertical discretization is also advantageous near the land surface (to properly capture feedbacks) yet many applications have a large vertical extent. However, the surface flow is strongly dependent on topography leading to a need for greater lateral resolution in some regions and the subsurface flow is tightly coupled to the atmospheric model near the surface leading to a need for finer vertical resolution. In addition, the interactions (e.g. rain) will be highly variable in space and time across the problem domain so an adaptive scheme is preferred to a static strategy to efficiently use computing and memory resources. As a result, this project focussed on algorithmic research required for development of an adaptive simulation capability in the PF.WRF system and its subsequent use in an application problem in the Central Valley of California. This report documents schemes of use for a future implementation of an adaptive grid capability within the ParFlow subsurface flow simulator in PF.WRF. The methods describe specific handling of the coarse/fine boundaries within a cell-centered discretization of the nonlinear parabolic Richards equation model for variable saturated flow. In addition, we describe development of a spline fit and table lookup method implemented within ParFlow to enhance computational efficiency of variably saturated flow calculations.

97 MATHEMATICS AND COMPUTING↗

Adaptive Scalpel Scanning Probe Microscopy for Enhanced Volumetric Sensing in Tomographic Analysis

Controlling nanoscale tip‐induced material removal is crucial for achieving atomic‐level precision in tomographic sensing with atomic force microscopy (AFM). While advances have enabled volumetric probing of conductive features with nanometer accuracy in solid‐state devices, materials, and photovoltaics, limitations in spatial resolution and volumetric sensitivity persist. This work identifies and addresses in‐plane and vertical tip‐sample junction leakage as sources of parasitic contrast in tomographic AFM, hindering real‐space 3D reconstructions. Novel strategies are proposed to overcome these limitations. First, the contrast mechanisms analyzing nanosized conductive features are explored when confining current collection purely to in‐plane transport, thus allowing reconstruction with a reduction in the overestimation of the lateral dimensions. Furthermore, an adaptive tip‐sample biasing scheme is demonstrated for the mitigation of a class of artefacts induced by the high electric field inside the thin oxide when volumetrically reduced. This significantly enhances vertical sensitivity by approaching the intrinsic limits set by quantum tunneling processes, allowing detailed depth analysis in thin dielectrics. The effectiveness of these methods is showcased in tomographic reconstructions of conductive filaments in valence change memory, highlighting the potential for application in nanoelectronics devices and bulk materials and unlocking new limits for tomographic AFM.

36 MATERIALS SCIENCE↗

DIF3D-VARIANT 12.0: Updates and New Features

The DIF3D code has been a workhorse of fast reactor analysis work at Argonne National Laboratory for over 40 years. In 1995, a transport option called VARIANT was added to DIF3D to improve the flux solutions for fast reactor problems which we term DIF3D-VARIANT today. DIF3D-VARIANT performs nodal neutron transport calculations using P N or SP N theory in Cartesian and hexagonal two- and three-dimensional geometries. The limited computing capabilities of the time restricted DIF3D-VARIANT to use at most a 6 th order spatial approximation combined with a P3 flux approximation and P1 scattering kernel for a 33 group structure on most studied reactor problems. Computer capabilities have increased steadily since 1995 and today much larger space-angle-energy approximations are possible. This manuscript serves as an update to the theory section of the original DIF3D-VARIANT manual and details more than twenty years of changes made to DIF3D to make version 12 which was released on November 1 st , 2024. The primary focus of the initial work was to extend the space-angle approximations available in DIF3D-VARIANT such that the error due to transport approximations could be better understood. This work was started and completed in 2002 and marked the official version 10. Unfortunately, those higher order approximations could not be used at that time due to the memory constraints of the BPOINTER part of DIF3D (limited to 2 GB). In version 11, completed in 2012, BPOINTER was circumvented in DIF3D-VARIANT for the largest arrays by introducing a Fortran 90 module called LMA (Large Memory Array). This seamlessly replaces all of the functionality of the BPOINTER concept, but it allows 64 bit addressing for every array such that they can be larger than 2 GB. It is now common for DIF3D-VARIANT jobs to consume 50 GB of memory on modern workstations when using high order space-angle approximations and a large number of groups. Many improvements were made to version 11 from 2012 to 2022 when work to create version 12 started. For version 12, several parts of DIF3D were updated to improve performance and thread parallelism was introduced to further reduce the runtime. Numerous minor bugs were discovered in DIF3D-VARIANT as part of the process of creating the perturbation and sensitivity code PERSENT. All of these algorithmic problems were identified in the transition from version 10 to version 11 which prevented DIF3D-VARIANT from running efficiently and reliably. Firstly, the coarse mesh rebalance scheme would routinely diverge and a study detailed in this report demonstrates how it was also typically not effective. This is not a failure of the coarse mesh rebalance methodology, but a failure of its implementation in DIF3D-VARIANT for hexagonal geometries. The fission source extrapolation algorithm was also found to be unreliable on larger group structure problems, leading to divergence in some cases and a negligible improvement in performance overall. Finally, the “Omega” acceleration applied to the partial current solver routine of DIF3D-VARIANT was found to cause DIF3D-VARIANT to converge to the wrong answer. To resolve these issues, both the coarse mesh rebalance and fission source extrapolation were permanently disabled in version 11. The Tchebychev acceleration was put in as a temporary reliable alternative but it is generally inferior to coarse mesh rebalance or coarse mesh finite difference. For the Omega acceleration, the factor was restricted to guarantee that it would not cause follow-on errors in PERSENT. Due to limited funding to support maintenance and development of DIF3D in the last 10 years, no effort was spent since to resolve the outer iteration acceleration. Except for the threading work, all of the changes discussed in this manuscript refer to changes made between version 10 and version 11. Performance comparisons are done to demonstrate the improvements from version 9 to version 12. As will be demonstrated, the updated versi

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Explore Spatio‐Temporal Learning of Large Sample Hydrology Using Graph Neural Networks

Abstract Streamflow forecasting over gauged and ungauged basins play a vital role in water resources planning, especially under the changing climate. Increased availability of large sample hydrology data sets, together with recent advances in deep learning techniques, has presented new opportunities to explore temporal and spatial patterns in hydrological signatures for improving streamflow forecasting. The purpose of this study is to adapt and benchmark several state‐of‐the‐art graph neural network (GNN) architectures, including ChebNet, Graph Convolutional Network (GCN), and GraphWaveNet, for end‐to‐end graph learning. We explicitly represent river basins as nodes in a graph, learn the spatiotemporal nodal dependencies, and then use the learned relations to predict streamflow simultaneously across all nodes in the graph. The efficacy of the developed GNN models is investigated using the Catchment Attributes and MEteorology for Large‐sample Studies (CAMELS) data set under two settings, fixed graph topology (transductive learning), and variable graph topology (inductive learning), with the latter applicable to prediction in ungauged basins (PUB). Results indicate that GNNs are generally robust and computationally efficient, achieving similar or better performance than a baseline model trained using the long short‐term memory (LSTM) network. Further analyses are conducted to interpret the graph learning process at the edge and node levels and to investigate the effect of different model configurations. We conclude that graph learning constitutes a viable machine learning‐based method for aggregating spatiotemporal information from a multitude of sources for streamflow forecasting

Sun, Alexander Y.↗

Reduced scaling CASPT2 using supporting subspaces and tensor hyper-contraction

Here, we present a reduced scaling formulation of the state specific complete active space second-order perturbation method (CASPT2) requiring O( N 4 ) operations and O( N 2 ) memory for a fixed active space, where N is proportional to system size. Motivated by the properties of the Kronecker sum, we introduce the supporting subspace technique (SST), which decomposes the CASPT2 linear equations into two parts: a single-reference MP2 energy term using dressed orbitals, plus a reduced linear system with dimension scaling as O( N 2 ). Together with Laplace quadrature, the SST allows us to reformulate CASPT2 using a MP2 energy computation and Fock builds. By further applying the tensor hyper-contraction (THC) approximation, the MP2-like term can be computed with O( N 4 ) operations, and the remainder can be solved with O( N 3 ) operations using the preconditioned conjugate gradient method. This is the first application of THC in the context of multi-reference methods. We also developed an efficient implementation of the method by utilizing graphical processing units and exploiting spatial sparsity in tensor operations. We benchmark the accuracy of the new method against conventional CASPT2 for reactions in the gas phase. We apply the new method to Menshutkin S N 2 reactions in carbon nanotubes, demonstrating the feasibility of CASPT2 calculations with O(100) atoms.

74 ATOMIC AND MOLECULAR PHYSICS↗

Multifunctional ferrofluid-infused surfaces with reconfigurable multiscale topography

Developing adaptive materials with geometries that change in response to external stimuli provides fundamental insights into the links between the physical forces involved and the resultant morphologies and creates a foundation for technologically relevant dynamic systems. In particular, reconfigurable surface topography as a means to control interfacial properties has recently been explored using responsive gels, shape-memory polymers, liquid crystals and hybrid composites, including magnetically active slippery surfaces. However, these designs exhibit a limited range of topographical changes and thus a restricted scope of function. Here we introduce a hierarchical magneto-responsive composite surface, made by infiltrating a ferrofluid into a microstructured matrix (termed ferrofluid-containing liquid-infused porous surfaces, or FLIPS). We demonstrate various topographical reconfigurations at multiple length scales and a broad range of associated emergent behaviours. An applied magnetic-field gradient induces the movement of magnetic nanoparticles suspended in a viscous fluid, which leads to microscale flow of this ferrofluid first above and then within the microstructured surface. This redistribution changes the initially smooth surface of the ferrofluid (which is immobilized by the porous matrix through capillary forces) into various multiscale hierarchical topographies shaped by the size, arrangement and orientation of the confining microstructures in the magnetic field. We analyse the spatial and temporal dynamics of these reconfigurations theoretically and experimentally as a function of the balance between capillary and magnetic pressures and of the geometric anisotropy of the FLIPS system. Several interesting functions at three different length scales are demonstrated: self-assembly of colloidal particles at the micrometre scale; regulated flow of liquid droplets at the millimetre scale; and switchable adhesion and friction, liquid pumping and removal of biofilms at the centimetre scale. We envision that FLIPS could be used as part of integrated control systems for the manipulation and transport of matter, thermal management, microfluidics and fouling-release materials.

36 MATERIALS SCIENCE↗

Curvature Induced Modifications of Chirality and Magnetic Configuration in Perpendicular Films

Designing curvature in three-dimensional (3D) magnetic nanostructures enables controlled manipulation of local energy landscapes, allowing for the modification of noncollinear spin textures relevant for next-generation spintronic devices. In this study, we experimentally investigate 3D magnetization textures in a Co/Pd multilayer film, exhibiting strong perpendicular magnetic anisotropy (PMA), deposited onto curved Cu nanowire meshes with diameters as small as 50 nm and lengths of several microns. Utilizing magnetic soft X-ray nanotomography, we achieve reconstructions of 3D magnetic domain patterns at approximately 30 nm spatial resolution. This approach provides detailed information on both the orientation and magnitude of magnetization within the film. Our results reveal that interfacial anisotropy in the Co/Pd multilayers drives the magnetization toward the local surface normal. In contrast to typical labyrinth domains observed in planar films, the presence of curved nanowires significantly alters the domain structure, with domains preferentially aligning along the nanowire axis in close proximity, while adopting random orientations farther away. We report direct experimental observation of a curvature-induced Dzyaloshinskii-Moriya interaction (DMI), which is quantified to be approximately one-third of the intrinsic DMI in Co/Pd stacks. The curvature induced DMI enhances stability of Néel-type domain walls. These experimental observations are further supported by micromagnetic simulations. Altogether, our findings demonstrate that introducing curvature into magnetic nanostructures provides a powerful strategy for tailoring complex magnetic behaviors, paving the way for the design of advanced 3D racetrack memory and neuromorphic computing devices.

Raftrey, David↗

A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets

We present a new lock-free parallel algorithm for computing betweenness centralityof massive small-world networks. With minor changes to the data structures, ouralgorithm also achieves better spatial cache locality compared to previous approaches. Betweenness centrality is a key algorithm kernel in HPCS SSCA#2, a benchmark extensively used to evaluate the performance of emerging high-performance computing architectures for graph-theoretic computations. We design optimized implementations of betweenness centrality and the SSCA#2 benchmark for two hardware multithreaded systems: a Cray XMT system with the Threadstorm processor, and a single-socket Sun multicore server with the UltraSPARC T2 processor. For a small-world network of 134 million vertices and 1.073 billion edges, the 16-processor XMT system and the 8-core Sun Fire T5120 server achieve TEPS scores (an algorithmic performance count for the SSCA#2 benchmark) of 160 million and 90 million respectively, which corresponds to more than a 2X performance improvement over the previous parallel implementations. To better characterize the performance of these multithreaded systems, we correlate the SSCA#2 performance results with data from the memory-intensive STREAM and RandomAccess benchmarks. Finally, we demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for a large-scale IMDb movie-actor network.

97 MATHEMATICS AND COMPUTING↗

Analyzing and modeling the kinetics of amyloid beta pores associated with Alzheimer’s disease pathology

Amyloid beta (Aβ) oligomers associated with Alzheimer’s disease (AD) form Ca 2+ -permeable plasma membrane pores, leading to a disruption of the otherwise well-controlled intracellular calcium (Ca 2+ ) homeostasis. The resultant up-regulation of intracellular Ca 2+ concentration has detrimental implications for memory formation and cell survival. The gating kinetics and Ca 2+ permeability of Aβ pores are not well understood. We have used computational modeling in conjunction with the ability of optical patch-clamping for massively parallel imaging of Ca 2+ flux through thousands of pores in the cell membrane of Xenopus oocytes to elucidate the kinetic properties of Aβ pores. The fluorescence time-series data from individual pores were idealized and used to develop data-driven Markov chain models for the kinetics of the Aβ pore at different stages of its evolution. Our study provides the first demonstration of developing Markov chain models for ion channel gating that are driven by optical-patch clamp data with the advantage of experiments being performed under close to physiological conditions. As a result, we demonstrate the up-regulation of gating of various Ca 2+ release channels due to Aβ pores and show that the extent and spatial range of such up-regulation increases as Aβ pores with low open probability and Ca 2+ permeability transition into those with high open probability and Ca 2+ permeability.

59 BASIC BIOLOGICAL SCIENCES↗

Three-dimensional high-content imaging of unstained soft tissue with subcellular resolution using a laboratory-based X-ray microscope

With increasing interest in studying biological systems across spatial scales—from centimeters down to nanometers—histology continues to be the gold standard for tissue imaging at cellular resolution, providing an essential bridge between macroscopic and nanoscopic analysis. However, its inherently destructive and two-dimensional nature limits its ability to capture the full three-dimensional complexity of tissue architecture. Here, we show that phase-contrast X-ray microscopy can enable three-dimensional virtual histology with subcellular resolution. This technique provides direct quantification of electron density without restrictive assumptions, allowing for direct characterization of cellular nuclei in a standard laboratory setting. By combining high spatial resolution and soft tissue contrast, with automated segmentation of cell nuclei, we demonstrated virtual Hematoxylin and Eosin (H&E) staining using machine learning-based style transfer, yielding volumetric datasets compatible with existing histopathological analysis tools. Furthermore, by integrating electron density and the sensitivity to nanometric features of the dark field contrast channel, we achieve stain-free, high-content imaging capable of distinguishing nuclei and extracellular matrix.

3D virtual histology↗

An in situ neutron diffraction study of anomalous superelasticity in a strain glass Ni 43 Fe 18 Ga 27 Co 12 alloy

Superelastic behavior is traditionally related to the martensitic transition with a collective transformation scenario in some shape memory alloys. A kind of quasi-linear superelasticity accompanied by a finite avalanche or confined martensitic transformation was recently found in some alloy systems with strain glass state. Here, an in situ neutron diffraction technique was used to study the deformation behavior in an Ni 43 Fe 18 Ga 27 Co 12 alloy with strain glass state in order to reveal the new intrinsic physical nature of the quasi-linear superelasticity. A significant modulus softening prior to the stress-induced martensitic transformation was observed during compression in the studied alloy, which is similar to the characteristics exhibited in the tweed precursor phenomena prior to temperature-induced martensitic transformation. Moreover, the diffraction peak broadening was further shown during the elastic stage of deformation for both single-crystal and polycrystalline samples, which mainly stems from the short-range fluctuation in the strain field inside each grain based on Williamson–Hall analysis. The authors believe that there exists a spatial heterogeneity in the modulus of the confined martensitic transformation alloy.

Zhang, Q. H.↗

Exact charge and energy conservation in implicit PIC with mapped computational meshes

This paper discusses a novel fully implicit formulation for a one-dimensional electrostatic particle-in-cell (PIC) plasma simulation approach. Unlike earlier implicit electrostatic PIC approaches (which are based on a linearized Vlasov Poisson formulation), ours is based on a nonlinearly converged Vlasov Amp re (VA) model. By iterating particles and fields to a tight nonlinear convergence tolerance, the approach features superior stability and accuracy properties, avoiding most of the accuracy pitfalls in earlier implicit PIC implementations. In particular, the formulation is stable against temporal (Courant Friedrichs Lewy) and spatial (aliasing) instabilities. It is charge- and energy-conserving to numerical round-off for arbitrary implicit time steps (unlike the earlier energy-conserving explicit PIC formulation, which only conserves energy in the limit of arbitrarily small time steps). While momentum is not exactly conserved, errors are kept small by an adaptive particle sub-stepping orbit integrator, which is instrumental to prevent particle tunneling (a deleterious effect for long-term accuracy). The VA model is orbit-averaged along particle orbits to enforce an energy conservation theorem with particle sub-stepping. As a result, very large time steps, constrained only by the dynamical time scale of interest, are possible without accuracy loss. Algorithmically, the approach features a Jacobian-free Newton Krylov solver. A main development in this study is the nonlinear elimination of the new-time particle variables (positions and velocities). Such nonlinear elimination, which we term particle enslavement, results in a nonlinear formulation with memory requirements comparable to those of a fluid computation, and affords us substantial freedom in regards to the particle orbit integrator. Numerical examples are presented that demonstrate the advertised properties of the scheme. In particular, long-time ion acoustic wave simulations show that numerical accuracy does not degrade even with very large implicit time steps, and that significant CPU gains are possible.

Chen, Guangye↗

A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets

We present a new lock-free parallel algorithm for computing betweenness centrality of massive small-world networks. With minor changes to the data structures, our algorithm also achieves better spatial cache locality compared to previous approaches. Betweenness centrality is a key algorithm kernel in the HPCS SSCA#2 Graph Analysis benchmark, which has been extensively used to evaluate the performance of emerging high-performance computing architectures for graph-theoretic computations. We design optimized implementations of betweenness centrality and the SSCA#2 benchmark for two hardware multithreaded systems: a Cray XMT system with the ThreadStorm processor, and a single-socket Sun multicore server with the UltraSparc T2 processor. For a small-world network of 134 million vertices and 1.073 billion edges, the 16-processor XMT system and the 8-core Sun Fire T5120 server achieve TEPS scores (an algorithmic performance count for the SSCA#2 benchmark) of 160 million and 90 million respectively, which corresponds to more than a 2X performance improvement over the previous parallel implementations. To better characterize the performance of these multithreaded systems, we correlate the SSCA#2 performance results with data from the memory-intensive STREAM and RandomAccess benchmarks. Finally, we demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for a large-scale IMDb movie-actor network.

architecture comparison↗

Energy-Charge-conserving, Implicit, Electrostatic Particle-in-Cell Algorithm

This paper discusses a novel fully implicit formulation for a one-dimensional electrostatic particle-in-cell (PIC) plasma simulation approach. Unlike earlier implicit electrostatic PIC approaches (which are based on a linearized Vlasov-Poisson formulation), ours is based on a nonlinearly converged Vlasov-Ampere (VA) model. By iterating particles and fields to a tight nonlinear convergence tolerance, the approach features superior stability and accuracy properties, avoiding most of the accuracy pitfalls in earlier implicit PIC implementations. In particular, the formulation is stable against temporal (Courant-Friedrichs-Lewy) and spatial (aliasing) instabilities. It is charge- and energy-conserving to numerical round-off for arbitrary implicit time steps (unlike the earlier ''energy-conserving'' explicit PIC formulation, which only conserves energy in the limit of arbitrarily small time steps). While momentum is not exactly conserved, errors are kept small by an adaptive particle sub-stepping orbit integrator, which is instrumental to prevent particle tunneling (a deleterious effect for long-term accuracy). The VA model is orbit-averaged along particle orbits to enforce an energy conservation theorem with particle sub-stepping. As a result, very large time steps, constrained only by the dynamical time scale of interest, are possible without accuracy loss. Algorithmically, the approach features a Jacobian-free Newton-Krylov solver. A main development in this study is the nonlinear elimination of the new-time particle variables (positions and velocities). Such nonlinear elimination, which we term particle enslavement, results in a nonlinear formulation with memory requirements comparable to those of a fluid computation, and affords us substantial freedom in regards to the particle orbit integrator. Numerical examples are presented that demonstrate the advertised properties of the scheme. In particular, long-time ion acoustic wave simulations show that numerical accuracy does not degrade even with very large implicit time steps, and that significant CPU gains are possible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Filled Elastomers: Mechanistic and Physics-Driven Modeling and Applications as Smart Materials

Elastomers are made of chain-like molecules to form networks that can sustain large deformation. Rubbers are thermosetting elastomers that are obtained from irreversible curing reactions. Curing reactions create permanent bonds between the molecular chains. On the other hand, thermoplastic elastomers do not need curing reactions. Incorporation of appropriated filler particles, as has been practiced for decades, can significantly enhance mechanical properties of elastomers. However, there are fundamental questions about polymer matrix composites (PMCs) that still elude complete understanding. This is because the macroscopic properties of PMCs depend not only on the overall volume fraction (ϕ) of the filler particles, but also on their spatial distribution (i.e., primary, secondary, and tertiary structure). This work aims at reviewing how the mechanical properties of PMCs are related to the microstructure of filler particles and to the interaction between filler particles and polymer matrices. Overall, soft rubbery matrices dictate the elasticity/hyperelasticity of the PMCs while the reinforcement involves polymer–particle interactions that can significantly influence the mechanical properties of the polymer matrix interface. For ϕ values higher than a threshold, percolation of the filler particles can lead to significant reinforcement. While viscoelastic behavior may be attributed to the soft rubbery component, inelastic behaviors like the Mullins and Payne effects are highly correlated to the microstructures of the polymer matrix and the filler particles, as well as that of the polymer–particle interface. Additionally, the incorporation of specific filler particles within intelligently designed polymer systems has been shown to yield a variety of functional and responsive materials, commonly termed smart materials. We review three types of smart PMCs, i.e., magnetoelastic (M-), shape-memory (SM-), and self-healing (SH-) PMCs, and discuss the constitutive models for these smart materials.

36 MATERIALS SCIENCE↗

A cell-centered AMR-ALE framework for 3D multi-material hydrodynamics. Part I: Lagrangian and indirect Euler AMR algorithms

Many applications of physics and engineering involve wide ranges of time and spatial scales. The numerical simulation of localized small scales such as shock waves and material interfaces requires a large number of computational cells in these regions. For these applications, Lagrangian and Arbitrary-Lagrangian-Eulerian (ALE) related methods are engaging since the moving mesh feature naturally brings mesh cells on shock discontinuities and material interfaces are carefully captured. In addition, Adaptive-Mesh-Refinement (AMR) strategies aim to optimize computational resources by concentrating finer mesh cells only in areas of interest while using coarser cells elsewhere. A key but challenging AMR requirement consists in efficiently distributing the computational effort to achieve high accuracy without the prohibitive computational costs associated with uniformly fine grids. Here, in this document, the coupling of the p4est AMR library with a cell-centered Lagrangian scheme is presented with the goal to perform reliable 3D Lagrangian-AMR and indirect Euler-AMR multi-material simulations. In particular, it is shown that starting from a 3D indirect ALE code, the memory management and load balancing requirements can be delegated to an external library (here the p4est library) to unlock ALE-AMR capabilities. First, we present a strategy to transcribe the octant-based connectivity of the 3D AMR framework with that of an unstructured mesh of polygonal cells used in Lagrangian hydrodynamics. Then, we show how refinement and coarsening operations must be adapted to the particular Lagrangian framework to ensure the conservation of volume during those steps. Finally, several numerical test cases are presented that demonstrate the capabilities of the Lagrangian-AMR and indirect Euler-AMR algorithms.

3D cell-centered Lagrangian numerical scheme↗

Unconventional ferroelectricity in moiré heterostructures

Although all matter is composed of component particles, these particles can arrange themselves in various ways, giving rise to emergent phenomena that can be surprisingly rich and often cannot be understood by studying only the individual constituents. Discovering and understanding novel forms of emergence in quantum materials, especially in those where multiple degrees of freedom or energy scales are delicately balanced, is of great fundamental interest to condensed matter research. In this work, we report on the surprising observation of emergent ferroelectricity in graphene-based moiré heterostructures. Ferroelectric materials exhibit an electrically-switchable electric dipole, which is usually formed by spatial separation between the averaged centers of positive and negative charge within the unit cell. Based on this, it is difficult to imagine graphene, a material composed only of carbon atoms, exhibiting ferroelectricity. However, in this work, we indeed realize switchable ferroelectricity in Bernal-stacked bilayer graphene sandwiched between two hexagonal boron nitride (BN) layers. By introducing a moiré superlattice potential (via aligning bilayer graphene with the top and/or bottom BN crystals), we observe prominent and robust hysteretic behavior of the graphene resistance with an externally applied out-of-plane displacement field. Our systematic transport measurements reveal rich and striking response as a function of displacement field and electron filling, not previously observed in any 2D systems, and beyond the framework of conventional ferroelectrics. We further directly probe the ferroelectric polarization through a nonlocal monolayer graphene sensor. Our results suggest an unconventional, odd parity electronic ordering in the bilayer graphene/BN moiré system. This emergent moiré ferroelectricity may pave the way for ultrafast, programmable, and atomically thin carbon-based memory devices.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Physics-informed latent neural operator for real-time predictions of time-dependent parametric PDEs

Deep operator network (DeepONet) has shown significant promise as surrogate models for systems governed by partial differential equations (PDEs), enabling accurate mappings between infinite-dimensional function spaces. However, when applied to systems with high-dimensional input-output mappings arising from large numbers of spatial and temporal collocation points, these models often require heavily overparameterized networks, leading to long training times. Latent DeepONet addresses some of these challenges by introducing a two-step approach: first learning a reduced latent space using a separate model, followed by operator learning within this latent space. While efficient, this method is inherently data-driven and lacks mechanisms for incorporating physical laws, limiting its robustness and generalizability in data-scarce settings. Here, in this work, we propose PI-Latent-NO, a physics-informed latent neural operator framework that integrates governing physics directly into the learning process. Our architecture features two coupled DeepONets trained end-to-end: a Latent-DeepONet that learns a low-dimensional representation of the solution, and a Reconstruction-DeepONet that maps this latent representation back to the physical space. By embedding PDE constraints into the training via automatic differentiation, our method eliminates the need for labeled training data and ensures physics-consistent predictions. The proposed framework is both memory and compute-efficient, exhibiting near-constant scaling with problem size and demonstrating significant speedups over traditional physics-informed operator models. We validate our approach on a range of parametric PDEs, showcasing its accuracy, scalability, and suitability for real-time prediction in complex physical systems.

Latent representations↗