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 145 records · Page 8

MO-DE-207B-10: Impact of Morphologic Characteristics On Radiomics Features From Contast-Enhanced CT for Primary Lung Tumors

Purpose: Determine the impact of morphologic characteristics (e.g. necrosis, vascular enhancement, and cavitation) on radiomic features from contrast enhanced CT (CE-CT) in primary lung tumors. Methods: We developed an auto-segmentation algorithm to separate lung tumors on contrast-enhanced CT into cavitation (air), necrosis, tissue, and enhancing vessels using a combination of thresholding and region-growing. An auto-segmentation algorithm was also designed to identify necrosis on FDG-PET scans. Wilcoxon rank-sum tests were used to determine if significant differences existed in radiomics features (histogram-uniformity and Laplacian-of-Gaussian average) from 249 patients, found to prognostic in previous work, based on the presence/absence of morphologic features. Feature values were also compared between the original tumor contours and contours excluding a specific morphologic feature. Comparison of necrosis segmentation on CE-CT versus FDG-PET was performed in 78 patients to assess for agreement using the concordance correlation coefficient (CCC). Results: Tumors with cavitation and enhancing vasculature had lower uniformity values (p = 0.001 and p = 0.03, respectively). Tumors with enhancing vasculature and necrosis had higher Laplacian-of-Gaussian average values (measure of “edges” within the tumor) (p < 0.001). Removing these tissue types from regions-of-interest did not drastically alter either radiomic feature value (all scenarios had R{sup 2} > 0.8). This suggests there may be interactions between morphologic characteristics and the radiomic feature value of tumor tissue. Comparison of necrosis volume and percent necrosis volume of tumor were found to have CCC values of 0.85 and 0.76, respectively between CE-CT and FDG-PET segmentation methods. Conclusions: Tumors with enhancing vasculature, necrosis, and cavitation have higher radiomic feature values that are associated with poor prognosis than tumors without these features. Removing these tissue types from quantitative assessment did not drastically impact radiomic feature values. High reproducibility of CE-CT segmented necrosis compared to FDG-PET segmented necrosis provides a reasonable validation of segmentation accuracy on CE-CT.

60 APPLIED LIFE SCIENCES↗

fPINNs: Fractional Physics-Informed Neural Networks

Physics-informed neural networks (PINNs), introduced, are effective in solving integer-order partial differential equations (PDEs) based on scattered and noisy data. PINNs employ standard feedforward neural networks (NNs) with the PDEs explicitly encoded into the NN using automatic differentiation, while the sum of the mean-squared PDE residuals and the mean-squared error in initial-boundary conditions is minimized with respect to the NN parameters. Here we extend PINNs to fractional PINNs (fPINNs) to solve space-time fractional advection-diffusion equations (fractional ADEs), and we study systematically their convergence, hence explaining both fPINNs and PINNs for the first time. Specifically, we demonstrate their accuracy and effectiveness in solving multidimensional forward and inverse problems with forcing terms whose values are only known at randomly scattered spatio-temporal coordinates (black-box (BB) forcing terms). A novel element of the fPINNs is the hybrid approach that we introduce for constructing the residual in the loss function using both automatic differentiation for the integer-order operators and numerical discretization for the fractional operators. This approach bypasses the difficulties stemming from the fact that automatic differentiation is not applicable to fractional operators because the standard chain rule in integer calculus is not valid in fractional calculus. To discretize the fractional operators, we employ the Grünwald--Letnikov (GL) formula in one-dimensional fractional ADEs and the vector GL formula in conjunction with the directional fractional Laplacian in two- and three-dimensional fractional ADEs. We first consider the one-dimensional fractional Poisson equation and compare the convergence of the fPINNs against the finite difference method (FDM). We present the solution convergence using both the mean L 2 error as well as the standard deviation due to sensitivity to NN parameter initializations. Using different GL formulas we observe first-, second-, and third-order convergence rates for small size training sets but the error saturates for larger training sets. We explain these results by analyzing the four sources of numerical errors due to discretization, sampling, NN approximation, and optimization. The total error decays monotonically (below 10 –5 for a third-order GL formula) but it saturates beyond that point due to the optimization error. We also analyze the relative balance between discretization and sampling errors and observe that the sampling size and the number of discretization points (auxiliary points) should be comparable to achieve the highest accuracy. As we increase the depth of the NN up to certain value, the mean error decreases and the standard deviation increases, whereas the width has essentially no effect unless its value is either too small or too large. We next consider time-dependent fractional ADEs and compare white-box (WB) and BB forcing. We observe that for the WB forcing, our results are similar to the aforementioned cases; however, for the BB forcing fPINNs outperform FDM. Subsequently, we consider multidimensional time-, space-, and space-time-fractional ADEs using the directional fractional Laplacian and we observe relative errors of 10 –3 ~ 10 –4 . Lastly, we solve several inverse problems in one, two, and three dimensions to identify the fractional orders, diffusion coefficients, and transport velocities and obtain accurate results given proper initializations even in the presence of significant noise.

97 MATHEMATICS AND COMPUTING↗

Learning Optimal Multigrid Smoothers via Neural Networks

Multigrid methods are one of the most efficient techniques for solving large sparse linear systems arising from partial differential equations (PDEs) and graph Laplacians from machine learning applications. One of the key components of multigrid is smoothing, which aims at reducing high-frequency errors on each grid level. However, finding optimal smoothing algorithms is problem-dependent and can impose challenges for many problems. In this paper, we propose an efficient adaptive framework for learning optimized smoothers from operator stencils in the form of convolutional neural networks (CNNs). Here, the CNNs are trained on small-scale problems from a given type of PDEs based on a supervised loss function derived from multigrid convergence theories and can be applied to large-scale problems of the same class of PDEs. Numerical results on anisotropic rotated Laplacian problems and variable coefficient diffusion problems demonstrate improved convergence rates and solution time compared with classical hand-crafted relaxation methods.

97 MATHEMATICS AND COMPUTING↗

Towards a Unified theory of Fractional and Nonlocal Vector Calculus

Nonlocal and fractional-order models capture effects that classical partial differential equations cannot describe; for this reason, they are suitable for a broad class of engineering and scientific applications that feature multiscale or anomalous behavior. This has driven a desire for a vector calculus that includes nonlocal and fractional gradient, divergence and Laplacian type operators, as well as tools such as Green’s identities, to model subsurface transport, turbulence, and conservation laws. In the literature, several independent definitions and theories of nonlocal and fractional vector calculus have been put forward. Some have been studied rigorously and in depth, while others have been introduced ad-hoc for specific applications. The goal of this work is to provide foundations for a unified vector calculus by (1) consolidating fractional vector calculus as a special case of nonlocal vector calculus, (2) relating unweighted and weighted Laplacian operators by introducing an equivalence kernel, and (3) proving a form of Green’s identity to unify the corresponding variational frameworks for the resulting nonlocal volume-constrained problems. Here, the proposed framework goes beyond the analysis of nonlocal equations by supporting new model discovery, establishing theory and interpretation for a broad class of operators, and providing useful analogues of standard tools from the classical vector calculus.

97 MATHEMATICS AND COMPUTING↗

A Unified Theory of Fractional Nonlocal and Weighted Nonlocal Vector Calculus

Nonlocal and fractional-order models capture effects that classical partial differential equations cannot describe; for this reason, they are suitable for a broad class of engineering and scientific applications that feature multiscale or anomalous behavior. This has driven a desire for a vector calculus that includes nonlocal and fractional gradient, divergence and Laplacian type operators, as well as tools such as Green's identities, to model subsurface transport, turbulence, and conservation laws. In the literature, several independent definitions and theories of nonlocal and fractional vector calculus have been put forward. Some have been studied rigorously and in depth, while others have been introduced ad-hoc for specific applications. The goal of this work is to provide foundations for a unified vector calculus by (1) consolidating fractional vector calculus as a special case of nonlocal vector calculus, (2) relating unweighted and weighted Laplacian operators by introducing an equivalence kernel, and (3) proving a form of Green's identity to unify the corresponding variational frameworks for the resulting nonlocal volume-constrained problems. The proposed framework goes beyond the analysis of nonlocal equations by supporting new model discovery, establishing theory and interpretation for a broad class of operators, and providing useful analogues of standard tools from the classical vector calculus.

97 MATHEMATICS AND COMPUTING↗

Hyperspectral Image Classification Using Graph Clustering Methods

Hyperspectral imagery is a challenging modality due to the dimension of the pixels which can range from hundreds to over a thousand frequencies depending on the sensor. Most methods in the literature reduce the dimension of the data using a method such as principal component analysis, however this procedure can lose information. More recently methods have been developed to address classification of large datasets in high dimensions. This paper presents two classes of graph-based classification methods for hyperspectral imagery. Using the full dimensionality of the data, we consider a similarity graph based on pairwise comparisons of pixels. The graph is segmented using a pseudospectral algorithm for graph clustering that requires information about the eigenfunctions of the graph Laplacian but does not require computation of the full graph. We develop a parallel version of the Nyström extension method to randomly sample the graph to construct a low rank approximation of the graph Laplacian. With at most a few hundred eigenfunctions, we can implement the clustering method designed to solve a variational problem for a graph-cut-based semi-supervised or unsupervised classification problem. We implement OpenMP directive-based parallelism in our algorithms and show performance improvement and strong, almost ideal, scaling behavior. The method can handle very large datasets including a video sequence with over a million pixels, and the problem of segmenting a data set into a pre-determined number of classes.

47 OTHER INSTRUMENTATION↗

High spatial resolution Mg/Al maps of the western Crisium and Sulpicius Gallus regions

High spatial resolution Mg/Al ratio maps of the western Crisium and Sulpicius Gallus regions of the moon are presented. The data is from the X-ray fluorescence experiment and the image enhancement technique in the Laplacian subtraction method using a special least-squares version of the Laplacian to reduce noise amplification. In the highlands region west of Mare Crisium several relatively small patches of smooth material have high local Mg/Al ratio similar to values found in mare sites, suggesting volcanism in the highlands. In the same highland region there were other smooth areas with no high Mg/Al local values and they are probably Cayley Formation material produced by impact mass wasting. The Sulpicius Gallus region has variable Mg/Al ratios. In this region there are several high Mg/Al ratio spots, two of which occur at the highland-mare interface. Another high Mg/Al ratio area corresponds to the Sulpicius Gallus Rima I region. The high Mg/Al ratio material in the Sulpicius Gallus region is probably pyroclastic.

Schonfeld, E.↗

Discretization formulas for unstructured grids

The Galerkin weighted residual technique using linear triangular weight functions is employed to develop finite difference formula in cartesian coordinates for the Laplacian operator, first derivative operators and the function for unstructured triangular grids. The weighted residual coefficients associated with the weak formulation of the Laplacian operator are shown to agree with the Taylor series approach on a global average. In addition, a simple algorithm is presented to determine the Voronoi (finite difference) area of an unstructured grid.

Baumeister, Kenneth J.↗

A finite difference treatment of Stokes-type flows: Preliminary report

The equations Laplacian operator omega = 0, (1.1a) and omega = Laplacian operator Chi, (1.1b) describe, in suitable units, 2-D Stokes flow of an incompressible fluid occupying a domain D in which omega is the vorticity and Chi is the stream function. The flow is uniquely determined by specifying the velocity on the boundary B of D, a condition which leads to specifying the stream function Chi and its normal derivative Chi sub n on B. A mathematically similar problem arises in describing the equilibrium of a flat plate in structural mechanics where a related 1-D problem by finite difference or finite element methods is to introduce effective methods for imposing the boundary conditions through which (1.1a) is coupled to (1.1b). These models thus provide a simple starting point for examining the general treatment of boundary conditions for more general time dependent Navier-Stokes incompressible flows. For the purpose of discussion it is assumed that D is a square domain. A standard finite difference method to solve (1.1) is to introduce a uniform grid and then use standard five point finite difference operators to express each equation in (1.1). At any point on the boundary B a value of Chi is specified by the boundary conditions but a value of omega at the same boundary mesh point will also be required to complete the computation. Methods are discussed which overcome the difficulty in solving these problems.

Rose, M. E.↗

Discretization formulas for unstructured grids

The Galerkin weighted residual technique using linear triangular weight functions is employed to develop finite difference formula in cartesian coordinates for the Laplacian operator, first derivative operators and the function for unstructured triangular grids. The weighted residual coefficients associated with the weak formulation of the Laplacian operator are shown to agree with the Taylor series approach on a global average. In addition, a simple algorithm is presented to determine the Voronoi (finite difference) area of an unstructured grid.

Baumeister, Kenneth J.↗

Numerical aspects of computing high Reynolds number flows on unstructured meshes

An edge-data structure describing a mesh edge-wise given the vertices of each edge and neighboring cell information is used developing algorithms for the Navier-Stokes equations on triangular meshes. Edge formulas for the Galerkin and finite-element discretization of gradient, divergence, Hessian, and Laplacian operators are derived. A simple edge formula is derived for the discretization of the Laplacian operator, where precise theoretical conditions for a discrete maximum principle can be ascertained. Practical issues associated with solving the Navier-Stokes equations on unstructured meshes are addressed, along with issues concerning the generation of highly stretched triangular meshes and the modeling of turbulence on unstructured meshes. A turbulence modeling strategy is proposed, and numerical results for a high-Reynolds-number flow about single- and multielement airfoils are discussed.

Barth, Timothy J.↗

On the optimality of a universal noiseless coder

Rice developed a universal noiseless coding structure that provides efficient performance over an extremely broad range of source entropy. This is accomplished by adaptively selecting the best of several easily implemented variable length coding algorithms. Variations of such noiseless coders have been used in many NASA applications. Custom VLSI coder and decoder modules capable of processing over 50 million samples per second have been fabricated and tested. In this study, the first of the code options used in this module development is shown to be equivalent to a class of Huffman code under the Humblet condition, for source symbol sets having a Laplacian distribution. Except for the default option, other options are shown to be equivalent to the Huffman codes of a modified Laplacian symbol set, at specified symbol entropy values. Simulation results are obtained on actual aerial imagery over a wide entropy range, and they confirm the optimality of the scheme. Comparison with other known techniques are performed on several widely used images and the results further validate the coder's optimality.

Yeh, Pen-Shu↗

An analysis of spectral envelope-reduction via quadratic assignment problems

A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described. The ordering is computed by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. In this paper, we provide an analysis of the spectral envelope reduction algorithm. We described related 1- and 2-sum problems; the former is related to the envelope size, while the latter is related to an upper bound on the work involved in an envelope Cholesky factorization scheme. We formulate the latter two problems as quadratic assignment problems, and then study the 2-sum problem in more detail. We obtain lower bounds on the 2-sum by considering a projected quadratic assignment problem, and then show that finding a permutation matrix closest to an orthogonal matrix attaining one of the lower bounds justifies the spectral envelope reduction algorithm. The lower bound on the 2-sum is seen to be tight for reasonably 'uniform' finite element meshes. We also obtain asymptotically tight lower bounds for the envelope size for certain classes of meshes.

George, Alan↗

A spectral algorithm for envelope reduction of sparse matrices

A new algorithm for reducing the envelope of a sparse matrix is presented. This algorithm is based on the computation of eigenvectors of the Laplacian matrix associated with the graph of the sparse matrix. A reordering of the sparse matrix is determined based on the numerical values of the entries of an eigenvector of the Laplacian matrix. Numerical results show that the new reordering algorithm can in some cases reduce the envelope by more than a factor of two over the current standard algorithms such as Gibbs-Poole-Stockmeyer (GPS) or SPARSPAK's reverse Cuthill-McKee (RCM).

Barnard, Stephen T.↗

Cluster growth modeling of plateau erosion

The pattern of erosion of a plateau along an escarpment may be modeled usng cluster growth techniques, recently popularized in models of drainage network evolution. If erosion on the scarp takes place in discrete events at rates subject to local substrate strength, the whole range of behavior is described by a combination of three cluster growth mechanisms: invasion percolation, Eden growth and diffusion-limited aggregation (DLA). These model the relative importance of preexisting substrate strength, background weathering, and seepage weathering and erosion respectively. The rate of seepage processes is determined by the efflux of groundwater at the plateau margin, which in turn is determined by the pressure field in the plateau aquifer. If this process acted alone, it would produce erosion patterns in the form of Laplacian fractals, with groundwater recharge from a distant source, or Poissionian fractals, with groundwater recharge uniform over the plateau. DLA is used to mimic the Laplacian or Poissonian potential field and the corresponding seepage growth process. The scaling structure of clusters grown by pure DLA, invasion percolation, or Eden growth is well known; this study presents a model which combines all three growth mechanisms for the first time. Mixed growth processes create clusters with different scaling properties and morphologies over distinct length scale ranges, and this is demonstrable in natural examples of plateau erosion.

Stark, Colin P.↗

Model-based VQ for image data archival, retrieval and distribution

An ideal image compression technique for image data archival, retrieval and distribution would be one with the asymmetrical computational requirements of Vector Quantization (VQ), but without the complications arising from VQ codebooks. Codebook generation and maintenance are stumbling blocks which have limited the use of VQ as a practical image compression algorithm. Model-based VQ (MVQ), a variant of VQ described here, has the computational properties of VQ but does not require explicit codebooks. The codebooks are internally generated using mean removed error and Human Visual System (HVS) models. The error model assumed is the Laplacian distribution with mean, lambda-computed from a sample of the input image. A Laplacian distribution with mean, lambda, is generated with uniform random number generator. These random numbers are grouped into vectors. These vectors are further conditioned to make them perceptually meaningful by filtering the DCT coefficients from each vector. The DCT coefficients are filtered by multiplying by a weight matrix that is found to be optimal for human perception. The inverse DCT is performed to produce the conditioned vectors for the codebook. The only image dependent parameter used in the generation of codebook is the mean, lambda, that is included in the coded file to repeat the codebook generation process for decoding.

Manohar, Mareboyana↗

A New Electron Localization Function and Its Interpretation

A new electron localization function is justified and compared with the laplacian of the electronic charge density. Some advantages of the new function and its novel predictions are discussed. Several slides and some video of visualizations using the new function in comparison to the laplacian will be shown.

Levit, Creon↗

Bohm's Quantum Potential and the Visualization of Molecular Structure

David Bohm's ontological interpretation of quantum theory can shed light on otherwise counter-intuitive quantum mechanical phenomena including chemical bonding. In the field of quantum chemistry, Richard Bader has shown that the topology of the Laplacian of the electronic charge density characterizes many features of molecular structure and reactivity. Visual and computational examination suggests that the Laplacian of Bader and the quantum potential of Bohm are morphologically equivalent. It appears that Bohmian mechanics and the quantum potential can make chemistry as clear as they makes physics.

Levit, Creon↗