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 793 records · Page 44

Comprehensive Evaluation and Application of GIS Insulation Condition Part 1: Selection and Optimization of Insulation Condition Comprehensive Evaluation Index Based on Multi-Source Information Fusion

How to select and optimize the evaluation indicators from many characteristic information to characterize the internal insulation condition of GIS equipment, and establish a scientific technical and economic evaluation model of insulation condition is a huge challenge needs to be addressed urgently. Motived by this purpose, this study simulates the deterioration process of four typical insulation defects in GIS to obtain the information of UHF, ultrasound, and SF 6 decomposition components excited by different degradation stages of each insulating defect simultaneously. Moreover, the operating environment conditions, running time, overhaul times, and the residual value of equipment are taken into account. Using the improved minimum-redundancy-maximum-relevance (mRMR) criterion and genetic algorithm, a comprehensive evaluation index system including the 23 evaluation indicators in three categories is established, which covers the PD hazard, SF 6 insulation performance, equipment running time and environment, and residual value. The research lays a foundation for the later construction and application of multi-source information fusion evaluation model of GIS equipment insulation condition considering economic value.

42 ENGINEERING↗

Stochastic basis adaptation and spatial domain decomposition for partial differential equations with random coefficients

We present a novel approach for high-dimensional stochastic partial differential equations that decomposes the computational domain into smaller disjoint subdomains and reduces the random dimension in each subdomain to save computational costs. The proposed approach combines spatial domain decomposition and stochastic basis adaptation in each subdomain. We adapt the stochastic basis in each subdomain such that the local solution has a low-dimensional random space representation. To compute the stochastic solution in each subdomain, we use the Neumann-Neumann algorithm, where we first estimate the interface solution and then evaluate the interior solution in each subdomain using the interface solution as a boundary condition. The interior solutions in each subdomain are computed independently of each other, which reduces the operation count from $\approx O(N^\alpha)$ to $\approx O(M^\alpha),$ where $N$ is the total number of degrees of freedom, $M$ is the number of degrees of freedom in each subdomain, and the exponent $\alpha>1$ depends on the uncertainty quantification method used. In addition, the localized nature of solutions makes the proposed approach highly parallelizable. We illustrate the accuracy and efficiency of the approach for a steady-state diffusion equation with a random space-dependent diffusion coefficient.

uncertainty quantification, basis adaptation↗

Performability analysis using semi-Markov reward processes

Beaudry (1978) proposed a simple method of computing the distribution of performability in a Markov reward process. Two extensions of Beaudry's approach are presented. The method is generalized to a semi-Markov reward process by removing the restriction requiring the association of zero reward to absorbing states only. The algorithm proceeds by replacing zero-reward nonabsorbing states by a probabilistic switch; it is therefore related to the elimination of vanishing states from the reachability graph of a generalized stochastic Petri net and to the elimination of fast transient states in a decomposition approach to stiff Markov chains. The use of the approach is illustrated with three applications.

Ciardo, Gianfranco↗

tapir: A tool for topologies, amplitudes, partial fraction decomposition and input for reductions

The demand for precision predictions in the field of high energy physics has dramatically increased over recent years. Experiments conducted at the LHC, as well as precision measurements at the intensity frontier such as Belle II require equally precise theoretical predictions to make full use of the acquired data. To match the experimental precision, second-, third- and, for certain quantities, even higher-order calculations in perturbative quantum field theory are required. To facilitate such calculations, computer software automating as many steps as possible is required. Yet, each calculation poses different challenges and thus, a high level of configurability is required. In this context we present tapir: a tool for identification, manipulation and minimization of Feynman integral families. It is designed to integrate in toolchains based on the computer algebra system FORM, the use of which is common practice in the field. tapir can be used to reduce the complexity of multi-loop problems with cut-filters, topology mapping, partial fraction decomposition and alike. Program Title:tapir CPC Library link to program files:https://doi.org/10.17632/ptc9t46xyn.1 Developer's repository link:https://gitlab.com/tapir-devs/tapir Licensing provisions: GPLv3 Programming language:python 3, C++ Nature of problem: Multi-loop computations require the automatization of a large number of different tasks related to Feynman integral topologies. Among them are the identification and minimization of integral topologies, partial fraction decomposition of topologies in the case of linearly dependent propagators as well as mapping scalar products of loop momenta to scalar functions. Solution method: The minimization of topologies is performed by comparison of their respective Nickel indices [1], even further minimization utilizes Pak's algorithm [2]. To efficiently map scalar products of loop momenta to scalar functions FORM [3] code is generated. Additional comments including restrictions and unusual features: Minimization based on Pak's algorithm slows down for many lines and scales. A coarser minimization using the Nickel indices, however, is still possible. [1]B. Nickel, D. Meiron, G.A.J. Baker, Compilation of 2-pt and 4-pt graphs for continuous spin model, Report, University of Guelph, 1977.[2]A. Pak, J. Phys. Conf. Ser. 368 (2012) 012049, https://doi.org/10.1088/1742-6596/368/1/012049, arXiv:1111.0868.[3]B. Ruijl, T. Ueda, J. Vermaseren, FORM version 4.2, arXiv:1707.06453, 7 2017.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

IMFIT: A FAST, FLEXIBLE NEW PROGRAM FOR ASTRONOMICAL IMAGE FITTING

I describe a new, open-source astronomical image-fitting program called IMFIT, specialized for galaxies but potentially useful for other sources, which is fast, flexible, and highly extensible. A key characteristic of the program is an object-oriented design that allows new types of image components (two-dimensional surface-brightness functions) to be easily written and added to the program. Image functions provided with IMFIT include the usual suspects for galaxy decompositions (Sérsic, exponential, Gaussian), along with Core-Sérsic and broken-exponential profiles, elliptical rings, and three components that perform line-of-sight integration through three-dimensional luminosity-density models of disks and rings seen at arbitrary inclinations. Available minimization algorithms include Levenberg-Marquardt, Nelder-Mead simplex, and Differential Evolution, allowing trade-offs between speed and decreased sensitivity to local minima in the fit landscape. Minimization can be done using the standard χ{sup 2} statistic (using either data or model values to estimate per-pixel Gaussian errors, or else user-supplied error images) or Poisson-based maximum-likelihood statistics; the latter approach is particularly appropriate for cases of Poisson data in the low-count regime. I show that fitting low-signal-to-noise ratio galaxy images using χ{sup 2} minimization and individual-pixel Gaussian uncertainties can lead to significant biases in fitted parameter values, which are avoided if a Poisson-based statistic is used; this is true even when Gaussian read noise is present.

79 ASTRONOMY AND ASTROPHYSICS↗

Simplified projection on total spin zero for state preparation on quantum computers

Here, we introduce a simple algorithm for projecting on J = 0 states of a many-body system by performing a series of rotations to remove states with angular momentum projections greater than zero. Existing methods rely on unitary evolution with the two-body operator J 2 , which when expressed in the computational basis contains many complicated Pauli strings requiring Trotterization and leading to very deep quantum circuits. Our approach performs the necessary projections using the one-body operators J x and J z . By leveraging the method of Cartan decomposition, the unitary transformations that perform the projection can be parametrized as a product of a small number of two-qubit rotations, with angles determined by an efficient classical optimization. Given the reduced complexity in terms of gates, this approach can be used to prepare approximate ground states of even-even nuclei by projecting onto the J = 0 component of deformed Hartree-Fock states. We estimate the resource requirements in terms of the universal gate set {H,S, CNOT ,T} and briefly discuss a variant of the algorithm that projects onto J = 1/2 states of a system with an odd number of fermions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A high-order numerical algorithm for DNS of low-Mach-number reactive flows with detailed chemistry and quasi-spectral accuracy

A novel and efficient algorithm is presented in this paper to deal with DNS of turbulent reacting flows under the low-Mach-number assumption, with detailed chemistry and a quasi-spectral accuracy. The temporal integration of the equations relies on an operating-split strategy, where chemical reactions are solved implicitly with a stiff solver and the convection-diffusion operators are solved with a Runge-Kutta-Chebyshev method. The spatial discretisation is performed with high-order compact schemes, and a FFT based constant-coefficient spectral solver is employed to solve a variable-coefficient Poisson equation. The numerical implementation takes advantage of the 2DECOMP&FFT libraries developed by, which are based on a pencil decomposition method of the domain and are proven to be computationally very efficient. An enhanced pressure-correction method is proposed to speed up the achievement of machine precision accuracy. It is demonstrated that a second-order accuracy is reached in time, while the spatial accuracy ranges from fourth-order to sixth-order depending on the set of imposed boundary conditions. In conclusion, the software developed to implement the present algorithm is called HOLOMAC, and its numerical efficiency opens the way to deal with DNS of reacting flows to understand complex turbulent and chemical phenomena in flames.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Development of Multiobjective Optimization Techniques for Sonic Boom Minimization

A discrete, semi-analytical sensitivity analysis procedure has been developed for calculating aerodynamic design sensitivities. The sensitivities of the flow variables and the grid coordinates are numerically calculated using direct differentiation of the respective discretized governing equations. The sensitivity analysis techniques are adapted within a parabolized Navier Stokes equations solver. Aerodynamic design sensitivities for high speed wing-body configurations are calculated using the semi-analytical sensitivity analysis procedures. Representative results obtained compare well with those obtained using the finite difference approach and establish the computational efficiency and accuracy of the semi-analytical procedures. Multidisciplinary design optimization procedures have been developed for aerospace applications namely, gas turbine blades and high speed wing-body configurations. In complex applications, the coupled optimization problems are decomposed into sublevels using multilevel decomposition techniques. In cases with multiple objective functions, formal multiobjective formulation such as the Kreisselmeier-Steinhauser function approach and the modified global criteria approach have been used. Nonlinear programming techniques for continuous design variables and a hybrid optimization technique, based on a simulated annealing algorithm, for discrete design variables have been used for solving the optimization problems. The optimization procedure for gas turbine blades improves the aerodynamic and heat transfer characteristics of the blades. The two-dimensional, blade-to-blade aerodynamic analysis is performed using a panel code. The blade heat transfer analysis is performed using an in-house developed finite element procedure. The optimization procedure yields blade shapes with significantly improved velocity and temperature distributions. The multidisciplinary design optimization procedures for high speed wing-body configurations simultaneously improve the aerodynamic, the sonic boom and the structural characteristics of the aircraft. The flow solution is obtained using a comprehensive parabolized Navier Stokes solver. Sonic boom analysis is performed using an extrapolation procedure. The aircraft wing load carrying member is modeled as either an isotropic or a composite box beam. The isotropic box beam is analyzed using thin wall theory. The composite box beam is analyzed using a finite element procedure. The developed optimization procedures yield significant improvements in all the performance criteria and provide interesting design trade-offs. The semi-analytical sensitivity analysis techniques offer significant computational savings and allow the use of comprehensive analysis procedures within design optimization studies.

Chattopadhyay, Aditi↗

Spherical Harmonic Decomposition of Gravitational Waves Across Mesh Refinement Boundaries

We evolve a linearized (Teukolsky) solution of the Einstein equations with a non-linear Einstein solver. Using this testbed, we are able to show that such gravitational waves, defined by the Weyl scalars in the Newman-Penrose formalism, propagate faithfully across mesh refinement boundaries, and use, for the first time to our knowledge, a novel algorithm due to Misner to compute spherical harmonic components of our waveforms. We show that the algorithm performs extremely well, even when the extraction sphere intersects refinement boundaries.

Fiske, David R.↗

Improvements to the Ion Doppler Spectrometer Diagnostic on the HIT-SI Experiments

An Ion Doppler Spectrometer diagnostic system measuring impurity ion temperature and velocity on the HIT-SI and HIT-SI3 spheromak devices has been improved with higher spatiotemporal resolution and lower error than previously described devices. Hardware and software improvements to the established technique have resulted in a record 6.9 µs temporal and <=2.8 cm spatial resolution in the midplane of each device. These allow C III and O II flow, displacement, and temperature profiles to be simultaneously observed. With 72 fused-silica fiber channels in two independent bundles, and an f/8.5 Czerny-Turner spectrometer coupled to video camera, frame-rates of up to ten times the imposed magnetic perturbation frequency of 14.5 kHz were achieved in HIT-SI, viewing the upper 1/2 of the midplane. In HIT-SI3 frame-rates of up to eight times the perturbation frequency were achieved viewing both halves of the midplane. Biorthogonal Decomposition is used as a novel filtering tool, reducing uncertainty in ion temperature from <=13 to <=5 eV (with an instrument temperature of 8-16 eV), and uncertainty in velocity from <=2 to <=1 km/s. Doppler shift and broadening is calculated via the Levenberg-Marquart algorithm, after which errors in velocity and temperature are uniquely specified. Axisymmetric temperature profiles on HIT-SI3 for C III peaked near the inboard current separatrix at approximately 40 eV are observed. Axisymmetric plasma displacement profiles have been measured on HIT-SI3, peaking at approximately 6 cm at the outboard separatrix. Both profiles agree with the upper half of the midplane observable by HIT-SI. With its complete midplane view, HIT-SI3 has unambiguously extracted axisymmetric, toroidal current dependent rotation of up to 3 km/s. Analysis of the temporal phase of the displacement uncovers a coherent structure, locked to the applied perturbation. Previously described diagnostic systems could not achieve such results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum real-time evolution using tensor renormalization group methods

We introduce an approach for approximate real-time evolution of quantum systems using tensor renormalization group (TRG) methods originally developed for imaginary time. We use higher-order TRG to generate a coarse-grained time evolution operator for a 1+1⁢D transverse Ising model with a longitudinal field. We show that the standard tensor norm used for the singular value decomposition-based truncation is degenerate and propose an alternate method to discriminate. We show that it is effective and efficient in evolving Gaussian wave packets for one and two particles in the disordered phase, while ordered phase behavior is more challenging to capture. We compare our algorithm with local simulators for universal quantum computers and discuss possible benchmarking in the near future.

lattice gauge theory↗

pyDRESCALk

Modern data scientists are tasked to analyze ever-growing data sets with increasingly complex relationships. Tensor decompositions have come to play a central role in identifying underlying latent structures in higher-order data. The problem of fitting tensor models to different distributions is complicated by the combinations of size, dimensionality, and sparsity present in real world data. The situation demands efficient algorithms designed for shared-memory and distributed systems. This work will present new research that tackles these challenges on several different fronts, leveraging optimizations in numerical algorithms and sparse tensor representations in heterogeneous high performance computing environments.

Bhattarai, Manish↗

Parallel Tensor Compression for Large-Scale Scientific Data.

As parallel computing trends towards the exascale, scientific data produced by high-fidelity simulations are growing increasingly massive. For instance, a simulation on a three-dimensional spatial grid with 512 points per dimension that tracks 64 variables per grid point for 128 time steps yields 8 TB of data. By viewing the data as a dense five way tensor, we can compute a Tucker decomposition to find inherent low-dimensional multilinear structure, achieving compression ratios of up to 10000 on real-world data sets with negligible loss in accuracy. So that we can operate on such massive data, we present the first-ever distributed memory parallel implementation for the Tucker decomposition, whose key computations correspond to parallel linear algebra operations, albeit with nonstandard data layouts. Our approach specifies a data distribution for tensors that avoids any tensor data redistribution, either locally or in parallel. We provide accompanying analysis of the computation and communication costs of the algorithms. To demonstrate the compression and accuracy of the method, we apply our approach to real-world data sets from combustion science simulations. We also provide detailed performance results, including parallel performance in both weak and strong scaling experiments.

59 BASIC BIOLOGICAL SCIENCES↗

Lattice QCD Calculation of Nucleon Structure

It is emphasized in the 2015 NSAC Long Range Plan that "understanding the structure of hadrons in terms of QCD's quarks and gluons is one of the central goals of modern nuclear physics." Over the last three decades, lattice QCD has developed into a powerful tool for ab initio calculations of strong-interaction physics. Up until now, it is the only theoretical approach to solving QCD with controlled statistical and systematic errors. Since 1985, we have proposed and carried out first-principles calculations of nucleon structure and hadron spectroscopy using lattice QCD which entails both algorithmic development and large-scale computer simulation. We started out by calculating the nucleon form factors -- electromagnetic, axial-vector, πNN, and scalar form factors, the quark spin contribution to the proton spin, the strangeness magnetic moment, the quark orbital angular momentum, the quark momentum fraction, and the quark and glue decomposition of the proton momentum and angular momentum. The first round of calculations were done with Wilson fermions in the `quenched' approximation where the dynamical effects of the quarks in the sea are not taken into account in the Monte Carlo simulation to generate the background gauge configurations. Beginning in 2000, we have started implementing the overlap fermion formulation into the spectroscopy and structure calculations. This is mainly because the overlap fermion honors chiral symmetry as in the continuum. It is going to be more and more important to take the symmetry into account as the simulations move closer to the physical point where the u and d quark masses are as light as a few MeV only. We began with lattices which have quark masses in the sea corresponding to a pion mass at ~ 300 MeV and obtained the strange form factors, charm and strange quark masses, the charmonium spectrum and the D s meson decay constant f D s , the strangeness and charmness, the meson mass decomposition and the strange quark spin from the anomalous Ward identity. Recently, we have started to include multiple lattices with different lattice spacings and different volumes including large lattices at the physical pion mass point. We are getting quite close to being able to calculate the hadron structure at the physical point and to do the continuum and large volume extrapolations, which is our ultimate aim. We have now finished several projects which have included these systematic corrections. They include the leptonic decay width of the ρ, the πN sigma and strange sigma terms, and the strange quark magnetic moment. Over the years, we have also studied hadron spectroscopy with lattice calculations and in phenomenology. These include Roper resonance, pentaquark state, charmonium spectrum, glueballs, scalar mesons a 0 (1450) and σ(600) and other scalar mesons, and the 1 -+ meson. In addition, we have employed the canonical approach to explore the first-order phase transition and the critical point at finite density and finite temperature. We have also discovered a new parton degree of freedom -- the connected sea partons, from the path-integral formulation of the hadronic tensor, which explains the experimentally observed Gottfried sum rule violation. Combining experimental result on the strange parton distribution, the CT10 global fitting results of the total u and d anti-partons and the lattice result of the ratio of the momentum fraction of the strange vs that of u or d in the disconnected insertion, we have shown that the connected sea partons can be isolated. In this final technical report, we shall present a few representative highlights that have been achieved in the project.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Multicomponent Cholesky Decomposition: Application to Nuclear–Electronic Orbital Theory

The Cholesky decomposition technique is commonly used to reduce the memory requirement for storing two-particle repulsion integrals in quantum chemistry calculations that use atomic orbital bases. However, when quantum methods use multicomponent bases, such as nuclear–electronic orbitals, additional challenges are introduced due to asymmetric two-particle integrals. This work proposes several multicomponent Cholesky decomposition methods for calculations using nuclear–electronic orbital density functional theory. To analyze the errors in different Cholesky decomposition components, benchmark calculations using water clusters are carried out. The largest benchmark calculation is a water cluster (H 2 O) 27 where all 54 protons are treated quantum mechanically. Furthermore, this study provides energetic and complexity analyses to demonstrate the accuracy and performance of the proposed multicomponent Cholesky decomposition method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A generalized Ewald decomposition for screened Coulomb interactions

Medium-range interactions occur in a wide range of systems, including charged-particle systems with varying screening lengths. We generalize the Ewald method to charged systems described by interactions involving an arbitrary dielectric response function ϵ(𝐤). We provide an error estimate and optimize the generalization to find the break-even parameters that separate a neighbor list-only algorithm from the particle-particle particle-mesh algorithm. We examine the implications of different choices of the screening length for the computational cost of computing the dynamic structure factor. We then use our new method in molecular dynamics simulations to compute the dynamic structure factor for a model plasma system and examine the wave-dispersion properties of this system.

Dharuman, Gautham↗

Effect of finite particle number sampling on baryon number fluctuations

The effects of finite particle number sampling on the net baryon number cumulants, extracted from fluid dynamical simulations, are studied. The commonly used finite particle number sampling procedure introduces an additional Poissonian (or multinomial if global baryon number conservation is enforced) contribution which increases the extracted moments of the baryon number distribution. If this procedure is applied to a fluctuating fluid dynamics framework, one severely overestimates the actual cumulants. We show that the sampling of so-called test particles suppresses the additional contribution to the moments by at least one power of the number of test particles. We demonstrate this method in a numerical fluid dynamics simulation that includes the effects of spinodal decomposition due to a first-order phase transition. Furthermore, in the limit where antibaryons can be ignored, we derive analytic formulas which capture exactly the effect of particle sampling on the baryon number cumulants. These formulas may be used to test the various numerical particle sampling algorithms.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗