Search NASA⌕ Search

SEARCH · Search NASA

Results for “Laplacian”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

A conservative, consistent, and scalable meshfree mimetic method

Mimetic methods discretize divergence by restricting the Gauss theorem to mesh cells. Because point clouds lack such geometric entities, construction of a compatible meshfree divergence remains a challenge. In this work, we define an abstract Meshfree Mimetic Divergence (MMD) operator on point clouds by contraction of field and virtual face moments. This MMD satisfies a discrete divergence theorem, provides a discrete local conservation principle, and is first-order accurate. We consider two MMD instantiations. The first one assumes a background mesh and uses generalized moving least squares (GMLS) to obtain the necessary field and face moments. This MMD instance is appropriate for settings where a mesh is available but its quality is insufficient for a robust and accurate mesh-based discretization. The second MMD operator retains the GMLS field moments but defines virtual face moments using computationally efficient weighted graph-Laplacian equations. This MMD instance does not require a background grid and is appropriate for applications where mesh generation creates a computational bottleneck. It allows one to trade an expensive mesh generation problem for a scalable algebraic one, without sacrificing compatibility with the divergence operator. We demonstrate the approach by using the MMD operator to obtain a virtual finite-volume discretization of conservation laws on point clouds. Finally, numerical results in the paper confirm the mimetic properties of the method and show that it behaves similarly to standard finite volume methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Solution of the Schrödinger equation for quasi-one-dimensional materials using helical waves

We formulate and implement a spectral method for solving the Schrödinger equation, as it applies to quasi-one-dimensional materials and structures. This allows for computation of the electronic structure of important technological materials such as nanotubes (of arbitrary chirality), nanowires, nanoribbons, chiral nanoassemblies, nanosprings and nanocoils, in an accurate, efficient and systematic manner. Our work is motivated by the observation that one of the most successful methods for carrying out electronic structure calculations of bulk/crystalline systems — the plane-wave method — is a spectral method based on eigenfunction expansion. Our scheme avoids computationally onerous approximations involving periodic supercells often employed in conventional plane-wave calculations of quasi-one-dimensional materials, and also overcomes several limitations of other discretization strategies, e.g., those based on finite differences and atomic orbitals. The basis functions in our method — called helical waves (or twisted waves) — are eigenfunctions of the Laplacian with symmetry adapted boundary conditions, and are expressible in terms of plane waves and Bessel functions in helical coordinates. We describe the setup of fast transforms to carry out discretization of the governing equations using our basis set, and the use of matrix-free iterative diagonalization to obtain the electronic eigenstates. Miscellaneous computational details, including the choice of eigensolvers, use of a preconditioning scheme, evaluation of oscillatory radial integrals and the imposition of a kinetic energy cutoff are discussed. We have implemented these strategies into a computational package called HelicES (Helical Electronic Structure). We demonstrate the utility of our method in carrying out systematic electronic structure calculations of various quasi-one-dimensional materials through numerous examples involving nanotubes, nanoribbons and nanowires. We also explore the convergence properties of our method, and assess its accuracy and computational efficiency by comparison against reference finite difference, transfer matrix method and plane-wave results. We anticipate that our method will find applications in computational nanomechanics and multiscale modeling, for carrying out transport calculations of interest to the field of semiconductor devices, and for the discovery of novel chiral phases of matter that are of relevance to the burgeoning quantum hardware industry.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Understanding of three different polyvinylpyrrolidone (PVP) based battery binders blends on graphene surfaces from first principles via DFT simulations

Binders play a crucial role in binding electrodes, current collectors, and conductive agents during battery manufacturing. The selection of the binders and their blends considerably affect various properties such as mechanical durability, adhesion performance, ionic/electronic conductivities, and solid electrolyte interface stability for lithium-ion batteries. In this work, polyvinylidene di-fluoride (PVDF), polyacrylic acid (PAA), polyvinylpyrrolidone (PVP), and lithiated polyacrylic acid (Li-PAA) were selected as the model binders, and their blends were studied on graphene surfaces. Further, among them, PVDF is hardly soluble in water unlike the other binders, so in practice, the blend of PVP:PVDF is not thought to be a proper combination. However, the PVP:PVDF binder has also been included because the purpose of this work is to calculate several electronic properties such as binding energies, intermolecular interaction energies, bond critical points, electron density, and the Laplacian of electron density at critical bonding regions of all these blends at the molecular level via density functional theory (DFT) simulations in order to evaluate and compare how is the interaction strength and bonding type of three different lithium-ion batteries (LIBs) binder blends on graphene surfaces. Most stable binder pairs and their binding mechanisms on graphene surfaces were studied. The delocalization of lithium in Li-PAA was studied with the presence of water.

25 ENERGY STORAGE↗
DOE OSTI2022

Monitoring and flaw detection during wire-based directed energy deposition using in-situ acoustic sensing and wavelet graph signal analysis

The goal of this work is to detect flaw formation in the wire-based directed energy deposition (W-DED) process using in-situ sensor data. The W-DED studied in this work is analogous to metal inert gas electric arc welding. The adoption of W-DED in industry is limited because the process is susceptible to stochastic and environmental disturbances that cause instabilities in the electric arc, eventually leading to flaw formation, such as porosity and suboptimal geometric integrity. Moreover, due to the large size of W-DED parts, it is difficult to detect flaws post-process using non-destructive techniques, such as X-ray computed tomography. Accordingly, the objective of this work is to detect flaw formation in W-DED parts using data acquired from an acoustic (sound) sensor installed near the electric arc. To realize this objective, we develop and apply a novel wavelet integrated graph theory approach. The approach extracts a single feature called graph Laplacian Fiedler number from the noise-contaminated acoustic sensor data, which is subsequently tracked in a statistical control chart. Using this approach, the onset of various types of flaws are detected with a false alarm rate less-than 2%. This work demonstrates the potential of using advanced data analytics for in-situ monitoring of W-DED.

42 ENGINEERING↗
DOE OSTI2021

Machine learning based rate optimization under geologic uncertainty

We propose a novel approach for rate optimization during a waterflood under geologic uncertainty in reservoir properties such as permeability and porosity. The traditional approach typically involves several runs of the forward simulator. This may not scale well when the optimization is to be performed at the full field-level and over multiple geologic realizations. A machine-learning (ML) based approach which is quick and scalable for rate optimization over multiple geologic realizations is proposed instead. The training data for the model is generated by running the forward simulator with randomly assigned well rates using multiple geologic realizations. A reduced order representation of the permeability heterogeneity in each of the realizations is derived using a grid connectivity transformation (GCT). This step involves finding basis functions corresponding to the different modal frequencies of the grid connectivity represented by the grid Laplacian. The projection of the heterogeneous property field along these basis functions gives the basis coefficients that form the reduced order representation. Subsequently, for each training datapoint, streamlines are traced and the minimum time of flight (TOF) representing the tracer breakthrough time at each producer is recorded. The basis coefficients and well rates are fed to a machine learning model as input and the minimum TOF at the producers forms the output of the model. This trained model can then be used along with an optimizer for computing the optimal injection rates to maximize the injection sweep efficiency. This corresponds to minimizing the variance in the minimum TOF within each well group. Different architectures of neural network are tested using 5-fold cross validation to decide the best ML model to compute the streamline time of flight. The trained model is used to perform well rate optimization over multiple realizations of geology by using a risk tolerance penalty. The optimal well rates thus obtained are compared with two cases: a) equal well rates assigned to all injectors and producers and b) well rates obtained by optimizing over a single realization without considering the uncertainty in geology. The optimal well rates are seen to offer better oil recovery and sweep efficiency than both cases.

02 PETROLEUM↗
DOE OSTI2022

Facile alignment estimation in carbon nanotube films using image processing

Whether a macroscopic assembly of carbon nanotubes can exhibit the one-dimensional properties expected from individual nanotubes critically depends on how well the nanotubes are aligned inside the assembly. Therefore, a simple and accurate method for assessing the degree of alignment is desired for the rapid characterization of carbon nanotube films and fibers. Here, we present an end-to-end solution for determining the global and local spatial orientation of carbon nanotubes in films within a short amount of time using a fast, precise, and economical approach based on an image processing method applied to scanning electron microscopy images. Further, we first use Laplacian edge enhancement filtering for improving the appearance of edge regions, which is followed by image partitioning into multiple blocks to capture the nanoscale orientation characteristics and total variation-based image decomposition of these image blocks. We then perform a 2D-fast Fourier transform on the image decomposed textural components of these edge-enhanced image blocks to determine the orientation distribution, which is utilized to estimate the 2D nematic order parameter. To show the effectiveness of our method, we corroborated our results against results obtained with other state-of-the-art image processing and experimental techniques.

2D-FFT↗
DOE OSTI2020

Graph interpolating activation improves both natural and robust accuracies in data-efficient deep learning

Improving the accuracy and robustness of deep neural nets (DNNs) and adapting them to small training data are primary tasks in deep learning (DL) research. In this paper, we replace the output activation function of DNNs, typically the data-agnostic softmax function, with a graph Laplacian-based high-dimensional interpolating function which, in the continuum limit, converges to the solution of a Laplace–Beltrami equation on a high-dimensional manifold. Furthermore, we propose end-to-end training and testing algorithms for this new architecture. The proposed DNN with graph interpolating activation integrates the advantages of both deep learning and manifold learning. Compared to the conventional DNNs with the softmax function as output activation, the new framework demonstrates the following major advantages: First, it is better applicable to data-efficient learning in which we train high capacity DNNs without using a large number of training data. Second, it remarkably improves both natural accuracy on the clean images and robust accuracy on the adversarial images crafted by both white-box and black-box adversarial attacks. Third, it is a natural choice for semi-supervised learning. This paper is a significant extension of our earlier work published in NeurIPS, 2018. For reproducibility, the code is available at https://github.com/BaoWangMath/DNN-DataDependentActivation .

Mathematics↗
DOE OSTI2022

A deterministic gradient-based approach to avoid saddle points

Abstract Loss functions with a large number of saddle points are one of the major obstacles for training modern machine learning (ML) models efficiently. First-order methods such as gradient descent (GD) are usually the methods of choice for training ML models. However, these methods converge to saddle points for certain choices of initial guesses. In this paper, we propose a modification of the recently proposed Laplacian smoothing gradient descent (LSGD) [Osher et al., arXiv:1806.06317 ], called modified LSGD (mLSGD), and demonstrate its potential to avoid saddle points without sacrificing the convergence rate. Our analysis is based on the attraction region, formed by all starting points for which the considered numerical scheme converges to a saddle point. We investigate the attraction region’s dimension both analytically and numerically. For a canonical class of quadratic functions, we show that the dimension of the attraction region for mLSGD is $\lfloor (n-1)/2\rfloor$ , and hence it is significantly smaller than that of GD whose dimension is $n-1$ .

Mathematics↗
DOE OSTI2025

Symmetrization of Strong Hydrogen Bond under High Pressure in Bihydroxide-Ion-Containing NaCu 2 (SO 4 ) 2 ·H 3 O 2 Revealed by Experimental Charge Density, Single-Crystal Electron Diffraction, and Neutron Diffraction Studies

In minerals and inorganic compounds, strong hydrogen bonding can lead to the formation of complex ionic species such as the H 3 O 2 – bihydroxide anion and Zundel cation H 5 O 2 + . We studied [NaCu 2 (SO 4 ) 2 ·H 3 O 2 ] natrochalcite, which contains bihydroxide anions and undergoes hydrogen bond symmetrization at the lowest pressure reported so far among inorganic compounds. Hydrogen bond symmetrization leads to changes in the bulk modulus, seismic wave velocities, and proton mobility and plays a primary role in high-temperature superconductivity, but its characteristics are not well understood due to a lack of systematic studies and limitations of experimental methods sensitive to this subtle change. In this work, we applied experimental charge density analysis based on in situ single-crystal X-ray diffraction data, along with the single-crystal neutron and electron diffraction experiments, to probe the behavior of hydrogen atoms during the hydrogen bond symmetrization process under high-pressure conditions. On the way to the symmetrical H-bonding, natrochalcite undergoes a series of complex redistributions of electron density, which we trace with multipole refinement and detailed analysis of changes in the Laplacian of electron density values. Additionally, we deconvoluted the equation of state (volume of the unit cell vs pressure relation) into the atomic equation of states describing dependencies of atomic charges or volumes vs pressure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Suppressed Daytime Convection Over the Amazon River

We investigated the interaction between surface conditions and precipitating convection by comparing the Amazon River against the surrounding forest. Despite similar synoptic conditions within a few tens of kilometers, the river surface is substantially cooler than the surrounding forest during the day and warmer at night. We analyzed 20 years of high-resolution satellite precipitation data and confirmed previous findings of daytime rainfall reduction over the river for the whole Amazon Basin. The percentage reduction is strongest during the dry-to-wet transition season. In addition, the percentage reduction of individual tributary is significantly correlated with the Laplacian of surface temperature, which causes thermally driven surface divergence and suppresses local convection. Additionally, nighttime rainfall is enhanced over tributaries near the Atlantic coast during the wet season. A regional climate model then simulates the local rainfall anomalies associated with the river. Above the river, moisture diverges near the surface and converges above the surface before the daytime rainfall, partially driven by the horizontal gradient of humidity. Unlike the river, moisture convergence within the boundary layer is more critical for the rainfall above the forest region. Our studies suggest that strong thermal contrast can be important in deriving heterogeneous convection in moist tropical regions.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Surface Variability Mapping and Roughness Analysis of the Moon Using a Coarse–Graining Decomposition

The lunar surface contains a wide variety of topographic shapes and features, each with different distributions and scales, and any analysis technique to objectively measure roughness must respect these qualities. Coarse-graining is a naturally scale-dependent filtering technique that preserves scale-dependent symmetries and produces coarse elevation maps that gradually erase the smaller features from the original topography. In this study of the lunar surface, we present two surface variability metrics obtained from coarse-graining lunar topography: fine elevation and coarse curvature. Both metrics are isotropic, deterministic, slope-independent, and coordinate-agnostic. Fine (detrended) elevation is acquired by subtracting the coarse elevation from the original topography and contains features that are smaller than the coarse-graining length-scale. Coarse curvature is the Laplacian of coarsened topography, and naturally quantifies the curvature at any scale and indicates whether a location is elevated or depressed relative to its neighborhood at that scale. We find that highlands and maria have distinct roughness characteristics at all length-scales. Our topographic spectra reveal four scale-breaks that mark characteristic shifts in surface roughness: 100, 300, 1,000, and 4,000 km. Comparing fine elevation distributions between maria and highlands, we show that maria fine elevation is biased toward smaller-magnitude elevations and that the maria–highland discrepancies are more pronounced at larger length-scales. Here, we also provide local examples of selected regions to demonstrate that these metrics can successfully distinguish geological features of different length-scales.

58 GEOSCIENCES↗
DOE OSTI2022

SIMILE enables alignment of tandem mass spectra with statistical significance

Abstract Interrelating small molecules according to their aligned fragmentation spectra is central to tandem mass spectrometry-based untargeted metabolomics. Current alignment algorithms do not provide statistical significance and compounds that have multiple delocalized structural differences and therefore often fail to have their fragment ions aligned. Here we align fragmentation spectra with both statistical significance and allowance for multiple chemical differences using Significant Interrelation of MS/MS Ions via Laplacian Embedding (SIMILE). SIMILE yields spectral alignment inferred structural connections in molecular networks that are not found with cosine-based scoring algorithms. In addition, it is now possible to rank spectral alignments based on p-values in the exploration of structural relationships between compounds and enhance the chemical connectivity that can be obtained with molecular networking.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Quantum computing and preconditioners for hydrological linear systems

Modeling hydrological fracture networks is a hallmark challenge in computational earth sciences. Accurately predicting critical features of fracture systems, e.g. percolation, can require solving large linear systems far beyond current or future high performance capabilities. Quantum computers can theoretically bypass the memory and speed constraints faced by classical approaches, however several technical issues must first be addressed. Chief amongst these difficulties is that such systems are often ill-conditioned, i.e. small changes in the system can produce large changes in the solution, which can slow down the performance of linear solving algorithms. We test several existing quantum techniques to improve the condition number, but find they are insufficient. We then introduce the inverse Laplacian preconditioner, which improves the scaling of the condition number of the system from O(N) to O($\sqrt{N}$) and admits a quantum implementation. These results are a critical first step in developing a quantum solver for fracture systems, both advancing the state of hydrological modeling and providing a novel real-world application for quantum linear systems algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators

It is widely known that neural networks (NNs) are universal approximators of continuous functions. However, a less known but powerful result is that a NN with a single hidden layer can accurately approximate any nonlinear continuous operator. This universal approximation theorem of operators is suggestive of the structure and potential of deep neural networks (DNNs) in learning continuous operators or complex systems from streams of scattered data. Here, in this work, we thus extend this theorem to DNNs. We design a new network with small generalization error, the deep operator network (DeepONet), which consists of a DNN for encoding the discrete input function space (branch net) and another DNN for encoding the domain of the output functions (trunk net). We demonstrate that DeepONet can learn various explicit operators, such as integrals and fractional Laplacians, as well as implicit operators that represent deterministic and stochastic differential equations. We study different formulations of the input function space and its effect on the generalization error for 16 different diverse applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Physics-based reward driven image analysis in microscopy

The rise of electron microscopy has expanded our ability to acquire nanometer and atomically resolved images of complex materials. The resulting vast datasets are typically analyzed by human operators, an intrinsically challenging process due to the multiple possible analysis steps and the corresponding need to build and optimize complex analysis workflows. We present a methodology based on the concept of a Reward Function coupled with Bayesian Optimization, to optimize image analysis workflows dynamically. The Reward Function is engineered to closely align with the experimental objectives and broader context and is quantifiable upon completion of the analysis. Here, cross-section, high-angle annular dark field (HAADF) images of ion-irradiated (Y, Dy)Ba 2 Cu 3 O 7–δ thin-films were used as a model system. The reward functions were formed based on the expected materials density and atomic spacings and used to drive multi-objective optimization of the classical Laplacian-of-Gaussian (LoG) method. These results can be benchmarked against the DCNN segmentation. This optimized LoG* compares favorably against DCNN in the presence of the additional noise. We further extend the reward function approach towards the identification of partially-disordered regions, creating a physics-driven reward function and action space of high-dimensional clustering. We pose that with correct definition, the reward function approach allows real-time optimization of complex analysis workflows at much higher speeds and lower computational costs than classical DCNN-based inference, ensuring the attainment of results that are both precise and aligned with the human-defined objectives.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Maximum entropy distributions of dark matter in ΛCDM cosmology

Context. Small-scale challenges to ΛCDM cosmology require a deeper understanding of dark matter physics. Aims. This paper aims to develop the maximum entropy distributions for dark matter particle velocity (denoted by X ), speed (denoted by Z ), and energy (denoted by E ) that are especially relevant on small scales where system approaches full virialization. Methods. For systems involving long-range interactions, a spectrum of halos of different sizes is required to form to maximize system entropy. While the velocity in halos can be Gaussian, the velocity distribution throughout the entire system, involving all halos of different sizes, is non-Gaussian. With the virial theorem for mechanical equilibrium, we applied the maximum entropy principle to the statistical equilibrium of entire system, such that the maximum entropy distribution of velocity (the X distribution) could be analytically derived. The halo mass function was not required in this formulation, but it did indeed result from the maximum entropy. Results. The predicted X distribution involves a shape parameter α and a velocity scale, v 0 . The shape parameter α reflects the nature of force ( α → 0 for long-range force or α → ∞ for short-range force). Therefore, the distribution approaches Laplacian with α → 0 and Gaussian with α → ∞. For an intermediate value of α , the distribution naturally exhibits a Gaussian core for v ≪ v 0 and exponential wings for v ≫ v 0 , as confirmed by N -body simulations. From this distribution, the mean particle energy of all dark matter particles with a given speed, v , follows a parabolic scaling for low speeds (∝ v 2 for v ≪ v 0 in halo core region, i.e., “Newtonian”) and a linear scaling for high speeds (∝ v for v ≫ v 0 in halo outskirt, i.e., exhibiting “non-Newtonian” behavior due to long-range gravity). We compared our results against N -body simulations and found a good agreement.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Filling data analysis gaps in time-resolved crystallography by machine learning

There is a growing understanding of the structural dynamics of biological molecules fueled by x-ray crystallography experiments. Time-resolved serial femtosecond crystallography (TR-SFX) with x-ray Free Electron Lasers allows the measurement of ultrafast structural changes in proteins. Nevertheless, this technique comes with some limitations. One major challenge is the quality of data from TR-SFX measurements, which often faces issues like data sparsity, partial recording of Bragg reflections, timing errors, and pixel noise. To overcome these difficulties, conventionally, large volumes of data are collected and grouped into a few temporal bins. The data in each bin are then averaged and paired with the mean of their corresponding jittered timestamps. This procedure provides one structure per bin, resulting in a limited number of averaged structures for the entire time interval spanned by the experiment. Therefore, the information on ultrafast structural dynamics at high temporal resolution is lost. This has initiated research for advanced methods of analyzing experimental TR-SFX data beyond the standard binning and averaging method. To address this problem, we use a machine learning algorithm called Nonlinear Laplacian Spectral Analysis (NLSA), which has emerged as a promising technique for studying the dynamics of complex systems. In this work, we demonstrate the power of this algorithm using synthetic x-ray diffraction snapshots from a protein with significant data incompleteness, timing uncertainties, and noise. Our study confirms that NLSA is a suitable approach that effectively mitigates the effects of these artifacts in TR-SFX data and recovers accurate structural dynamics information hidden in such data.

Trujillo, Justin (ORCID:0000000285505360)↗
DOE OSTI2020

The concept of spin ice graphs and a field theory for their charges

Originally detected in rare earth pyrochlores, spin ice physics is now being artificially extended to a variety of geometries that control collective behavior and exotic properties, making graph theory their proper framework. We relate spin ice notions, such as ice rule, ice manifold, Coulomb phases, charges, and monopoles, to graph-theoretical notions, such as balance, in/out-degrees, and Euler paths. We then propose a field-theoretical treatment in which topological charges and monopoles are the degrees of freedom, while the binary spins are subsumed in an entropic interaction among charges. We show that for a spin ice on a graph in a Gaussian approximation, the kernel of the entropic interaction is the inverse of the graph Laplacian, and we compute screening functions from the graph spectra as Green operators for the screened Poisson problem on a graph. We then apply the treatment to star graphs, tournaments, cycles, and regular spin ice in different dimensions. Our aim is twofold: to set spin ice physics in a proper graph setting, where only topological rather than geometrical notions hold, and to invite graph theorists to contribute their powerful tools to the field of spin ice.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗