Search NASA⌕ Search

SEARCH · Search NASA

Results for “Decomposition algorithm”

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

Fast polar decomposition of an arbitrary matrix

The polar decomposition of an m x n matrix A of full rank, where m is greater than or equal to n, can be computed using a quadratically convergent algorithm. The algorithm is based on a Newton iteration involving a matrix inverse. With the use of a preliminary complete orthogonal decomposition the algorithm can be extended to arbitrary A. How to use the algorithm to compute the positive semi-definite square root of a Hermitian positive semi-definite matrix is described. A hybrid algorithm which adaptively switches from the matrix inversion based iteration to a matrix multiplication based iteration due to Kovarik, and to Bjorck and Bowie is formulated. The decision when to switch is made using a condition estimator. This matrix multiplication rich algorithm is shown to be more efficient on machines for which matrix multiplication can be executed 1.5 times faster than matrix inversion.

Higham, Nicholas J.↗

A novel coupling of noise reduction algorithms for particle flow simulations

Proper orthogonal decomposition (POD) and its extension based on time-windows have been shown to greatly improve the effectiveness of recovering smooth ensemble solutions from noisy particle data. However, to successfully de-noise any molecular system, a large number of measurements still need to be provided. In order to achieve a better efficiency in processing time-dependent fields, we have combined POD with a well-established signal processing technique, wavelet-based thresholding. In this novel hybrid procedure, the wavelet filtering is applied within the POD domain and referred to as WAVinPOD. The algorithm exhibits promising results when applied to both synthetically generated signals and particle data. In this work, the simulations compare the performance of our new approach with standard POD or wavelet analysis in extracting smooth profiles from noisy velocity and density fields. Numerical examples include molecular dynamics and dissipative particle dynamics simulations of unsteady force- and shear-driven liquid flows, as well as phase separation phenomenon. Simulation results confirm that WAVinPOD preserves the dimensionality reduction obtained using POD, while improving its filtering properties through the sparse representation of data in wavelet basis. This paper shows that WAVinPOD outperforms the other estimators for both synthetically generated signals and particle-based measurements, achieving a higher signal-to-noise ratio from a smaller number of samples. The new filtering methodology offers significant computational savings, particularly for multi-scale applications seeking to couple continuum informations with atomistic models. It is the first time that a rigorous analysis has compared de-noising techniques for particle-based fluid simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Near real-time response matrix calibration for 10 Hz GOFB

The 10 Hz global orbit feedback (GOFB), for damping the trajectory perturbation ({approx}10 Hz) due to the vibrations of the triplet quadrupoles, is operational. The correction algorithm uses transfer functions between the beam position monitors and correctors obtained from the online optics model and a correction algorithm based on singular value decomposition (SVD). Recently the calibration of the transfer functions was measured using beam position measurements acquired while modulating dedicated correctors. In this report, the feedback results with model matrix and measured matrix are compared.

43 PARTICLE ACCELERATORS↗

Polar decomposition for attitude determination from vector observations

This work treats the problem of weighted least squares fitting of a 3D Euclidean-coordinate transformation matrix to a set of unit vectors measured in the reference and transformed coordinates. A closed-form analytic solution to the problem is re-derived. The fact that the solution is the closest orthogonal matrix to some matrix defined on the measured vectors and their weights is clearly demonstrated. Several known algorithms for computing the analytic closed form solution are considered. An algorithm is discussed which is based on the polar decomposition of matrices into the closest unitary matrix to the decomposed matrix and a Hermitian matrix. A somewhat longer improved algorithm is suggested too. A comparison of several algorithms is carried out using simulated data as well as real data from the Upper Atmosphere Research Satellite. The comparison is based on accuracy and time consumption. It is concluded that the algorithms based on polar decomposition yield a simple although somewhat less accurate solution. The precision of the latter algorithms increase with the number of the measured vectors and with the accuracy of their measurement.

Bar-Itzhack, Itzhack Y.↗

Domain decomposition solvers for PDEs : some basics, practical tools, and new developments.

The first part of this talk provides a basic introduction to the building blocks of domain decomposition solvers. Specific details are given for both the classical overlapping Schwarz (OS) algorithm and a recent iterative substructuring (IS) approach called balancing domain decomposition by constraints (BDDC). A more recent hybrid OS-IS approach is also described. The success of domain decomposition solvers depends critically on the coarse space. Similarities and differences between the coarse spaces for OS and BDDC approaches are discussed, along with how they can be obtained from discrete harmonic extensions. Connections are also made between coarse spaces and multiscale modeling approaches from computational mechanics. As a specific example, details are provided on constructing coarse spaces for incompressible fluid problems. The next part of the talk deals with a variety of implementation details for domain decomposition solvers. These include mesh partitioning options, local and global solver options, reducing the coarse space dimension, dealing with constraint equations, residual weighting to accelerate the convergence of OS methods, and recycling of Krylov spaces to efficiently solve problems with multiple right hand sides. Some potential bottlenecks and remedies for domain decomposition solvers are also discussed. The final part of the talk concerns some recent theoretical advances, new algorithms, and open questions in the analysis of domain decomposition solvers. The focus will be primarily on the work of the speaker and his colleagues on elasticity, fluid mechanics, problems in H(curl), and the analysis of subdomains with irregular boundaries.

99 GENERAL AND MISCELLANEOUS↗

Three-dimensional discrete ordinates reactor assembly calculations on GPUs

In this paper we describe and demonstrate a discrete ordinates sweep algorithm on GPUs. This sweep algorithm is nested within a multilevel comunication-based decomposition based on energy. We demonstrated the effectiveness of this algorithm on detailed three-dimensional critical experiments and PWR lattice problems. For these problems we show improvement factors of 4 6 over conventional communication-based, CPU-only sweeps. These sweep kernel speedups resulted in a factor of 2 total time-to-solution improvement.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

QuadSync: Quadrifocal tensor synchronization via Tucker decomposition

In structure from motion, quadrifocal tensors capture more information than their pairwise counterparts (essential matrices), yet they have often been thought of as impractical and only of theoretical interest. In this work, we challenge such beliefs by providing a new framework to recover n cameras from the corresponding collection of quadrifocal tensors. We form the block quadrifocal tensor and show that it admits a Tucker decomposition whose factor matrices are the stacked camera matrices, and which thus has a multilinear rank of (4,4,4,4) independent of n. We develop the first synchronization algorithm for quadrifocal tensors, using Tucker decomposition, alternating direction method of multipliers, and iteratively reweighted least squares. We further establish relationships between the block quadrifocal, trifocal, and bifocal tensors, and introduce an algorithm that jointly synchronizes these three entities. Numerical experiments demonstrate the effectiveness of our methods on modern datasets, indicating the potential and importance of using higher-order information in synchronization.

Miao, Daniel [University of Minnesota]↗

Application of the Parareal Algorithm for Acoustic Wave Propagation

We present an application of the parareal algorithm to solve wave propagation problems in the time domain. The parareal algorithm is based on a decomposition of the integration time interval in time slices. It involves a serial prediction step based on a coarse approximation, and a correction step (computed in parallel) based on a fine approximation within each time slice. In our case, the spatial discretization is based on a spectral element approximation which allows flexible and accurate wave simulations in complex geological media. Fully explicit time advancing schemes are classically used for both coarse and fine solvers.In a first stage, we solve the 1D acoustic wave equation in an homogeneous medium in order to test stability and convergence properties of the parareal algorithm. We confirmed the stability problems outlined by Bal and Farhat et al. for hyperbolic problems. These stability issues are mitigated by a time-discontinuous Galerkin discretization of the coarse solver. It may also involve a coarser spatial discretization (hp-refinement) which helps to preserve stability and allows more significant computer savings. Besides, we explore the contribution of elastodynamic homogenization to build consistent coarse grid solvers. Extension to 2D/3D realistic geological media is an ongoing work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Near real-time ORM measurements and SVD matrix generation for 10 Hz global orbit feedback in RHIC

To reduce the effect of trajectory perturbations ({approx}10 Hz) due to vibrations of the final focusing quadrupoles at RHIC, global orbit feedback was successfully prototyped during run-10. After upgraded to a system with 36 BPMs and 12 correctors, 10 Hz feedback was tested successfully in Run-11 and is in operational status for physics program. The test and operation of the system has been performed using transfer functions between the beam position monitors and correctors obtained from the online optics model and a correction algorithm based on singular value decomposition (SVD). One of our goals is to self-calibrate the system using SVD matrices derived from orbit response matrix (ORM) measurements acquired real-time using the new FPGA-based signal processing. Comparisons between measurement matrix and model matrix and the generation of SVD matrix for the feedback operation are presented.

43 PARTICLE ACCELERATORS↗

Direct particle simulation on the Connection Machine CM-2

Particle simulation is a useful technique for analyzing low density flows. The Connection Machine CM-2 is a useful test bed for studying the fine-grain data objects decomposition and the coarse-grain domain decomposition single instruction multiple datastream (SIMD) approaches to particle simulation. Both approaches are investigated for the model problem of uniform flow through a channel and the algorithms required for the SIMD domain decomposition approach are presented. An unresolved issue with the domain decomposition approach is the effect of a poor partitioning on flows with real geometries. Initial results with the channel flow problem indicate that a poor partitioning has only a small detrimental effect on the overall performance.

Dagum, L.↗

Limited-memory adaptive snapshot selection for proper orthogonal decomposition

Reduced order models are useful for accelerating simulations in many-query contexts, such as optimization, uncertainty quantification, and sensitivity analysis. However, offline training of reduced order models can have prohibitively expensive memory and floating-point operation costs in high-performance computing applications, where memory per core is limited. To overcome this limitation for proper orthogonal decomposition, we propose a novel adaptive selection method for snapshots in time that limits offline training costs by selecting snapshots according an error control mechanism similar to that found in adaptive time-stepping ordinary differential equation solvers. The error estimator used in this work is related to theory bounding the approximation error in time of proper orthogonal decomposition-based reduced order models, and memory usage is minimized by computing the singular value decomposition using a single-pass incremental algorithm. Results for a viscous Burgers’ test problem demonstrate convergence in the limit as the algorithm error tolerances go to zero; in this limit, the full order model is recovered to within discretization error. The resulting method can be used on supercomputers to generate proper orthogonal decomposition-based reduced order models, or as a subroutine within hyperreduction algorithms that require taking snapshots in time, or within greedy algorithms for sampling parameter space.

97 MATHEMATICS AND COMPUTING↗

Intelligent load pattern modeling and denoising using improved variational mode decomposition for various calendar periods

This paper proposes a novel approach to identify the load patterns considering calendar impact and denoising process, which advances the state of art of load identification and load forecasting to a more flexible and adaptive extent by revealing the correlation between load profile and the substantial influence factors. With the rapid development and the promising application of energy intemet and grid modernization, the accurate load modeling and forecasting especially by load pattern modeling (LPM) have become more and more critical to observe and estimate load profile so as to optimize the operation efficiency of the power grid. Traditional methods mostly focus on the static LPM itself which are unable to account the non-linear and highly dynamic load fluctuations in order to balance the demand of the power grid during various calendar period (VCP) scheduling. In this paper, a load pattern modeling method for power grid considering the impact of typical calendar effects is proposed using a combination of improved variational mode decomposition (IVMD) and deep belief network (DBN) algorithm. Firstly, an index of load curve curvature (LCC) is proposed to improve the selection of value K in the conventional VMD algorithm. The value K of the intrinsic modality is determined by adopting LCC to better quantify the average instantaneous frequency of the modal decomposition of the VMD and to reduce the elevated stochasticity of k. Secondly, an optimization formulation is developed based on adaptive segmented loop decomposition of the typical correlation coefficient to suppress the edge effect in VMD decomposition, which would enable the reconstructed curve to incorporate the variabilities from the initial data. Finally, the IVMD and DBN algorithms are jointly implemented to optimize the accuracy of VCP load pattern modeling curve regression. Numerical examples have been performed with the results proving that the proposed method significantly outperforms the state-of-art in reducing the modeling error of VCP load curve, improving the overall forecasting accuracy, and reducing load dispatching cost.

deep belief network↗

An Extended Group Additivity Method for Polycyclic Thermochemistry Estimation

Automatic kinetic mechanism generation, virtual high-throughput screening, and automatic transition state search are currently trending applications requiring exploration of a large molecule space. Large-scale search requires fast and accurate estimation of molecules’ properties of interest, such as thermochemistry. Existing approaches are not satisfactory for large polycyclic molecules: considering the number of molecules being screened, quantum chemistry (even cheap density functional theory methods) can be computationally expensive, and group additivity, though fast, is not sufficiently accurate. Here, this paper provides a fast and moderately accurate alternative by proposing a polycyclic thermochemistry estimation method that extends the group additivity method with two additional algorithms: similarity match and bicyclic decomposition. It significantly reduces H f (298 K) estimation error from over 60 kcal/mol (group additivity method) to around 5 kcal/mol, C p (298 K) error from 9 to 1 cal/mol/K,and S(298 K) error from 70 to 7 cal/mol/K. This method also works well for heteroatomic polycyclics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Block-oriented modeling of superstructure optimization problems

We present a novel software framework for modeling large-scale engineered systems as mathematical optimization problems. A key motivating feature in such systems is their hierarchical, highly structured topology. Existing mathematical optimization modeling environments do not facilitate the natural expression and manipulation of hierarchically structured systems. Rather, the modeler is forced to "flatten" the system description, hiding structure that may be exploited by solvers, and obfuscating the system that the modeling environment is attempting to represent. To correct this deficiency, we propose a Python-based "block-oriented" modeling approach for representing the discrete components within the system. Our approach is an extension of the Pyomo library for specifying mathematical optimization problems. Through the use of a modeling components library, the block-oriented approach facilitates a clean separation of system superstructure from the details of individual components. This approach also naturally lends itself to expressing design and operational decisions as disjunctive expressions over the component blocks. By expressing a mathematical optimization problem in a block-oriented manner, inherent structure (e.g., multiple scenarios) is preserved for potential exploitation by solvers. In particular, we show that block-structured mathematical optimization problems can be straightforwardly manipulated by decomposition-based multi-scenario algorithmic strategies, specifically in the context of the PySP stochastic programming library. We illustrate our block-oriented modeling approach using a case study drawn from the electricity grid operations domain: unit commitment with transmission switching and N - 1 reliability constraints. Finally, we demonstrate that the overhead associated with block-oriented modeling only minimally increases model instantiation times, and need not adversely impact solver behavior. (C) 2013 Elsevier Ltd. All rights reserved.

Friedman, Z↗

Accelerating and Parallelizing Lagrangian Simulations of Mixing-Limited Reactive Transport

Recent advances in random walk particle tracking have enabled direct simulation of mixing and reactions by allowing the particles to interact with each other using a multipoint mass transfer scheme. The mass transfer scheme allows separation of mixing and spreading processes, among other advantages, but it is computationally expensive because its speed depends on the number of interacting particle pairs. This note explores methods for relieving the computational bottleneck caused by the mass transfer step, and we use these algorithms to develop a new parallel, interacting particle model. The new model is a combination of a sparse search algorithm and a novel domain decomposition scheme, both of which offer significant speedup relative to the reference case—even when they are executed serially. We combine the strengths of these methods to create a parallel particle scheme that is highly accurate and efficient with run times that scale as 1/P for a fixed number of particles, where P is the number of computational cores (equivalently, subdomains, in this work) being used. Here, the new parallel model is a significant advance because it enables efficient simulation of large particle ensembles that are needed for environmental simulations and also because it can naturally pair with parallel geochemical solvers to create a practical Lagrangian tool for simulating mixing and reactions in complex chemical systems.

54 ENVIRONMENTAL SCIENCES↗

Three-dimensional reconstruction of neutron, gamma-ray, and x-ray sources using spherical harmonic decomposition

Neutron, gamma-ray, and x-ray imaging are important diagnostic tools at the National Ignition Facility (NIF) for measuring the two-dimensional (2D) size and shape of the neutron producing region, for probing the remaining ablator and measuring the extent of the DT plasmas during the stagnation phase of Inertial Confinement Fusion implosions. Due to the difficulty and expense of building these imagers, at most only a few two-dimensional projections images will be available to reconstruct the three-dimensional (3D) sources. In this work, we present a technique that has been developed for the 3D reconstruction of neutron, gamma-ray, and x-ray sources from a minimal number of 2D projections using spherical harmonics decomposition. We present the detailed algorithms used for this characterization and the results of reconstructed sources from experimental neutron and x-ray data collected at OMEGA and NIF.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Communication-Avoiding Parallel Sparse-Dense Matrix-Matrix Multiplication

Multiplication of a sparse matrix with a dense matrix is a building block of an increasing number of applications in many areas such as machine learning and graph algorithms. However, most previous work on parallel matrix multiplication considered only both dense or both sparse matrix operands. This paper analyzes the communication lower bounds and compares the communication costs of various classic parallel algorithms in the context of sparse-dense matrix-matrix multiplication. We also present new communication-avoiding algorithms based on a 1D decomposition, called 1.5D, which - while suboptimal in dense-dense and sparse-sparse cases - outperform the 2D and 3D variants both theoretically and in practice for sparse-dense multiplication. Our analysis separates one-time costs from per iteration costs in an iterative machine learning context. Experiments demonstrate speedups up to 100x over a baseline 3D SUMMA implementation and show parallel scaling over 10 thousand cores.

Koanantakool, Penporn↗