Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,261 records · Page 70

Solving the $k$-Sparse Eigenvalue Problem with Reinforcement Learning

We examine the possibility of using a reinforcement learning (RL) algorithm to solve large-scale eigenvalue problems in which the desired the eigenvector can be approximated by a sparse vector with at most k nonzero elements, where k is relatively small compare to the dimension of the matrix to be partially diagonalized. Here, this type of problem arises in applications in which the desired eigenvector exhibits localization properties and in large-scale eigenvalue computations in which the amount of computational resource is limited. When the positions of these nonzero elements can be determined, we can obtain the k-sparse approximation to the original problem by computing eigenvalues of a k × k submatrix extracted from k rows and columns of the original matrix. We review a previously developed greedy algorithm for incrementally probing the positions of the nonzero elements in a k-sparse approximate eigenvector and show that the greedy algorithm can be improved by using an RL method to refine the selection of k rows and columns of the original matrix. We describe how to represent states, actions, rewards and policies in an RL algorithm designed to solve the k-sparse eigenvalue problem and demonstrate the effectiveness of the RL algorithm on two examples originating from quantum many-body physics.

97 MATHEMATICS AND COMPUTING↗

Heel effect adaptive flat field correction of digital x-ray detectors

Purpose: Anode heel effect renders large-scale background nonuniformities in digital radiographs. Conventional offset/gain calibration is performed at mono source-to-image distance (SID), and disregards the SID-dependent characteristic of heel effect. It results in a residual nonuniform background in the corrected radiographs when the SID settings for calibration and correction differ. In this work, the authors develop a robust and efficient computational method for digital x-ray detector gain correction adapted to SID-variant heel effect, without resorting to physical filters, phantoms, complicated heel effect models, or multiple-SID calibration and interpolation.Methods: The authors present the Duo-SID projection correction method. In our approach, conventional offset/gain calibrations are performed only twice, at the minimum and maximum SIDs of the system in typical clinical use. A fast iterative separation algorithm is devised to extract the detector gain and basis heel patterns from the min/max SID calibrations. The resultant detector gain is independent of SID, while the basis heel patterns are parameterized by the min- and max-SID. The heel pattern at any SID is obtained from the min-SID basis heel pattern via projection imaging principles. The system gain desired at a specific acquisition SID is then constructed using the projected heel pattern and detector gain map.Results: The method was evaluated for flat field and anatomical phantom image corrections. It demonstrated promising improvements over interpolation and conventional gain calibration/correction methods, lowering their correction errors by approximately 70% and 80%, respectively. The separation algorithm was able to extract the detector gain and heel patterns with less than 2% error, and the Duo-SID corrected images showed perceptually appealing uniform background across the detector.Conclusions: The Duo-SID correction method has substantially improved on conventional offset/gain corrections for digital x-ray imaging in an SID-variant environment. The technique is relatively simple, and can be easily incorporated into multiple-point gain calibration/correction techniques. It offers a potentially valuable tool for preprocessing digital x-ray images to boost image quality of mammography, chest and cardiac radiography, as well as automated computer aided diagnostic radiology.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗

Robotic reconnaissance platform. I. Spectroscopic instruments with rangefinders

In this paper, basic principles of the design and implementation of a portable, multi-functional scientific instrument, operating from a robotic reconnaissance mobile platform are discussed. The current version of the instrument includes a multi-gas laser sensor, multi-functional spectrometer, isotopes identifier, cameras, and rangefinder. An additional set of sensors monitors temperature, pressure, humidity, and background radiation. All components are installed on a mini-robotic platform, which provides data acquisition, processing, and transmittance. The design focuses on the development of calibration-free, reliable, low power-consumption devices. To create a highly survivable, accurate, and reliable instrument, a concept of an inhomogeneous sensory network has been developed. Such a network combines non-identical sensors and provides cross-use of information received from different sensors to describe environmental conditions, to choose appropriate algorithms of data processing, and to achieve high accuracy gas-concentration measurements. The system uses the same lasers to operate different optical devices such as sensors, rangefinders, spectrometers, and isotopes identifiers. Among the innovative elements described in this paper, are a calibration-free, laser multi-gas sensor with range-finding option; a high signal/noise ratio transmittance spectrometer; a single-frequency laser with nano-selector; and low repetition-rate femtosecond fiber lasers operating in near- and middle- infrared spectral ranges. New detailed analyses of absorption spectroscopy theoretical approximations made it possible to achieve high-accuracy gas-concentration measurements with miniature optical sensors.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Communication: Stochastic evaluation of explicitly correlated second-order many-body perturbation energy

A stochastic algorithm is proposed that can compute the basis-set-incompleteness correction to the second-order many-body perturbation (MP2) energy of a polyatomic molecule. It evaluates the sum of two-, three-, and four-electron integrals over an explicit function of electron-electron distances by a Monte Carlo (MC) integration at an operation cost per MC step increasing only quadratically with size. The method can reproduce the corrections to the MP2/cc-pVTZ energies of H{sub 2}O, CH{sub 4}, and C{sub 6}H{sub 6} within a few mE{sub h} after several million MC steps. It circumvents the resolution-of-the-identity approximation to the nonfactorable three-electron integrals usually necessary in the conventional explicitly correlated (R12 or F12) methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulation and optimization of pressure swing adsorption systmes using reduced-order modeling

Over the past three decades, pressure swing adsorption (PSA) processes have been widely used as energyefficient gas separation techniques, especially for high purity hydrogen purification from refinery gases. Models for PSA processes are multiple instances of partial differential equations (PDEs) in time and space with periodic boundary conditions that link the processing steps together. The solution of this coupled stiff PDE system is governed by steep fronts moving with time. As a result, the optimization of such systems represents a significant computational challenge to current differential algebraic equation (DAE) optimization techniques and nonlinear programming algorithms. Model reduction is one approach to generate cost-efficient low-order models which can be used as surrogate models in the optimization problems. This study develops a reducedorder model (ROM) based on proper orthogonal decomposition (POD), which is a low-dimensional approximation to a dynamic PDE-based model. The proposed method leads to a DAE system of significantly lower order, thus replacing the one obtained from spatial discretization and making the optimization problem computationally efficient. The method has been applied to the dynamic coupled PDE-based model of a twobed four-step PSA process for separation of hydrogen from methane. Separate ROMs have been developed for each operating step with different POD modes for each of them. A significant reduction in the order of the number of states has been achieved. The reduced-order model has been successfully used to maximize hydrogen recovery by manipulating operating pressures, step times and feed and regeneration velocities, while meeting product purity and tight bounds on these parameters. Current results indicate the proposed ROM methodology as a promising surrogate modeling technique for cost-effective optimization purposes.

08 HYDROGEN↗

Hybrid stochastic simulation of reaction-diffusion systems with slow and fast dynamics

In this paper, we present a novel hybrid method to simulate discrete stochastic reaction-diffusion models arising in biochemical signaling pathways. We study moderately stiff systems, for which we can partition each reaction or diffusion channel into either a slow or fast subset, based on its propensity. Numerical approaches missing this distinction are often limited with respect to computational run time or approximation quality. We design an approximate scheme that remedies these pitfalls by using a new blending strategy of the well-established inhomogeneous stochastic simulation algorithm and the tau-leaping simulation method. The advantages of our hybrid simulation algorithm are demonstrated on three benchmarking systems, with special focus on approximation accuracy and efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Hybrid framework for the simulation of stochastic chemical kinetics

Stochasticity plays a fundamental role in various biochemical processes, such as cell regulatory networks and enzyme cascades. Isothermal, well-mixed systems can be modelled as Markov processes, typically simulated using the Gillespie Stochastic Simulation Algorithm (SSA) [25]. While easy to implement and exact, the computational cost of using the Gillespie SSA to simulate such systems can become prohibitive as the frequency of reaction events increases. This has motivated numerous coarse-grained schemes, where the “fast” reactions are approximated either using Langevin dynamics or deterministically. While such approaches provide a good approximation when all reactants are abundant, the approximation breaks down when one or more species exist only in small concentrations and the fluctuations arising from the discrete nature of the reactions become significant. This is particularly problematic when using such methods to compute statistics of extinction times for chemical species, as well as simulating non-equilibrium systems such as cell-cycle models in which a single species can cycle between abundance and scarcity. In this paper, a hybrid jump-diffusion model for simulating well-mixed stochastic kinetics is derived. It acts as a bridge between the Gillespie SSA and the chemical Langevin equation. For low reactant reactions the underlying behaviour is purely discrete, while purely diffusive when the concentrations of all species are large, with the two different behaviours coexisting in the intermediate region. A bound on the weak error in the classical large volume scaling limit is obtained, and three different numerical discretisations of the jump-diffusion model are described. The benefits of such a formalism are illustrated using computational examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-F-BRA-13: Knowledge-Based Treatment Planning for Prostate LDR Brachytherapy Based On Principle Component Analysis

Purpose: To create a knowledge-based algorithm for prostate LDR brachytherapy treatment planning that standardizes plan quality using seed arrangements tailored to individual physician preferences while being fast enough for real-time planning. Methods: A dataset of 130 prior cases was compiled for a physician with an active prostate seed implant practice. Ten cases were randomly selected to test the algorithm. Contours from the 120 library cases were registered to a common reference frame. Contour variations were characterized on a point by point basis using principle component analysis (PCA). A test case was converted to PCA vectors using the same process and then compared with each library case using a Mahalanobis distance to evaluate similarity. Rank order PCA scores were used to select the best-matched library case. The seed arrangement was extracted from the best-matched case and used as a starting point for planning the test case. Computational time was recorded. Any subsequent modifications were recorded that required input from a treatment planner to achieve an acceptable plan. Results: The computational time required to register contours from a test case and evaluate PCA similarity across the library was approximately 10s. Five of the ten test cases did not require any seed additions, deletions, or moves to obtain an acceptable plan. The remaining five test cases required on average 4.2 seed modifications. The time to complete manual plan modifications was less than 30s in all cases. Conclusion: A knowledge-based treatment planning algorithm was developed for prostate LDR brachytherapy based on principle component analysis. Initial results suggest that this approach can be used to quickly create treatment plans that require few if any modifications by the treatment planner. In general, test case plans have seed arrangements which are very similar to prior cases, and thus are inherently tailored to physician preferences.

60 APPLIED LIFE SCIENCES↗

Hybrid immersed interface-immersed boundary methods for AC dielectrophoresis

Dielectrophoresis, a nonlinear electrokinetic transport mechanism, has become popular in many engineering applications including manipulation, characterization and actuation of biomaterials, particles and biological cells. In this paper, we present a hybrid immersed interface–immersed boundary method to study AC dielectrophoresis where an algorithm is developed to solve the complex Poisson equation using a real variable formulation. An immersed interface method is employed to obtain the AC electric field in a fluid media with suspended particles and an immersed boundary method is used for the fluid equations and particle transport. The convergence of the proposed algorithm as well as validation of the hybrid scheme with experimental results is presented. In this paper, the Maxwell stress tensor is used to calculate the dielectrophoretic force acting on particles by considering the physical effect of particles in the computational domain. Thus, this study eliminates the approximations used in point dipole methods for calculating dielectrophoretic force. A comparative study between Maxwell stress tensor and point dipole methods for computing dielectrophoretic forces are presented. The hybrid method is used to investigate the physics of dielectrophoresis in microfluidic devices using an AC electric field. The numerical results show that with proper design and appropriate selection of applied potential and frequency, global electric field minima can be obtained to facilitate multiple particle trapping by exploiting the mechanism of negative dielectrophoresis. Our numerical results also show that electrically neutral particles form a chain parallel to the applied electric field irrespective of their initial orientation when an AC electric field is applied. This proposed hybrid numerical scheme will help to better understand dielectrophoresis and to design and optimize microfluidic devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Investigation of electron-atom/molecule scattering resonances: Two complex multiconfigurational self-consistent field approaches

Resonances are temporarily bound states which lie in the continuum part of the Hamiltonian. If the electronic coordinates of the Hamiltonian are scaled (“dilated”) by a complex parameter, η = αe{sup iθ} (α, θ real), then its complex eigenvalues represent the scattering states (resonant and non-resonant) while the eigenvalues corresponding to the bound states and the ionization and the excitation thresholds remain real and unmodified. These make the study of these transient species amenable to the bound state methods. We developed a quadratically convergent multiconfigurational self-consistent field method (MCSCF), a well-established bound-state technique, combined with a dilated Hamiltonian to investigate resonances. This is made possible by the adoption of a second quantization algebra suitable for a set of “complex conjugate biorthonormal” spin orbitals and a modified step-length constraining algorithm to control the walk on the complex energy hypersurface while searching for the stationary point using a multidimensional Newton-Raphson scheme. We present our computational results for the {sup 2}PBe{sup −} shape resonances using two different computationally efficient methods that utilize complex scaled MCSCF (i.e., CMCSCF). These two methods are to straightforwardly use CMCSCF energy differences and to obtain energy differences using an approximation to the complex multiconfigurational electron propagator. It is found that, differing from previous computational studies by others, there are actually two {sup 2}PBe{sup −} shape resonances very close in energy. In addition, N{sub 2} resonances are examined using one of these methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Two-particle correlations in a dynamic cluster approximation with continuous momentum dependence: Superconductivity in the two-dimensional Hubbard model

The DCA + algorithm was recently introduced by Stear, Maier, and Schulthess [Phys. Rev. B 88, 115101 (2013), 10.1103/PhysRevB.88.115101] to extend the dynamic cluster approximation (DCA) with a continuous lattice self-energy in order to achieve better convergence with cluster size. In this work, we extend the DCA + algorithm to the calculation of two-particle correlation functions by introducing irreducible vertex functions with continuous momentum dependence consistent with the DCA + self-energy. This enables a significantly more controlled and reliable study of phase transitions than with the DCA. We test the new method by calculating the superconducting transition temperature $T_c$ in the attractive Hubbard model and show that it reproduces previous determinantal quantum Monte Carlo results. We then calculate $T_c$ in the doped repulsive Hubbard model, for which previous DCA calculations could only access the weak-coupling ($\textit{U}$ =4$\textit{t}$) regime for large clusters. Here, we show that the new algorithm provides access to much larger clusters and delivers asymptotically converged results for $T_c$ for both the weak ($\textit{U}$ =4$\textit{t}$) and intermediate ($\textit{U}$ =7$\textit{t}$) coupling regimes, and thereby enables the accurate determination of the exact infinite cluster size result.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

On the spin separation of algebraic two-component relativistic Hamiltonians

The separation of the spin-free and spin-dependent terms of a given relativistic Hamiltonian is usually facilitated by the Dirac identity. However, this is no longer possible for the recently developed exact two-component relativistic Hamiltonians derived from the matrix representation of the Dirac equation in a kinetically balanced basis. This stems from the fact that the decoupling matrix does not have an explicit form. To resolve this formal difficulty, we first define the spin-dependent term as the difference between a two-component Hamiltonian corresponding to the full Dirac equation and its one-component counterpart corresponding to the spin-free Dirac equation. The series expansion of the spin-dependent term is then developed in two different ways. One is in the spirit of the Douglas-Kroll-Hess (DKH) transformation and the other is based on the perturbative expansion of a two-component Hamiltonian of fixed structure, either the two-step Barysz-Sadlej-Snijders (BSS) or the one-step exact two-component (X2C) form. The algorithms for constructing arbitrary order terms are proposed for both schemes and their convergence patterns are assessed numerically. Truncating the expansions to finite orders leads naturally to a sequence of novel spin-dependent Hamiltonians. In particular, the order-by-order distinctions among the DKH, BSS, and X2C approaches can nicely be revealed. The well-known Pauli, zeroth-order regular approximation, and DKH1 spin-dependent Hamiltonians can also be recovered naturally by appropriately approximating the decoupling and renormalization matrices. On the practical side, the sf-X2C+so-DKH3 Hamiltonian, together with appropriately constructed generally contracted basis sets, is most promising for accounting for relativistic effects in two steps, first spin-free and then spin-dependent, with the latter applied either perturbatively or variationally.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optical Characteristics of Zinc Oxide Films on Glass Substrates

An algorithm is developed for solving the inverse problem of multiangular spectrophotometry of a layer on a planeparallel substrate of fi nite thickness using s- and p-polarized waves. It allows the dispersive properties of the layer and substrate to be studied both far from and in the vicinity of the resonant wavelengths. The dispersive properties of layers of pure and Al-doped ZnO on glass substrates are investigated using it. It is shown that doping shifts the absorption band maximum to shorter wavelength and decreases the refractive index of the material. The applicability limits of known approximate expressions for determining the spectral dependence of the absorption coeffi cient of a layer from spectrophotometric data are estimated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Approximate Bayesian Model Inversion for PDEs with Heterogeneous and State-Dependent Coefficients

We present two approximate Bayesian inference methods for parameter estimation in partial differential equation (PDE) models with space-dependent and state-dependent parameters. We demonstrate that these methods provide accurate and cost-effective alternatives to Markov Chain Monte Carlo simulation. We assume a parameterized Gaussian prior on the unknown functions, and approximate the posterior density by a parameterized multivariate Gaussian density. The parameters of the prior and posterior are estimated from sparse observations of the PDE model's states and the unknown functions themselves by maximizing the evidence lower bound (ELBO), a lower bound on the log marginal likelihood of the observations. The first method, Laplace-EM, employs the expectation maximization algorithm to maximize the ELBO, with a Laplace approximation of the posterior on the E-step, and minimization of a Kullback-Leibler divergence on the M-step. The second method, DSVI-EB, employs the doubly stochastic variational inference (DSVI) algorithm, in which the ELBO is maximized via gradient-based stochastic optimization, with nosiy gradients computed via simple Monte Carlo sampling and Gaussian backpropagation. We apply these methods to identifying diffusion coefficients in linear and nonlinear diffusion equations, and we find that both methods provide accurate estimates of posterior densities and the hyperparameters of Gaussian priors. While the Laplace-EM method is more accurate, it requires computing Hessians of the physics model. The DSVI-EB method is found to be less accurate but only requires gradients of the physics model.

approximate Bayesian inference, model inversion, v↗

Dynamic Forms: Application to Aircraft Guidance - Part 2

The paper describes a method for guiding a dynamic system through a given set of points. The paradigm is a fully automatic aircraft subject to air traffic control (ATC). The ATC provides a sequence of waypoints through which the aircraft trajectory must pass. The waypoints typically specify time, position, and velocity. The guidance problem is to synthesize a system state trajectory that satisfies both the ATC and aircraft constraints. Complications arise because the controlled process is multidimensional, multiaxis, nonlinear, highly coupled, and the state space is not flat. In addition, there is a multitude of operating modes, which may number in the hundreds. Each such mode defines a distinct state space model of the process by specifying the state space coordinatization, the partition of the controls into active controls and configuration controls, and the output map. Furthermore, mode transitions are required to be smooth. The proposed guidance algorithm is based on the inversion of the pure feedback approximation, followed by correction for the effects of zero dynamics. The paper describes the structure and major modules of the algorithm, and the performance is illustrated by several example aircraft maneuvers.

Meyer, George↗

Fast Near-Optimal Heterogeneous Task Allocation via Flow Decomposition

Multi-robot systems are uniquely well-suited to perform complex tasks such as patrolling and tracking, infor- mation gathering, and pick-up and delivery problems, offering significantly higher performance than single-robot systems. A fundamental building block in most multi-robot systems is dynamic task allocation: assigning robots to tasks (e.g., patrolling an area, or servicing a transportation request) as they appear based on the robots’ states to maximize reward. In many practical situations, the allocation must account for potentially heteroge- neous capabilities (e.g., availability of appropriate sensors or actuators) to ensure the feasibility of execution, and exploit predictive information concerning the likelihood of future tasks to promote a higher reward over a long time horizon. To this end, we present an efficient algorithm for predictive heterogeneous task- allocation achieving an approximation factor of at least 1/2 of the optimal reward. Our approach demonstrates that the problem can be decomposed into several homogeneous subproblems that can be solved efficiently using min-cost flow. Through simulation experiments, we show that our algorithm is faster by several orders of magnitude than a MILP-based approach.

Pavone, Marco↗

Structural properties of small rhodium clusters

We report a systematic study of the structural properties of rhodium clusters at the atomistic level. A novel global-minimum search algorithm, known as parallel tempering multicanonical basin hopping plus genetic algorithm (PTMBHGA), is used to obtain the geometrical structures with lowest minima at the semi-empirical level where Gupta potential is used to describe the atomic interaction among the rhodium atoms. These structures are then re-optimized at the density functional theory (DFT) level with exchange-correlation energy approximated by Perdew-Burke-Ernzerhof (PBE) generalized gradient approximation (GGA). The structures are optimized for different spin multiplicities. The ones with lowest energies will be taken as ground-state structures. In most cases, we observe only minor changes in the geometry and bond length of the clusters as a result of DFT-level re-optimization. Only in some limited cases, the initial geometries obtained from the PTMBHGA are modified by the re-optimization. The variation of structural properties, such as ground-state geometry, symmetry and binding energy, with respect to the cluster size is studied and agreed well with other results available in the literature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗