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 541 records · Page 30

Interpretation of experimental data on safety parameters from standpoint of mathematical nuclear reactor theory

The paper deals with the problem of correct processing of experimental information for unambiguous determination of current reactivity value. The methodology for reactivity determination that is based on spectral decomposition of the solution obtained for non-stationary equation of neutron transport is presented. The proposed spectral projection algorithm takes into consideration the effects related with space-time re-distribution of neutron field and thus excludes the main systematic error and increases accuracy of current reactivity values. The paper presents the results of model calculations, demonstrating the effectiveness of the proposed method. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

CPOPT : optimization for fitting CANDECOMP/PARAFAC models.

Tensor decompositions (e.g., higher-order analogues of matrix decompositions) are powerful tools for data analysis. In particular, the CANDECOMP/PARAFAC (CP) model has proved useful in many applications such chemometrics, signal processing, and web analysis; see for details. The problem of computing the CP decomposition is typically solved using an alternating least squares (ALS) approach. We discuss the use of optimization-based algorithms for CP, including how to efficiently compute the derivatives necessary for the optimization methods. Numerical studies highlight the positive features of our CPOPT algorithms, as compared with ALS and Gauss-Newton approaches.

99 GENERAL AND MISCELLANEOUS↗

Efficient Scalable Parallel Higher Order Direct MoM-SIE Method With Hierarchically Semiseparable Structures for 3-D Scattering

A novel fast scalable parallel algorithm is proposed for the solution of large 3-D scattering problems based on: 1) the double (geometrical and current-approximation) higher order (DHO) method of moments (MoM) in the surface integral equation (SIE) formulation and 2) a direct solver for dense linear systems utilizing hierarchically semiseparable (HSS) structures. Namely, an HSS matrix representation is used for compression, factorization, and solution of the system matrix. In addition, a rank-revealing QR decomposition for memory compression is used, with a stopping criterion in terms of the relative rank tolerance value. One method for geometrical preprocessing of the scatterers based on the cobblestone distance sorting technique is employed in order to enhance the HSS algorithm accuracy and parallelization. Numerical examples show how the accuracy of the DHO HSS-MoM-SIE method is easily controllable by using the relative tolerance for the matrix compression. Furthermore, the examples demonstrate low memory consumption, as well as much faster simulation time, when compared to the direct LU decomposition. The method enables dramatically faster monostatic scattering computations than iterative solvers and reduced number of unknowns when compared to low-order discretizations. Finally, great scalability of the algorithm is demonstrated on more than one thousand processes.

97 MATHEMATICS AND COMPUTING↗

MO-FG-CAMPUS-TeP2-01: A Graph Form ADMM Algorithm for Constrained Quadratic Radiation Treatment Planning

Purpose: In radiation therapy optimization the constraints can be either hard constraints which must be satisfied or soft constraints which are included but do not need to be satisfied exactly. Currently the voxel dose constraints are viewed as soft constraints and included as a part of the objective function and approximated as an unconstrained problem. However in some treatment planning cases the constraints should be specified as hard constraints and solved by constrained optimization. The goal of this work is to present a computation efficiency graph form alternating direction method of multipliers (ADMM) algorithm for constrained quadratic treatment planning optimization and compare it with several commonly used algorithms/toolbox. Method: ADMM can be viewed as an attempt to blend the benefits of dual decomposition and augmented Lagrangian methods for constrained optimization. Various proximal operators were first constructed as applicable to quadratic IMRT constrained optimization and the problem was formulated in a graph form of ADMM. A pre-iteration operation for the projection of a point to a graph was also proposed to further accelerate the computation. Result: The graph form ADMM algorithm was tested by the Common Optimization for Radiation Therapy (CORT) dataset including TG119, prostate, liver, and head & neck cases. Both unconstrained and constrained optimization problems were formulated for comparison purposes. All optimizations were solved by LBFGS, IPOPT, Matlab built-in toolbox, CVX (implementing SeDuMi) and Mosek solvers. For unconstrained optimization, it was found that LBFGS performs the best, and it was 3–5 times faster than graph form ADMM. However, for constrained optimization, graph form ADMM was 8 – 100 times faster than the other solvers. Conclusion: A graph form ADMM can be applied to constrained quadratic IMRT optimization. It is more computationally efficient than several other commercial and noncommercial optimizers and it also used significantly less computer memory.

60 APPLIED LIFE SCIENCES↗

Composite-dimensional topological codes with boundaries and defects

We introduce new algorithms and provide example constructions of stabilizer models for the gapped boundaries, domain walls, and 0D defects of Abelian composite-dimensional twisted quantum doubles. Using the physically intuitive concept of condensation, our algorithm explicitly describes how to construct the boundary and domain-wall stabilizers starting from the bulk model. This extends the utility of Pauli stabilizer models in describing nontranslationally invariant topological orders with gapped boundaries. To highlight this utility, we provide a series of examples, including a new family of quantum error-correcting codes where the double of ℤ4 is coupled to instances of the double semion (DS) phase. We discuss the codes' utility in the burgeoning area of quantum error correction with an emphasis on the interplay between deconfined anyons, logical operators, error rates, and decoding. We also augment our construction, built using algorithmic tools to describe the properties of explicit stabilizer layouts at the microscopic lattice level, with dimensional counting arguments and macroscopic-level constructions building on pants decompositions. The latter outlines how such codes' representation and design can be automated. Our results are validated by a series of error-correcting threshold calculations comparing our codes' performance with that of standard surface codes. To do so, we introduce a composite-dimensional belief-propagation decoder with ordered statistics that utilizes combination sweeps. Going beyond our worked-out examples, we expect our explicit step-by-step algorithms to pave the path for higher-dimensional codes to be discovered and implemented in near-future architectures that take advantage of various hardware platforms.

Mousa, Mohamad [Purdue University]↗

Reduced-order simulation of large accelerator structures

Simulating electromagnetic waves inside finite periodic or almost periodic three-dimensional structures is important to research in linear particle acceleration, high power microwave generation, and photonic band gap structures. While eigenmodes of periodic structures can be determined from analysis of a single unit cell, based on Floquet theory, the general case of aperiodic structures, with defects or nonuniform properties, typically requires 3D electromagnetic simulation of the entire structure. When the structure is large and high accuracy is necessary this can require high-performance computing techniques to obtain even a few eigenmodes [Z. Li et al., Nucl. Instrum. Methods Phys. Res., Sect. A 558, 168 (2006)]. To confront this problem, we describe an efficient, field-based algorithm that can accurately determine the complete eigenmode spectrum for extended aperiodic structures, up to some chosen frequency limit. The new method combines domain decomposition with a nontraditional, dual eigenmode representation of the fields local to each cell of the structure. Two related boundary value eigenproblems are solved numerically in each cell, with (a) electrically shielded, and (b) magnetically shielded interfaces, to determine a combined set of basis fields. By using the dual solutions in our field representation we accurately represent both the electric and magnetic surface currents that mediate coupling at the interfaces between adjacent cells. The solution is uniformly convergent, so that typically only a few modes are used in each cell. We present results from 2D and 3D simulations that demonstrate the speed and low computational needs of the algorithm.

43 PARTICLE ACCELERATORS↗

A Reactive Molecular Dynamics Study of the Thermal Decomposition of Perfluorodimethyl Ether †

Classical reactive molecular dynamics (RMD) simulation is used to model the thermal decomposition of perfluorodimethyl ether (CF3OCF3), which is relevant as a simple molecule containing the necessary architectural elements to study the chemical stability of perfluoropolyether lubricants. The RMD algorithm employs nonreactive interaction potentials for the reactants and products. The reactivity is implemented through a coarse-grained simulation algorithm, incorporating elements from both the quantum and macroscopic descriptions of the reaction. The RMD scheme maps the quantum mechanically determined transition state onto a set of geometric triggers. When a configuration matching those triggers is found in the RMD simulation, the reaction instantaneously occurs. A brief, local equilibration process stabilizes the configuration, and the simulation continues. Using two geometric triggers, the RMD simulation can describe quantitatively the temperature dependence of the thermal decomposition of CF3OCF3, when compared to the quantum mechanical standard.

Chemistry↗

General CMB and primordial trispectrum estimation

In this paper we present trispectrum estimation methods which can be applied to general nonseparable primordial and CMB trispectra. We review the relationship between the reduced CMB trispectrum and the reduced primordial trispectrum. We present a general optimal estimator for the connected part of the trispectrum, for which we derive a quadratic term to incorporate the effects of inhomogeneous noise and masking. We describe a general algorithm for creating simulated maps with given arbitrary (and independent) power spectra, bispectra, and trispectra. We propose a universal definition of the trispectrum parameter T{sub NL}, so that the integrated trispectrum on the observational domain can be consistently compared between theoretical models. We define a shape function for the primordial trispectrum, together with a shape correlator and a useful parametrization for visualizing the trispectrum; these methods might also be applied to the late-time trispectrum for large-scale structure. We derive separable analytic CMB solutions in the large-angle limit for constant and local models. We present separable mode decompositions which can be used to describe any primordial or CMB trispectra on their respective wave number or multipole domains. By extracting coefficients of these separable basis functions from an observational map, we are able to present an efficient estimator for any given theoretical model with a nonseparable trispectrum. The estimator has two manifestations, comparing the theoretical and observed coefficients at either primordial or late times, thus encompassing a wider range of models, such as secondary anisotropies, lensing, and cosmic strings. We show that these mode decomposition methods are numerically tractable with order l{sup 5} operations for the CMB estimator and approximately order l{sup 6} for the general primordial estimator (reducing to order l{sup 3} in both cases for a special class of models). We also demonstrate how the trispectrum can be reconstructed from observational maps using these methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spatial assignment of symmetry adapted perturbation theory interaction energy components: The atomic SAPT partition

We develop a physically-motivated assignment of symmetry adapted perturbation theory for intermolecular interactions (SAPT) into atom-pairwise contributions (the A-SAPT partition). The basic precept of A-SAPT is that the many-body interaction energy components are computed normally under the formalism of SAPT, following which a spatially-localized two-body quasiparticle interaction is extracted from the many-body interaction terms. For electrostatics and induction source terms, the relevant quasiparticles are atoms, which are obtained in this work through the iterative stockholder analysis (ISA) procedure. For the exchange, induction response, and dispersion terms, the relevant quasiparticles are local occupied orbitals, which are obtained in this work through the Pipek-Mezey procedure. The local orbital atomic charges obtained from ISA additionally allow the terms involving local orbitals to be assigned in an atom-pairwise manner. Further summation over the atoms of one or the other monomer allows for a chemically intuitive visualization of the contribution of each atom and interaction component to the overall noncovalent interaction strength. Herein, we present the intuitive development and mathematical form for A-SAPT applied in the SAPT0 approximation (the A-SAPT0 partition). We also provide an efficient series of algorithms for the computation of the A-SAPT0 partition with essentially the same computational cost as the corresponding SAPT0 decomposition. We probe the sensitivity of the A-SAPT0 partition to the ISA grid and convergence parameter, orbital localization metric, and induction coupling treatment, and recommend a set of practical choices which closes the definition of the A-SAPT0 partition. We demonstrate the utility and computational tractability of the A-SAPT0 partition in the context of side-on cation-π interactions and the intercalation of DNA by proflavine. A-SAPT0 clearly shows the key processes in these complicated noncovalent interactions, in systems with up to 220 atoms and 2845 basis functions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Reduced Basis Method for Nanodevices Simulation

Ballistic transport simulation in nanodevices, which involves self-consistently solving a coupled Schrodinger-Poisson system of equations, is usually computationally intensive. Here, we propose coupling the reduced basis method with the subband decomposition method to improve the overall efficiency of the simulation. By exploiting a posteriori error estimation procedure and greedy sampling algorithm, we are able to design an algorithm where the computational cost is reduced significantly. In addition, the computational cost only grows marginally with the number of grid points in the confined direction.

99 GENERAL AND MISCELLANEOUS↗

Enabling High-Dimensional Hierarchical Uncertainty Quantification by ANOVA and Tensor-Train Decomposition

Hierarchical uncertainty quantification can reduce the computational cost of stochastic circuit simulation by employing spectral methods at different levels. This paper presents an efficient framework to simulate hierarchically some challenging stochastic circuits/systems that include high-dimensional subsystems. Due to the high parameter dimensionality, it is challenging to both extract surrogate models at the low level of the design hierarchy and to handle them in the high-level simulation. In this paper, we develop an efficient analysis of variance-based stochastic circuit/microelectromechanical systems simulator to efficiently extract the surrogate models at the low level. In order to avoid the curse of dimensionality, we employ tensor-train decomposition at the high level to construct the basis functions and Gauss quadrature points. As a demonstration, we verify our algorithm on a stochastic oscillator with four MEMS capacitors and 184 random parameters. This challenging example is efficiently simulated by our simulator at the cost of only 10min in MATLAB on a regular personal computer.

ANOVA↗

Weak Simulation v.0.1

The SPARSIFY algorithm implemented by the code allows for classical simulation of universal quantum computer sample outcomes. The code sparsifies the stabilizer decomposition of a qubit t-tensored T gate magic state to some additive error. This is accomplished by either independent L1 sampling or with correlated L1 sampling to supplement an independent subset, which offers a more efficient decomposition: for a given t, a sparser decomposition is sufficient with correlated L1 sampling to satisfy a given additive error. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525. SAND2021-8296 O

SciDAC↗

TMVOC-MP: a parallel numerical simulator for Three-PhaseNon-isothermal Flows of Multicomponent Hydrocarbon Mixtures inporous/fractured media

TMVOC-MP is a massively parallel version of the TMVOC code (Pruess and Battistelli, 2002), a numerical simulator for three-phase non-isothermal flow of water, gas, and a multicomponent mixture of volatile organic chemicals (VOCs) in multidimensional heterogeneous porous/fractured media. TMVOC-MP was developed by introducing massively parallel computing techniques into TMVOC. It retains the physical process model of TMVOC, designed for applications to contamination problems that involve hydrocarbon fuels or organic solvents in saturated and unsaturated zones. TMVOC-MP can model contaminant behavior under 'natural' environmental conditions, as well as for engineered systems, such as soil vapor extraction, groundwater pumping, or steam-assisted source remediation. With its sophisticated parallel computing techniques, TMVOC-MP can handle much larger problems than TMVOC, and can be much more computationally efficient. TMVOC-MP models multiphase fluid systems containing variable proportions of water, non-condensible gases (NCGs), and water-soluble volatile organic chemicals (VOCs). The user can specify the number and nature of NCGs and VOCs. There are no intrinsic limitations to the number of NCGs or VOCs, although the arrays for fluid components are currently dimensioned as 20, accommodating water plus 19 components that may be either NCGs or VOCs. Among them, NCG arrays are dimensioned as 10. The user may select NCGs from a data bank provided in the software. The currently available choices include O{sub 2}, N{sub 2}, CO{sub 2}, CH{sub 4}, ethane, ethylene, acetylene, and air (a pseudo-component treated with properties averaged from N{sub 2} and O{sub 2}). Thermophysical property data of VOCs can be selected from a chemical data bank, included with TMVOC-MP, that provides parameters for 26 commonly encountered chemicals. Users also can input their own data for other fluids. The fluid components may partition (volatilize and/or dissolve) among gas, aqueous, and NAPL phases. Any combination of the three phases may present, and phases may appear and disappear in the course of a simulation. In addition, VOCs may be adsorbed by the porous medium, and may biodegrade according to a simple half-life model. Detailed discussion of physical processes, assumptions, and fluid properties used in TMVOC-MP can be found in the TMVOC user's guide (Pruess and Battistelli, 2002). TMVOC-MP was developed based on the parallel framework of the TOUGH2-MP code (Zhang et al. 2001, Wu et al. 2002). It uses the MPI (Message Passing Forum, 1994) for parallel implementation. A domain decomposition approach is adopted for the parallelization. The code partitions a simulation domain, defined by an unstructured grid, using partitioning algorithm from the METIS software package (Karypsis and Kumar, 1998). In parallel simulation, each processor is in charge of one part of the simulation domain for assembling mass and energy balance equations, solving linear equation systems, updating thermophysical properties, and performing other local computations. The local linear-equation systems are solved in parallel by multiple processors with the Aztec linear solver package (Tuminaro et al., 1999). Although each processor solves the linearized equations of subdomains independently, the entire linear equation system is solved together by all processors collaboratively via communication between neighboring processors during each iteration. Detailed discussion of the prototype of the data-exchange scheme can be found in Elmroth et al. (2001). In addition, FORTRAN 90 features are introduced to TMVOC-MP, such as dynamic memory allocation, array operation, matrix manipulation, and replacing 'common blocks' (used in the original TMVOC) with modules. All new subroutines are written in FORTRAN 90. Program units imported from the original TMVOC remain in standard FORTRAN 77. This report provides a quick starting guide for using the TMVOC-MP program. We suppose that the users have basic knowledge of using the original TMVOC code. The users can find the detailed technical description of the physical processes modeled, and the mathematical and numerical methods in the user's guide for TMVOC (Pruess and Battistelli, 2002).

58 GEOSCIENCES↗

Internal Alignment of the SLD Vertex Detector

The tracking resolution and vertex finding capabilities of the SLD experiment depended upon a precise knowledge of the location and orientation of the elements of the SLD pixel vertex detector (VXD3) in 3D space. At the heart of the procedure described here to align the 96 CCDs is the matrix inversion technique of singular value decomposition (SVD). This tool was employed to unfold the detector geometry corrections from the track data in the VXD3. The algorithm was adapted to perform an optimal {chi}{sup 2} minimization by careful treatment of the track hit residual measurement errors. The tracking resolution obtained with the aligned geometry achieved the design performance. Comments are given on how this method could be used for other trackers.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Improved ALE mesh velocities for complex flows

A key choice in the development of arbitrary Lagrangian-Eulerian solution algorithms is how to move the computational mesh. The most common approaches are smoothing and relaxation techniques, or to compute a mesh velocity field that produces smooth mesh displacements. We present a method in which the mesh velocity is specified by the irrotational component of the fluid velocity as computed from a Helmholtz decomposition, and excess compression of mesh cells is treated through a noniterative, local spring-force model. This approach allows distinct and separate control over rotational and translational modes. In conclusion, the utility of the new mesh motion algorithm is demonstrated on a number of 3D test problems, including problems that involve both shocks and significant amounts of vorticity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Computer-Aided Design: Digital Quantum Simulation of Quantum Processors

With the increasing size of quantum processors, submodules that constitute the processor hardware will become too large to accurately simulate on a classical computer. Therefore, one would soon have to fabricate and test each new design primitive and parameter choice in time-consuming coordination between design, fabrication, and experimental validation. Here we show how one can design and test the performance of next-generation quantum hardware—by using existing quantum computers. Focusing on superconducting transmon processors as a prominent hardware platform, we compute the static and dynamic properties of individual and coupled transmons. We show how the energy spectra of transmons can be obtained by variational hybrid quantum-classical algorithms that are well suited for near-term noisy quantum computers. In addition, single- and two-qubit gate simulations are demonstrated via Suzuki-Trotter decomposition. Our methods pave a promising way towards designing candidate quantum processors when the demands of calculating submodule properties exceed the capabilities of classical computing resources.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dual energy exposure control (DEEC) for computed tomography: Algorithm and simulation study

DECT means acquiring the same object at two different energies, respectively two different tube voltages U{sub 1} and U{sub 2}. The raw data q{sub 1} and q{sub 2} undergo a decomposition process of type p=p(q{sub 1},q{sub 2}). The raw data p are reconstructed to obtain monochromatic images of the attenuation {mu}, of the object density {rho}, or of a specific material distribution. Recent advances in DECT focus on noise reduction techniques [S. Richard and J. H. Siewerdsen, Med. Phys. 35(2), 586-600 (2008)] and enable high performance DECT such as lung nodule detection [Shkumat et al., Med. Phys. 35(2), 629-632 (2008)]. Given p and a raw data-based projection-wise patient dose estimation D({alpha}) the authors determine the optimal tube current curves I{sub 1}({alpha}) and I{sub 2}({alpha}), with {alpha} being the view angle, which minimizes image noise for a given patient dose level. DEEC can perform online; I{sub 1}({alpha}) and I{sub 2}({alpha}) can be determined during the scan. Simulation studies using semianthropomorphic phantom data were carried out. In particular, functions p that generate {mu}-images and density images were evaluated. Image quality was compared to standard scans at U{sub 0}=120 kV (clinical CT) and U{sub 0}=45 kV (micro-CT) that were taken at the same dose level (D{sub 0}=D{sub 1}+D{sub 2}) and identical spatial resolution. Appropriate choice of p(q{sub 1},q{sub 2}) allows to obtain {mu}-images that show fewer artifacts and yield image noise levels comparable to the noise of the standard scan. The authors compared the standard scan to {mu}-images at 70 keV, which is the effective energy used in clinical CT, and found optimal results with {mu}-images at 25 keV for micro-CT. Nonoptimal choice of the decomposition function will, however, significantly increase image noise. In particular {mu}-images at 511 keV, as needed for PET/CT attenuation correction, exhibit more than twice as much image noise as the standard scan. With DEEC, which guarantees best dose usage possible, monochromatic images are generated with only slightly increased noise levels at the same dose compared to a standard scan. The benefit of significantly decreased artifacts appears to allow using DEEC-generated monochromatic images in daily routine. Furthermore, DEEC is not restricted to DECT and the inherent tube current modulation algorithm may also be applied to single energy CT.

62 RADIOLOGY AND NUCLEAR MEDICINE↗