Search NASA⌕ Search

SEARCH · Search NASA

Results for “block errors”

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 91 records · Page 5

Super-resolution imaging reveals resistance to mass transfer in functionalized stationary phases

Chemical separations are costly in terms of energy, time, and money. Separation methods are optimized with inefficient trial-and-error approaches that lack insight into the molecular dynamics that lead to the success or failure of a separation and, hence, ways to improve the process. We perform super-resolution imaging of fluorescent analytes in five different commercial liquid chromatography materials. Unexpectedly, we observe that chemical functionalization can block more than 50% of the material’s porous interior, rendering it inaccessible to small-molecule analytes. Only in situ imaging unveils the inaccessibility when compared to the industry-accepted ex situ characterization methods. Selectively removing some of the functionalization with solvent restores pore access without substantially altering the single-molecule kinetics that underlie the separation and agree with bulk chromatography measurements. Our molecular results determine that commercial “fully porous” stationary phases are over-functionalized and provide an alternative avenue to characterize and direct separation material design from the bottom-up.

Science & Technology - Other Topics↗

Constraint energy minimizing generalized multiscale finite element method for multi-continuum Richards equations

In fluid flow simulation, the multi-continuum model is a useful strategy. When the heterogeneity and contrast of coefficients are high, the system becomes multiscale, and some kinds of reduced order methods are demanded. Combining these techniques with nonlinearity, we will consider in this paper a dual-continuum model which is generalized as a multi-continuum model for a coupled system of nonlinear Richards equations as unsaturated flows, in complex heterogeneous fractured porous media; and we will solve it by a novel multiscale approach utilizing the constraint energy minimizing generalized multiscale finite element method (CEM-GMsFEM). In particular, such a nonlinear system will be discretized in time and then linearized by Picard iteration (whose global convergence is proved theoretically). Subsequently, we tackle the resulting linearized equations by the CEM-GMsFEM and obtain proper offline multiscale basis functions to span the multiscale space (which contains the pressure solution). More specifically, we first introduce two new sources of samples, and the GMsFEM is used over each coarse block to build local auxiliary multiscale basis functions via solving local spectral problems, that are crucial for detecting high-contrast channels. Second, per oversampled coarse region, local multiscale basis functions are created through the CEM as constrainedly minimizing an energy functional. Various numerical tests for our approach reveal that the error converges with the coarse-grid size and that only few oversampling layers as well as basis functions are needed.

97 MATHEMATICS AND COMPUTING↗

Next generation Arctic vegetation maps: Aboveground plant biomass and woody dominance mapped at 30 m resolution across the tundra biome

The Arctic is warming faster than anywhere else on Earth, placing tundra ecosystems at the forefront of global climate change. Plant biomass is a fundamental ecosystem attribute that is sensitive to changes in climate, closely tied to ecological function, and crucial for constraining ecosystem carbon dynamics. However, the amount, functional composition, and distribution of plant biomass are only coarsely quantified across the Arctic. Therefore, we developed the first moderate resolution (30 m) maps of live aboveground plant biomass (g m −2 ) and woody plant dominance (%) for the Arctic tundra biome, including the mountainous Oro Arctic. We modeled biomass for the year 2020 using a new synthesis dataset of field biomass harvest measurements, Landsat satellite seasonal synthetic composites, ancillary geospatial data, and machine learning models. Additionally, we quantified pixel-wise uncertainty in biomass predictions using Monte Carlo simulations and validated the models using a robust, spatially blocked and nested cross-validation procedure. Observed plant and woody plant biomass values ranged from 0 to ∼6000 g m −2 (mean ≈ 350 g m −2 ), while predicted values ranged from 0 to ∼4000 g m −2 (mean ≈ 275 g m −2 ), resulting in model validation root-mean-squared-error (RMSE) ≈ 400 g m −2 and R 2 ≈ 0.6. Our maps not only capture large-scale patterns of plant biomass and woody plant dominance across the Arctic that are linked to climatic variation (e.g., thawing degree days), but also illustrate how fine-scale patterns are shaped by local surface hydrology, topography, and past disturbance. By providing data on plant biomass across Arctic tundra ecosystems at the highest resolution to date, our maps can significantly advance research and inform decision-making on topics ranging from Arctic vegetation monitoring and wildlife conservation to carbon accounting and land surface modeling.

Climate change↗

Adaptive mesh refinement in binary black holes simulations

Abstract We discuss refinement criteria for the Berger–Rigoutsos (block-based) refinement algorithm in our numerical relativity code GR-Athena++ in the context of binary black hole (BBH) merger simulations. We compare three different strategies: the ‘box-in-box’ approach, the ‘sphere-in-sphere’ approach and a local criterion for refinement based on the estimation of truncation error of the finite difference scheme. We extract and compare gravitational waveforms using the three different mesh refinement methods and compare their accuracy against a calibration waveform and demonstrate that the sphere-in-sphere approach provides the best strategy overall when considering computational cost and the waveform accuracy. Ultimately, we demonstrate the capability of each mesh refinement method in accurately simulating gravitational waves from BBH systems—a crucial aspect for their application in next-generation detectors. We quantify the mismatch achievable with the different strategies by extrapolating the gravitational wave mismatch to higher resolution.

Astronomy & Astrophysics↗

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗

FAIR Data and Interpretable AI Framework for Architectured Metamaterials (Final Report)

This research program established a transformative framework for the discovery and design of mechanical metamaterials, which are architected structures engineered to control physical phenomena like sound and vibration in ways natural materials cannot. To overcome the traditional reliance on trial-and-error, the project developed an interpretable Artificial Intelligence (AI) framework that moves beyond "black box" models to reveal the specific geometric patterns—such as "unit-cell templates"—that govern a material’s performance. A major breakthrough was the development of a hierarchical design method, which allows a single material to block vibrations across multiple frequency ranges simultaneously by layering patterns at different scales without them interfering with one another. This was further expanded to include irregular, graph-based designs that use spanning tree algorithms to ensure structural connectivity while allowing for customized, direction-dependent properties like stiffness and acoustic impedance. Beyond design, the project addressed the practicalities of real-world production by developing uncertainty quantification techniques that account for manufacturing defects and material variability, reducing the need for expensive physical testing by orders of magnitude. To speed up the discovery process, the team implemented Gaussian Process Regression and other surrogate models that provide accurate performance predictions at a fraction of the traditional computational cost. The AI-generated designs were successfully validated through fabrication of physical samples and wave propagation experiments, confirming their ability to accurately guide or reflect waves as predicted. By contributing these tools and high-quality FAIR benchmark datasets to the wider scientific community, this work provides a scalable foundation for advancing technologies in aerospace vibration control, medical imaging, and noise reduction.

36 MATERIALS SCIENCE↗

Deep material network via a quilting strategy: visualization for explainability and recursive training for improved accuracy

Recent developments integrating micromechanics and neural networks offer promising paths for rapid predictions of the response of heterogeneous materials with similar accuracy as direct numerical simulations. The deep material network is one such approaches, featuring a multi-layer network and micromechanics building blocks trained on anisotropic linear elastic properties. Once trained, the network acts as a reduced-order model, which can extrapolate the material’s behavior to more general constitutive laws, including nonlinear behaviors, without the need to be retrained. However, current training methods initialize network parameters randomly, incurring inevitable training and calibration errors. Here, we introduce a way to visualize the network parameters as an analogous unit cell and use this visualization to “quilt” patches of shallower networks to initialize deeper networks for a recursive training strategy. The result is an improvement in the accuracy and calibration performance of the network and an intuitive visual representation of the network for better explainability.

97 MATHEMATICS AND COMPUTING↗

The ITensor Software Library for Tensor Network Calculations

ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagrams, allowing users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The ITensor interface rules out common programming errors and enables rapid prototyping of algorithms. After discussing the philosophy behind the ITensor approach, we show examples of each part of the interface including Index objects, the ITensor product operator, tensor factorizations, tensor storage types, algorithms for matrix product state (MPS) and matrix product operator (MPO) tensor networks, quantum number conserving block sparse tensors, and the NDTensors library. We also review publications that have used ITensor for quantum many-body physics and for other areas where tensor networks are increasingly applied. To conclude we discuss promising features and optimizations to be added in the future.

Fishman, Matthew↗

Codebase release 0.3 for ITensor

ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagrams, allowing users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The ITensor interface rules out common programming errors and enables rapid prototyping of algorithms. After discussing the philosophy behind the ITensor approach, we show examples of each part of the interface including Index objects, the ITensor product operator, tensor factorizations, tensor storage types, algorithms for matrix product state (MPS) and matrix product operator (MPO) tensor networks, quantum number conserving block sparse tensors, and the NDTensors library. We also review publications that have used ITensor for quantum many-body physics and for other areas where tensor networks are increasingly applied. To conclude we discuss promising features and optimizations to be added in the future.

Fishman, Matthew↗

Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement

The standard LU factorization-based solution process for linear systems can be enhanced in speed or accuracy by employing mixed-precision iterative refinement. Most recent work has focused on dense systems. We investigate the potential of mixed-precision iterative refinement to enhance methods for sparse systems based on approximate sparse factorizations. In doing so, we first develop a new error analysis for LU- and GMRES-based iterative refinement under a general model of LU factorization that accounts for the approximation methods typically used by modern sparse solvers, such as low-rank approximations or relaxed pivoting strategies. We then provide a detailed performance analysis of both the execution time and memory consumption of different algorithms, based on a selected set of iterative refinement variants and approximate sparse factorizations. Our performance study uses the multifrontal solver MUMPS, which can exploit block low-rank factorization and static pivoting. We evaluate the performance of the algorithms on large, sparse problems coming from a variety of real-life and industrial applications showing that mixed-precision iterative refinement combined with approximate sparse factorization can lead to considerable reductions of both the time and memory consumption.

97 MATHEMATICS AND COMPUTING↗

Rolling Optimization of Transmission Network Recovery and Load Restoration Considering Hybrid Wind-Storage System and Cold Load Pickup

A common solution to deal with the stochasticity introduced by fast-ramping wind power integration is to equip wind farms (WFs) with energy storage systems (ESSs) to formulate hybrid WF-ESSs. In addition to leveling off wind power fluctuations during normal operations, a hybrid WF-ESS can be a flexible power source to accumulate the power system restoration. In this paper, we propose a rolling optimization model for transmission network recovery and load restoration considering the contributions of WF-ESSs. The proposed model is formulated as a mixed integer linear programming problem that simultaneously optimizes the amount and location of restorable load blocks as well as the restoration lines. The cold load pickup features of interrupted loads considering the outage duration are modeled in detail. A chance-constrained method is employed to deal with the uncertainty of wind power, and a rolling horizon-based framework is adopted to reduce the influence of forecast error. Case studies are conducted on both New England 39-bus system and part of a provincial power system in China. The results show that the load restoration process can be significantly accelerated by employing the proposed method and contributions of hybrid WF-ESSs to power system restoration are validated.

chance-constrained optimization↗

Toward Accurate Spin–Orbit Splittings from Relativistic Multireference Electronic Structure Theory

Most nonrelativistic electron correlation methods can be adapted to account for relativistic effects, as long as the relativistic molecular spinor integrals are available, from either a four-, two-, or one-component mean-field calculation. Furthermore, relativistic multireference correlation methods remain a relatively unexplored area, with mixed evidence regarding the improvements brought by perturbative treatments. We report, for the first time, the implementation of state-averaged four-component relativistic multireference perturbation theories to second and third order based on the driven similarity renormalization group (DSRG). With our methods, named 4c-SA-DSRG-MRPT2 and 3, we find that the dynamical correlation included on top of 4c-CASSCF references can significantly improve the spin-orbit splittings in p-block elements and potential energy surfaces when compared to 4c-CASSCF and 4c-CASPT2 results. We further show that 4c-DSRG-MRPT2 and 3 are applicable to these systems over a wide range of the flow parameter, with systematic improvement from second to third order in terms of both improved error statistics and reduced sensitivity with respect to the flow parameter.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Complexity of many-body interactions in transition metals via machine-learned force fields from the TM23 data set

Abstract This work examines challenges associated with the accuracy of machine-learned force fields (MLFFs) for bulk solid and liquid phases ofd-block elements. In exhaustive detail, we contrast the performance of force, energy, and stress predictions across the transition metals for two leading MLFF models: a kernel-based atomic cluster expansion method implemented using sparse Gaussian processes (FLARE), and an equivariant message-passing neural network (NequIP). Early transition metals present higher relative errors and are more difficult to learn relative to late platinum- and coinage-group elements, and this trend persists across model architectures. Trends in complexity of interatomic interactions for different metals are revealed via comparison of the performance of representations with different many-body order and angular resolution. Using arguments based on perturbation theory on the occupied and unoccupieddstates near the Fermi level, we determine that the large, sharpddensity of states both above and below the Fermi level in early transition metals leads to a more complex, harder-to-learn potential energy surface for these metals. Increasing the fictitious electronic temperature (smearing) modifies the angular sensitivity of forces and makes the early transition metal forces easier to learn. This work illustrates challenges in capturing intricate properties of metallic bonding with current leading MLFFs and provides a reference data set for transition metals, aimed at benchmarking the accuracy and improving the development of emerging machine-learned approximations.

Chemistry↗

An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations

We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fejér-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for simulating a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.

Novikau, I [Lawrence Livermore National Laboratory↗

Afterpulse correction for micro-pulse lidar to improve middle and upper tropospheric aerosol measurements

Micro-pulse lidar (MPL) measurements have been widely used in atmospheric research over the past few decades. However, the MPL afterpulse noise has a large impact on the MPL aerosol measurement in the middle and upper troposphere, and an effective correction method is still lacking. Here, a new afterpulse correction approach is presented by using measurements with low-level optically thick clouds to act as the lids blocking atmospheric signals beyond the clouds completely. Examples are provided to illustrate the effectiveness of this correction method. Using one-year 2014 MPL measurements at the U.S. Department of Energy Atmospheric Radiation Measurement (ARM) North Slope of Alaska (NSA) site, the impact of the correction on the aerosol measurements is quantified. The relative error (RE, %) of attenuated backscattering ratio (ABR) without the afterpulse correction is 30% and 190% at the height of 1.00 km and 9.00 km (AGL), and the RE is larger for weaker aerosol signals (ABR<2). The RE of linear depolarization ratio (LDR), which is significantly higher than that of ABR for a given aerosol layer, is highly non-linear above 3.00 km, with a value of 300%-900% for weak aerosols (ABR<2) above 3.00 km. Therefore, the afterpulse correction is critical for the middle and upper tropospheric aerosol observations. We demonstrated that our afterpulse correction can provide reasonable particle depolarization ratio (PDR) to properly identify dust aerosols. The newly developed method can be applied to long-term MPL measurements to support aerosol and mixed-phase/ice cloud interaction study at the NSA site.

54 ENVIRONMENTAL SCIENCES↗

Robust Decentralized Secondary Control Scheme for Inverter-based Power Networks

Inverter-dominated microgrids are quickly becoming a key building block of future power systems. They rely on centralized controllers that can provide reliability and resiliency in extreme events. Nonetheless, communication failures due to cyber-physical attacks or natural disasters can make autonomous operation of islanded microgrids challenging. This paper examines a unified decentralized secondary control scheme that is robust to inverter clock synchronization errors and can be seamlessly applied to grid-following or grid-forming control architectures. The proposed scheme overcomes the well-known stability problem that arises from parallel operation of local integral controllers. Theoretical guarantees for stability are provided along with criteria to appropriately tune the secondary control gains to achieve good frequency regulation performance while ensuring fair power sharing. The efficacy of our approach is demonstrated through simulations on a 5-bus microgrid with four grid-forming inverters.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Persistent Current Simulation for CCT Testing Magnet Used in EIC

The Electron-Ion Collider (EIC), a powerful new facility to be built in the United States at the U.S. Department of Energy's Brookhaven National Laboratory in collaboration with Thomas Jefferson National Accelerator Facility, will explore the most fundamental building blocks of nearly all visible matter. Here, there are many different types of superconducting magnets near the interaction region (IR) of EIC. Due to space constraints and special lattice requirements, Tapered CCT (canted-cosine theta) magnets have been used for EIC. At beam injection, the magnetic field is only ~5.5% of the maximum operating field. Considerable field errors will be generated from persistent current in superconducting strands even using very fine filament for those superconductors. A tapered CCT demonstrator magnet has been built and tested successfully at BNL since July 2020 to evaluate the key technologies for future tapered CCT magnets. In October 2023, BNL team also measured the persistent current in this demonstrator magnet. To validate the persistent current simulation methods for CCT magnets in EIC, this paper used a full 3D Opera Model and measured magnetization data from superconducting strand for the simulation. Simulation results showed reasonable agreement with recent measurement results.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Checkpoint triggering in a computer system

According to an aspect, a method for triggering creation of a checkpoint in a computer system includes executing a task in a processing node of the computer system. A monitoring block size is determined for the checkpoint. A checkpoint interval is determined based on the monitoring block size, a checkpoint bandwidth, and a failure rate of the computer system. Based on determining that the checkpoint interval has elapsed, the checkpoint including state data of the task is created to enable restarting execution of the task upon a restart operation. The state data of the checkpoint is restored from a memory responsive to detecting an error condition at the processing node. Execution of the task is restarted in the processing node based on the state data restored from the memory.

97 MATHEMATICS AND COMPUTING↗