Search NASA⌕ Search

SEARCH · Search NASA

Results for “tensor methods”

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 361 records · Page 20

Mean-field entanglement transitions in random tree tensor networks

Entanglement phase transitions in quantum chaotic systems subject to projective measurements and in random tensor networks have emerged as a new class of critical points separating phases with different entanglement scaling. We propose a mean-field theory of such transitions by studying the entanglement properties of random tree tensor networks. As a function of bond dimension, we find a phase transition separating area-law from logarithmic scaling of the entanglement entropy. Using a mapping onto a replica statistical mechanics model defined on a Cayley tree and the cavity method, we analyze the scaling properties of such transitions. Our approach provides a tractable, mean-field-like example of an entanglement transition. Furthermore, we verify our predictions numerically by computing directly the entanglement of random tree tensor network states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Sparse tensor spherical harmonics approximation in radiative transfer

The stationary monochromatic radiative transfer equation is a partial differential transport equation stated on a five-dimensional phase space. To obtain a well-posed problem, boundary conditions have to be prescribed on the inflow part of the domain boundary. We solve the equation with a multi-level Galerkin FEM in physical space and a spectral discretization with harmonics in solid angle and show that the benefits of the concept of sparse tensor products, known from the context of sparse grids, can also be leveraged in combination with a spectral discretization. Our method allows us to include high spectral orders without incurring the 'curse of dimension' of a five-dimensional computational domain. Neglecting boundary conditions, we find analytically that for smooth solutions, the convergence rate of the full tensor product method is retained in our method up to a logarithmic factor, while the number of degrees of freedom grows essentially only as fast as for the purely spatial problem. For the case with boundary conditions, we propose a splitting of the physical function space and a conforming tensorization. Numerical experiments in two physical and one angular dimension show evidence for the theoretical convergence rates to hold in the latter case as well.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental evaluation of electrical conductivity imaging of anisotropic brain tissues using a combination of diffusion tensor imaging and magnetic resonance electrical impedance tomography

Anisotropy of biological tissues is a low-frequency phenomenon that is associated with the function and structure of cell membranes. Imaging of anisotropic conductivity has potential for the analysis of interactions between electromagnetic fields and biological systems, such as the prediction of current pathways in electrical stimulation therapy. To improve application to the clinical environment, precise approaches are required to understand the exact responses inside the human body subjected to the stimulated currents. In this study, we experimentally evaluate the anisotropic conductivity tensor distribution of canine brain tissues, using a recently developed diffusion tensor-magnetic resonance electrical impedance tomography method. At low frequency, electrical conductivity of the biological tissues can be expressed as a product of the mobility and concentration of ions in the extracellular space. From diffusion tensor images of the brain, we can obtain directional information on diffusive movements of water molecules, which correspond to the mobility of ions. The position dependent scale factor, which provides information on ion concentration, was successfully calculated from the magnetic flux density, to obtain the equivalent conductivity tensor. By combining the information from both techniques, we can finally reconstruct the anisotropic conductivity tensor images of brain tissues. The reconstructed conductivity images better demonstrate the enhanced signal intensity in strongly anisotropic brain regions, compared with those resulting from previous methods using a global scale factor.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Rank-reduced coupled-cluster. III. Tensor hypercontraction of the doubles amplitudes

In this work, we develop a quartic-scaling implementation of coupled-cluster singles and doubles (CCSD) based on low-rank tensor hypercontraction (THC) factorizations of both the electron repulsion integrals (ERIs) and the doubles amplitudes. This extends our rank-reduced (RR) coupled-cluster method to incorporate higher-order tensor factorizations. The THC factorization of the doubles amplitudes accounts for most of the gain in computational efficiency as it is sufficient, in conjunction with a Cholesky decomposition of the ERIs, to reduce the computational complexity of most contributions to the CCSD amplitude equations. Further THC factorization of the ERIs reduces the complexity of certain terms arising from nested commutators between the doubles excitation operator and the two-electron operator. We implement this new algorithm using graphical processing units and demonstrate that it enables CCSD calculations for molecules with 250 atoms and 2500 basis functions using a single computer node. Furthermore, we show that the new method computes correlation energies with comparable accuracy to the underlying RR-CCSD method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Signal-to-noise assessment for diffusion tensor imaging with single data set and validation using a difference image method with data from a multicenter study

Purpose: To describe a quantitative method for determination of SNR that extracts the local noise level using a single diffusion data set. Methods: Brain data sets came from a multicenter study (eight sites; three MR vendors). Data acquisition protocol required b = 0, 700 s/mm{sup 2}, fov = 256 × 256 mm{sup 2}, acquisition matrix size 128 × 128, reconstruction matrix size 256 × 256; 30 gradient encoding directions and voxel size 2 × 2 × 2 mm{sup 3}. Regions-of-interest (ROI) were placed manually on the b = 0 image volume on transverse slices, and signal was recorded as the mean value of the ROI. The noise level from the ROI was evaluated using Fourier Transform based Butterworth high-pass filtering. Patients were divided into two groups, one for filter parameter optimization (N = 17) and one for validation (N = 10). Six white matter areas (the genu and splenium of corpus callosum, right and left centrum semiovale, right and left anterior corona radiata) were analyzed. The Bland–Altman method was used to compare the resulting SNR with that from the difference image method. The filter parameters were optimized for each brain area, and a set of “global” parameters was also obtained, which represent an average of all regions. Results: The Bland–Altman analysis on the validation group using “global” filter parameters revealed that the 95% limits of agreement of percent bias between the SNR obtained with the new and the reference methods were −15.5% (median of the lower limit, range [−24.1%, −8.9%]) and 14.5% (median of the higher limits, range [12.7%, 18.0%]) for the 6 brain areas. Conclusions: An FT-based high-pass filtering method can be used for local area SNR assessment using only one DTI data set. This method could be used to evaluate SNR for patient studies in a multicenter setting.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A minimal set of invariants as a systematic approach to higher order gravity models

Higher-order gravity models have been recently the subject of much attention in the context of cosmic acceleration. These models are derived by adding various curvature invariants to the Einstein-Hilbert action. Several studies showed that these models can have late-time self-acceleration and could, in some cases, fit various observational constraints. In view of the infinite spectrum of invariants that could be built from curvature tensors, we propose here a method based on minimal sets of independent invariants as a possible route for a systematic approach to these models. We explore a connection made between theorems on bases in invariants theory in relativity and higher-order cosmological models. A dynamical system analysis is performed and some models with accelerating attractors are discussed. The asymptotic behavior of the models is also studied using analytical calculations.

79 ASTRONOMY AND ASTROPHYSICS↗

Highly Efficient and Scalable Compound Decomposition of Two-Electron Integral Tensor and Its Application in Coupled Cluster Calculations

The representation and storage of two-electron integral tensors are vital in large- scale applications of accurate electronic structure methods. Low-rank representation and efficient storage strategy of integral tensors can significantly reduce the numerical overhead and consequently time-to-solution of these methods. In this paper, by combining pivoted incomplete Cholesky decomposition (CD) with a follow-up truncated singular vector decomposition (SVD), we develop a decomposition strategy to approximately represent the two-electron integral tensor in terms of low-rank vectors. A systematic benchmark test on a series of 1-D, 2-D, and 3-D carbon-hydrogen systems demonstrates high efficiency and scalability of the compound two-step decomposition of the two-electron integral tensor in our implementation. For the size of atomic basis set N_b ranging from ~ 100 up to ~ 2, 000, the observed numerical scaling of our implementation shows O(N_b^{2.5~3}) versus O(N_b^{3~4}) of single CD in most of other implementations. More importantly, this decomposition strategy can significantly reduce the storage requirement of the atomic-orbital (AO) two-electron integral tensor from O(N_b^4) to O(N_b^2 log_{10}(N_b)) with moderate decomposition thresholds. The accuracy tests have been performed using ground- and excited-state formulations of coupled- cluster formalism employing single and double excitations (CCSD) on several bench- mark systems including the C_{60} molecule described by nearly 1,400 basis functions. The results show that the decomposition thresholds can be generally set to 10^{-4} to 10^{-3} to give acceptable compromise between efficiency and accuracy.

54 ENVIRONMENTAL SCIENCES↗

Full-sky formulae for weak lensing power spectra from total angular momentum method

We systematically derive full-sky formulae for the weak lensing power spectra generated by scalar, vector and tensor perturbations from the total angular momentum (TAM) method. Based on both the geodesic and geodesic deviation equations, we first give the gauge-invariant expressions for the deflection angle and Jacobi map as observables of the CMB lensing and cosmic shear experiments. We then apply the TAM method, originally developed in the theoretical studies of CMB, to a systematic derivation of the angular power spectra. The TAM representation, which characterizes the total angular dependence of the spatial modes projected along a line-of-sight, can carry all the information of the lensing modes generated by scalar, vector, and tensor metric perturbations. This greatly simplifies the calculation, and we present a complete set of the full-sky formulae for angular power spectra in both the E-/B-mode cosmic shear and gradient-/curl-mode lensing potential of deflection angle. Based on the formulae, we give illustrative examples of non-vanishing B-mode cosmic shear and curl-mode of deflection angle in the presence of the vector and tensor perturbations, and explicitly compute the power spectra.

79 ASTRONOMY AND ASTROPHYSICS↗

Frontal Slice Approaches for Tensor Linear Systems

Inspired by the row and column action methods for solving large-scale linear systems, in this work, we explore the use of frontal slices for solving tensor linear systems. In particular, this paper presents a novel approach for using frontal slices of a tensor $\mathcal{A}$ to solve tensor linear systems $\mathcal{A} ∗\mathcal{X} = \mathcal{B}$ where ∗ denotes the $t$-product. In addition, we consider variations of this method, including cyclic, block, and randomized approaches, each designed to optimize performance in different operational contexts. Our primary contribution lies in the development and convergence analysis of these methods. Experimental results on synthetically generated and real-world data, including applications such as image and video deblurring, demonstrate the efficacy of our proposed approaches and validate our theoretical findings.

Luo, Hengrui↗

Algebraic grid generation using tensor product B-splines

Finite difference methods are more successful if the accompanying grid has lines which are smooth and nearly orthogonal. The development of an algorithm which produces such a grid when given the boundary description. Topological considerations in structuring the grid generation mapping are discussed. The concept of the degree of a mapping and how it can be used to determine what requirements are necessary if a mapping is to produce a suitable grid is examined. The grid generation algorithm uses a mapping composed of bicubic B-splines. Boundary coefficients are chosen so that the splines produce Schoenberg's variation diminishing spline approximation to the boundary. Interior coefficients are initially chosen to give a variation diminishing approximation to the transfinite bilinear interpolant of the function mapping the boundary of the unit square onto the boundary grid. The practicality of optimizing the grid by minimizing a functional involving the Jacobian of the grid generation mapping at each interior grid point and the dot product of vectors tangent to the grid lines is investigated. Grids generated by using the algorithm are presented.

Saunders, B. V.↗

TTDFT: A GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations

We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses a localized Tucker tensor basis computed from an additive separable approximation to the Kohn-Sham Hamiltonian. The discrete Kohn-Sham problem is solved using Chebyshev filtered subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. In conclusion, the computational performance of the TTDFT code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms.

97 MATHEMATICS AND COMPUTING↗

Parallel Nonnegative CP Decomposition of Dense Tensors

The CP tensor decomposition is a low-rank approximation of a tensor. We present a distributed-memory parallel algorithm and implementation of an alternating optimization method for computing a CP decomposition of dense tensors that can enforce nonnegativity of the computed low-rank factors. The principal task is to parallelize the Matricized-Tensor Times Khatri-Rao Product (MTTKRP) bottleneck subcomputation. The algorithm is computation efficient, using dimension trees to avoid redundant computation across MTTKRPs within the alternating method. Our approach is also communication efficient, using a data distribution and parallel algorithm across a multidimensional processor grid that can be tuned to minimize communication. We benchmark our software on synthetic as well as hyperspectral image and neuroscience dynamic functional connectivity data, demonstrating that our algorithm scales well to 100s of nodes (up to 4096 cores) and is faster and more general than the currently available parallel software.

Ballard, Grey↗

An efficient tensor transpose algorithm for multicore CPU, Intel Xeon Phi, and NVidia Tesla GPU

An efficient parallel tensor transpose algorithm is suggested for shared-memory computing units, namely, multicore CPU, Intel Xeon Phi, and NVidia GPU. The algorithm operates on dense tensors (multidimensional arrays) and is based on the optimization of cache utilization on x86 CPU and the use of shared memory on NVidia GPU. From the applied side, the ultimate goal is to minimize the overhead encountered in the transformation of tensor contractions into matrix multiplications in computer implementations of advanced methods of quantum many-body theory (e.g., in electronic structure theory and nuclear physics). A particular accent is made on higher-dimensional tensors that typically appear in the so-called multireference correlated methods of electronic structure theory. Depending on tensor dimensionality, the presented optimized algorithms can achieve an order of magnitude speedup on x86 CPUs and 2-3 times speedup on NVidia Tesla K20X GPU with respect to the na ve scattering algorithm (no memory access optimization). Furthermore, the tensor transpose routines developed in this work have been incorporated into a general-purpose tensor algebra library (TAL-SH).

97 MATHEMATICS AND COMPUTING↗

Van der Waals Sandwich Structures for Surface-Enhanced Raman Scattering

Surface-enhanced Raman scattering (SERS) intensity of two-dimensional (2D) materials critically depends on the resonant conditions and factors such as the substrate interferences and molecule adsorption fluctuations, making comprehensive investigation, understanding, and optimization of 2D materials-assisted SERS challenging. Here, in this work, the wavelength-dependent SERS of van der Waals structures of 2D materials is systematically investigated, focusing on the intrinsic frequency-dependent Raman tensors by first-principles method while ruling out other extrinsic factors in experiments. Distinct enhancement profiles are found for different 2D materials, among which MoS2 and graphene exhibit remarkably strong and broadband enhancement effects. For stacked multilayers and heterostructures of 2D materials, the calculated SERS addresses the significance of the first contact monolayer effect. Based on the above theory, the van der Waals sandwich structures are proposed and investigated as the SERS substrates, verifying a further significantly enhanced SERS performance. This resonant first-principles study demonstrates a comprehensive and analytical way to explore and promote the SERS of van der Waals structures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Oblique diffraction geometry for the observation of several non-coplanar Bragg reflections under identical illumination

A method to determine the strain tensor and local lattice rotation with dark-field X-ray microscopy is presented. Using a set of at least three non-coplanar symmetry-equivalent Bragg reflections, the illuminated volume of the sample can be kept constant for all reflections, facilitating easy registration of the measured lattice variations. This requires an oblique diffraction geometry,i.e.the diffraction plane is neither horizontal nor vertical. We derive a closed analytical expression that allows determination of the strain and lattice rotation from the deviation of experimental observables (e.g.goniometer angles) from their nominal values for an unstrained lattice.

Chemistry↗

Stress computation in displacement methods for two-material elastic media

The method of best fit strain tensors is extended to compute the stresses satisfying the conditions of equilibrium, compatibility, and constitutive relationships. It is assumed that the deflections at the mesh points have already been computed with acceptable accuracy. Results of examples presented show better accuracy than the usual procedure, in which equilibrium conditions are not enforced. Special emphasis is placed here upon two-material elastic media.

Salama, M.↗

Advanced numerical methods in mesh generation and mesh adaptation

Numerical solution of partial differential equations requires appropriate meshes, efficient solvers and robust and reliable error estimates. Generation of high-quality meshes for complex engineering models is a non-trivial task. This task is made more difficult when the mesh has to be adapted to a problem solution. This article is focused on a synergistic approach to the mesh generation and mesh adaptation, where best properties of various mesh generation methods are combined to build efficiently simplicial meshes. First, the advancing front technique (AFT) is combined with the incremental Delaunay triangulation (DT) to build an initial mesh. Second, the metric-based mesh adaptation (MBA) method is employed to improve quality of the generated mesh and/or to adapt it to a problem solution. We demonstrate with numerical experiments that combination of all three methods is required for robust meshing of complex engineering models. The key to successful mesh generation is the high-quality of the triangles in the initial front. We use a black-box technique to improve surface meshes exported from an unattainable CAD system. The initial surface mesh is refined into a shape-regular triangulation which approximates the boundary with the same accuracy as the CAD mesh. The DT method adds robustness to the AFT. The resulting mesh is topologically correct but may contain a few slivers. The MBA uses seven local operations to modify the mesh topology. It improves significantly the mesh quality. The MBA method is also used to adapt the mesh to a problem solution to minimize computational resources required for solving the problem. The MBA has a solid theoretical background. In the first two experiments, we consider the convection-diffusion and elasticity problems. We demonstrate the optimal reduction rate of the discretization error on a sequence of adaptive strongly anisotropic meshes. The key element of the MBA method is construction of a tensor metric from hierarchical edge-based error estimates. We conclude that the quasi-optimal mesh must be quasi-uniform in this metric. All numerical experiments are based on the publicly available Ani3D package, the collection of advanced numerical instruments.

99 GENERAL AND MISCELLANEOUS↗

Workshop on Field Theoretic Simulations in Particle Physics and Condensed Matter

A two and half day workshop at Boston University, devoted to a discussion of common problems in the theoretical and computational study of particle physics and condensed matter. The phase structure of strongly coupled quantum field theories are of great interest in condensed matter and high energy physics. For example, the study of strongly correlated systems, such as frustrated quantum anti-ferromagnets, have suggested the existence of phases in which the low energy excitations do not have the quantum numbers of electrons but are fractionalized. The field description of such systems are typically topological quantum field theories. The latter have also proved important in constructing supersymmetric lattice gauge theories. Quantum critical systems in condensed matter are described by conformal field theories which have the subject of much recent work in the context of theories of Beyond Standard Model physics. Finally, theoretical holographic techniques originating in string theory may offer a new tool to investigate strongly interacting electrons. In parallel with these theoretical developments there has been rapid progress in computational methods in both fields; from tensor networks and density matrix renormalization group techniques to the rational hybrid Monte Carlo algorithm and techniques to ameliorate the famous sign problem. It is thus a propitious time to bring both communities together to stimulate an exchange of ideas and facilitate possible future collaborations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗