Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm computing”

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 1,711 records · Page 95

Efficient analysis of small-angle scattering curves for large biomolecular assemblies using Monte Carlo methods

Structure elucidation from small-angle scattering curves of large biomolecular assemblies is notoriously challenging. This is because the simulation of high-resolution features in the structure of large macromolecular assemblies, such as de novo protein assemblies, is computationally demanding when it needs to cover a broad range of length scales. Conventional methods, such as the numerical approximation to the Debye equation or the use of spherical harmonics, do not scale well as the size of the assembly increases, which limits their application to small structures (e.g. individual proteins). This work explores the effectiveness of a Monte Carlo method to simulate and fit scattering curves for large biomolecular assemblies spanning over ranges covering atomic and molecular detail (e.g. spacing and orientation of proteins in an assembly) as well as large-scale (hundreds of nanometres) features. Owing to its speed and scalability, it can be combined with a fitting algorithm to extract structural features from experimental small-angle scattering curves in biomolecular assemblies that are otherwise intractable for interpretation. This work first demonstrates the effectiveness of the tool using experimental small-angle X-ray scattering (SAXS) data from tile-like proteins that assemble into 1D tube-like macromolecular structures. Here, the diameter distribution of tubes is extracted from SAXS fits, and this is quantitatively compared with distributions from electron microscopy. SAXS data are also obtained from 2D sheet-like protein assemblies, and the proposed method is used to quantify structural features such as the separation distance between protein building blocks and the flexing of the sheet. An open-source implementation of the methodology is provided for use in a broad range of biological systems involving multi-scale scattering analysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable Parallel Methods for Analyzing Metagenomics Data at Extreme Scale

The field of bioinformatics and computational biology is currently experiencing a data revolution. The exciting prospect of making fundamental biological discoveries is fueling the rapid development and deployment of numerous cost-effective, high-throughput next-generation sequencing technologies. The result is that the DNA and protein sequence repositories are being bombarded with new sequence information. Databases are continuing to report a Moore’s law-like growth trajectory in their database sizes, roughly doubling every 18 months. In what seems to be a paradigm-shift, individual projects are now capable of generating billions of raw sequence data that need to be analyzed in the presence of already annotated sequence information. While it is clear that data-driven methods, such as sequencing homology detection, are becoming the mainstay in the field of computational life sciences, the algorithmic advancements essential for implementing complex data analytics at scale have mostly lagged behind. Sequence homology detection is central to a number of bioinformatics applications including genome sequencing and protein family characterization. Given millions of sequences, the goal is to identify all pairs of sequences that are highly similar (or “homologous”) on the basis of alignment criteria. While there are optimal alignment algorithms to compute pairwise homology, their deployment for large-scale is currently not feasible; instead, heuristic methods are used at the expense of quality. In this dissertation, we present the design and evaluation of a parallel implementation for conducting optimal homology detection on distributed memory supercomputers. Our approach uses a combination of techniques from asynchronous load balancing (viz. work stealing, dynamic task counters), data replication, and exact-matching filters to achieve homology detection at scale. Results for a collection of 2.56M sequences show parallel efficiencies of ~75-100% on up to 8K cores, representing a time-to-solution of 33 seconds. We extend this work with a detailed analysis of single-node sequence alignment performance using the latest CPU vector instruction set extensions. Preliminary results reveal that current sequence alignment algorithms are unable to fully utilize widening vector registers.

59 BASIC BIOLOGICAL SCIENCES↗

Quantum Search Approaches to Sampling-Based Motion Planning

In this paper, we present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms. We consider two complementary scenarios: for simpler sparse environments, we formulate the Quantum Full Path Search Algorithm (q-FPS), which creates a superposition of full random path solutions, manipulates probability amplitudes with Quantum Amplitude Amplification (QAA), and quantum measures a single obstacle free full path solution. For dense unstructured environments, we formulate the Quantum Rapidly Exploring Random Tree algorithm, q-RRT, that creates quantum superpositions of possible parent-child connections, manipulates probability amplitudes with QAA, and quantum measures a single reachable state, which is added to a tree. As performance depends on the number of oracle calls and the probability of measuring good quantum states, we quantify how these errors factor into the probabilistic completeness properties of the algorithm. We then numerically estimate the expected number of database solutions to provide an approximation of the optimal number of oracle calls in the algorithm. We compare the q-RRT algorithm with a classical implementation and verify quadratic run-time speedup in the largest connected component of a 2D dense random lattice. We conclude by evaluating a proposed approach to limit the expected number of database solutions and thus limit the optimal number of oracle calls to a given number.

97 MATHEMATICS AND COMPUTING↗

Computer Modeling and Simulation

Verification and validation of computer codes and models used in simulation are two aspects of the scientific practice of high importance and have recently been discussed by philosophers of science. While verification is predominantly associated with the correctness of the way a model is represented by a computer code or algorithm, validation more often refers to model’s relation to the real world and its intended use. It has been argued that because complex simulations are generally not transparent to a practitioner, the Duhem problem can arise for verification and validation due to their entanglement; such an entanglement makes it impossible to distinguish whether a coding error or model’s general inadequacy to its target should be blamed in the case of the model failure. I argue that in order to disentangle verification and validation, a clear distinction between computer modeling (construction of mathematical computer models of elementary processes) and simulation (construction of models of composite objects and processes by means of numerical experimenting with them) needs to be made. Holding on to that distinction, I propose to relate verification (based on theoretical strategies such as inferences) to modeling and validation, which shares the common epistemology with experimentation, to simulation. To explain reasons of their intermittent entanglement I propose a weberian ideal-typical model of modeling and simulation as roles in practice. I suggest an approach to alleviate the Duhem problem for verification and validation generally applicable in practice and based on differences in epistemic strategies and scopes

Pronskikh, V. S.↗

Interparameter trade-off quantification and reduction in isotropic-elastic full-waveform inversion: synthetic experiments and Hussar land data set application

The problem of inverting for multiple physical parameters in the subsurface using seismic full-waveform inversion (FWI) is complicated by interparameter trade-off arising from inherent ambiguities between different physical parameters. Parameter resolution is often characterized using scattering radiation patterns, but these neglect some important aspects of interparameter trade-off. More general analysis and mitigation of interparameter trade-off in isotropic-elastic FWI is possible through judiciously chosen multiparameter Hessian matrix-vector products. We show that products of multiparameter Hessian off-diagonal blocks with model perturbation vectors, referred to as interparameter contamination kernels , are central to the approach. We then apply the multiparameter Hessian to various vectors designed to provide information regarding the strengths and characteristics of interparameter contamination, both locally and within the whole volume. With numerical experiments, we observe that S-wave velocity perturbations introduce strong contaminations into density and phase-reversed contaminations into P-wave velocity, but themselves experience only limited contaminations from other parameters. Based on these findings, we introduce a novel strategy to mitigate the influence of interparameter trade-off with approximate contamination kernels. Furthermore, we recommend that the local spatial and interparameter trade-off of the inverted models be quantified using extended multiparameter point spread functions (EMPSFs) obtained with pre-conditioned conjugate-gradient algorithm. Compared to traditional point spread functions, the EMPSFs appear to provide more accurate measurements for resolution analysis, by de-blurring the estimations, scaling magnitudes and mitigating interparameter contamination. Approximate eigenvalue volumes constructed with stochastic probing approach are proposed to evaluate the resolution of the inverted models within the whole model. With a synthetic Marmousi model example and a land seismic field data set from Hussar, Alberta, Canada, we confirm that the new inversion strategy suppresses the interparameter contamination effectively and provides more reliable density estimations in isotropic-elastic FWI as compared to standard simultaneous inversion approach.

58 GEOSCIENCES↗

Generative Vulnerability Assessment for Cyber-Physical Systems

Cyber-physical systems (CPS) are highly susceptible to malicious attacks due to their complex dynamics and interconnectivity. A comprehensive understanding of their vulnerabilities is essential for designing effective resilience measures. This paper presents a data-driven attack generative system for evaluating the vulnerability of CPS. The proposed approach formulates the vulnerability assessment problem as determining the feasibility of a specific attack set based on two boundary functions that represent the effectiveness and stealthiness of attacks. The attack generative model is trained using a custom loss function, with two universal approximators designed to learn the effectiveness and stealthiness functions simultaneously. Theoretical results for successful generation and asymptotic convergence of the resulting training algorithm are given. As a result, the proposed approach is evaluated via numerical simulation of an IEEE 14-bus system and gas pipeline systems, demonstrating its viability in learning how to attack nonlinear CPS and identify potential vulnerabilities.

Computer systems organization↗

NWChem: Quantum Chemistry Simulations at Scale

Methods based on quantum mechanics equations have been developed since the 1930's with the purpose of accurately studying the electronic structure of molecules. However, it is only during the last two decades that intense development of new computational algorithms has opened the possibility of performing accurate simulations of challenging molecular processes with high-order many-body methods. A wealth of evidence indicates that the proper inclusion of instantaneous interactions between electrons (or the so-called electron correlation effects) is indispensable for the accurate characterization of chemical reactivity, molecular properties, and interactions of light with matter. The availability of reliable methods for benchmarking of medium-size molecular systems provides also a unique chance to propagate high-level accuracy across spatial scales through the multiscale methodologies. Some of these methods have potential to utilize computational resources in an effi*cient way since they are characterized by high numerical complexity and appropriate level of data granularity, which can be effi*ciently distributed over multi-processor architectures. The broad spectrum of coupled cluster (CC) methods falls into this class of methodologies. Several recent CC implementations clearly demonstrated the scalability of CC formalisms on architectures composed of hundreds thousand computational cores. In this context NWChem provides a collection of Tensor Contraction Engine (TCE) generated parallel implementations of various coupled cluster methods capable of taking advantage of many thousand of cores on leadership class parallel architectures.

chemistry↗

DIMENSION REDUCTION NUMERICAL CLOSURE METHOD FOR ADVECTION-DIFFUSION-REACTION SYSTEMS

Many natural physical processes exhibit a multiscale behavior, that is the same processes allow different mathematical description on different scales. The microscale description is usually based on fundamental conservation laws that form a closed system of ordinary differential equations (ODEs) or partial differential equations (PDEs) but the numerical discretization of these equations may produce a system of ODEs with an enormous number of unknowns. Furthermore, a time integration of the microscale equations usually requires time steps that are smaller than the observation time by many orders of magnitude. A direct solution of these ODEs can be extremely expensive. This necessitates development of advanced algorithms for model (or dimension) reduction. Often, we are only interested in the average behavior of the system rather than the exact solution of the ODEs. Here we developed a novel dimension reduction method that gives an approximate solution of the ODEs and gives an accurate prediction of the average behavior. The method relies on a computational closure of averaged evolution balance equations. The computational closure is achieved via short bursts of microscale simulation. The dimension reduction model was used to simulate flow and transport with mixing controlled reactions and mineral precipitation. A pore-scale model was used as a microscale model. A good agreement between microscale simulations and the accelerated microscale simulations confirms the accuracy and computational efficiency of the dimension reduction model. The method significant accelerates microscale simulations, while providing accurate approximation of the solution and accurate prediction of the average behavior of the system.

99 GENERAL AND MISCELLANEOUS↗

Analysis of deformable image registration accuracy using computational modeling

Computer aided modeling of anatomic deformation, allowing various techniques and protocols in radiation therapy to be systematically verified and studied, has become increasingly attractive. In this study the potential issues in deformable image registration (DIR) were analyzed based on two numerical phantoms: One, a synthesized, low intensity gradient prostate image, and the other a lung patient's CT image data set. Each phantom was modeled with region-specific material parameters with its deformation solved using a finite element method. The resultant displacements were used to construct a benchmark to quantify the displacement errors of the Demons and B-Spline-based registrations. The results show that the accuracy of these registration algorithms depends on the chosen parameters, the selection of which is closely associated with the intensity gradients of the underlying images. For the Demons algorithm, both single resolution (SR) and multiresolution (MR) registrations required approximately 300 iterations to reach an accuracy of 1.4 mm mean error in the lung patient's CT image (and 0.7 mm mean error averaged in the lung only). For the low gradient prostate phantom, these algorithms (both SR and MR) required at least 1600 iterations to reduce their mean errors to 2 mm. For the B-Spline algorithms, best performance (mean errors of 1.9 mm for SR and 1.6 mm for MR, respectively) on the low gradient prostate was achieved using five grid nodes in each direction. Adding more grid nodes resulted in larger errors. For the lung patient's CT data set, the B-Spline registrations required ten grid nodes in each direction for highest accuracy (1.4 mm for SR and 1.5 mm for MR). The numbers of iterations or grid nodes required for optimal registrations depended on the intensity gradients of the underlying images. In summary, the performance of the Demons and B-Spline registrations have been quantitatively evaluated using numerical phantoms. The results show that parameter selection for optimal accuracy is closely related to the intensity gradients of the underlying images. Also, the result that the DIR algorithms produce much lower errors in heterogeneous lung regions relative to homogeneous (low intensity gradient) regions, suggests that feature-based evaluation of deformable image registration accuracy must be viewed cautiously.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Wide ranging equation of state with Tartarus: A hybrid Green’s function/orbital based average atom code

Average atom models are widely used to make equation of state tables and for calculating other properties of materials over a wide range of conditions, from zero temperature isolated atom to fully ionized free electron gases. The numerical challenge of making these density functional theory based models work for any temperature, density or nuclear species is formidable. Here we present in detail a hybrid Green’s function/orbital based approach that has proved to be stable and accurate for wide ranging conditions. Algorithmic strategies are discussed. In particular the decomposition of the electron density into numerically advantageous parts is presented and a robust and rapid self consistent field method based on a quasi-Newton algorithm is given. Example application to the equation of state of lutetium (Z = 71) is explored in detail, including the effect of relativity, finite temperature exchange and correlation, and a comparison to a less approximate method. Furthermore, the hybrid scheme is found to be numerically stable and accurate for lutetium over at least 6 orders of magnitude in density and 5 orders of magnitude in temperature.

74 ATOMIC AND MOLECULAR PHYSICS↗

Computing resonant modes of accelerator cavities by solving nonlinear eigenvalue problems via rational approximation

Here, we present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems arising from the modeling of particle accelerator cavities. The eigenvalue nonlinearity in these problems results from the use of waveguides to couple external power sources or to allow certain excited electromagnetic modes to exit the cavity. We use a rational approximation to reduce the nonlinear eigenvalue problem first to a rational eigenvalue problem. We then apply a special linearization procedure to turn the rational eigenvalue problem into a larger linear eigenvalue problem with the same eigenvalues, which can be solved by existing iterative methods. By using a compact scheme to represent both the linearized operator and the eigenvectors to be computed, we obtain a numerical method that only involves solving linear systems of equations of the same dimension as the original nonlinear eigenvalue problem. We refer to this method as a compact rational Krylov (CORK) method. We implemented the CORK method in the Omega3P module of the Advanced Computational Electromagnetic 3D Parallel (ACE3P) simulation suite and validated it by comparing the computed cavity resonant frequencies and damping Q factors of a small model problem to those obtained from a fitting procedure that uses frequency responses computed by another ACE3P module called S3P. We also used the CORK method to compute trapped modes damped in an ideal eight 9-cell SRF cavity cryomodule. This was the first time it was possible to compute these modes directly. The damping Q factors of the computed modes match well with those measured in experiments and the difference in resonant frequencies is within the range introduced by cavity imperfection. Therefore, the CORK method is an extremely valuable tool for computational cavity design.

43 PARTICLE ACCELERATORS↗

Fast and low-dose computed laminography using compressive sensing based technique

Computed laminography (CL) is well known for inspecting microstructures in the materials, weldments and soldering defects in high density packed components or multilayer printed circuit boards. The overload problem on x-ray tube and gross failure of the radio-sensitive electronics devices during a scan are among important issues in CL which needs to be addressed. The sparse-view CL can be one of the viable option to overcome such issues. In this work a numerical aluminum welding phantom was simulated to collect sparsely sampled projection data at only 40 views using a conventional CL scanning scheme i.e. oblique scan. A compressive-sensing inspired total-variation (TV) minimization algorithm was utilized to reconstruct the images. It is found that the images reconstructed using sparse view data are visually comparable with the images reconstructed using full scan data set i.e. at 360 views on regular interval. We have quantitatively confirmed that tiny structures such as copper and tungsten slags, and copper flakes in the reconstructed images from sparsely sampled data are comparable with the corresponding structure present in the fully sampled data case. A blurring effect can be seen near the edges of few pores at the bottom of the reconstructed images from sparsely sampled data, despite the overall image quality is reasonable for fast and low-dose NDT.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

RADIAL STELLAR PULSATION AND THREE-DIMENSIONAL CONVECTION. I. NUMERICAL METHODS AND ADIABATIC TEST CASES

We are developing a three-dimensional radiation hydrodynamics code to simulate the interaction of convection and pulsation in classical variable stars. One key goal is the ability to carry these simulations to full amplitude in order to compare them with observed light and velocity curves. Previous two-dimensional calculations were prevented from doing this because of drift in the radial coordinate system, due to the algorithm defining radial movement of the coordinate system during the pulsation cycle. We remove this difficulty by defining our coordinate system flow algorithm to require that the mass in a spherical shell remains constant throughout the pulsation cycle. We perform adiabatic test calculations to show that large amplitude solutions repeat over more than 150 pulsation periods. We also verify that the computational method conserves the peak kinetic energy per period, as must be true for adiabatic pulsation models.

79 ASTRONOMY AND ASTROPHYSICS↗

Sparse low rank approximation of potential energy surfaces with applications in estimation of anharmonic zero point energies and frequencies

We introduce a method that exploits sparse representation of potential energy surfaces (PES) on a polynomial basis set selected by compressed sensing . The method is useful for studies involving large numbers of PES evaluations, such as the search for local minima, transition states, or integration. We apply this method for estimating zero point energies and frequencies of molecules using a three step approach. In the first step, we interpret the PES as a sparse tensor on polynomial basis and determine its entries by a compressed sensing based algorithm using only a few PES evaluations. Then, we establish a rank reduction strategy to compress this tensor in a suitable low-rank canonical tensor format using standard tensor compression tools. This allows representing a high dimensional PES as a small sum of products of one dimensional functions. Finally, a low dimensional Gauss–Hermite quadrature rule is used to integrate the product of sparse canonical low-rank representation of PES and Green’s function in the second-order diagrammatic vibrational many-body Green’s function theory (XVH2) for estimation of zero-point energies and frequencies. Numerical tests on molecules considered in this work indicate a more efficient scaling of computational cost with molecular size as compared to other methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Survey and analysis of multiresolution methods for turbulence data

This paper compares the effectiveness of various multi-resolution geometric representation methods, such as B-spline, Daubechies, Coiflet and Dual-tree wavelets, curvelets and surfacelets, to capture the structure of fully developed turbulence using a truncated set of coefficients. The turbulence dataset is obtained from a Direct Numerical Simulation of buoyancy driven turbulence on a 512 3 mesh size, with an Atwood number, A = 0.05, and turbulent Reynolds number, Re t = 1800, and the methods are tested against quantities pertaining to both velocities and active scalar (density) fields and their derivatives, spectra, and the properties of constant density surfaces. The comparisons between the algorithms are given in terms of performance, accuracy, and compression properties. The results should provide useful information for multi-resolution analysis of turbulence, coherent feature extraction, compression for large datasets handling, as well as simulations algorithms based on multi-resolution methods. In conclusion, the final section provides recommendations for best decomposition algorithms based on several metrics related to computational efficiency and preservation of turbulence properties using a reduced set of coefficients.

97 MATHEMATICS AND COMPUTING↗

Accurate and efficient description of interacting carriers in quantum nanostructures by selected configuration interaction and perturbation theory

In this paper, we present a method to accurately and efficiently calculate many-body states of interacting carriers in quantum nanostructures based on a combination of iterative selection of configurations and perturbation theory. This method enables investigations of large excitonic complexes and multielectron systems with near full configuration interaction accuracy, even though only a small subspace of the full many-body Hilbert space is sampled, thus saving orders of magnitudes in computational resources. Important advantages of this method are that the convergence is controlled by a single parameter, the threshold, and that ground and excited states can be treated on an equal footing. On the example of InAsP nanowire quantum dots described using a million-atom tight-binding approach, we demonstrate the extreme efficiency of the method by numerical studies of large excitonic complexes filling up to the fourth electronic shell. We find that the method generally converges fast as a function of the threshold, profiting from a significant acceleration due to the perturbative corrections. The role of the choice of single-particle basis states is discussed. It is found that the algorithm converges faster in the Hartree-Fock basis only for highly charged systems, where Coulomb repulsion dominates. Finally, based on the observation that second-order perturbative energy corrections only depend on off-diagonal elements of the many-body Hamiltonian, we present a way to accurately calculate many-body states that requires only a relatively small number of Coulomb matrix elements.

36 MATERIALS SCIENCE↗

Variational Quantum Linear Solver

Previously proposed quantum algorithms for solving linear systems of equations cannot be implemented in the near term due to the re quired circuit depth. Here, we propose a hybrid quantum-classical algorithm, called Variational Quantum Linear Solver (VQLS), for solving linear systems on near-term quantum computers. VQLS seeks to variationally prepare |x$\rangle$ such that A|x$\rangle$ ∝ |b$\rangle$. We derive an operationally meaningful termination condition for VQLS that allows one to guarantee that a desired solution precision ϵ is achieved. Specifically, we prove that C $⩾$ ϵ 2 /κ 2 , where C is the VQLS cost function and κ is the condition number of A. We present efficient quantum circuits to estimate C, while providing evidence for the classical hardness of its estimation. Using Rigetti’s quantum computer, we success fully implement VQLS up to a problem size of 1024 × 1024. Finally, we numerically solve nontrivial problems of size up to 2 50 × 2 50 . For the specific examples that we consider, we heuristically find that the time complexity of VQLS scales efficiently in ϵ, κ, and the system size N.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algebraic multigrid preconditioners for two-phase flow in porous media with phase transitions [Algebraic multigrid preconditioners for multiphase flow in porous media with phase transitions]

Multiphase flow is a critical process in a wide range of applications, including oil and gas recovery, carbon sequestration, and contaminant remediation. Numerical simulation of multiphase flow requires solving of a large, sparse linear system resulting from the discretization of the partial differential equations modeling the flow. In the case of multiphase multicomponent flow with miscible effect, this is a very challenging task. The problem becomes even more difficult if phase transitions are taken into account. A new approach to handle phase transitions is to formulate the system as a nonlinear complementarity problem (NCP). Unlike in the primary variable switching technique, the set of primary variables in this approach is fixed even when there is phase transition. Not only does this improve the robustness of the nonlinear solver, it opens up the possibility to use multigrid methods to solve the resulting linear system. The disadvantage of the complementarity approach, however, is that when a phase disappears, the linear system has the structure of a saddle point problem and becomes indefinite, and current algebraic multigrid (AMG) algorithms cannot be applied directly. In this study, we explore the effectiveness of a new multilevel strategy, based on the multigrid reduction technique, to deal with problems of this type. We demonstrate the effectiveness of the method through numerical results for the case of two-phase, two-component flow with phase appearance/disappearance. In conclusion, we also show that the strategy is efficient and scales optimally with problem size.

02 PETROLEUM↗