Search NASA⌕ Search

SEARCH · Search NASA

Results for “decomposition algorithms”

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 487 records · Page 27

Soft functions for generic jet algorithms and observables at hadron colliders

Here, we introduce a method to compute one-loop soft functions for exclusive N - jet processes at hadron colliders, allowing for different definitions of the algorithm that determines the jet regions and of the measurements in those regions. In particular, we generalize the N -jettiness hemisphere decomposition of ref. [1] in a manner that separates the dependence on the jet boundary from the observables measured inside the jet and beam regions. Results are given for several factorizable jet definitions, including anti- k T , XCone, and other geometric partitionings. We calculate explicitly the soft functions for angularity measurements, including jet mass and jet broadening, in pp → L + 1 jet and explore the differences for various jet vetoes and algorithms. This includes a consistent treatment of rapidity divergences when applicable. We also compute analytic results for these soft functions in an expansion for a small jet radius R . We find that the small- R results, including corrections up to O(R 2 ), accurately capture the full behavior over a large range of R .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Optimized Lie–Trotter–Suzuki decompositions for two and three non-commuting terms

Lie–Trotter–Suzuki decompositions are an efficient way to approximate operator exponentials exp ( t H ) when H is a sum of n (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution algorithms for tensor network states, digital quantum simulation protocols, path integral methods like quantum Monte Carlo, and splitting methods for symplectic integrators in classical Hamiltonian systems. Here, we provide optimized decompositions up to order t 6 . The leading error term is expanded in nested commutators (Hall bases) and we minimize the 1-norm of the coefficients. For n = 2 terms, several of the optima we find are close to those in McLachlan (1995). Generally, our results substantially improve over unoptimized decompositions by Forest, Ruth, Yoshida, and Suzuki. We explain why these decompositions are sufficient to efficiently simulate any one- or two-dimensional lattice model with finite-range interactions. This follows by solving a partitioning problem for the interaction graph.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large Scale Tensor Factorization via Parallel Sketches

Tensor factorization methods have recently gained increased popularity. A key feature that renders tensors attractive is the ability to directly model multi-relational data. In this work, we propose ParaSketch, a parallel tensor factorization algorithm that enables massive parallelism, to deal with large tensors. The idea is to compress the large tensor into multiple small tensors, decompose each small tensor in parallel, and combine the results to reconstruct the desired latent factors. Prior art in this direction entails potentially very high complexity in the (Gaussian) compression and final combining stages. Adopting sketching matrices for compression, the proposed method enjoys a dramatic reduction in compression complexity, and features a much lighter combining step. Moreover, theoretical analysis shows that the compressed tensors inherit latent identifiability under mild conditions, hence establishing correctness of the overall approach. Numerical experiments corroborate the theory and demonstrate the effectiveness of the proposed algorithm.

block term decomposition↗

A multistage stochastic programming model for a multi-period strategic expansion of biofuel supply chain under evolving uncertainties

Here, we develop a multistage, stochastic mixed-integer model to support biofuel supply chain expansion under evolving uncertainties. By utilizing the block-separable recourse property, we reformulate the multistage program in an equivalent two-stage program and solve it using an enhanced nested decomposition method with maximal non-dominated cuts. We conduct extensive numerical experiments and demonstrate the application of the model and algorithm in a case study based on the South Carolina settings. The value of multistage stochastic programming method is also explored by comparing the model solution with the counterparts of an expected value based deterministic model and a two-stage stochastic model.

09 BIOMASS FUELS↗

Learning Conservation Laws in Unknown Quantum Dynamics

We present a learning algorithm for discovering conservation laws given as sums of geometrically local observables in quantum dynamics. This includes conserved quantities that arise from local and global symmetries in closed and open quantum many-body systems. The algorithm combines the classical shadow formalism for estimating expectation values of observable and data analysis techniques based on singular value decompositions and robust polynomial interpolation to discover all such conservation laws in unknown quantum dynamics with rigorous performance guarantees. Our method can be directly realized in quantum experiments, which we illustrate with numerical simulations, using closed and open quantum system dynamics in a ℤ 2 gauge theory and in many-body localized spin chains.

Machine learning↗

Analysis and compression of six-dimensional gyrokinetic datasets using higher order singular value decomposition

Higher order singular value decomposition (HOSVD) is explored as a tool for analyzing and compressing gyrokinetic data. An efficient numerical implementation of an HOSVD algorithm is described. HOSVD is used to analyze the full six-dimensional (three spatial, two velocity space, and time dimensions) gyrocenter distribution function from gyrokinetic simulations of ion temperature gradient, electron temperature gradient, and trapped electron mode driven turbulence. The HOSVD eigenvalues for the velocity space coordinates decay very rapidly, indicating that only a few structures in velocity space can capture the most important dynamics. In almost all of the cases studied, HOSVD extracts parallel velocity space structures which are very similar to orthogonal polynomials. HOSVD is also used to compress gyrokinetic datasets, an application in which it is shown to significantly outperform the more commonly used singular value decomposition. It is shown that the effectiveness of the HOSVD compression improves as the dimensionality of the dataset increases. (C) 2012 Elsevier Inc. All rights reserved.

equation↗

A RADIATION TRANSFER SOLVER FOR ATHENA USING SHORT CHARACTERISTICS

We describe the implementation of a module for the Athena magnetohydrodynamics (MHD) code that solves the time-independent, multi-frequency radiative transfer (RT) equation on multidimensional Cartesian simulation domains, including scattering and non-local thermodynamic equilibrium (LTE) effects. The module is based on well known and well tested algorithms developed for modeling stellar atmospheres, including the method of short characteristics to solve the RT equation, accelerated Lambda iteration to handle scattering and non-LTE effects, and parallelization via domain decomposition. The module serves several purposes: it can be used to generate spectra and images, to compute a variable Eddington tensor (VET) for full radiation MHD simulations, and to calculate the heating and cooling source terms in the MHD equations in flows where radiation pressure is small compared with gas pressure. For the latter case, the module is combined with the standard MHD integrators using operator splitting: we describe this approach in detail, including a new constraint on the time step for stability due to radiation diffusion modes. Implementation of the VET method for radiation pressure dominated flows is described in a companion paper. We present results from a suite of test problems for both the RT solver itself and for dynamical problems that include radiative heating and cooling. These tests demonstrate that the radiative transfer solution is accurate and confirm that the operator split method is stable, convergent, and efficient for problems of interest. We demonstrate there is no need to adopt ad hoc assumptions of questionable accuracy to solve RT problems in concert with MHD: the computational cost for our general-purpose module for simple (e.g., LTE gray) problems can be comparable to or less than a single time step of Athena's MHD integrators, and only few times more expensive than that for more general (non-LTE) problems.

79 ASTRONOMY AND ASTROPHYSICS↗

Exploration of efficient reduced-order modeling and a posteriori error estimation

Efficient algorithms are considered for the computation of a reduced-order model based on the proper orthogonal decomposition methodology for the solution of parameterized elliptic partial differential equations. The method relies on partitioning the parameter space into subdomains based on the properties of the solution space and then forming a reduced basis for each of the subdomains. This yields more efficient offline and online stages for the proper orthogonal decomposition method. We extend these ideas for inexpensive adjoint based a posteriori error estimation of both the expensive finite element method solutions and the reduced-order model solutions, for a single and multiple quantities of interest. Finally, various numerical results indicate the efficacy of the approach.

42 ENGINEERING↗

PDSLin User Guide

This document describes a software package which implements a parallel hybrid (direct/iterative) linear solver based on the Schur complement method for solving a general sparse linear system of equations. The package is named parallel domain decomposition Schur complement based linear solver, or PDSLin in short. We give a brief description of the algorithm, installation, calling sequences, and data structures of PDSLin.

97 MATHEMATICS AND COMPUTING↗

An Efficient Implementation of Multiscale Simulation Software PNP-cDFT

An efficient implementation of PNP-cDFT, a multiscale method for computing the chemical potentials of charged species is designed and evaluated. Spatial decomposition of the multi particle system is employed in the parallelization of classical density functional theory (cDFT) algorithm. Furthermore, a truncated strategy is used to reduce the computational complexity of cDFT algorithm. The simulation results show that the parallel implementation has close to linear scalability in parallel computing environments for both 1D and 3D systems. It also shows that the truncated versions of cDFT improve the efficiency of the methods substantially.

99 GENERAL AND MISCELLANEOUS↗

High-Performance Computation of Distributed-Memory Parallel 3D Voronoi and Delaunay Tessellation

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets: N-body simulations, molecular dynamics codes, and LIDAR point clouds are just a few examples. Such computational geometry methods are common in data analysis and visualization; but as the scale of simulations and observations surpasses billions of particles, the existing serial and shared-memory algorithms no longer suffice. A distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this paper is a new parallel Delaunay and Voronoi tessellation algorithm that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include periodic and wall boundary conditions, comparison of our method using two popular serial libraries, and application to numerous science datasets.

97 MATHEMATICS AND COMPUTING↗

Model's sparse representation based on reduced mixed GMsFE basis methods

In this paper, we propose a model's sparse representation based on reduced mixed generalized multiscale finite element (GMsFE) basis methods for elliptic PDEs with random inputs. A typical application for the elliptic PDEs is the flow in heterogeneous random porous media. Mixed generalized multiscale finite element method (GMsFEM) is one of the accurate and efficient approaches to solve the flow problem in a coarse grid and obtain the velocity with local mass conservation. When the inputs of the PDEs are parameterized by the random variables, the GMsFE basis functions usually depend on the random parameters. This leads to a large number degree of freedoms for the mixed GMsFEM and substantially impacts on the computation efficiency. In order to overcome the difficulty, we develop reduced mixed GMsFE basis methods such that the multiscale basis functions are independent of the random parameters and span a low-dimensional space. To this end, a greedy algorithm is used to find a set of optimal samples from a training set scattered in the parameter space. Reduced mixed GMsFE basis functions are constructed based on the optimal samples using two optimal sampling strategies: basis-oriented cross-validation and proper orthogonal decomposition. Although the dimension of the space spanned by the reduced mixed GMsFE basis functions is much smaller than the dimension of the original full order model, the online computation still depends on the number of coarse degree of freedoms. To significantly improve the online computation, we integrate the reduced mixed GMsFE basis methods with sparse tensor approximation and obtain a sparse representation for the model's outputs. The sparse representation is very efficient for evaluating the model's outputs for many instances of parameters. To illustrate the efficacy of the proposed methods, we present a few numerical examples for elliptic PDEs with multiscale and random inputs. In particular, a two-phase flow model in random porous media is simulated by the proposed sparse representation method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral characteristics of background error covariance and multiscale data assimilation

The spatial resolutions of numerical atmospheric and oceanic circulation models have steadily increased over the past decades. Horizontal grid spacing down to the order of 1 km is now often used to resolve cloud systems in the atmosphere and sub-mesoscale circulation systems in the ocean. These fine resolution models encompass a wide range of temporal and spatial scales, across which dynamical and statistical properties vary. In particular, dynamic flow systems for small scales can become spatially localized and temporarily intermittent. An analysis shows that the background correlation length scale is larger than 75 km for streamfunctions, even for a 2-km resolution model, and larger than 25 km for water vapor mixing ratios. The theoretical analyses suggest that such correlation length scales prevent the currently used data assimilation schemes from constraining spatial scales smaller than 150 km for streamfunctions and 50 km for water vapor mixing ratios. These results highlight the necessity of fundamentally modifying the currently used data assimilation algorithm for assimilating high-resolution observations into the aforementioned fine resolution models. A multiscale methodology based on scale decomposition is suggested, and challenges are discussed.

Li, Zhijin↗

Fast truncated SVD of sparse and dense matrices on graphics processors

We investigate the solution of low-rank matrix approximation problems using the truncated singular value decomposition (SVD). For this purpose, we develop and optimize graphics processing unit (GPU) implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.

Computer Science↗

A Linear-Complexity Tensor Butterfly Algorithm for Compressing High-Dimensional Oscillatory Integral Operators

This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and integral transforms such as Radon transforms and Fourier transforms. The proposed algorithm leverages a tensor extension of the so-called complementary low-rank property of existing matrix butterfly algorithms. The algorithm partitions the discretized integral operator tensor into subtensors of multiple levels and factorizes each subtensor at the middle level as a Tucker-type interpolative decomposition, whose factor matrices are formed in a multilevel fashion. For a d-dimensional (d > 1) integral operator discretized into a 2d-mode tensor with n2d entries, the overall CPU time and memory requirement scale as O(nd), in stark contrast to the O(nd log n) complexity of existing matrix algorithms such as matrix butterfly algorithms and fast Fourier transforms (FFTs), where n is the number of points per direction. When comparing with other tensor algorithms such as quantized tensor train (QTT), the proposed algorithm also shows superior CPU and memory performance for tensor contraction. Remarkably, the tensor butterfly algorithm can efficiently model high-frequency Green's function interactions between two unit cubes, each spanning 512 wavelengths per direction, which represents problems of scale over 512× larger than that existing butterfly algorithms can handle, with the same amount of computation resources. On the other hand, for a problem representing 64 wavelengths per direction, which is the largest size existing algebraic matrix algorithms can handle, our tensor butterfly algorithm exhibits 200x speedups and 30× memory reduction compared with existing ones. Moreover, the tensor butterfly algorithm also permits O(nd)-complexity FFTs and Radon transforms up to d = 6 dimensions.

Kielstra, P Michael↗

Automatic Identification and Truncation of Boundary Outlets in Complex Imaging-Derived Biomedical Geometries

Fast and accurate reconstruction of imaging-derived geometries and subsequent quality mesh generation for biomedical computation are enabling technologies for both clinical and research simulations. Often, the transformation of image to mesh is the rate-limiting step, requiring arduous manual manipulations. A challenging part of this process is the introduction of computable, orthogonal boundary patches, namely the outlets, into treed structures, such as vasculature, arterial or airway trees. Herein, we present efficient and robust algorithms for automatically identifying and truncating the outlets for complex biomedical geometries. Our approach is based on a conceptual decomposition of objects into three different types of local structures, including tips, segments, and branches, where the tips determine the outlets. We define the tips by introducing a novel geometric concept called the average interior center of curvature (AICC), and identify those that are physically stable and numerically noise resistant through successive inflation and deflation tests. We compute well-defined orthogonal planes, which truncate the tips into outlets. The rims of the outlets are then connected into curves, and the outlets are then closed using Delaunay triangulation with the curves as the boundary constraints. Our approach is efficient, with near linear time complexity. We illustrate the effectiveness and robustness of our approach with a variety of complex lung and coronary artery geometries.

60 APPLIED LIFE SCIENCES↗

Turbulent flow and vortex characteristics in a blocked subchannel of a helically wrapped rod bundle

The study of flow and heat transfer through a bundle of rods is important, as this type of configuration is widely used in many engineering applications, for example, in heat exchangers, clusters of support structures, steam generators, and nuclear power reactors. This work experimentally investigated the flow-field characteristics of rod bundles with helically wrapped wires (wire-wrapped rod assemblies) proposed for advanced burner reactors. Subchannel blockage is one of the most interesting accident scenarios for liquid metal fast reactors as different mechanisms can lead to a partial or total subchannel blockage. It is of paramount important to understand the thermal-hydraulic behavior of the flow in the vicinity of such blockages. The flow mixing characteristics in two interior subchannels located near the core of the bundle, one without and one with the presence of a blockage, were experimentally investigated. The velocity fields within the spatial gaps of two subchannels were obtained by applying the matched-index-of-refraction and time-resolved particle image velocimetry (TR-PIV) technique for Reynolds numbers of 4000 and 17,000. The first- and second-order statistics, including the mean velocity, root-mean-square fluctuating velocity, and Reynolds stress, were computed from the obtained TR-PIV velocity vector fields. In the blocked sub-channel, the TR-PIV results revealed a large recirculation flow region in the vicinity of the blockage that was created by the interaction between inflows from neighboring subchannels. Spectral analysis was performed and the vortex shedding frequency indicated by the Strouhal number was found to be St = 0.16 for the two Reynolds numbers investigated. The flow characteristics of the interior subchannels were investigated via the two-point cross-correlation of fluctuating velocities. In addition, proper orthogonal decomposition (POD) analysis was applied to the instantaneous vorticity fields to extract the statistically dominant flow structures. Lastly, the statistical characteristics of the vortex, such as the vortex populations, spatial distributions, and vortex strengths, were acquired by combining POD analysis and the vortex identification algorithm.

42 ENGINEERING↗