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 811 records · Page 45

A trust-region algorithm for the optimization of PSA processes using reduced-order modeling

The last few decades have seen a considerable increase in the applications of adsorptive gas separation technologies, such as pressure swing adsorption (PSA); the applications range from bulk separations to trace contaminant removal. PSA processes are based on solid-gas equilibrium and operate under periodic transient conditions [1]. Bed models for these processes are therefore defined by coupled nonlinear partial differential and algebraic equations (PDAEs) distributed in space and time with periodic boundary conditions that connect the processing steps together and high nonlinearities arising from non-isothermal effects and nonlinear adsorption isotherms. As a result, the optimization of such systems for either design or operation represents a significant computational challenge to current nonlinear programming algorithms. Model reduction is a powerful methodology that permits systematic generation of cost-efficient low-order representations of large-scale systems that result from discretization of such PDAEs. In particular, low-dimensional approximations can be obtained from reduced order modeling (ROM) techniques based on proper orthogonal decomposition (POD) and can be used as surrogate models in the optimization problems. In this approach, a representative ensemble of solutions of the dynamic PDAE system is constructed by solving a higher-order discretization of the model using the method of lines, followed by the application of Karhunen-Loeve expansion to derive a small set of empirical eigenfunctions (POD modes). These modes are used as basis functions within a Galerkin's projection framework to derive a low-order DAE system that accurately describes the dominant dynamics of the PDAE system. This approach leads to a DAE system of significantly lower order, thus replacing the one obtained from spatial discretization before and making optimization problem computationally efficient [2]. The ROM methodology has been successfully applied to a 2-bed 4-step PSA process used for separating a hydrogen-methane mixture in [3]. The reduced order model developed was successfully used to optimize this process to maximize hydrogen recovery within a trust-region. We extend this approach in this work to develop a rigorous trust-region algorithm for ROM-based optimization of PSA processes. The trust-region update rules and sufficient decrease condition for the objective is used to determine the size of the trust-region. Based on the decrease in the objective function and error in the ROM, a ROM updation strategy is designed [4, 5]. The inequalities and bounds are handled in the algorithm using exact penalty formulation, and a non-smooth trust-region algorithm by Conn et al. [6] is used to handle non-differentiability. To ensure that the first order consistency condition is met and the optimum obtained from ROM-based optimization corresponds to the optimum of the original problem, a scaling function, such as one proposed by Alexandrov et al. [7], is incorporated in the objective function. Such error control mechanism is also capable of handling numerical inconsistencies such as unphysical oscillations in the state variable profiles. The proposed methodology is applied to optimize a PSA process to concentrate CO{sub 2} from a nitrogen-carbon dioxide mixture. As in [3], separate ROMs are developed for each operating step with different POD modes for each state variable. Numerical results will be presented for optimization case studies which involve maximizing CO{sub 2} recovery, feed throughput or minimizing overall power consumption.

97 MATHEMATICS AND COMPUTING↗

On linearization and preconditioning for radiation diffusion coupled to material thermal conduction equations

Jacobian-free Newton–Krylov (JFNK) method is an effective algorithm for solving large scale nonlinear equations. One of the most important advantages of JFNK method is that there is no necessity to form and store the Jacobian matrix of the nonlinear system when JFNK method is employed. However, an approximation of the Jacobian is needed for the purpose of preconditioning. In this paper, JFNK method is employed to solve a class of non-equilibrium radiation diffusion coupled to material thermal conduction equations, and two preconditioners are designed by linearizing the equations in two methods. Numerical results show that the two preconditioning methods can improve the convergence behavior and efficiency of JFNK method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning high-dimensional parametric maps via reduced basis adaptive residual networks

We propose a scalable framework for the learning of high-dimensional parametric maps via adaptively constructed residual network (ResNet) maps between reduced bases of the inputs and outputs. When just few training data are available, it is beneficial to have a compact parametrization in order to ameliorate the ill-posedness of the neural network training problem. By linearly restricting high-dimensional maps to informed reduced bases of the inputs, one can compress high-dimensional maps in a constructive way that can be used to detect appropriate basis ranks, equipped with rigorous error estimates. A scalable neural network learning framework is thus to learn the nonlinear compressed reduced basis mapping. Unlike the reduced basis construction, however, neural network constructions are not guaranteed to reduce errors by adding representation power, making it difficult to achieve good practical performance. Inspired by recent approximation theory that connects ResNets to sequential minimizing flows, we present an adaptive ResNet construction algorithm. This algorithm allows for depth-wise enrichment of the neural network approximation, in a manner that can achieve good practical performance by first training a shallow network and then adapting. We prove universal approximation of the associated neural network class for $L^2_v$ functions on compact sets. Our overall framework allows for constructive means to detect appropriate breadth and depth, and related compact parametrizations of neural networks, significantly reducing the need for architectural hyperparameter tuning. Numerical experiments for parametric PDE problems and a 3D CFD wing design optimization parametric map demonstrate that the proposed methodology can achieve remarkably high accuracy for limited training data, and outperformed other neural network strategies we compared against.

42 ENGINEERING↗

Filtering a statistically exactly solvable test model for turbulent tracers from partial observations

A statistically exactly solvable model for passive tracers is introduced as a test model for the authors' Nonlinear Extended Kalman Filter (NEKF) as well as other filtering algorithms. The model involves a Gaussian velocity field and a passive tracer governed by the advection-diffusion equation with an imposed mean gradient. The model has direct relevance to engineering problems such as the spread of pollutants in the air or contaminants in the water as well as climate change problems concerning the transport of greenhouse gases such as carbon dioxide with strongly intermittent probability distributions consistent with the actual observations of the atmosphere. One of the attractive properties of the model is the existence of the exact statistical solution. In particular, this unique feature of the model provides an opportunity to design and test fast and efficient algorithms for real-time data assimilation based on rigorous mathematical theory for a turbulence model problem with many active spatiotemporal scales. Here, we extensively study the performance of the NEKF which uses the exact first and second order nonlinear statistics without any approximations due to linearization. The role of partial and sparse observations, the frequency of observations and the observation noise strength in recovering the true signal, its spectrum, and fat tail probability distribution are the central issues discussed here. The results of our study provide useful guidelines for filtering realistic turbulent systems with passive tracers through partial observations.

54 ENVIRONMENTAL SCIENCES↗

Electronic and magnetic properties of small rhodium clusters

We report a theoretical study of the electronic and magnetic properties of rhodium-atomic clusters. The lowest energy structures at the semi-empirical level of rhodium clusters are first obtained from a novel global-minimum search algorithm, known as PTMBHGA, where Gupta potential is used to describe the atomic interaction among the rhodium atoms. The structures are then re-optimized at the density functional theory (DFT) level with exchange-correlation energy approximated by Perdew-Burke-Ernzerhof generalized gradient approximation. For the purpose of calculating the magnetic moment of a given cluster, we calculate the optimized structure as a function of the spin multiplicity within the DFT framework. The resultant magnetic moments with the lowest energies so obtained allow us to work out the magnetic moment as a function of cluster size. Rhodium atomic clusters are found to display a unique variation in the magnetic moment as the cluster size varies. However, Rh{sub 4} and Rh{sub 6} are found to be nonmagnetic. Electronic structures of the magnetic ground-state structures are also investigated within the DFT framework. The results are compared against those based on different theoretical approaches available in the literature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Superfluid to Mott insulator transition of hardcore bosons in a superlattice

We study the superfluid to Mott-insulator transition of hardcore bosons in commensurate superlattices in two and three dimensions. We focus on the special case where the superlattice has period two and the system is at half-filling. We obtain numerical results by using the stochastic series expansion algorithm, and compute various properties of the system, such as the ground-state energy, the density of bosons in the zero-momentum mode, the superfluid density, and the compressibility. We employ finite-size scaling to extrapolate the thermodynamic limit, and find the critical points of the phase transition. We also explore the extent to which several approximate solutions such as mean-field theory, with and without spin-wave corrections, can help one gain analytical insight into the behavior of the system in the vicinity of the phase transition.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Cross sections for ionization of K, L and M shells of atoms by impact of electrons and positrons with energies up to 1 GeV: Analytical formulas

Analytical formulas are presented for the easy calculation of cross sections for ionization of K, L and M shells of neutral atoms by impact of electrons and positrons with kinetic energies up to 1 GeV. Each formula contains a number of parameters that are characteristic of the element, the active electron shell and the projectile particle. The values of these parameters were determined by fitting the cross section values in an extensive database that was calculated recently by means of a composite algorithm that combines the distorted-wave and plane-wave Born approximations. Tables of parameter values are given for all elements, from hydrogen (Z=1) to einsteinium (Z=99). The proposed analytical expressions yield ionization cross sections that agree with those in the numerical database to within about 1%, except for projectiles with near-threshold energies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Evaluation of Green's Function Derivatives for Exponentially Graded Elasticity

Effective formulas for computing the Green's function of an exponentially graded three dimensional material have been derived In previous work. The expansion approach for evaluating the Green's function has been extended to develop corresponding algorithms for its first and second order derivatives. The resulting formulas are again obtained as a relatively simple analytic term plus a single double integral, the integrand involving only elementary functions. A primary benefit of the expansion procedure is the ability to compute the second order derivatives needed for fracture analysis. Moreover, as all singular terms in this hypersingular kernel are contained in the analytic expression, these expressions are readily implemented in a boundary integral equation calculation. The computational formulas for the first derivative are tested by comparing with results of finite difference approximations involving the Green's function. In turn, the second derivatives are then validated by comparing with finite difference quotients using the first derivatives.

42 ENGINEERING↗

Analytical estimation of emission zone mean position and width in organic light-emitting diodes from emission pattern image-source interference fringes

We present an analytical method for evaluating the first and second moments of the effective exciton spatial distribution in organic light-emitting diodes (OLED) from measured emission patterns. Specifically, the suggested algorithm estimates the emission zone mean position and width, respectively, from two distinct features of the pattern produced by interference between the emission sources and their images (induced by the reflective cathode): the angles in which interference extrema are observed, and the prominence of interference fringes. The relations between these parameters are derived rigorously for a general OLED structure, indicating that extrema angles are related to the mean position of the radiating excitons via Bragg's condition, and the spatial broadening is related to the attenuation of the image-source interference prominence due to an averaging effect. The method is applied successfully both on simulated emission patterns and on experimental data, exhibiting a very good agreement with the results obtained by numerical techniques. We investigate the method performance in detail, showing that it is capable of producing accurate estimations for a wide range of source-cathode separation distances, provided that the measured spectral interval is large enough; guidelines for achieving reliable evaluations are deduced from these results as well. As opposed to numerical fitting tools employed to perform similar tasks to date, our approximate method explicitly utilizes physical intuition and requires far less computational effort (no fitting is involved). Hence, applications that do not require highly resolved estimations, e.g., preliminary design and production-line verification, can benefit substantially from the analytical algorithm, when applicable. This introduces a novel set of efficient tools for OLED engineering, highly important in the view of the crucial role the exciton distribution plays in determining the device performance.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement

The standard LU factorization-based solution process for linear systems can be enhanced in speed or accuracy by employing mixed-precision iterative refinement. Most recent work has focused on dense systems. We investigate the potential of mixed-precision iterative refinement to enhance methods for sparse systems based on approximate sparse factorizations. In doing so, we first develop a new error analysis for LU- and GMRES-based iterative refinement under a general model of LU factorization that accounts for the approximation methods typically used by modern sparse solvers, such as low-rank approximations or relaxed pivoting strategies. We then provide a detailed performance analysis of both the execution time and memory consumption of different algorithms, based on a selected set of iterative refinement variants and approximate sparse factorizations. Our performance study uses the multifrontal solver MUMPS, which can exploit block low-rank factorization and static pivoting. We evaluate the performance of the algorithms on large, sparse problems coming from a variety of real-life and industrial applications showing that mixed-precision iterative refinement combined with approximate sparse factorization can lead to considerable reductions of both the time and memory consumption.

97 MATHEMATICS AND COMPUTING↗

A GODUNOV METHOD FOR MULTIDIMENSIONAL RADIATION MAGNETOHYDRODYNAMICS BASED ON A VARIABLE EDDINGTON TENSOR

We describe a numerical algorithm to integrate the equations of radiation magnetohydrodynamics in multidimensions using Godunov methods. This algorithm solves the radiation moment equations in the mixed frame, without invoking any diffusion-like approximations. The moment equations are closed using a variable Eddington tensor whose components are calculated from a formal solution of the transfer equation at a large number of angles using the method of short characteristics. We use a comprehensive test suite to verify the algorithm, including convergence tests of radiation-modified linear acoustic and magnetosonic waves, the structure of radiation-modified shocks, and two-dimensional tests of photon bubble instability and the ablation of dense clouds by an intense radiation field. These tests cover a very wide range of regimes, including both optically thick and thin flows, and ratios of the radiation to gas pressure of at least 10{sup -4}-10{sup 4}. Across most of the parameter space, we find that the method is accurate. However, the tests also reveal there are regimes where the method needs improvement, for example when both the radiation pressure and absorption opacity are very large. We suggest modifications to the algorithm that will improve the accuracy in this case. We discuss the advantages of this method over those based on flux-limited diffusion. In particular, we find that the method is not only substantially more accurate, but often no more expensive than the diffusion approximation for our intended applications.

79 ASTRONOMY AND ASTROPHYSICS↗

Tunneling splitting in double-proton transfer: Direct diagonalization results for porphycene

Zero-point and excited level splittings due to double-proton tunneling are calculated for porphycene and the results are compared with experiment. The calculation makes use of a multidimensional imaginary-mode Hamiltonian, diagonalized directly by an effective reduction of its dimensionality. Porphycene has a complex potential energy surface with nine stationary configurations that allow a variety of tunneling paths, many of which include classically accessible regions. A symmetry-based approach is used to show that the zero-point level, although located above the cis minimum, corresponds to concerted tunneling along a direct trans − trans path; a corresponding cis − cis path is predicted at higher energy. This supports the conclusion of a previous paper [Z. Smedarchina, W. Siebrand, and A. Fernández-Ramos, J. Chem. Phys. 127, 174513 (2007)] based on the instanton approach to a model Hamiltonian of correlated double-proton transfer. A multidimensional tunneling Hamiltonian is then generated, based on a double-minimum potential along the coordinate of concerted proton motion, which is newly evaluated at the RI-CC2/cc-pVTZ level of theory. To make it suitable for diagonalization, its dimensionality is reduced by treating fast weakly coupled modes in the adiabatic approximation. This results in a coordinate-dependent mass of tunneling, which is included in a unique Hermitian form into the kinetic energy operator. The reduced Hamiltonian contains three symmetric and one antisymmetric mode coupled to the tunneling mode and is diagonalized by a modified Jacobi-Davidson algorithm implemented in the Jadamilu software for sparse matrices. The results are in satisfactory agreement with the observed splitting of the zero-point level and several vibrational fundamentals after a partial reassignment, imposed by recently derived selection rules. They also agree well with instanton calculations based on the same Hamiltonian.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Construction of a universal quantum computer

We construct a universal quantum computer following Deutsch's original proposal of a universal quantum Turing machine (UQTM). Like Deutsch's UQTM, our machine can emulate any classical Turing machine and can execute any algorithm that can be implemented in the quantum gate array framework but under the control of a quantum program, and hence is universal. We present the architecture of the machine, which consists of a memory tape and a processor and describe the observables that comprise the registers of the processor and the instruction set, which includes a set of operations that can approximate any unitary operation to any desired accuracy and hence is quantum computationally universal. We present the unitary evolution operators that act on the machine to achieve universal computation and discuss each of them in detail and specify and discuss explicit program halting and concatenation schemes. We define and describe a set of primitive programs in order to demonstrate the universal nature of the machine. These primitive programs facilitate the implementation of more complex algorithms and we demonstrate their use by presenting a program that computes the NAND function, thereby also showing that the machine can compute any classically computable function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations

We present an efficient parallel algorithm and its implementation for computing the diagonal of $H^-1$ where $H$ is a 2D Kohn-Sham Hamiltonian discretized on a rectangular domain using a standard second order finite difference scheme. This type of calculation can be used to obtain an accurate approximation to the diagonal of a Fermi-Dirac function of $H$ through a recently developed pole-expansion technique \cite{LinLuYingE2009}. The diagonal elements are needed in electronic structure calculations for quantum mechanical systems \citeHohenbergKohn1964, KohnSham 1965,DreizlerGross1990. We show how elimination tree is used to organize the parallel computation and how synchronization overhead is reduced by passing data level by level along this tree using the technique of local buffers and relative indices. We analyze the performance of our implementation by examining its load balance and communication overhead. We show that our implementation exhibits an excellent weak scaling on a large-scale high performance distributed parallel machine. When compared with standard approach for evaluating the diagonal a Fermi-Dirac function of a Kohn-Sham Hamiltonian associated a 2D electron quantum dot, the new pole-expansion technique that uses our algorithm to compute the diagonal of $(H-z_i I)^-1$ for a small number of poles $z_i$ is much faster, especially when the quantum dot contains many electrons.

74 ATOMIC AND MOLECULAR PHYSICS↗

Surface hopping outperforms secular Redfield theory when reorganization energies range from small to moderate (and nuclei are classical)

We evaluate the accuracy of Tully’s surface hopping algorithm for the spin-boson model in the limit of small to moderate reorganization energy. We calculate transition rates between diabatic surfaces in the exciton basis and compare against exact results from the hierarchical equations of motion; we also compare against approximate rates from the secular Redfield equation and Ehrenfest dynamics. We show that decoherence-corrected surface hopping performs very well in this regime, agreeing with secular Redfield theory for very weak system-bath coupling and outperforming secular Redfield theory for moderate system-bath coupling. Surface hopping can also be extended beyond the Markovian limits of standard Redfield theory. Given previous work [B. R. Landry and J. E. Subotnik, J. Chem. Phys. 137, 22A513 (2012)] that establishes the accuracy of decoherence-corrected surface-hopping in the Marcus regime, this work suggests that surface hopping may well have a very wide range of applicability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SENSITIVE SEARCH FOR RADIO VARIABLES AND TRANSIENTS IN THE EXTENDED CHANDRA DEEP FIELD SOUTH

We report on an analysis of the Extended Chandra Deep Field South (E-CDFS) region using archival data from the Very Large Array, with the goal of studying radio variability and transients at the sub-milliJansky level. The 49 epochs of E-CDFS observations at 1.4 GHz sample timescales from 1 day to 3 months. We find that only a fraction (1%) of unresolved radio sources above 40 {mu}Jy are variable at the 4{sigma} level. There is no evidence that the fractional variability changes along with the known transition of radio-source populations below 1 mJy. Optical identifications of the sources show that the variable radio emission is associated with the central regions of an active galactic nucleus or a star-forming galaxy. After a detailed comparison of the efficacy of various source-finding algorithms, we use the best to carry out a transient search. No transients were found. This implies that the areal density of transients with peak flux density greater than 0.21 mJy is less than 0.37 deg{sup -2} (at a confidence level of 95%). This result is approximately an order of magnitude below the transient rate measured at 5 GHz by Bower et al. but it is consistent with more recent upper limits from Frail et al. Our findings suggest that the radio sky at 1.4 GHz is relatively quiet. For multi-wavelength transient searches, such as the electromagnetic counterparts to gravitational waves, this frequency may be optimal for reducing the high background of false positives.

79 ASTRONOMY AND ASTROPHYSICS↗