Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

Unifying Combinatorial and Graphical Methods in Artificial Intelligence

Recently, a new graph Laplacian, called the inner product Laplacian, was introduced which generalizes many existing Laplacians, including the normalized and combinatorial Laplacian and their weighted variants. The key observation behind the inner product Laplacian is that by defining appropriate inner product spaces on the vertices and edges, the standard Laplacians can be recovered as Hodge Laplacians over the simplicial complex formed by the edges and vertices. These inner product spaces form a natural way to incorporate non-combinatorial information into the definition of a domain-specific Laplacian. In particular, in contrast to current domain-specific weighting schemes which rely solely on edge weights, information regarding the similarity of non-adjacent vertices and arbitrary pairs of edges can be effectively incorporated into the Laplacian. In order to illustrate this approach we consider the problem of calculating the potential energy of an atomistic configuration using Graph Neural Networks. In comparison with start-of-the-art approaches, such as SchNet, our approach replaces a learned (via auto-encoder) representation of the atom types with an inner product space on atoms based on scientific knowledge (e.g., electronegativity). We will illustrate how this approach captures key chemical properties of the molecules and compare the energy calculations with state-of-the-art neural network approaches. However, to compute the resulting Laplacian involves a mixture of sparse and dense matrix computation and yields a dense matrix as the basis for the graph convolution. This dense convolutional kernel necessitates moving away from the standard message passing framework for graph neural networks and increases the computational cost of applying the kernel. In order to mitigate these costs we investigate means of leveraging the mixed sparse and dense computations to reduce the overall computational cost and how these approaches can be automatically transferred to energy efficient hardware (e.g., field programmable gate arrays (FPGAs)).

97 MATHEMATICS AND COMPUTING↗

Bounds on spectral gaps of Hyperbolic spin surfaces

We describe a method for constraining Laplacian and Dirac spectra of two dimensional compact orientable hyperbolic spin manifolds and orbifolds. The key ingredient is an infinite family of identities satisfied by the spectra. These spectral identities follow from the consistency between 1) the spectral decomposition of functions on the spin bundle into irreducible representations of SL(2,R) and 2) associativity of pointwise multiplication of functions. Applying semidefinite programming methods to our identities produces rigorous upper bounds on the Laplacian spectral gap as well as on the Dirac spectral gap conditioned on the former. In several examples, our bounds are nearly sharp; a numerical algorithm based on the Selberg trace formula shows that the [0;3,3,5] orbifold, a particular surface with signature [1;3], and the Bolza surface nearly saturate the bounds at genus 0, 1 and 2 respectively. Under additional assumptions on the number of harmonic spinors carried by the spin-surface, we obtain more restrictive bounds on the Laplacian spectral gap. In particular, these bounds apply to hyperelliptic surfaces. We also determine the set of Laplacian spectral gaps attained by all compact orientable two-dimensional hyperbolic spin orbifolds. We show that this set is upper bounded by 12.13798; this bound is nearly saturated by the [0;3,3,5] orbifold, whose first non-zero Laplacian eigenvalue is λ^(0)_1 ≈ 12.13623.

Spectral theory↗

Bootstrap AMG for spectral clustering

Graph Laplacian is a popular tool for analyzing graphs, particularly in graph partitioning and clustering. Given a notion of similarity (via an adjacency matrix), graph clustering refers to identifying different groups such that vertices in the same group are more similar compared to vertices across different groups. Data clustering can be reformulated in terms of a graph clustering problem when the given set of data is represented as a graph, also known as similarity graph. In this context, eigenvectors of the graph Laplacian are often used to obtain a new geometric representation of the original data set that generally enhances cluster properties and improves cluster detection. Here, we apply a bootstrap algebraic multigrid (AMG) method that constructs a set of vectors associated with the graph Laplacian. These vectors, referred to as algebraically smooth ones, span a low-dimensional Euclidean space, which we use to represent the data, enabling cluster detection both in synthetic and in realistic well-clustered graphs. We show that, in the case of a good quality bootstrap AMG, the computed smooth vectors employed in the construction of the final AMG operator, which by construction is spectrally equivalent to the originally given graph Laplacian, accurately approximate the space in the lower portion of the spectrum of the preconditioned operator. Thus, our approach can be viewed as a spectral clustering technique associated with the generalized spectral problem (Laplace operator versus the final AMG operator), and hence, it can be seen as an extension of the classical spectral clustering that employs a standard eigenvalue problem.

97 MATHEMATICS AND COMPUTING↗

Mach's principle: Exact frame-dragging via gravitomagnetism in perturbed Friedmann-Robertson-Walker universes with K=({+-}1,0)

We show that there is exact dragging of the axis directions of local inertial frames by a weighted average of the cosmological energy currents via gravitomagnetism for all linear perturbations of all Friedmann-Robertson-Walker (FRW) universes and of Einstein's static closed universe, and for all energy-momentum-stress tensors and in the presence of a cosmological constant. This includes FRW universes arbitrarily close to the Milne Universe and the de Sitter universe. Hence the postulate formulated by Ernst Mach about the physical cause for the time-evolution of inertial axes is shown to hold in general relativity for linear perturbations of FRW universes. - The time-evolution of local inertial axes (relative to given local fiducial axes) is given experimentally by the precession angular velocity {omega}-vector{sub gyro} of local gyroscopes, which in turn gives the operational definition of the gravitomagnetic field: B-vector{sub g}{identical_to}-2{omega}-vector{sub gyro}. The gravitomagnetic field is caused by energy currents J-vector{sub {epsilon}} via the momentum constraint, Einstein's G{sup 0-}circumflex{sub i-circumflex} equation, (-{delta}+{mu}{sup 2})A-vector{sub g}=-16{pi}G{sub N}J-vector{sub {epsilon}} with B-vector{sub g}=curl A-vector{sub g}. This equation is analogous to Ampere's law, but it holds for all time-dependent situations. {delta} is the de Rham-Hodge Laplacian, and {delta}=-curl curl for the vorticity sector in Riemannian 3-space. - In the solution for an open universe the 1/r{sup 2}-force of Ampere is replaced by a Yukawa force Y{sub {mu}}(r)=(-d/dr)[(1/R)exp(-{mu}r)], form-identical for FRW backgrounds with K=(-1,0). Here r is the measured geodesic distance from the gyroscope to the cosmological source, and 2{pi}R is the measured circumference of the sphere centered at the gyroscope and going through the source point. The scale of the exponential cutoff is the H-dot radius, where H is the Hubble rate, dot is the derivative with respect to cosmic time, and {mu}{sup 2}=-4(dH/dt). Analogous results hold in closed FRW universes and in Einstein's closed static universe.--We list six fundamental tests for the principle formulated by Mach: all of them are explicitly fulfilled by our solutions.--We show that only energy currents in the toroidal vorticity sector with l=1 can affect the precession of gyroscopes. We show that the harmonic decomposition of toroidal vorticity fields in terms of vector spherical harmonics X-vector{sub lm}{sup -} has radial functions which are form-identical for the 3-sphere, the hyperbolic 3-space, and Euclidean 3-space, and are form-identical with the spherical Bessel-, Neumann-, and Hankel functions. - The Appendix gives the de Rham-Hodge Laplacian on vorticity fields in Riemannian 3-spaces by equations connecting the calculus of differential forms with the curl notation. We also give the derivation the Weitzenboeck formula for the difference between the de Rham-Hodge Laplacian {delta} and the ''rough'' Laplacian {nabla}{sup 2} on vector fields.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Protection Against Graph-Based False Data Injection Attacks on Power Systems

Graph signal processing (GSP) has emerged as a powerful tool for practical network applications, including power system monitoring. By representing power system voltages as smooth graph signals, recent research has focused on developing GSP-based methods for state estimation, attack detection, and topology identification. Included, efficient methods have been developed for detecting false data injection (FDI) attacks, which until now were perceived as non-smooth with respect to the graph Laplacian matrix. Consequently, these methods may not be effective against smooth FDI attacks. In this paper, we propose a graph FDI (GFDI) attack that minimizes the Laplacian-based graph total variation (TV) under practical constraints. In addition, we develop a low-complexity algorithm that solves the non-convex GDFI attack optimization problem using ell_1-norm relaxation, the projected gradient descent (PGD) algorithm, and the alternating direction method of multipliers (ADMM). We then propose a protection scheme that identifies the minimal set of measurements necessary to constrain the GFDI output to high graph TV, thereby enabling its detection by existing GSP-based detectors. Our numerical simulations on the IEEE-57 bus test case reveal the potential threat posed by well-designed GSP-based FDI attacks. Moreover, we demonstrate that integrating the proposed protection design with GSP-based detection can lead to significant hardware cost savings compared to previous designs of protection methods against FDI attacks.

Morgenstern, Gal↗

Edge detection - Image-plane versus digital processing

To optimize edge detection with the familiar Laplacian-of-Gaussian operator, it has become common to implement this operator with a large digital convolution mask followed by some interpolation of the processed data to determine the zero crossings that locate edges. It is generally recognized that this large mask causes substantial blurring of fine detail. It is shown that the spatial detail can be improved by a factor of about four with either the Wiener-Laplacian-of-Gaussian filter or an image-plane processor. The Wiener-Laplacian-of-Gaussian filter minimizes the image-gathering degradations if the scene statistics are at least approximately known and also serves as an interpolator to determine the desired zero crossings directly. The image-plane processor forms the Laplacian-of-Gaussian response by properly combining the optical design of the image-gathering system with a minimal three-by-three lateral-inhibitory processing mask. This approach, which is suggested by Marr's model of early processing in human vision, also reduces data processing by about two orders of magnitude and data transmission by up to an order of magnitude.

Huck, Friedrich O.↗

Partitioning sparse matrices with eigenvectors of graphs

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Pothen, Alex↗

A Spectral Algorithm for Envelope Reduction of Sparse Matrices

The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope-reducing reordering is obtained by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. This Laplacian eigenvector solves a continuous relaxation of a discrete problem related to envelope minimization called the minimum 2-sum problem. The permutation vector computed by the spectral algorithm is a closest permutation vector to the specified Laplacian eigenvector. Numerical results show that the new reordering algorithm usually computes smaller envelope sizes than those obtained from the current standard algorithms such as Gibbs-Poole-Stockmeyer (GPS) or SPARSPAK reverse Cuthill-McKee (RCM), in some cases reducing the envelope by more than a factor of two.

Barnard, Stephen T.↗

An efficient reconstruction algorithm for differential phase-contrast tomographic images from a limited number of views

The main focus of this paper is reconstruction of tomographic phase-contrast image from a set of projections. We propose an efficient reconstruction algorithm for differential phase-contrast computed tomography that can considerably reduce the number of projections required for reconstruction. The key result underlying this research is a projection theorem that states that the second derivative of the projection set is linearly related to the Laplacian of the tomographic image. The proposed algorithm first reconstructs the Laplacian image of the phase-shift distribution from the second-derivative of the projections using total variation regularization. The second step is to obtain the phase-shift distribution by solving a Poisson equation whose source is the Laplacian image previously reconstructed under the Dirichlet condition. We demonstrate the efficacy of this algorithm using both synthetically generated simulation data and projection data acquired experimentally at a synchrotron. The experimental phase data were acquired from a human coronary artery specimen using dark-field-imaging optics pioneered by our group. Our results demonstrate that the proposed algorithm can reduce the number of projections to approximately 33% as compared with the conventional filtered backprojection method, without any detrimental effect on the image quality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral Bounds on Hyperbolic 3-Manifolds: Associativity and the Trace Formula

We constrain the low-energy spectra of Laplace operators on closed hyperbolic manifolds and orbifolds in three dimensions, including the standard Laplace--Beltrami operator on functions and the Laplacian on powers of the cotangent bundle. Our approach employs linear programming techniques to derive rigorous bounds by leveraging two types of spectral identities. The first type, inspired by the conformal bootstrap, arises from the consistency of the spectral decomposition of the product of Laplace eigensections, and involves the Laplacian spectra as well as integrals of triple products of eigensections. We formulate these conditions in the language of representation theory of PSL 2 (C) and use them to prove upper bounds on the first and second Laplacian eigenvalues. The second type of spectral identities follows from the Selberg trace formula. We use them to find upper bounds on the spectral gap of the Laplace--Beltrami operator on hyperbolic 3-orbifolds, as well as on the systole length of hyperbolic 3-manifolds, as a function of the volume. Further, we prove that the spectral gap λ 1 of the Laplace--Beltrami operator on all closed hyperbolic 3-manifolds satisfies λ 1 < 47.32. Along the way, we use the trace formula to estimate the low-energy spectra of a large set of example orbifolds and compare them with our general bounds, finding that the bounds are nearly sharp in several cases.

Bonifacio, James [University of Mississippi, MS (U↗

How Well Can the M06 Suite of Functionals Describe the Electron Densities of Ne, Ne 6+ , and Ne 8+ ?

The development of better approximations to the exact exchange-correlation functional is essential to the accuracy of density functionals. A recent study indicated that functionals with few parameters offer more accurate electron densities than recently developed many-parameter functionals for light closed-shell atomic systems. In this study, we calculated electron densities, their gradients, and Laplacians of Ne, Ne 6+ , and Ne 8+ using 19 electronic structure methods, and we compared them to the CCSD reference results. Two basis sets, namely, aug-cc-pωCV5Z and aug-cc-pV5Z, are utilized in the calculations. We found that the choice of basis set has a significant impact on the errors and rankings of some of the selected methods. The errors of electron densities, their gradients, and Laplacians calculated with the aug-cc-pV5Z basis set are substantially reduced, especially for Minnesota density functionals, as compared to the results using the aug-cc-pωCV5Z basis set (a larger basis set utilized in earlier work (Medvedev et al. Science2017, 355, 49–52)). The rankings of the M06 suite of functionals among the 19 methods are greatly improved with the aug-cc-pV5Z basis set. Furthermore, the performances of the HSE06, BMK, MN12-L, and MN12-SX functionals are also improved with the aug-cc-pV5Z basis set. The M06 suite of functionals is capable of providing accurate electron densities, gradients, and Laplacians using the aug-cc-pV5Z basis set, and thus it is suitable for a wide range of applications in chemistry and physics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An equivalent body surface charge model representing three-dimensional bioelectrical activity

A new surface-source model has been developed to account for the bioelectrical potential on the body surface. A single-layer surface-charge model on the body surface has been developed to equivalently represent bioelectrical sources inside the body. The boundary conditions on the body surface are discussed in relation to the surface-charge in a half-space conductive medium. The equivalent body surface-charge is shown to be proportional to the normal component of the electric field on the body surface just outside the body. The spatial resolution of the equivalent surface-charge distribution appears intermediate between those of the body surface potential distribution and the body surface Laplacian distribution. An analytic relationship between the equivalent surface-charge and the surface Laplacian of the potential was found for a half-space conductive medium. The effects of finite spatial sampling and noise on the reconstruction of the equivalent surface-charge were evaluated by computer simulations. It was found through computer simulations that the reconstruction of the equivalent body surface-charge from the body surface Laplacian distribution is very stable against noise and finite spatial sampling. The present results suggest that the equivalent body surface-charge model may provide an additional insight to our understanding of bioelectric phenomena.

NASA Discipline Regulatory Physiology↗