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 109 records · Page 6

Dynamic Stability And Adaptive Control of Networked Evolving Formations with Weak Nonlinearities

The dynamic stability of formation geometry is vital to the design of large scale multiagent systems. In this paper, we probe into the structure of the formation system matrix using the Laplacian of a digraph to develop several fundamental theoretical results on the stability of formation geometry. Our key-results include the integration of the graph Laplacian into linear and weak-nonlinear relative dynamics, the development of several new coordinate transformations that expose the influence of the graph Laplacian matrix on the control laws of the agents, and the use of direct adaptive control as stability restoring devices. We also develop two fundamental results that provide upper bounds for stable formation evolution under nonlinear perturbations of agent dynamics. Finally, we use an illustrative example to demonstrate our theoretical findings.

Gehlot, Vinod P.↗

Error-Bounded Graph Construction for Semi-supervised Manifold Learning

Graphs are commonly used in semi-supervised learning to represent a manifold on which the data reside in a high-dimensional ambient space. The graph can then be utilized in different ways, typically via the Laplacian of the graph, in order to leverage associations among the unlabeled data to improve learning. One common way to leverage the graph Laplacian is as a regularization term, where models that would disagree with the graph are penalized. More often the spectrum of the graph Laplacian is used to find a lower dimensional embedding in which neighboring relations encoded via the graph are preserved. Most manifold-based methods of semi-supervised learning depend upon geometric structure in the ambient feature space in order to construct a graph whose edges encode similarity that should be useful in selecting a model. A critical assumption is that some standard measure of similarity applied to the ambient space can be used to construct a graph that is error-free or of low error, meaning that examples (i.e., vertices) from distinct classes are not connected. However, this assumption often precludes the use of such methods in noisy or complex feature spaces, even though such spaces often arise in problems that can most benefit from structure that might be uncovered within the unlabeled data. This paper presents a method of graph construction for manifold-based semi-supervised learning that respects the manifold assumptions underlying these methods and bounds the error on the graph itself, which then permits bounds on the overall generalization error of the learning algorithms without relying on assumptions that do not hold in many modern problem domains.

Symons, Christopher T↗

Commuting projections on graphs

For a given (connected) graph, we consider vector spaces of (discrete) functions defined on its vertices and its edges. These two spaces are related by a discrete gradient operator, Grad and its adjoint, ₋Div, referred to as (negative) discrete divergence. We also consider a coarse graph obtained by aggregation of vertices of the original one. Then a coarse vertex space is identified with the subspace of piecewise constant functions over the aggregates. We consider the ℓ 2 -projection Q H onto the space of these piecewise constants. In the present paper, our main result is the construction of a projection π H from the original edge-space onto a properly constructed coarse edge-space associated with the edges of the coarse graph. The projections π H and Q H commute with the discrete divergence operator, i.e., we have div π H = Q H div. The respective pair of coarse edge-space and coarse vertexspace offer the potential to construct two-level, and by recursion, multilevel methods for the mixed formulation of the graph Laplacian which utilizes the discrete divergence operator. The performance of one two-level method with overlapping Schwarz smoothing and correction based on the constructed coarse spaces for solving such mixed graph Laplacian systems is illustrated on a number of graph examples.

97 MATHEMATICS AND COMPUTING↗

Numerical aspects of spectral segmentation on polygonal grids

The authors analyze numerical behavior of the spectral graph partitioning problem arising in the Normalized Cuts formulation of the image segmentation problem on polygonal grids. They make an observation that in the presence of rounding errors the eigenvector corresponding to the k-th smallest eigenvalue of the generalized graph Laplacian should contain more than k nodal domains that represent coherent segments in the image. As the result, the eigenvector corresponding to the trivial solution carries a wealth of information about the nodal domains in the image and can be used as an initial guess for the Krylov subspace eigensolver, while the computed eigenvector subspace, corresponding to just a few of the lowest eigenvalues of the graph Laplacian, will contain sufficient information for obtaining meaningful segmentation.

97 MATHEMATICS AND COMPUTING↗

On the Characteristic Polynomial and Eigenvectors in Terms of the Tree-Like Structure of a Digraph

Regarding a square matrix as the adjacency matrix of a weighted digraph, we construct an extended digraph whose Laplacian contains the original matrix as a submatrix. This construction allows us to use known results on Laplacians to study arbitrary square matrices. The calculation of an eigenvector in a parametric form demonstrates a connection between its components and the tree-like structure of the digraph.

97 MATHEMATICS AND COMPUTING↗

Numerical simulations of chaotic and complex spatiotemporal patterns in fractional reaction–diffusion systems

The generalized fractional reaction–diffusion equations which exist in the form of noninteger order partial differential equations have now found wide application for illustrating important and useful physical phenomena, such as subdiffusive and superdiffusive scenarios. The space fractional derivatives are defined in the Riesz sense on the intervals 0 < α < 1 and 1 < α ≤ 2. We propose robust numerical techniques, such as a spectral representation of the fractional Laplacian operator in conjunction with the exponential time differencing method, and present the equivalent relationship between the Riesz fractional derivative and fractional Laplacian operator. We apply these techniques to numerically solve a range of chaotic processes, such as the Chua’s equations, Rössler system, Lorenz and Lorenz-type systems. Simulation results revealed various complex and spatiotemporal chaos, spiral chaos, intermittent chaos and spots patterns in two-dimensional space fractional reaction–diffusion problems.

97 MATHEMATICS AND COMPUTING↗

Discontinuity detection in multivariate space for stochastic simulations

Edge detection has traditionally been associated with detecting physical space jump discontinuities in one dimension, e.g. seismic signals, and two dimensions, e.g. digital images. Hence most of the research on edge detection algorithms is restricted to these contexts. High dimension edge detection can be of significant importance, however. For instance, stochastic variants of classical differential equations not only have variables in space/time dimensions, but additional dimensions are often introduced to the problem by the nature of the random inputs. The stochastic solutions to such problems sometimes contain discontinuities in the corresponding random space and a prior knowledge of jump locations can be very helpful in increasing the accuracy of the final solution. Traditional edge detection methods typically require uniform grid point distribution. They also often involve the computation of gradients and/or Laplacians, which can become very complicated to compute as the number of dimensions increases. The polynomial annihilation edge detection method, on the other hand, is more flexible in terms of its geometric specifications and is furthermore relatively easy to apply. This paper discusses the numerical implementation of the polynomial annihilation edge detection method to high dimensional functions that arise when solving stochastic partial differential equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A short proof of Weyl's law for fractional differential operators

We study spectral asymptotics for a large class of differential operators on an open subset of R{sup d} with finite volume. This class includes the Dirichlet Laplacian, the fractional Laplacian, and also fractional differential operators with non-homogeneous symbols. Based on a sharp estimate for the sum of the eigenvalues we establish the first term of the semiclassical asymptotics. This generalizes Weyl's law for the Laplace operator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Eulerian frequency analysis of structural vibrations from high-speed video

An approach for the analysis of the frequency content of structural vibrations from high-speed video recordings is proposed. The techniques and tools proposed rely on an Eulerian approach, that is, using the time history of pixels independently to analyse structural motion, as opposed to Lagrangian approaches, where the motion of the structure is tracked in time. The starting point is an existing Eulerian motion magnification method, which consists in decomposing the video frames into a set of spatial scales through a so-called Laplacian pyramid [1]. Each scale — or level — can be amplified independently to reconstruct a magnified motion of the observed structure. The approach proposed here provides two analysis tools or pre-amplification steps. The first tool provides a representation of the global frequency content of a video per pyramid level. This may be further enhanced by applying an angular filter in the spatial frequency domain to each frame of the video before the Laplacian pyramid decomposition, which allows for the identification of the frequency content of the structural vibrations in a particular direction of space. This proposed tool complements the existing Eulerian magnification method by amplifying selectively the levels containing relevant motion information with respect to their frequency content. This magnifies the displacement while limiting the noise contribution. The second tool is a holographic representation of the frequency content of a vibrating structure, yielding a map of the predominant frequency components across the structure. In contrast to the global frequency content representation of the video, this tool provides a local analysis of the periodic gray scale intensity changes of the frame in order to identify the vibrating parts of the structure and their main frequencies. Validation cases are provided and the advantages and limits of the approaches are discussed. The first validation case consists of the frequency content retrieval of the tip of a shaker, excited at selected fixed frequencies. The goal of this setup is to retrieve the frequencies at which the tip is excited. The second validation case consists of two thin metal beams connected to a randomly excited bar. It is shown that the holographic representation visually highlights the predominant frequency content of each pixel and locates the global frequencies of the motion, thus retrieving the natural frequencies for each beam.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Diffusion processes in tumors: A nuclear medicine approach

The number of counts used in nuclear medicine imaging techniques, only provides physical information about the desintegration of the nucleus present in the the radiotracer molecules that were uptaken in a particular anatomical region, but that information is not a real metabolic information. For this reason a mathematical method was used to find a correlation between number of counts and {sup 18}F-FDG mass concentration. This correlation allows a better interpretation of the results obtained in the study of diffusive processes in an agar phantom, and based on it, an image from the PETCETIX DICOM sample image set from OsiriX-viewer software was processed. PET-CT gradient magnitude and Laplacian images could show direct information on diffusive processes for radiopharmaceuticals that enter into the cells by simple diffusion. In the case of the radiopharmaceutical {sup 18}F-FDG is necessary to include pharmacokinetic models, to make a correct interpretation of the gradient magnitude and Laplacian of counts images.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Conditions for the cosmological viability of the most general scalar-tensor theories and their applications to extended Galileon dark energy models

In the Horndeski's most general scalar-tensor theories with second-order field equations, we derive the conditions for the avoidance of ghosts and Laplacian instabilities associated with scalar, tensor, and vector perturbations in the presence of two perfect fluids on the flat Friedmann-Lemaître-Robertson-Walker (FLRW) background. Our general results are useful for the construction of theoretically consistent models of dark energy. We apply our formulas to extended Galileon models in which a tracker solution with an equation of state smaller than -1 is present. We clarify the allowed parameter space in which the ghosts and Laplacian instabilities are absent and we numerically confirm that such models are indeed cosmologically viable.

79 ASTRONOMY AND ASTROPHYSICS↗

Stability of Horndeski vector-tensor interactions

We study the Horndeski vector-tensor theory that leads to second order equations of motion and contains a non-minimally coupled abelian gauge vector field. This theory is remarkably simple and consists of only 2 terms for the vector field, namely: the standard Maxwell kinetic term and a coupling to the dual Riemann tensor. Furthermore, the vector sector respects the U(1) gauge symmetry and the theory contains only one free parameter, M{sup 2}, that controls the strength of the non-minimal coupling. We explore the theory in a de Sitter spacetime and study the presence of instabilities and show that it corresponds to an attractor solution in the presence of the vector field. We also investigate the cosmological evolution and stability of perturbations in a general FLRW spacetime. We find that a sufficient condition for the absence of ghosts is M{sup 2} > 0. Moreover, we study further constraints coming from imposing the absence of Laplacian instabilities. Finally, we study the stability of the theory in static and spherically symmetric backgrounds (in particular, Schwarzschild and Reissner-Nordström-de Sitter). We find that the theory, quite generally, do have ghosts or Laplacian instabilities in regions of spacetime where the non-minimal interaction dominates over the Maxwell term. We also calculate the propagation speed in these spacetimes and show that superluminality is a quite generic phenomenon in this theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Vortex structure of SU(2) calorons

We reveal the center vortex content of SU(2) calorons and ensembles of them. We use Laplacian center gauge as well as maximal center gauges to show that the vortex in a single caloron consists of two parts. The first one connects the constituent dyons of the caloron (which are monopoles in Laplacian Abelian gauge) and extends in time. The second part is predominantly spatial, encloses one of the dyons and can be related to the twist in the caloron gauge field. This part depends strongly on the caloron holonomy and degenerates to a plane when the holonomy is maximally nontrivial, i.e. when the asymptotic Polyakov loop is traceless. Correspondingly, we find the spatial vortices in caloron ensembles to percolate in this case. This finding fits perfectly in the confinement scenario of vortices and shows that calorons are suitable to facilitate the vortex confinement mechanism.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Initial study of Schroedinger eigenmaps for spectral target detection

Spectral target detection refers to the process of searching for a specific material with a known spectrum over a large area containing materials with different spectral signatures. Traditional target detection methods in hyperspectral imagery (HSI) require assuming the data fit some statistical or geometric models and based on the model, to estimate parameters for defining a hypothesis test, where one class (i.e., target class) is chosen over the other classes (i.e., background class). Nonlinear manifold learning methods such as Laplacian eigenmaps (LE) have extensively shown their potential use in HSI processing, specifically in classification or segmentation. Recently, Schroedinger eigenmaps (SE), which is built upon LE, has been introduced as a semisupervised classification method. In SE, the former Laplacian operator is replaced by the Schroedinger operator. The Schroedinger operator includes by definition, a potential term V that steers the transformation in certain directions improving the separability between classes. In this regard, we propose a methodology for target detection that is not based on the traditional schemes and that does not need the estimation of statistical or geometric parameters. This method is based on SE, where the potential term V is taken into consideration to include the prior knowledge about the target class and use it to steer the transformation in directions where the target location in the new space is known and the separability between target and background is augmented. An initial study of how SE can be used in a target detection scheme for HSI is shown here. Inscene pixel and spectral signature detection approaches are presented. Finally, the HSI data used comprise various target panels for testing simultaneous detection of multiple objects with different complexities.

97 MATHEMATICS AND COMPUTING↗

A Fast Solver for the Fractional Helmholtz Equation

The purpose of this paper is to study a Helmholtz problem with a spectral fractional Laplacian, instead of the standard Laplacian. Recently, it has been established that such a fractional Helmholtz problem better captures the underlying behavior in Geophysical Electromagnetics. In this work, we establish the well-posedness and regularity of this problem. We introduce a hybrid spectral-finite element approach to discretize it and show well-posedness of the discrete system. In addition, we derive a priori discretization error estimates. Finally, we introduce an efficient solver that scales aswell as the best possible solver for the classical integer-order Helmholtz equation. We conclude withseveral illustrative examples that confirm our theoretical findings.

97 MATHEMATICS AND COMPUTING↗

A Fast Solver for the Fractional Helmholtz Equation

The purpose of this paper is to study a Helmholtz problem with a spectral fractional Laplacian, instead ofthe standard Laplacian. Recently, it has been established that such a fractional Helmholtz problem better captures the underlying behavior in Geophysical Electromagnetics. We establish the well-posedness and regularity of this problem. We introduce a hybrid finite element-spectral approach to discretize it and show well-posedness of the discrete system. In addition, we derive a priori discretization error estimates. Finally, we introduce an efficient solver that scales as well as the best possible solver for the classical integer-order Helmholtz equation. We conclude with several illustrative examples that confirm our theoretical findings.

97 MATHEMATICS AND COMPUTING↗

Moment-Preserving SN Discretizations for the One-Dimensional Fokker-Planck Equation

The Fokker-Planck equation: (1) Describes the transport and interactions of charged particles, (2) Many small-angle scattering collisions, (3) Asymptotic limit of the Boltzmann equation (Pomraning, 1992), and (4) The Boltzmann collision operator becomes the angular Laplacian. SN angular discretization: (1) Angular flux is collocated at the SN quadrature points, (2) The second-order derivatives in the Laplacian term must be discretized, and (3) Weighted finite-difference method preserves zeroth and first moments (Morel, 1985). Moment-preserving methods: (1) Collocate the Fokker-Planck operator at the SN quadrature points, (2) Develop several related and/or equivalent methods, and (3) Motivated by discretizations for the angular derivative appearing in the transport equation in one-dimensional spherical coordinates.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

OpenMP Parallelization and Optimization of Graph-Based Machine Learning Algorithms

In this paper, we investigate the OpenMP parallelization and optimization of two novel data classification algorithms. The new algorithms are based on graph and PDE solution techniques and provide significant accuracy and performance advantages over traditional data classification algorithms in serial mode. The methods leverage the Nystrom extension to calculate eigenvalue/eigenvectors of the graph Laplacian and this is a self-contained module that can be used in conjunction with other graph-Laplacian based methods such as spectral clustering. We use performance tools to collect the hotspots and memory access of the serial codes and use OpenMP as the parallelization language to parallelize the most time-consuming parts. Where possible, we also use library routines. We then optimize the OpenMP implementations and detail the performance on traditional supercomputer nodes (in our case a Cray XC30), and test the optimization steps on emerging testbed systems based on Intel’s Knights Corner and Landing processors. We show both performance improvement and strong scaling behavior. Finally, a large number of optimization techniques and analyses are necessary before the algorithm reaches almost ideal scaling.

97 MATHEMATICS AND COMPUTING↗