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 739 records · Page 41

Optimization of processor allocation for domain decomposed Monte Carlo calculations

Load imbalance plagues domain decomposed Monte Carlo calculations when sources are not uniform. Parallel efficiency for domain decomposed Monte Carlo transport calculations improves through a nonuniform allocation of processors over subdomains. In this work, we optimize the allocation with runtime diagnostics collected during a calibration step, then complete the full calculation. The diagnostic-based approach is compared to implicit filtering, an optimization algorithm for bound constrained noisy optimization problems. Finally, we consider both forward and hybrid radiation transport calculations to measure performance.

97 MATHEMATICS AND COMPUTING↗

RADIO FREQUENCY INTERFERENCE REMOVAL THROUGH THE APPLICATION OF SPATIAL FILTERING TECHNIQUES ON THE PARKES MULTIBEAM RECEIVER

This paper addresses the first practical application of spatial filtering techniques to data taken with a multibeam receiver. Spatial filters make use of the relative arrival times of a signal at multiple sensors to identify and separate signals from different directions. The method is a consequence of the Karhunen-Loeve theorem and relies on the eigen decomposition of the covariance matrix formed from the multiple signal paths. The effectiveness of the spatial filtering techniques is demonstrated on observations of the Vela pulsar taken with the Parkes 20 cm Multibeam receiver. The experiment was highly successful, and the results show spatial filtering methods provide powerful tools for interference mitigation with an array feed receiver. Extensions of the algorithm to reduce computational requirements and allow application on short (submillisecond) timescales are also explored.

79 ASTRONOMY AND ASTROPHYSICS↗

3D And 4D Cloud Lifecycle Investigations Using Innovative Scanning Radar Analysis Methods. Final report

With the vast upgrades to the ARM program radar measurement capabilities in 2010 and beyond, our ability to probe the 3D structure of clouds and associated precipitation has increased dramatically. This project build on the PI's and co-I's expertisein the analysis of radar observations. The first research thrust aims to document the 3D morphological (as depicted by the radar reflectivity structure) and 3D dynamical (cloud$-$scale eddies) structure of boundary layer clouds. Unraveling the 3D dynamical structure of stratocumulus and shallow cumulus clouds requires decomposition of the environmental wind contribution and particle sedimentation velocity from the observed radial Doppler velocity. The second thrust proposes to unravel the mechanism of cumulus entrainment (location, scales) and its impact on microphysics utilizing radar measurements from the vertically pointing and new scanning radars at the ARM sites. The third research thrust requires the development of a cloud$-$tracking algorithm that monitors the properties of cloud.

3D structure↗

Bounds on spectral gaps of Hyperbolic spin surfaces

We describe a method for constraining Laplacian and Dirac spectra of two dimensional compact orientable hyperbolic spin manifolds and orbifolds. The key ingredient is an infinite family of identities satisfied by the spectra. These spectral identities follow from the consistency between 1) the spectral decomposition of functions on the spin bundle into irreducible representations of SL(2,R) and 2) associativity of pointwise multiplication of functions. Applying semidefinite programming methods to our identities produces rigorous upper bounds on the Laplacian spectral gap as well as on the Dirac spectral gap conditioned on the former. In several examples, our bounds are nearly sharp; a numerical algorithm based on the Selberg trace formula shows that the [0;3,3,5] orbifold, a particular surface with signature [1;3], and the Bolza surface nearly saturate the bounds at genus 0, 1 and 2 respectively. Under additional assumptions on the number of harmonic spinors carried by the spin-surface, we obtain more restrictive bounds on the Laplacian spectral gap. In particular, these bounds apply to hyperelliptic surfaces. We also determine the set of Laplacian spectral gaps attained by all compact orientable two-dimensional hyperbolic spin orbifolds. We show that this set is upper bounded by 12.13798; this bound is nearly saturated by the [0;3,3,5] orbifold, whose first non-zero Laplacian eigenvalue is λ^(0)_1 ≈ 12.13623.

Spectral theory↗

Overlapping localized exponential time differencing methods for diffusion problems

The localized exponential time differencing (ETD) based on overlapping domain decomposition has been recently introduced for extreme-scale phase field simulations of coarsening dynamics, which displays excellent parallel scalability in supercomputers. This paper serves as the first step toward building a solid mathematical foundation for this approach. We study the overlapping localized ETD schemes for a model time-dependent diffusion equation discretized in space by the standard central difference. Two methods are proposed and analyzed for solving the fully discrete localized ETD systems: the first one is based on Schwarz iteration applied at each time step and involves solving stationary problems in the subdomains at each iteration, while the second one is based on the Schwarz waveform relaxation algorithm in which time-dependent subdomain problems are solved at each iteration. The convergences of the associated iterative solutions to the corresponding fully discrete localized ETD solution and to the exact semidiscrete solution are rigorously proved. Finally, numerical experiments are also carried out to confirm theoretical results and to compare the performance of the two methods.

58 GEOSCIENCES↗

Characterizing magnetized plasmas with dynamic mode decomposition

Accurate and efficient plasma models are essential to understand and control experimental devices. Existing magnetohydrodynamic or kinetic models are nonlinear and computationally intensive and can be difficult to interpret, while often only approximating the true dynamics. In this work, data-driven techniques recently developed in the field of fluid dynamics are leveraged to develop interpretable reduced-order models of plasmas that strike a balance between accuracy and efficiency. In particular, dynamic mode decomposition (DMD) is used to extract spatio-temporal magnetic coherent structures from the experimental and simulation datasets of the helicity injected torus with steady inductive (HIT-SI) experiment. Three-dimensional magnetic surface probes from the HIT-SI experiment are analyzed, along with companion simulations with synthetic internal magnetic probes. A number of leading variants of the DMD algorithm are compared, including the sparsity-promoting and optimized DMD. Optimized DMD results in the highest overall prediction accuracy, while sparsity-promoting DMD yields physically interpretable models that avoid overfitting. These DMD algorithms uncover several coherent magnetic modes that provide new physical insights into the inner plasma structure. These modes were subsequently used to discover a previously unobserved three-dimensional structure in the simulation, rotating at the second injector harmonic. Finally, using data from probes at experimentally accessible locations, DMD identifies a resistive kink mode, a ubiquitous instability seen in magnetized plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Taming convergence in the determinant approach for x-ray excitation spectra

A determinant formalism in combination with ab initio calculations was proposed recently and has paved a way for simulating and interpreting x-ray excitation spectra in condensed-phase systems. The method systematically takes into account many-electron effects in the Mahan-Noziéres-De Dominicis (MND) theory, including core-level excitonic effects, the Fermi-edge singularity, shakeup excitations, and wave function overlap effects such as the orthogonality catastrophe, all within a universal framework using many-electron configurations. A heuristic search algorithm was introduced to search for the configurations that are important for defining the x-ray spectral line shape, instead of enumerating them in a brute-force way. The algorithm has proven to be efficient for calculating O K edges of transition metal oxides, which converge at the second excitation order (denoted as $f^{(n)}$ with n = 2), i.e., the final-state configurations with two e-h pairs (with one hole being the core hole). However, it remains unknown how the determinant x-ray spectra converge for general cases and at which excitation order n should one stop the determinant calculation. Even with the heuristic algorithm, the number of many-electron configurations still grows exponentially with the excitation order n. In this work we prove two theorems that can indicate the order of magnitude of the contribution of the $f^{(n)}$ configurations, so that one can estimate their contribution very quickly without actually calculating their amplitudes. The two theorems are based on singular-value decomposition (SVD) analysis, a method that is widely used to quantify entanglement between two quantum many-body systems. Finally, we examine the K edges of several metallic systems with the determinant formalism up to $f^{(5)}$ to illustrate the usefulness of the theorems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Impact of environmental factors on biometric matching during human decomposition

Automatic recognition systems are a valuable tool for identifying unknown deceased individuals. Immediately af- ter death fingerprint and face biometric samples are easy to collect using standard sensors and cameras and can be easily matched to anti-mortem biometric samples. Even though post-mortem fingerprints and faces have been used for decades, there are no studies that track these biomet- rics through the later stages of decomposition to determine the length of time the biometrics remain viable. This paper discusses a multimodal dataset of fingerprints, faces, and irises from 14 human cadavers that decomposed outdoors under natural conditions. Results include predictive models relating time and temperature, measured as Accumulated Degree Days (ADD), and season (winter, spring, summer) to the predicted probably of automatic verification using a commercial algorithm.

Bolme, David S↗

ESPResSo++ 2.0: Advanced methods for multiscale molecular simulation

We report that molecular simulation is a scientific tool used in many fields including material science and biology. This requires constant development and enhancement of algorithms within molecular simulation software packages. Here, we present computational tools for multiscale modeling developed and implemented within the ESPResSo++ package. These include the latest applications of the adaptive resolution scheme, the hydrodynamic interactions through a lattice Boltzmann solvent coupled to particle-based molecular dynamics, the implementation of the hierarchical strategy for equilibrating long-chained polymer melts and a heterogeneous spatial domain decomposition. The software design of ESPResSo++ has kept its highly modular C++ kernel with a Python user interface. Furthermore, it has been enhanced by automatic scripts that parse configurations from other established packages, providing scientists with the ability to rapidly set up their simulations.

97 MATHEMATICS AND COMPUTING↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

Adaptive matching of the iota ring linear optics for space charge compensation

Many present and future accelerators must operate with high intensity beams when distortions induced by space charge forces are among major limiting factors. Betatron tune depression of above approximately 0.1 per cell leads to significant distortions of linear optics. Many aspects of machine operation depend on proper relations between lattice functions and phase advances, and can be i proved with proper treatment of space charge effects. We implement an adaptive algorithm for linear lattice re matching with full account of space charge in the linear approximation for the case of Fermilab’s IOTA ring. The method is based on a search for initial second moments that give closed solution and, at the same predefined set of goals for emittances, beta functions, dispersions and phase advances at and between points of interest. Iterative singular value decomposition based technique is used to search for optimum by varying wide array of model parameters

43 PARTICLE ACCELERATORS↗

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗

LayTracks3D: A new approach for meshing general solids using medial axis transform

This study presents an extension of the all-quad meshing algorithm called LayTracks to generate high quality hex-dominant meshes of general solids. LayTracks3D uses the mapping between the Medial Axis (MA) and the boundary of the 3D domain to decompose complex 3D domains into simpler domains called Tracks. Tracks in 3D have no branches and are symmetric, non-intersecting, orthogonal to the boundary, and the shortest path from the MA to the boundary. These properties of tracks result in desired meshes with near cube shape elements at the boundary, structured mesh along the boundary normal with any irregular nodes restricted to the MA, and sharp boundary feature preservation. The algorithm has been tested on a few industrial CAD models and hex-dominant meshes are shown in the Results section. Work is underway to extend LayTracks3D to generate all-hex meshes.

97 MATHEMATICS AND COMPUTING↗

Analytical gradients of complete active space self-consistent field energies using Cholesky decomposition: Geometry optimization and spin-state energetics of a ruthenium nitrosyl complex

We present a formulation of analytical energy gradients at the complete active space self-consistent field (CASSCF) level of theory employing density fitting (DF) techniques to enable efficient geometry optimizations of large systems. As an example, the ground and lowest triplet state geometries of a ruthenium nitrosyl complex are computed at the DF-CASSCF level of theory and compared with structures obtained from density functional theory (DFT) using the B3LYP, BP86, and M06L functionals. The average deviation of all bond lengths compared to the crystal structure is 0.042 Å at the DF-CASSCF level of theory, which is slightly larger but still comparable with the deviations obtained by the tested DFT functionals, e.g., 0.032 Å with M06L. Specifically, the root-mean-square deviation between the DF-CASSCF and best DFT coordinates, delivered by BP86, is only 0.08 Å for S{sub 0} and 0.11 Å for T{sub 1}, indicating that the geometries are very similar. While keeping the mean energy gradient errors below 0.25%, the DF technique results in a 13-fold speedup compared to the conventional CASSCF geometry optimization algorithm. Additionally, we assess the singlet-triplet energy vertical and adiabatic differences with multiconfigurational second-order perturbation theory (CASPT2) using the DF-CASSCF and DFT optimized geometries. It is found that the vertical CASPT2 energies are relatively similar regardless of the geometry employed whereas the adiabatic singlet-triplet gaps are more sensitive to the chosen triplet geometry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The MP{sub N} method: a new angular discretization method based on piecewise polynomial interfaces fluxes

In transport calculations, it is well known how S{sub N} method is extremely inefficient in problems where the particle physics is dominated by streaming. The ray-effect eventually produced by the insufficient angular discretization, appears to be extremely persistent with respect to the refinement of the angular quadrature. The MP{sub N} method, that relies on continuous angular representation, offers a robust remedy to such an issue. MP{sub N} is based on the decomposition of the unit sphere into solid angles and on a piecewise continuous definition of interface fluxes, which are expanded in polynomials in each solid angle. This allows propagating more than one angular degree of freedom simultaneously while maintaining unaltered the block-diagonal pattern of the displacement plus removal operator. The method is therefore well suited for the flux resolution by means of a conventional sweep algorithm. Furthermore, unlike the S{sub N} method, MP{sub N} does not rely on discrete directions and, thus, on an angular quadrature formula, but rather constructs a set of linear equations solving for the angular moments of the flux for all discrete solid angles within the sweep. MP{sub N} shows an error convergence rate higher than S{sub N} at the expense of an increased size of the coefficient matrices, so of the computational cost. Although MP{sub N} is not free from ray-effect, the latter is effectively mitigated and less persistent with respect to the increase of the angular refinement order. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Sampling and resolution characteristics in reduced order models of shallow water equations: Intrusive vs nonintrusive

We investigate the sensitivity of reduced order models (ROMs) to training data spatial resolution as well as sampling rate. In particular, we consider proper orthogonal decomposition (POD), coupled with Galerkin projection (POD-GP), as an intrusive reduced order modeling technique. For non-intrusive ROMs, we consider two frameworks. The first is using dynamic mode decomposition (DMD), and the second is based on artificial neural networks (ANNs). For ANN, we utilized a residual deep neural network, and for DMD we have studied two versions of DMD approaches; one with hard thresholding and the other with sorted bases selection. Also, we highlight the differences between mean-subtracting the data (centering) and using the data without mean-subtraction. We tested these ROMs using a system of 2D shallow water equations for four different numerical experiments, adopting combinations of sampling rates and spatial resolutions. For these cases, we found that the DMD basis obtained with hard threshodling is sensitive to sampling rate. The sorted DMD algorithm helps to mitigate this problem and yields more stabilized and converging solution. Furthermore, we demonstrate that both DMD approaches without mean subtraction provide significantly more accurate results than DMD with mean-subtracting the data. On the other hand, POD is relatively insensitive to sampling rate and yields better representation of the flow field. Meanwhile, spatial resolution has little effect on both POD and DMD performances. Here, the numerical results reveal that an ANN on POD subspace (POD-ANN) performs remarkably better than POD-GP and DMD in capturing system dynamics, even with a small number of modes.

42 ENGINEERING↗

GLAD-M35: a joint P and S global tomographic model with uncertainty quantification

We present our third and final generation joint P and S global adjoint tomography (GLAD) model, GLAD-M35, and quantify its uncertainty based on a low-rank approximation of the inverse Hessian. Starting from our second-generation model, GLAD-M25, we added 680 new earthquakes to the database for a total of 2160 events. New P-wave categories are included to compensate for the imbalance between P- and S-wave measurements, and we enhanced the window selection algorithm to include more major-arc phases, providing better constraints on the structure of the deep mantle and more than doubling the number of measurement windows to 40 million. Two stages of a Broyden–Fletcher–Goldfarb–Shanno (BFGS) quasi-Newton inversion were performed, each comprising five iterations. With this BFGS update history, we determine the model’s standard deviation and resolution length through randomized singular value decomposition.

58 GEOSCIENCES↗