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 649 records · Page 36

A quantitative acoustic emission study on fracture processes in ceramics based on wavelet packet decomposition

We base a quantitative acoustic emission (AE) study on fracture processes in alumina ceramics on wavelet packet decomposition and AE source location. According to the frequency characteristics, as well as energy and ringdown counts of AE, the fracture process is divided into four stages: crack closure, nucleation, development, and critical failure. Each of the AE signals is decomposed by a 2-level wavelet package decomposition into four different (from-low-to-high) frequency bands (AA{sub 2}, AD{sub 2}, DA{sub 2}, and DD{sub 2}). The energy eigenvalues P{sub 0}, P{sub 1}, P{sub 2}, and P{sub 3} corresponding to these four frequency bands are calculated. By analyzing changes in P{sub 0} and P{sub 3} in the four stages, we determine the inverse relationship between AE frequency and the crack source size during ceramic fracture. AE signals with regard to crack nucleation can be expressed when P{sub 0} is less than 5 and P{sub 3} more than 60; whereas AE signals with regard to dangerous crack propagation can be expressed when more than 92% of P{sub 0} is greater than 4, and more than 95% of P{sub 3} is less than 45. Geiger location algorithm is used to locate AE sources and cracks in the sample. The results of this location algorithm are consistent with the positions of fractures in the sample when observed under a scanning electronic microscope; thus the locations of fractures located with Geiger's method can reflect the fracture process. The stage division by location results is in a good agreement with the division based on AE frequency characteristics. We find that both wavelet package decomposition and Geiger's AE source locations are suitable for the identification of the evolutionary process of cracks in alumina ceramics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tensor decomposition in post-Hartree–Fock methods. II. CCD implementation

In a previous publication, we have discussed the usage of tensor decomposition in the canonical polyadic (CP) tensor format for electronic structure methods. There, we focused on two-electron integrals and second order Møller-Plesset perturbation theory (MP2). In this work, we discuss the CP format for Coupled Cluster (CC) theory and present a pilot implementation for the Coupled Cluster Doubles method. We discuss the iterative solution of the CC amplitude equations using tensors in CP representation and present a tensor contraction scheme that minimizes the effort necessary for the rank reductions during the iterations. Furthermore, several details concerning the reduction of complexity of the algorithm, convergence of the CC iterations, truncation errors, and the choice of threshold for chemical accuracy are discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Iterative packing for demand matching and sparse packing.

The main result we will present is a 2k-approximation algorithm for the following 'k-hypergraph demand matching' problem: given a set system with sets of size <=k, where sets have profits & demands and vertices have capacities, find a max-profit subsystem whose demands do not exceed the capacities. The main tool is an iterative way to explicitly build a decomposition of the fractional optimum as 2k times a convex combination of integral solutions. If time permits we'll also show how the approach can be extended to a 3-approximation for 2-column sparse packing. The second result is tight w.r.t the integrality gap, and the first is near-tight as a gap lower bound of 2(k-1+1/k) is known.

99 GENERAL AND MISCELLANEOUS↗

Robust parallel iterative solvers for linear and least-squares problems (Final Technical Report)

The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the problem of evaluating f(A)v which arises in statistical sampling. 11. As an application to the methods we developed, we tackled the problem of computing the diagonal of the inverse of a matrix. This arises in statistical applications as well as in many applications in physics. We explored probing methods as well as domain-decomposition type methods. 12. A collaboration with researchers from Toulouse, France, considered the important problem of computing the Schur complement in a domain-decomposition approach. 13. We explored new ways of preconditioning linear systems, based on low-rank approximations.

97 MATHEMATICS AND COMPUTING↗

Accelerating multigrid with streaming chiral SVD for Wilson fermions in lattice QCD

A modification to the setup algorithm for the multigrid preconditioner of Wilson fermions in lattice QCD is presented. A larger basis of test vectors than that used in regular multigrid is calculated by the smoother and truncated by singular value decomposition on the chiral components of the test vectors. The truncated basis is used to form the prolongation and restriction matrices of the multigrid hierarchy. This modification of the setup method is demonstrated to increase the convergence of linear solvers on an anisotropic lattice with m π ≈ 239 MeV from the Hadron Spectrum Collaboration and an isotropic lattice with m π ≈ 220 MeV from the MILC Collaboration. The lattice volume dependence of the method is also examined. Increasing the number of test vectors improves speedup up to a point, but storing these vectors becomes impossible in limited memory resources such as GPUs. To address storage cost, we implement a streaming singular value decomposition of the basis of test vectors on the chiral components and demonstrate a decrease in the number of fine level iterations by a factor of 1.7 for m q ≈ m crit

Iterative methods↗

Extending the length and time scales of Gram–Schmidt Lyapunov vector computations

Lyapunov vectors have found growing interest recently due to their ability to characterize systems out of thermodynamic equilibrium. The computation of orthogonal Gram–Schmidt vectors requires multiplication and QR decomposition of large matrices, which grow as N{sup 2} (with the particle count). This expense has limited such calculations to relatively small systems and short time scales. Here, we detail two implementations of an algorithm for computing Gram–Schmidt vectors. The first is a distributed-memory message-passing method using Scalapack. The second uses the newly-released MAGMA library for GPUs. We compare the performance of both codes for Lennard–Jones fluids from N=100 to 1300 between Intel Nahalem/Infiniband DDR and NVIDIA C2050 architectures. To our best knowledge, these are the largest systems for which the Gram–Schmidt Lyapunov vectors have been computed, and the first time their calculation has been GPU-accelerated. We conclude that Lyapunov vector calculations can be significantly extended in length and time by leveraging the power of GPU-accelerated linear algebra.

97 MATHEMATICS AND COMPUTING↗

A Reactive Molecular Dynamics Algorithm for Proton Transport in Aqueous Systems

We present a model that incorporates the structural diffusion of a proton into a classical molecular dynamics simulation using a reactive molecular dynamics (RMD) algorithm. The transition state for proton transfer obtained from ab initio calculations is mapped onto a set of geometric and energetic triggers to describe the structural diffusion of the proton in the simulation. Numerical values of these triggers are parametrized to satisfy the experimental values of rate constant and activation energy in order to capture the molecular and macroscopic features of structural diffusion. The algorithm partitions the structural diffusion of a proton into three steps: (i) satisfaction of the triggers, (ii) instantaneous reaction, and (iii) local equilibration. The final step ensures that the ending point of the reaction provides the correct structure and heat of reaction. Hence, the reactivity is incorporated by the algorithm rather than through the development of a reactive potential. We have applied this scheme to study proton transport in bulk water and solutions of HCl. Total charge diffusion along with the structural and vehicular decomposition is studied as a function of temperature (280-320 K). The two components are found to be uncorrelated and the structural diffusion contributes 60-70% of the total charge diffusion in bulk water. The method is applied to HCl solutions (0.22-0.83 M) to study the effect of concentration on proton transport. The reduction in the total diffusivity of the charge with an increase in concentration is due to the reduction in structural diffusion.

Chemistry↗

A necessary and sufficient condition for the stability of linear Hamiltonian systems with periodic coefficients

Linear Hamiltonian systems with time-dependent coefficients are of importance to nonlinear Hamiltonian systems, accelerator physics, plasma physics, and quantum physics. It is shown here that the solution map of a linear Hamiltonian system with time-dependent coefficients can be parameterized by an envelope matrix w(t), which has a clear physical meaning and satisfies a nonlinear envelope matrix equation. It is proved that a linear Hamiltonian system with periodic coefficients is stable if and only if the envelope matrix equation admits a solution with periodic w † w and a suitable initial condition. The mathematical devices utilized in this theoretical development with significant physical implications are time-dependent canonical transformations, normal forms for stable symplectic matrices, and horizontal polar decomposition of symplectic matrices. These tools systematically decompose the dynamics of linear Hamiltonian systems with time-dependent coefficients and are expected to be effective in other studies as well, such as those on quantum algorithms for classical Hamiltonian systems.

43 PARTICLE ACCELERATORS↗

Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Data

In this paper, we propose a personalized Tucker decomposition (perTucker) to address the limitations of traditional tensor decomposition methods in capturing heterogeneity across different datasets. perTucker decomposes tensor data into shared global components and personalized local components. We introduce an order orthogonality assumption and develop a proximal gradient regularized block coordinate descent algorithm guaranteed to converge to a stationary point. The unique and common representations learned by perTucker reveal intrinsic statistical patterns in data and provide valuable information for a wide range of downstream analytics, including anomaly detection, source classification, and clustering. We demonstrate perTucker’s effectiveness through a simulation study and two case studies on solar flare detection and tonnage signal classification.

14 SOLAR ENERGY↗

A semi-automatic method for extracting thin line structures in images as rooted tree network

This paper addresses the problem of semi-automatic extraction of line networks in digital images - e.g., road or hydrographic networks in satellite images, blood vessels in medical images, robust. For that purpose, we improve a generic method derived from morphological and hydrological concepts and consisting in minimum cost path estimation and flow simulation. While this approach fully exploits the local contrast and shape of the network, as well as its arborescent nature, we further incorporate local directional information about the structures in the image. Namely, an appropriate anisotropic metric is designed by using both the characteristic features of the target network and the eigen-decomposition of the gradient structure tensor of the image. Following, the geodesic propagation from a given seed with this metric is combined with hydrological operators for overland flow simulation to extract the line network. The algorithm is demonstrated for the extraction of blood vessels in a retina image and of a river network in a satellite image.

47 OTHER INSTRUMENTATION↗

Efficient Measurement-Driven Eigenenergy Estimation with Classical Shadows

Quantum algorithms exploiting real-time evolution under a target Hamiltonian have demonstrated remarkable efficiency in extracting key spectral information. However, the broader potential of these methods, particularly beyond ground-state calculations, is underexplored. In this work, we introduce the framework of multiobservable dynamic mode decomposition (MODMD), which combines the observable dynamic mode decomposition (DMD), a measurement-driven eigensolver tailored for near-term implementation, with classical shadow tomography. MODMD leverages random scrambling in the classical shadow technique to construct, with exponentially reduced resource requirements, a signal subspace that encodes rich spectral information. Notably, we replace typical Hadamard-test circuits with a protocol designed to predict low-rank observables, thereby broadening the use of classical shadow tomography for predicting many low-rank observables. We establish theoretical guarantees on the spectral approximation from MODMD, taking into account distinct sources of error. In the ideal case, we prove that the spectral error scales as exp (−Δ⁢𝐸⁢𝑡 max ), where Δ⁢𝐸 is the Hamiltonian spectral gap and 𝑡 max is the maximal simulation time. This analysis provides a rigorous justification of the rapid convergence observed across simulations. To demonstrate the utility of our framework, we consider its application to fundamental tasks, such as determining the low-lying, i.e., ground or excited, energies of representative many-body systems. Our work paves the path for efficient designs of measurement-driven algorithms on near-term and early fault-tolerant quantum devices.

quantum algorithms & computation↗

Learning compact physics‐aware delayed photocurrent models using dynamic mode decomposition

Abstract Radiation‐induced photocurrent in semiconductor devices can be simulated using complex physics‐based models, which are accurate, but computationally expensive. This presents a challenge for implementing device characteristics in high‐level circuit simulations where it is computationally infeasible to evaluate detailed models for multiple individual circuit elements. In this work we demonstrate a procedure for learning compact delayed photocurrent models that are efficient enough to implement in large‐scale circuit simulations, but remain faithful to the underlying physics. Our approach utilizes dynamic mode decomposition (DMD), a system identification technique for learning reduced‐order discrete‐time dynamical systems from time series data based on singular value decomposition. To obtain physics‐aware device models, we simulate the excess carrier density induced by radiation pulses by solving numerically the ambipolar diffusion equation, then use the simulated internal state as training data for the DMD algorithm. Our results show that the significantly reduced‐order delayed photocurrent models obtained via this method accurately approximate the dynamics of the internal excess carrier density—which can be used to calculate the induced current at the device boundaries—while remaining compact enough to incorporate into larger circuit simulations.

Hanson, Joshua↗

Scalable multiscale modeling of platelets with 100 million particles

Here, we developed the core components of the AI-aided multiple time stepping algorithm for multiscale modeling of cell dynamics. This algorithm was implemented and analyzed on two supercomputer architectures with an application of simulating the aggregation of 250 platelets, or 102 million particles. To scale on these computers with complex memory and network architectures with GPUs, we devised a biomechanics-informed task mapping scheme to optimize load imbalance, communications, and memory utilization. Our simulations, scaling well up to 192 nodes on a Summit-like supercomputer with a peak speed of 11 petaflops, achieved a rate of 423 μs/day which is 500 times faster than the conventional algorithm using static time step and this has enabled studies of record size blood clots at record spatial–temporal resolutions. Additionally, we discovered the sensitive dependence of the scalability and execution time on the methods of decomposition, CPU–GPU coupling, and task mapping.

97 MATHEMATICS AND COMPUTING↗

Accelerating phase-field-based microstructure evolution predictions via surrogate models trained by machine learning methods

Abstract The phase-field method is a powerful and versatile computational approach for modeling the evolution of microstructures and associated properties for a wide variety of physical, chemical, and biological systems. However, existing high-fidelity phase-field models are inherently computationally expensive, requiring high-performance computing resources and sophisticated numerical integration schemes to achieve a useful degree of accuracy. In this paper, we present a computationally inexpensive, accurate, data-driven surrogate model that directly learns the microstructural evolution of targeted systems by combining phase-field and history-dependent machine-learning techniques. We integrate a statistically representative, low-dimensional description of the microstructure, obtained directly from phase-field simulations, with either a time-series multivariate adaptive regression splines autoregressive algorithm or a long short-term memory neural network. The neural-network-trained surrogate model shows the best performance and accurately predicts the nonlinear microstructure evolution of a two-phase mixture during spinodal decomposition in seconds, without the need for “on-the-fly” solutions of the phase-field equations of motion. We also show that the predictions from our machine-learned surrogate model can be fed directly as an input into a classical high-fidelity phase-field model in order to accelerate the high-fidelity phase-field simulations by leaping in time. Such machine-learned phase-field framework opens a promising path forward to use accelerated phase-field simulations for discovering, understanding, and predicting processing–microstructure–performance relationships.

36 MATERIALS SCIENCE↗

Multi-scale coarse-graining of non-conservative interactions in molecular liquids

A new bottom-up procedure for constructing non-conservative (dissipative and stochastic) interactions for dissipative particle dynamics (DPD) models is described and applied to perform hierarchical coarse-graining of a polar molecular liquid (nitromethane). The distant-dependent radial and shear frictions in functional-free form are derived consistently with a chosen form for conservative interactions by matching two-body force-velocity and three-body velocity-velocity correlations along the microscopic trajectories of the centroids of Voronoi cells (clusters), which represent the dissipative particles within the DPD description. The Voronoi tessellation is achieved by application of the K-means clustering algorithm at regular time intervals. Consistently with a notion of many-body DPD, the conservative interactions are determined through the multi-scale coarse-graining (MS-CG) method, which naturally implements a pairwise decomposition of the microscopic free energy. A hierarchy of MS-CG/DPD models starting with one molecule per Voronoi cell and up to 64 molecules per cell is derived. The radial contribution to the friction appears to be dominant for all models. As the Voronoi cell sizes increase, the dissipative forces rapidly become confined to the first coordination shell. For Voronoi cells of two and more molecules the time dependence of the velocity autocorrelation function becomes monotonic and well reproduced by the respective MS-CG/DPD models. A comparative analysis of force and velocity correlations in the atomistic and CG ensembles indicates Markovian behavior with as low as two molecules per dissipative particle. The models with one and two molecules per Voronoi cell yield transport properties (diffusion and shear viscosity) that are in good agreement with the atomistic data. The coarser models produce slower dynamics that can be appreciably attributed to unaccounted dissipation introduced by regular Voronoi re-partitioning as well as by larger numerical errors in mapping out the dissipative forces. The framework presented herein can be used to develop computational models of real liquids which are capable of bridging the atomistic and mesoscopic scales.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Smoothing of respiratory motion traces for motion-compensated radiotherapy

Purpose: The CyberKnife system has been used successfully for several years to radiosurgically treat tumors without the need for stereotactic fixation or sedation of the patient. It has been shown that tumor motion in the lung, liver, and pancreas can be tracked with acceptable accuracy and repeatability. However, highly precise targeting for tumors in the lower abdomen, especially for tumors which exhibit strong motion, remains problematic. Reasons for this are manifold, like the slow tracking system operating at 26.5 Hz, and using the signal from the tracking camera ''as is''. Since the motion recorded with the camera is used to compensate for system latency by prediction and the predicted signal is subsequently used to infer the tumor position from a correlation model based on x-ray imaging of gold fiducials around the tumor, camera noise directly influences the targeting accuracy. The goal of this work is to establish the suitability of a new smoothing method for respiratory motion traces used in motion-compensated radiotherapy. The authors endeavor to show that better prediction--With a lower rms error of the predicted signal--and/or smoother prediction is possible using this method. Methods: The authors evaluated six commercially available tracking systems (NDI Aurora, PolarisClassic, Polaris Vicra, MicronTracker2 H40, FP5000, and accuTrack compact). The authors first tracked markers both stationary and while in motion to establish the systems' noise characteristics. Then the authors applied a smoothing method based on the a trous wavelet decomposition to reduce the devices' noise level. Additionally, the smoothed signal of the moving target and a motion trace from actual human respiratory motion were subjected to prediction using the MULIN and the nLMS{sub 2} algorithms. Results: The authors established that the noise distribution for a static target is Gaussian and that when the probe is moved such as to mimic human respiration, it remains Gaussian with the exception of the FP5000 and the Aurora systems. The authors also showed that the proposed smoothing method can indeed be used to filter noise. The signal's jitter dropped by as much as 95% depending on the tracking system employed. Subsequently, the 3D prediction error (rms) for a prediction horizon of 150 ms on a synthetic signal dropped by up to 37% when using a normalized LMS prediction algorithm (nLMS{sub 2}) and hardly changed when using a MULIN algorithm. When smoothing a real signal obtained in our laboratory, the improvement of prediction was similar: Up to 30% for both the nLMS{sub 2} and the best MULIN algorithm. The authors also found a noticeable increase in smoothness of the predicted signal, the relative jitter dropped by up to 95% on the real signal, and on the simulated signal. Conclusions: In conclusion, the authors can say that preprocessing of marker data is very useful in motion-compensated radiotherapy since the quality of prediction increases. This will result in better performance of the correlation model. As a side effect, since the prediction of a preprocessed signal is also less noisy, the authors expect less robot vibration resulting in better targeting accuracy and less strain on the robot gears.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Parallel Computation of Three-Dimensional Flows using Overlapping Grids with Adaptive Mesh Refinement

This paper describes an approach for the numerical solution of time-dependent partial differential equations in complex three-dimensional domains. The domains are represented by overlapping structured grids, and block-structured adaptive mesh refinement (AMR) is employed to locally increase the grid resolution. In addition, the numerical method is implemented on parallel distributed-memory computers using a domain-decomposition approach. The implementation is flexible so that each base grid within the overlapping grid structure and its associated refinement grids can be independently partitioned over a chosen set of processors. A modified bin-packing algorithm is used to specify the partition for each grid so that the computational work is evenly distributed amongst the processors. All components of the AMR algorithm such as error estimation, regridding, and interpolation are performed in parallel. The parallel time-stepping algorithm is illustrated for initial-boundary-value problems involving a linear advection-diffusion equation and the (nonlinear) reactive Euler equations. Numerical results are presented for both equations to demonstrate the accuracy and correctness of the parallel approach. Exact solutions of the advection-diffusion equation are constructed, and these are used to check the corresponding numerical solutions for a variety of tests involving different overlapping grids, different numbers of refinement levels and refinement ratios, and different numbers of processors. The problem of planar shock diffraction by a sphere is considered as an illustration of the numerical approach for the Euler equations, and a problem involving the initiation of a detonation from a hot spot in a T-shaped pipe is considered to demonstrate the numerical approach for the reactive case. For both problems, the solutions are shown to be well resolved on the finest grid. The parallel performance of the approach is examined in detail for the shock diffraction problem.

42 ENGINEERING↗