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 631 records · Page 35

On the development of protein pKa calculation algorithms

Protein pKa calculation algorithms are typically developed to reproduce experimental pKa values and provide us with a better understanding of the fundamental importance of electrostatics for protein structure and function. However, the approximations and adjustable parameters employed in almost all pKa calculation methods means that there is the risk that pKa calculation algorithms are 'over-fitted' to the available datasets, and that these methods therefore do not model protein physics realistically. We employ simulations of the protein pKa calculation algorithm development process to show that careful optimization procedures and non-biased experimental datasets must be applied to ensure a realistic description of the underlying physical terms. We furthermore investigate the effect of experimental noise and find a significant effect on the pKa calculation algorithm optimization landscape. Finally, we comment on strategies for ensuring the physical realism of protein pKa calculation algorithms and we assess the overall state of the field with a view to predicting future directions of development.

59 BASIC BIOLOGICAL SCIENCES↗

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10 different input distributions or histograms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Similarity Downselection: Finding the n Most Dissimilar Molecular Conformers for Reference-Free Metabolomics

Computational methods for creating in silico libraries of molecular descriptors (e.g., collision cross sections) are becoming increasingly prevalent due to the limited number of authentic reference materials available for traditional library building. These so-called “reference-free metabolomics” methods require sampling sets of molecular conformers in order to produce high accuracy property predictions. Due to the computational cost of the subsequent calculations for each conformer, there is a need to sample the most relevant subset and avoid repeating calculations on conformers that are nearly identical. The goal of this study is to introduce a heuristic method of finding the most dissimilar conformers from a larger population in order to help speed up reference-free calculation methods and maintain a high property prediction accuracy. Finding the set of the n items most dissimilar from each other out of a larger population becomes increasingly difficult and computationally expensive as either n or the population size grows large. Because there exists a pairwise relationship between each item and all other items in the population, finding the set of the n most dissimilar items is different than simply sorting an array of numbers. For instance, if you have a set of the most dissimilar n = 4 items, one or more of the items from n = 4 might not be in the set n = 5. An exact solution would have to search all possible combinations of size n in the population exhaustively. We present an open-source software called similarity downselection (SDS), written in Python and freely available on GitHub. SDS implements a heuristic algorithm for quickly finding the approximate set(s) of the n most dissimilar items. We benchmark SDS against a Monte Carlo method, which attempts to find the exact solution through repeated random sampling. We show that for SDS to find the set of n most dissimilar conformers, our method is not only orders of magnitude faster, but it is also more accurate than running Monte Carlo for 1,000,000 iterations, each searching for set sizes n = 3–7 out of a population of 50,000. We also benchmark SDS against the exact solution for example small populations, showing that SDS produces a solution close to the exact solution in these instances. Using theoretical approaches, we also demonstrate the constraints of the greedy algorithm and its efficacy as a ratio to the exact solution.

97 MATHEMATICS AND COMPUTING↗

Approximate l-Fold Cross-Validation with Least Squares SVM and Kernel Ridge Regression

Kernel methods have difficulties scaling to large modern data sets. The scalability issues are based on computational and memory requirements for working with a large matrix. These requirements have been addressed over the years by using low-rank kernel approximations or by improving the solvers' scalability. However, Least Squares Support Vector Machines (LS-SVM), a popular SVM variant, and Kernel Ridge Regression still have several scalability issues. In particular, the O(n^3) computational complexity for solving a single model, and the overall computational complexity associated with tuning hyper parameters are still major problems. We address these problems by introducing an O(nlog n) approximate l-fold cross-validation method that uses a multi-level circulant matrix to approximate the kernel. In addition, we prove our algorithm's computational complexity and present empirical runtimes on data sets with approximately one million data points. We also validate our approximate method's effectiveness at selecting hyper parameters on real world and standard benchmark data sets. Lastly, we provide experimental results on using a multi level circulant kernel approximation to solve LS-SVM problems with hyper parameters selected using our method.

Computer Science↗

Approximate l-fold cross-validation with Least Squares SVM and Kernel Ridge Regression

Kernel methods have difficulties scaling to large modern data sets. The scalability issues are based on computational and memory requirements for working with a large matrix. These requirements have been addressed over the years by using low-rank kernel approximations or by improving the solvers scalability. However, Least Squares Support VectorMachines (LS-SVM), a popular SVM variant, and Kernel Ridge Regression still have several scalability issues. In particular, the O(n^3) computational complexity for solving a single model, and the overall computational complexity associated with tuning hyperparameters are still major problems. We address these problems by introducing an O(n log n) approximate l-fold cross-validation method that uses a multi-level circulant matrix to approximate the kernel. In addition, we prove our algorithm s computational complexity and present empirical runtimes on data sets with approximately 1 million data points. We also validate our approximate method s effectiveness at selecting hyperparameters on real world and standard benchmark data sets. Lastly, we provide experimental results on using a multi-level circulant kernel approximation to solve LS-SVM problems with hyperparameters selected using our method.

Edwards, Richard E↗

Chaos control of Hastings–Powell model by combining chaotic motions

In this paper, we propose a Parameter Switching (PS) algorithm as a new chaos control method for the Hastings–Powell (HP) system. The PS algorithm is a convergent scheme that switches the control parameter within a set of values while the controlled system is numerically integrated. The attractor obtained with the PS algorithm matches the attractor obtained by integrating the system with the parameter replaced by the averaged value of the switched parameter values. The switching rule can be applied periodically or randomly over a set of given values. In this way, every stable cycle of the HP system can be approximated if its underlying parameter value equalizes the average value of the switching values. Moreover, the PS algorithm can be viewed as a generalization of Parrondo's game, which is applied for the first time to the HP system, by showing that losing strategy can win: “losing + losing = winning.” If “loosing” is replaced with “chaos” and, “winning” with “order” (as the opposite to “chaos”), then by switching the parameter value in the HP system within two values, which generate chaotic motions, the PS algorithm can approximate a stable cycle so that symbolically one can write “chaos + chaos = regular.” Also, by considering a different parameter control, new complex dynamics of the HP model are revealed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Filtered Rayleigh-Ritz is all you need

Recent work has shown that the (block) Lanczos algorithm can be used to extract approximate energy spectra and matrix elements from (matrices of) correlation functions in quantum field theory, and identified exact coincidences between Lanczos analysis methods and others. In this work, we note another coincidence: the Lanczos algorithm is equivalent to the well-known Rayleigh-Ritz method applied to Krylov subspaces. Rayleigh-Ritz provides optimal eigenvalue approximations within subspaces; we find that spurious-state filtering allows these optimality guarantees to be retained in the presence of statistical noise. We explore the relation between Lanczos and Prony's method, their block generalizations, generalized pencil of functions (GPOF), and methods based on the generalized eigenvalue problem (GEVP), and find they all fall into a larger "Prony-Ritz equivalence class", identified as all methods which solve a finite-dimensional spectrum exactly given sufficient correlation function (matrix) data. This equivalence allows simpler and more numerically stable implementations of (block) Lanczos analyses.

97 MATHEMATICS AND COMPUTING↗

Combined mixed approach algorithm for in-line phase-contrast x-ray imaging

Purpose: In the past decade, phase-contrast imaging (PCI) has been applied to study different kinds of tissues and human body parts, with an increased improvement of the image quality with respect to simple absorption radiography. A technique closely related to PCI is phase-retrieval imaging (PRI). Indeed, PCI is an imaging modality thought to enhance the total contrast of the images through the phase shift introduced by the object (human body part); PRI is a mathematical technique to extract the quantitative phase-shift map from PCI. A new phase-retrieval algorithm for the in-line phase-contrast x-ray imaging is here proposed. Methods: The proposed algorithm is based on a mixed transfer-function and transport-of-intensity approach (MA) and it requires, at most, an initial approximate estimate of the average phase shift introduced by the object as prior knowledge. The accuracy in the initial estimate determines the convergence speed of the algorithm. The proposed algorithm retrieves both the object phase and its complex conjugate in a combined MA (CMA). Results: Although slightly less computationally effective with respect to other mixed-approach algorithms, as two phases have to be retrieved, the results obtained by the CMA on simulated data have shown that the obtained reconstructed phase maps are characterized by particularly low normalized mean square errors. The authors have also tested the CMA on noisy experimental phase-contrast data obtained by a suitable weakly absorbing sample consisting of a grid of submillimetric nylon fibers as well as on a strongly absorbing object made of a 0.03 mm thick lead x-ray resolution star pattern. The CMA has shown a good efficiency in recovering phase information, also in presence of noisy data, characterized by peak-to-peak signal-to-noise ratios down to a few dBs, showing the possibility to enhance with phase radiography the signal-to-noise ratio for features in the submillimetric scale with respect to the attenuation-based imaging. Conclusions: It has been shown that phase-retrieved radiographies can be used both to have quantitative phase information about soft tissues, complementary to the attenuation information, and to enhance the visibility of details inside soft tissues, with higher efficiency with respect to phase radiography.

60 APPLIED LIFE SCIENCES↗

Stochastic models of solute transport in highly heterogeneous geologic media

A stochastic model of anomalous diffusion was developed in which transport occurs by random motion of Brownian particles, described by distribution functions of random displacements with heavy (power-law) tails. One variant of an effective algorithm for random function generation with a power-law asymptotic and arbitrary factor of asymmetry is proposed that is based on the Gnedenko-Levy limit theorem and makes it possible to reproduce all known Levy {alpha}-stable fractal processes. A two-dimensional stochastic random walk algorithm has been developed that approximates anomalous diffusion with streamline-dependent and space-dependent parameters. The motivation for introducing such a type of dispersion model is the observed fact that tracers in natural aquifers spread at different super-Fickian rates in different directions. For this and other important cases, stochastic random walk models are the only known way to solve the so-called multiscaling fractional order diffusion equation with space-dependent parameters. Some comparisons of model results and field experiments are presented.

54 ENVIRONMENTAL SCIENCES↗

A Galerkin method with two-dimensional Haar basis functions for the computation of the Karhunen–Loève expansion

We study the numerical approximation of a homogeneous Fredholm integral equation of second kind associated with the Karhunen–Loève expansion of Gaussian random fields. We develop, validate, and discuss an algorithm based on the Galerkin method with two-dimensional Haar wavelets as basis functions. The shape functions are constructed from the orthogonal decomposition of tensor-product spaces of one-dimensional Haar functions, and a recursive algorithm is employed to compute the matrix of the discrete eigenvalue system without the explicit calculation of integrals, allowing the implementation of a fast and efficient algorithm that provides considerable reduction in CPU time, when compared with classical Galerkin methods. Numerical experiments confirm the convergence rate of the method and assess the approximation error and the sparsity of the eigenvalue system when the wavelet expansion is truncated. We illustrate the numerical solution of a diffusion problem with random input data with the present method. In this problem, accuracy was retained after dropping the coefficients below a threshold value that was numerically determined. A similar method with scaling functions rather than wavelet functions does not need a discrete wavelet transform and leads to eigenvalue systems with better conditioning but lower sparsity.

97 MATHEMATICS AND COMPUTING↗

THE QUASIPERIODIC AUTOMATED TRANSIT SEARCH ALGORITHM

We present a new algorithm for detecting transiting extrasolar planets in time-series photometry. The Quasiperiodic Automated Transit Search (QATS) algorithm relaxes the usual assumption of strictly periodic transits by permitting a variable, but bounded, interval between successive transits. We show that this method is capable of detecting transiting planets with significant transit timing variations without any loss of significance-{sup s}mearing{sup -}as would be incurred with traditional algorithms; however, this is at the cost of a slightly increased stochastic background. The approximate times of transit are standard products of the QATS search. Despite the increased flexibility, we show that QATS has a run-time complexity that is comparable to traditional search codes and is comparably easy to implement. QATS is applicable to data having a nearly uninterrupted, uniform cadence and is therefore well suited to the modern class of space-based transit searches (e.g., Kepler, CoRoT). Applications of QATS include transiting planets in dynamically active multi-planet systems and transiting planets in stellar binary systems.

79 ASTRONOMY AND ASTROPHYSICS↗

Accuracy and convergence properties of the fixed-stress iterative solution of two-way coupled poromechanics

Here, the paper deals with the numerical solution of Biot's equations of coupled consolidation obtained by a mixed formulation combining continuous Galerkin finite–element and multipoint flux approximation finite–volume methods. The solution algorithm relies on the recently developed fixed–stress solution scheme, in which first the flow problem and then the mechanical one are addressed iteratively. We show that the algorithm can be interpreted as a particular block triangular preconditioning strategy applied within a Richardson iteration. The key component to the success of the preconditioner is the sparse approximation to the Schur complement based on a pressure space mass matrix scaled by a weighting factor that depends element–wise on the inverse of a suitable bulk modulus. The accuracy of the method is assessed, making use of well–known analytical solutions from the literature. Numerical results demonstrate robustness and low computational cost of the fixed–stress scheme in accurately capturing the two–way coupling between deformation and pressure.

58 GEOSCIENCES↗

Integrating a ponderomotive guiding center algorithm into a quasi-static particle-in-cell code based on azimuthal mode decomposition

High fidelity modeling of plasma based acceleration (PBA) requires the use of three dimensional, fully nonlinear, and kinetic descriptions based on the particle-in-cell (PIC) method. In PBA an intense particle beam or laser (driver) propagates through a tenuous plasma whereby it excites a plasma wave wake. Three-dimensional PIC algorithms based on the quasi-static approximation (QSA) have been successfully applied to efficiently model the interaction between relativistic charged particle beams and plasma. In a QSA PIC algorithm, the plasma response to a charged particle beam or laser driver is calculated based on forces from the driver and self-consistent forces from the QSA form of Maxwell's equations. These fields are then used to advance the charged particle beam or laser forward by a large time step. Since the time step is not limited by the regular Courant-Friedrichs-Lewy (CFL) condition that constrains a standard 3D fully electromagnetic PIC code, a 3D QSA PIC code can achieve orders of magnitude speedup in performance. Recently, a new hybrid QSA PIC algorithm that combines another speedup technique known as an azimuthal Fourier decomposition has been proposed and implemented. This hybrid algorithm decomposes the electromagnetic fields, charge and current density into azimuthal harmonics and only the Fourier coefficients need to be updated, which can reduce the algorithmic complexity of a 3D code to that of a 2D code. Modeling the laser-plasma interaction in a full 3D electromagnetic PIC algorithm is very computationally expensive due the enormous disparity of physical scales to be resolved. In the QSA the laser is modeled using the ponderomotive guiding center (PGC) approach. We describe how to implement a PGC algorithm compatible for the QSA PIC algorithms based on the azimuthal mode expansion. Here this algorithm permits time steps orders of magnitude larger than the cell size and it can be asynchronously parallelized. Details on how this is implemented into the QSA PIC code that utilizes an azimuthal mode expansion, QPAD, are also described. Benchmarks and comparisons between a fully 3D explicit PIC code (OSIRIS), as well as a few examples related to laser wakefield acceleration, are presented.

97 MATHEMATICS AND COMPUTING↗

Learning Planar Ising Models Software

Learning Planar Ising Models is a software package written in Matlab for learning relationships among variable in a dataset using graphical models. The software package implements a generally-applicable algorithm for learning planar Ising models from any multivariate dataset. The code provides an algorithm for learning the best planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. The software includes demonstrations of the algorithm in simulations and for applications on publicly available datasets. Details of the algorithm, demonstration simulations, and applications are given in Johnson, et al; 2016. Reference: Johnson, J. K., Oyen, D., Chertkov, M., and Netrapalli, P. (2016). Learning planar Ising models. Journal of Machine Learning Research.

Oyen, Diane↗

Simple and efficient relaxation methods for interfaces separating compressible fluids, cavitating flows and shocks in multiphase mixtures

Numerical approximation of the five-equation two-phase flow of Kapila et al. [A.K. Kapila, R. Menikoff, J.B. Bdzil, S.F. Son, D.S. Stewart, Two-phase modeling of deflagration-to-detonation transition in granular materials: reduced equations, Physics of Fluids 13(10) (2001) 3002-3024] is examined. This model has shown excellent capabilities for the numerical resolution of interfaces separating compressible fluids as well as wave propagation in compressible mixtures [A. Murrone, H. Guillard, A five equation reduced model for compressible two phase flow problems, Journal of Computational Physics 202(2) (2005) 664-698; R. Abgrall, V. Perrier, Asymptotic expansion of a multiscale numerical scheme for compressible multiphase flows, SIAM Journal of Multiscale and Modeling and Simulation (5) (2006) 84-115; F. Petitpas, E. Franquet, R. Saurel, O. Le Metayer, A relaxation-projection method for compressible flows. Part II. The artificial heat exchange for multiphase shocks, Journal of Computational Physics 225(2) (2007) 2214-2248]. However, its numerical approximation poses some serious difficulties. Among them, the non-monotonic behavior of the sound speed causes inaccuracies in wave's transmission across interfaces. Moreover, volume fraction variation across acoustic waves results in difficulties for the Riemann problem resolution, and in particular for the derivation of approximate solvers. Volume fraction positivity in the presence of shocks or strong expansion waves is another issue resulting in lack of robustness. To circumvent these difficulties, the pressure equilibrium assumption is relaxed and a pressure non-equilibrium model is developed. It results in a single velocity, non-conservative hyperbolic model with two energy equations involving relaxation terms. It fulfills the equation of state and energy conservation on both sides of interfaces and guarantees correct transmission of shocks across them. This formulation considerably simplifies numerical resolution. Following a strategy developed previously for another flow model [R. Saurel, R. Abgrall, A multiphase Godunov method for multifluid and multiphase flows, Journal of Computational Physics 150 (1999) 425-467], the hyperbolic part is first solved without relaxation terms with a simple, fast and robust algorithm, valid for unstructured meshes. Second, stiff relaxation terms are solved with a Newton method that also guarantees positivity and robustness. The algorithm and model are compared to exact solutions of the Euler equations as well as solutions of the five-equation model under extreme flow conditions, for interface computation and cavitating flows involving dynamics appearance of interfaces. In order to deal with correct dynamic of shock waves propagating through multiphase mixtures, the artificial heat exchange method of Petitpas et al. [F. Petitpas, E. Franquet, R. Saurel, O. Le Metayer, A relaxation-projection method for compressible flows. Part II. The artificial heat exchange for multiphase shocks, Journal of Computational Physics 225(2) (2007) 2214-2248] is adapted to the present formulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation

In this work, we consider the problem of designing a cloak for waves described by the Helmholtz equation from an integer programming point of view. The problem can be modeled as a PDE-constrained optimization problem with integer-valued control inputs that are distributed in the computational domain. A first-discretize-then-optimize approach results in a large-scale mixed-integer nonlinear program that is in general intractable because of the large number of integer variables that arise from the discretization of the domain. Instead, we propose an efficient algorithm that is able to approximate the local infima of the underlying nonconvex infinite-dimensional problem arbitrarily close without the need to solve the discretized finite-dimensional integer programs to optimality. We optimize only the continuous relaxations of the approximations for local minima and then apply the sum-up rounding methodology to obtain integer-valued controls. If the solutions of the discretized continuous relaxations converge to a local minimizer of the continuous relaxation, then the resulting discrete-valued control sequence converges weakly \(^*\) in \(L^\infty\) to the same local minimizer. These approximation properties follow under suitable refinements of the involved discretization grids. Our results use familiar concepts arising from the analytical properties of the underlying PDE and complement previous results, derived from a topology optimization point of view.

97 MATHEMATICS AND COMPUTING↗

Physics-based adaptivity of a spectral method for the Vlasov–Poisson equations based on the asymmetrically-weighted Hermite expansion in velocity space

We propose a spectral method for the 1D-1V Vlasov–Poisson system where the discretization in velocity space is based on asymmetrically-weighted Hermite functions, dynamically adapted via a scaling α and shifting u of the velocity variable. Specifically, at each time instant an adaptivity criterion selects new values of α and u based on the numerical solution of the discrete Vlasov–Poisson system obtained at that time step. Once the new values of the Hermite parameters α and u are fixed, the Hermite expansion is updated and the discrete system is further evolved for the next time step. The procedure is applied iteratively over the desired temporal interval. The key aspects of the adaptive algorithm are: the map between approximation spaces associated with different values of the Hermite parameters that preserves total mass, momentum and energy; and the adaptivity criterion to update α and u based on physics considerations relating the Hermite parameters to the average velocity and temperature of each plasma species. For the discretization of the spatial coordinate, we rely on Fourier functions and use the implicit midpoint rule for time stepping. The resulting numerical method possesses intrinsically the property of fluid-kinetic coupling, where the low-order terms of the expansion are akin to the fluid moments of a macroscopic description of the plasma, while kinetic physics is retained by adding more spectral terms. Moreover, the scheme features conservation of total mass, momentum and energy associated in the discrete, for periodic boundary conditions. A set of numerical experiments confirms that the adaptive method outperforms the non-adaptive one in terms of accuracy and stability of the numerical solution.

97 MATHEMATICS AND COMPUTING↗