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 127 records · Page 7

Unitarization from geometry

We study the perturbative unitarity of scattering amplitudes in general dimensional reductions of Yang–Mills theories and general relativity on closed internal manifolds. For the tree amplitudes of the dimensionally reduced theory to have the expected high-energy behavior of the higher-dimensional theory, the masses and cubic couplings of the Kaluza–Klein states must satisfy certain sum rules that ensure there are nontrivial cancellations between Feynman diagrams. These sum rules give constraints on the spectra and triple overlap integrals of eigenfunctions of Laplacian operators on the internal manifold and can be proven directly using Hodge and eigenfunction decompositions. One consequence of these constraints is that there is an upper bound on the ratio of consecutive eigenvalues of the scalar Laplacian on closed Ricci-flat manifolds with special holonomy. This gives a sharp bound on the allowed gaps between Kaluza–Klein excitations of the graviton that also applies to Calabi–Yau compactifications of string theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The maximum relaxation time of a random walk

In this paper, we show the minimum spectral gap of the normalized Laplacian over all simple, connected graphs on n vertices is ( 1 + o ( 1 ) ) 54 n 3 . This minimum is achieved asymptotically by a double kite graph. Consequently, this leads to sharp upper bounds for the maximum relaxation time of a random walk, settling a conjecture of Aldous and Fill. We also improve an eigenvalue–diameter inequality by giving a new lower bound for the spectral gap of the normalized Laplacian. Finally, this eigenvalue lower bound is asymptotically best possible.

97 MATHEMATICS AND COMPUTING↗

A matrix-free hyperviscosity formulation for high-order ALE hydrodynamics

The numerical approximation of compressible hydrodynamics is at the core of high-energy density (HED) multiphysics simulations as shocks are the driving force in experiments like inertial confinement fusion (ICF). In this work, we describe our extension of the hyperviscosity technique, originally developed for shock treatment in finite difference simulations, for use in arbitrarily high-order finite element methods for Lagrangian hydrodynamics. Hyperviscosity enables shock capturing while preserving the high-order properties of the underlying discretization away from the shock region. Specifically, we compute a high-order term based on a product of the mesh length scale to a high power scaled by a hyper-Laplacian operator applied to a scalar field. We then form the total artificial viscosity by taking a non-linear blend of this term and a traditional artificial viscosity term. We also present a matrix-free formulation for computing the finite element based hyper-Laplacian operator. Such matrix-free methods have superior performance characteristics compared to traditional full matrix assembly approaches and offer advantages for GPU based HPC hardware. We demonstrate the numerical convergence of our method and its application to complex, multi-material ALE simulations on high-order (curved) meshes.

97 MATHEMATICS AND COMPUTING↗

Distributed and communication-efficient solutions to linear equations with special sparse structure

In this paper we report two distributed and communication-efficient algorithms based on the multi-agent system are proposed to solve a system of linear equations with the Laplacian sparse system matrix. One algorithm is based on the gradient descent method in optimization. In this algorithm, the agents only share partial information instead of all of their collective state vectors to save significant communication. The other algorithm is obtained by approximating Newton’s method for a faster convergence rate. Although it requires twice as much communication as the first one, it is still communication-efficient given the low dimension of the information shared among agents. The convergence at a linear rate is proved for both algorithms, and a comprehensive comparison of their convergence rate, communication burden, and computation costs is also performed. The proposed algorithms can be applied to various systems to solve those problems that can be modeled as a system of linear equations with a Laplacian sparse system matrix. Simulation results with the electric power system illustrate their effectiveness.

42 ENGINEERING↗

A new classification scheme of plastic wastes based upon recycling labels

Highlights: • PET, HPDE or PP types of plastics are considered. • An automated classification of plastic bottles based on the feature extraction and classification methods is performed. • The decision mechanism consists of PCA, Kernel PCA, FLDA, SVD and Laplacian Eigenmaps methods. • SVM is selected to achieve the classification task and majority voting technique is used. - Abstract: Since recycling of materials is widely assumed to be environmentally and economically beneficial, reliable sorting and processing of waste packaging materials such as plastics is very important for recycling with high efficiency. An automated system that can quickly categorize these materials is certainly needed for obtaining maximum classification while maintaining high throughput. In this paper, first of all, the photographs of the plastic bottles have been taken and several preprocessing steps were carried out. The first preprocessing step is to extract the plastic area of a bottle from the background. Then, the morphological image operations are implemented. These operations are edge detection, noise removal, hole removing, image enhancement, and image segmentation. These morphological operations can be generally defined in terms of the combinations of erosion and dilation. The effect of bottle color as well as label are eliminated using these operations. Secondly, the pixel-wise intensity values of the plastic bottle images have been used together with the most popular subspace and statistical feature extraction methods to construct the feature vectors in this study. Only three types of plastics are considered due to higher existence ratio of them than the other plastic types in the world. The decision mechanism consists of five different feature extraction methods including as Principal Component Analysis (PCA), Kernel PCA (KPCA), Fisher’s Linear Discriminant Analysis (FLDA), Singular Value Decomposition (SVD) and Laplacian Eigenmaps (LEMAP) and uses a simple experimental setup with a camera and homogenous backlighting. Due to the giving global solution for a classification problem, Support Vector Machine (SVM) is selected to achieve the classification task and majority voting technique is used as the decision mechanism. This technique equally weights each classification result and assigns the given plastic object to the class that the most classification results agree on. The proposed classification scheme provides high accuracy rate, and also it is able to run in real-time applications. It can automatically classify the plastic bottle types with approximately 90% recognition accuracy. Besides this, the proposed methodology yields approximately 96% classification rate for the separation of PET or non-PET plastic types. It also gives 92% accuracy for the categorization of non-PET plastic types into HPDE or PP.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Ionic versus metallic bonding in Al n Na m and Al n Mg m (m ≤ 3, n + m ≤ 15) clusters

First principles electronic structure studies on the ground state geometries, stability, and the electronic structure of Al n Na m and Al n Mg m (m ≤ 3, n + m ≤ 15) clusters have been carried out to examine the nature of bonding between Na or Mg and Al. Identifying whether the bonding is ionic or metallic in bulk materials is typically straightforward; however, in small clusters where quantum confinement is important, the nature of bonding may become unclear. Here, we have performed a critical analysis of the bonding in these bimetallic clusters using charge analysis, electrical dipole moments, hybridization of the atomic orbitals, the Laplacian of the charge density at the bond critical points, and the change in the bonding energy between neutral and anionic forms of the cluster. For Na n Al m clusters, we find that the Na binding is primarily ionic, while the bonding in Al n Mg m is primarily metallic. We find that the Mulliken population of the 3 p orbital of Na and Mg can provide a rapid assessment of the nature of bonding. We also find that the Hirshfeld charge and dipole moments are effective indicators, when placed in context. We found that the Laplacian of the charge density at the bond critical points can be misleading in identifying whether the bonding is ionic or metallic in small clusters.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Oscillatory Spreading and Inertia in Power Grids

The increase in variable renewable generators (VRGs) in power systems has altered the dynamics from a historical experience. VRGs introduce new sources of power oscillations, and the stabilizing response provided by synchronous generators (SGs, e.g., natural gas, coal, etc.), which help avoid some power fluctuations, will lessen as VRGs replace SGs. These changes have led to the need for new methods and metrics to quickly assess the likely oscillatory behavior for a particular network without performing computationally expensive simulations. This work studies the impact of a critical dynamical parameter - the inertia value - on the rest of a power system's oscillatory response to representative VRG perturbations. We use a known localization metric in a novel way to quantify the number of nodes responding to a perturbation and the magnitude of those responses. This metric allows us to relate the spread and severity of a system's power oscillations with inertia. We find that as inertia increases, the system response to node perturbations transitions from localized (only a few close nodes respond) to delocalized (many nodes across the network respond). We introduce a heuristic computed from the network Laplacian to relate this oscillatory transition to the network structure. We show that our heuristic accurately describes the spread of oscillations for a realistic power-system test case. Using a heuristic to determine the likely oscillatory behavior of a system given a set of parameters has wide applicability in power systems, and it could decrease the computational workload of planning and operation.

dynamical systems↗

Spatially enhanced electric field induced second harmonic (SEEFISH) generation for measurements of electric field distributions in high-pressure plasmas

Abstract The spatial resolution of the ps electric field induced second harmonic (EFISH) generation has been enhanced by using non-collinear pump laser beam arrangements. The pump laser beam (1064 nm, nominal pulse duration 150 ps, pulse energy 20–40 mJ) is separated into two coaxial or crossing beams, overlapping only near the focal point. The spatially enhanced EFISH (SEEFISH) signal is generated over a shorter beam overlap region compared to the collinear beam arrangement. Blocking of either of the two beams results in a complete suppression of the signal. The signal is spatially isolated from the ‘conventional’ EFISH signal and measured by a photomultiplier detector. Measurements of a known Laplacian field generated between two parallel cylinder electrodes in ambient air shows that SEEFISH improves the spatial resolution of the measurements by up to a factor of 2, such that the measurement results agree with the Laplacian field distribution. The spatial resolution is improved further by reducing the focal distance of the lens. The magnitude of the SEEFISH signal is significantly lower compared to that of the single-beam EFISH and decreases rapidly as the beam crossing angle is increased, due to the phase mismatch. This approach has a significant potential for measurements of electric field distributions in high-pressure plasmas, with an additional benefit of removing the stray second harmonic signal from the optical access windows.

Physics↗

Gaps labeling theorem for the bubble-diamond self-similar graphs

Abstract Motivated by the appearance of fractals in several areas of physics, especially in solid state physics and the physics of aperiodic order, and in other sciences, including the quantum information theory, we present a detailed spectral analysis for a new class of fractal-type diamond graphs, referred to as bubble-diamond graphs, and provide a gap-labeling theorem in the sense of Bellissard for the corresponding probabilistic graph Laplacians using the technique of spectral decimation. Labeling the gaps in the Cantor set by the normalized eigenvalue counting function, also known as the integrated density of states, we describe the gap labels as orbits of a second dynamical system that reflects the branching parameter of the bubble construction and the decimation structure. The spectrum of the natural Laplacian on limit graphs is shown generically to be pure point supported on a Cantor set, though one particular graph has a mixture of pure point and singularly continuous components.

Physics↗

Automorphic spectra and the conformal bootstrap

We describe a new method for constraining Laplacian spectra of hyperbolic surfaces and 2-orbifolds. The main ingredient is consistency of the spectral decomposition of integrals of products of four automorphic forms. Using a combination of representation theory of PSL 2 (R) and semidefinite programming, the method yields rigorous upper bounds on the Laplacian spectral gap. In several examples, the bound is nearly sharp. For instance, our bound on all genus-2 surfaces is λ 1 ≤ 3.8388976481, while the Bolza surface has λ 1 ≈ 3.838887258. The bounds also allow us to determine the set of spectral gaps attained by all hyperbolic 2-orbifolds. Our methods can be generalized to higher-dimensional hyperbolic manifolds and to yield stronger bounds in the two-dimensional case. The ideas were closely inspired by modern conformal bootstrap.

Kravchuk, Petr↗

Gapped lineon and fracton models on graphs

We introduce a $\mathbb{Z}_N$ stabilizer code that can be defined on any spatial lattice of the form $\Gamma\times C_{L_z}$, where $\Gamma$ is a general graph. We also present the low-energy limit of this stabilizer code as a Euclidean lattice action, which we refer to as the anisotropic $\mathbb{Z}_N$ Laplacian model. It is gapped, robust (i.e., stable under small deformations), and has lineons. Its ground state degeneracy (GSD) is expressed in terms of a "mod $N$-reduction" of the Jacobian group of the graph $\Gamma$. In the special case when space is an $L\times L\times L_z$ cubic lattice, the logarithm of the GSD depends on $L$ in an erratic way and grows no faster than $O(L)$. Furthermore, we also discuss another gapped model, the $\mathbb{Z}_N$ Laplacian model, which can be defined on any graph. It has fractons and a similarly strange GSD.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Isotropic model of fractional transport in two-dimensional bounded domains

A two-dimensional fractional Laplacian operator is derived and used to model nonlocal, nondiffusive transport. This integro-differential operator appears in the long-wavelength, fluid description of quantities undergoing non-Brownian random walks without characteristic length scale. To study bounded domains, a mask function is introduced that modifies the kernel in the fractional Laplacian and removes singularities at the boundary. Green's function solutions to the fractional diffusion equation are presented for the unbounded domain and compared to the one-dimensional Cartesian approximations. A time-implicit numerical integration scheme is presented to study fractional diffusion in a circular disk with azimuthal symmetry. Numerical studies of steady-state reveal temperature profiles in which the heat flux and temperature gradient are in the same direction, i.e., uphill transport. The response to off-axis heating, scaling of confinement time with system size, and propagation of cold pulses are investigated.

ADVECTION-DISPERSION EQUATIONS↗

Structural Impact of Grid-Forming Inverters on Power System Coherency

This paper addresses the following fundamental research question: how does the integration of grid-forming inverters (GFMs) replacing conventional synchronous generators (SGs) impact the slow coherent eigen-structure and the low frequency oscillatory behavior of future power systems? Due to time-scale separated dynamics, generator states inside a coherent area synchronize over a fast time-scale due to stronger coupling, while the areas themselves synchronize over a slower time scale. Our mathematical analysis shows that due to the large-scale integration of GFMs, the weighted Laplacian structure of the frequency dynamics is preserved, however, the entries of the Laplacian may be significantly modified based on the location and penetration levels of the GFMs. This can impact and potentially significantly alter the coherency structure of the system. We have validated our findings with numerical results using the IEEE 68-bus test system.

Mukherjee, Sayak [BATTELLE (PACIFIC NW LAB)]↗

Reduced-Order Models of Static Power Grids based on Spectral Clustering

For large-scale interconnected power systems that cover large geographical areas, certain electrical studies are required so that appropriate decisions ensure system reliability and low cost. For such studies, it is often neither practical nor necessary to model in detail the entire power system, which is increasingly complex due to a more diverse range of grid assets to choose from in both short and long-term planning. The goal of this paper is to present a methodology to reduce the order of large-scale power networks based on spectral graph theory given that current methods for static network reduction are not scalable. A brief analysis of some spectral clustering properties to determine which graph Laplacian matrix should be used and why is included. The analysis shows that the utilization of the normalized graph Laplacian is more advantageous for clustering purposes. Techniques are proposed to approximate cost functions for the aggregated generators. This is done via linear regression. The reduced-order model obtained with the proposed methodology has an accuracy above 94% and solves the scalability issue commonly present in other reduction methods. If the utilization of the reduced-order model is either constrained to load levels above mid-peak demand, or cost functions of aggregated units are approximated via a piecewise quadratic approach, then the error distribution is in the order of 10^-3. .

Baquedano-Aguilar, Mario D.↗

A Performance and Energy Study of GPU-Resident Preconditioners for Conjugate Gradient Solvers: In the Context of Existing and Novel Approaches

Optimizing a particular subprogram out of the set of Basic (sparse) Linear Algebra Subprograms (BLAS) for a given architecture is a common topic of research. In applications, however, these BLAS functions rarely appear in isolation; usually, many of them are used together, in various combinations and with varying inputs. As the need to solve a large, sparse linear system is ubiquitous throughout HPC applications, linear solvers constitute a realistic, sufficiently complex and well-defined representative use case for composite BLAS routines. To this end, based on a representative set of matrices drawn from a diverse set of fields, we present a framework to study, from the performance and energy perspective, the efficacy of GPU- resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process. The development of this preconditioner was motivated by solving large graph Laplacian linear systems, for which the existing preconditioners either perform slow on GPU-based platforms or are not applicable. We compare the performance of these preconditioners on different hardware accelerator architectures, i.e., AMD MI250X, MI100, Nvidia A100, V100, and Jetson. Our experiments reveal performance trade-offs and provide information on how to select the best strategy for the given linear system, dictated by its properties, and the platform of interest. We demonstrate the application of our novel preconditioner for solving CG and graph Laplacian systems. Overall, the framework can be utilized as a benchmark to guide informed decisions in choosing a specific preconditioner, i.e., whether it is better to rely on the performance of a triangular solver or on the performance of sparse matrix-vector product. Finally, by considering power consumption to solve the linear systems, we report the energy footprint for the solvers.

Preconditioned Conjugate Gradient, GPUs, iterative↗

Graph Sparsification by Approximate matrix Multiplication

Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.

97 MATHEMATICS AND COMPUTING↗

Spatial–spectral Schroedinger embedding for target detection in hyperspectral imagery

In this work, the Schroedinger eigenmaps (SE) algorithm using spatial and spectral information has been applied to supervised classification of hyperspectral imagery (HSI). We have previously introduced the use of SE in spectral target detection problems. The original SE-based target detector was built on the spectral information encoded in the Laplacian and Schroedinger operators. The original SE-based detector is extended such that spatial connectivity of target-like pixels is explored and encoded into the Schroedinger operator using a “knowledge propagation” scheme. The modified SE-based detector is applied to two HSI data sets that share similar target materials. Receiver operating characteristic curves and rates of detection and false alarm at object level are used as quantitative metrics to assess the detector. In addition, the Schroedinger embedding performance in target detection is compared against the performances of principal component embedding and the Laplacian embedding. Finally, results show that the SE-based detector with spatial–spectral features outperforms the other considered approaches.

36 MATERIALS SCIENCE↗

SU-E-J-261: The Importance of Appropriate Image Preprocessing to Augment the Information of Radiomics Image Features

Purpose: To investigate how different image preprocessing techniques, their parameters, and the different boundary handling techniques can augment the information of features and improve feature’s differentiating capability. Methods: Twenty-seven NSCLC patients with a solid tumor volume and no visually obvious necrotic regions in the simulation CT images were identified. Fourteen of these patients had a necrotic region visible in their pre-treatment PET images (necrosis group), and thirteen had no visible necrotic region in the pre-treatment PET images (non-necrosis group). We investigated how image preprocessing can impact the ability of radiomics image features extracted from the CT to differentiate between two groups. It is expected the histogram in the necrosis group is more negatively skewed, and the uniformity from the necrosis group is less. Therefore, we analyzed two first order features, skewness and uniformity, on the image inside the GTV in the intensity range [−20HU, 180HU] under the combination of several image preprocessing techniques: (1) applying the isotropic Gaussian or anisotropic diffusion smoothing filter with a range of parameter(Gaussian smoothing: size=11, sigma=0:0.1:2.3; anisotropic smoothing: iteration=4, kappa=0:10:110); (2) applying the boundaryadapted Laplacian filter; and (3) applying the adaptive upper threshold for the intensity range. A 2-tailed T-test was used to evaluate the differentiating capability of CT features on pre-treatment PT necrosis. Result: Without any preprocessing, no differences in either skewness or uniformity were observed between two groups. After applying appropriate Gaussian filters (sigma>=1.3) or anisotropic filters(kappa >=60) with the adaptive upper threshold, skewness was significantly more negative in the necrosis group(p<0.05). By applying the boundary-adapted Laplacian filtering after the appropriate Gaussian filters (0.5 <=sigma<=1.1) or anisotropic filters(20<=kappa <=50), the uniformity was significantly lower in the necrosis group (p<0.05). Conclusion: Appropriate selection of image preprocessing techniques allows radiomics features to extract more useful information and thereby improve prediction models based on these features.

60 APPLIED LIFE SCIENCES↗