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 685 records · Page 38

Application of the Parareal Algorithm for Acoustic Wave Propagation

We present an application of the parareal algorithm to solve wave propagation problems in the time domain. The parareal algorithm is based on a decomposition of the integration time interval in time slices. It involves a serial prediction step based on a coarse approximation, and a correction step (computed in parallel) based on a fine approximation within each time slice. In our case, the spatial discretization is based on a spectral element approximation which allows flexible and accurate wave simulations in complex geological media. Fully explicit time advancing schemes are classically used for both coarse and fine solvers.In a first stage, we solve the 1D acoustic wave equation in an homogeneous medium in order to test stability and convergence properties of the parareal algorithm. We confirmed the stability problems outlined by Bal and Farhat et al. for hyperbolic problems. These stability issues are mitigated by a time-discontinuous Galerkin discretization of the coarse solver. It may also involve a coarser spatial discretization (hp-refinement) which helps to preserve stability and allows more significant computer savings. Besides, we explore the contribution of elastodynamic homogenization to build consistent coarse grid solvers. Extension to 2D/3D realistic geological media is an ongoing work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Investigation of plasmon relaxation mechanisms using nonadiabatic molecular dynamics

Hot carriers generated from the decay of plasmon excitation can be harvested to drive a wide range of physical or chemical processes. However, their generation efficiency is limited by the concomitant phonon-induced relaxation processes by which the energy in excited carriers is transformed into heat. However, simulations of dynamics of nanoscale clusters are challenging due to the computational complexity involved. Here, in this paper, we adopt our newly developed Trajectory Surface Hopping (TSH) nonadiabatic molecular dynamics algorithm to simulate plasmon relaxation in Au 20 clusters, taking the atomistic details into account. The electronic properties are treated within the Linear Response Time-Dependent Tight-binding Density Functional Theory (LR-TDDFTB) framework. The relaxation of plasmon due to coupling to phonon modes in Au 20 beyond the Born–Oppenheimer approximation is described by the TSH algorithm. The numerically efficient LR-TDDFTB method allows us to address a dense manifold of excited states to ensure the inclusion of plasmon excitation. Starting from the photoexcited plasmon states in Au 20 cluster, we find that the time constant for relaxation from plasmon excited states to the lowest excited states is about 2.7 ps, mainly resulting from a stepwise decay process caused by low-frequency phonons of the Au 20 cluster. Furthermore, our simulations show that the lifetime of the phonon-induced plasmon dephasing process is ~10.4 fs and that such a swift process can be attributed to the strong nonadiabatic effect in small clusters. Our simulations demonstrate a detailed description of the dynamic processes in nanoclusters, including plasmon excitation, hot carrier generation from plasmon excitation dephasing, and the subsequent phonon-induced relaxation process.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Bendable X-ray Optics at the ALS: Design, Tuning, Performance and Applications

We review the development at the Advanced Light Source (ALS) of bendable x-ray optics widely used for focusing of beams of soft and hard x-rays. Typically, the focusing is divided in the tangential and sagittal directions into two elliptically cylindrical reflecting elements, the so-called Kirkpatrick-Baez (KB) pair [1]. Because fabrication of elliptical surfaces is complicated, the cost of directly fabricated tangential elliptical cylinders is often prohibitive. This is in contrast to flat optics, that are simpler to manufacture and easier to measure by conventional interferometry. The figure of a flat substrate can be changed by placing torques (couples) at each end. Equal couples form a tangential cylinder, and unequal couples can approximate a tangential ellipse or parabola. We review the nature of the bending, requirements and approaches to the mechanical design, and describe a technique developed at the ALS Optical Metrology Laboratory (OML) for optimal tuning of bendable mirrors before installation in the beamline [2]. The tuning technique adapts a method previously used to adjust bendable mirrors on synchrotron radiation beamlines [3]. However, in our case, optimal tuning of a bendable mirror is based on surface slope trace data obtained with a slope measuring instrument--in our case, the long trace profiler (LTP). We show that due to the near linearity of the bending problem, the minimal set of data, necessary for tuning of two benders, consists of only three slope traces measured before and after a single adjustment of each bending couple. We provide an algorithm that was used in dedicated software for finding optimal settings for the mirror benders. The algorithm is based on the method of regression analysis with experimentally found characteristic functions of the benders. The resulting approximation to the functional dependence of the desired slope shape provides nearly final settings for the benders. Moreover, the characteristic functions of the benders found in the course of tuning, can be used for retuning of the optics to a new desired shape without removing it from the beamline and re-measuring with the LTP. The result of practical use of the developed technique to precisely tune a KB mirror used at the ALS for micro-focusing is also presented. We also describe a simple ray trace using the profiler data which shows expected performance in the beamline and compare the simulation with experimental data. In summary, we also discuss the next steps in the systematic improvement of optical performance for the application of KB pairs in synchrotron beamlines at the ALS.

47 OTHER INSTRUMENTATION↗

Relaxed Multibang Regularization for the Combinatorial Integral Approximation

Multibang regularization and combinatorial integral approximation decompositions are two actively researched techniques for integer optimal control. In this work, we consider a class of polyhedral functions that arise particularly as convex lower envelopes of multibang regularizers and show that they have beneficial properties with respect to regularization of relaxations of integer optimal control problems. We extend the algorithmic framework of the combinatorial integral approximation such that a subsequence of the computed discrete-valued controls converges to the infimum of the regularized integer control problem.

97 MATHEMATICS AND COMPUTING↗

Snell Envelope with Small Probability Criteria

We present a new algorithm to compute the Snell envelope in the specific case where the criteria to optimize is associated with a small probability or a rare event. This new approach combines the Stochastic Mesh approach of Broadie and Glasserman with a particle approximation scheme based on a specific change of measure designed to concentrate the computational effort in regions pointed out by the criteria. The theoretical analysis of this new algorithm provides non asymptotic convergence estimates. Finally, the numerical tests confirm the practical interest of this approach.

97 MATHEMATICS AND COMPUTING↗

Proposed Semi-Analytic Benchmark for Coupled Neutronics/Thermal-Hydraulics Feedback in Multiphysics Simulations

The past decade has seen considerable advancements in multiscale and multiphysics simulations that account for nonlinear effects of feedback between different physical processes within a single calculation. One area of particular interest has been multiphysics simulations that include both neutronics and thermal-hydraulics effects to accurately model the thermal feedback effects present in nuclear reactors. During this time, many groups have successfully modeled thermal feedback effects by coupling a variety of different types of neutron transport and thermal-hydraulic solvers together. However, formal verification and validation of these coupled code systems has proven challenging due to a lack of benchmark problems with well-characterized reference solutions. One approach is to confirm gross energy balance using bulk coolant properties (outlet temperature/enthalpy) for code verification purposes. Alternatively, code-to-code comparisons of results for a predefined reference/challenge problem have been used to establish reasonability of local results (neutron flux, heating, enthalpy rise) for various implementations, for example the VERA Core Physics Progression Problems. While community solutions are valuable for assessing the relative performance and fidelity of different implementations, they are not guaranteed to provide a measure of the absolute accuracy of a given implementation. In fact, these code-to-code comparisons can give a false sense of confidence by masking the effects of errors or approximations that are common to all of the solution methods tested. This is a particular concern when many methods derive from a common approach, such as Picard iteration. To this end, an analytical benchmark would be very valuable for verifying individual coupled physics implementations, as well as for providing a formal assessment of algorithm accuracy and sensitivity to model approximations such as mesh size and number of convergence iterations. However, creation of an analytical benchmark is difficult due to the complex nature of the eigenvalue form of the neutron transport equation (which does not permit a simple analytical solution for non-trivial cases) as well as the variety of different empirical closure relationships used in thermal-hydraulic modeling. In this paper we propose a benchmark for coupled neutronics/thermal-hydraulics simulations. The proposed benchmark overcomes the challenges associated with a multiphysics benchmark problem by using a fixed-source (rather than eigenvalue) formulation of the neutron transport equation and limiting fluid properties to the single-phase regime where the density and temperature of the coolant are related to enthalpy by a known relationship, while still preserving significant nuclear/thermal feedback effects within the simplified problem. The new benchmark is easy to simulate using existing coupled physics implementations, and allows for a direct comparison with a reference solution, as provided in this summary.

42 ENGINEERING↗

Metals and Quantum Materials with Spin-orbit Interactions by Quantum Monte Carlo methods

The key goals of this project were as follows: 1) Analysis and benchmarks of electron correlation effects recovered in the fixed-node approximation that is inherent to quantum Monte Carlo (QMC) method as applied to metallic states; 2) development of new algorithms for electron spin-degrees of freedom to be treated as explicit quantum variables; 3) designing electronic structure QMC algorithm for efficient evaluation of spin-orbit effects in systems with heavy atoms; 4) adapting the algorithm to complex wave functions and developing corresponding fixed-phase approximation; 5) design and testing of algorithm for valence-only non-local spin-orbit operators; 6) analysis of fixed-node vs fixed-phase errors and their comparisons. The key accomplishments: i) We carried out a systematic study of Li systems by the fixed-node diffusion Monte Carlo method. This involved Li atom, molecule, cluster and solid calculated by the full range of QMC methods including fixed-node QMC.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Integrated Multiscale Modeling of Molecular Computing Devices

Significant advances were made on all objectives of the research program. We have developed fast multiresolution methods for performing electronic structure calculations with emphasis on constructing efficient representations of functions and operators. We extended our approach to problems of scattering in solids, i.e. constructing fast algorithms for computing above the Fermi energy level. Part of the work was done in collaboration with Robert Harrison and George Fann at ORNL. Specific results (in part supported by this grant) are listed here and are described in greater detail. (1) We have implemented a fast algorithm to apply the Green's function for the free space (oscillatory) Helmholtz kernel. The algorithm maintains its speed and accuracy when the kernel is applied to functions with singularities. (2) We have developed a fast algorithm for applying periodic and quasi-periodic, oscillatory Green's functions and those with boundary conditions on simple domains. Importantly, the algorithm maintains its speed and accuracy when applied to functions with singularities. (3) We have developed a fast algorithm for obtaining and applying multiresolution representations of periodic and quasi-periodic Green's functions and Green's functions with boundary conditions on simple domains. (4) We have implemented modifications to improve the speed of adaptive multiresolution algorithms for applying operators which are represented via a Gaussian expansion. (5) We have constructed new nearly optimal quadratures for the sphere that are invariant under the icosahedral rotation group. (6) We obtained new results on approximation of functions by exponential sums and/or rational functions, one of the key methods that allows us to construct separated representations for Green's functions. (7) We developed a new fast and accurate reduction algorithm for obtaining optimal approximation of functions by exponential sums and/or their rational representations.

99 GENERAL AND MISCELLANEOUS↗

A dynamically bi-orthogonal method for time-dependent stochastic partial differential equations II: Adaptivity and generalizations

This is part II of our paper in which we propose and develop a dynamically bi-orthogonal method (DyBO) to study a class of time-dependent stochastic partial differential equations (SPDEs) whose solutions enjoy a low-dimensional structure. In part I of our paper [9], we derived the DyBO formulation and proposed numerical algorithms based on this formulation. Some important theoretical results regarding consistency and bi-orthogonality preservation were also established in the first part along with a range of numerical examples to illustrate the effectiveness of the DyBO method. In this paper, we focus on the computational complexity analysis and develop an effective adaptivity strategy to add or remove modes dynamically. Our complexity analysis shows that the ratio of computational complexities between the DyBO method and a generalized polynomial chaos method (gPC) is roughly of order O((m/N{sub p}){sup 3}) for a quadratic nonlinear SPDE, where m is the number of mode pairs used in the DyBO method and N{sub p} is the number of elements in the polynomial basis in gPC. The effective dimensions of the stochastic solutions have been found to be small in many applications, so we can expect m is much smaller than N{sub p} and computational savings of our DyBO method against gPC are dramatic. The adaptive strategy plays an essential role for the DyBO method to be effective in solving some challenging problems. Another important contribution of this paper is the generalization of the DyBO formulation for a system of time-dependent SPDEs. Several numerical examples are provided to demonstrate the effectiveness of our method, including the Navier–Stokes equations and the Boussinesq approximation with Brownian forcing.

97 MATHEMATICS AND COMPUTING↗

Quantum grow--A quantum dynamics sampling approach for growing potential energy surfaces and nonadiabatic couplings

A quantum sampling algorithm for the interpolation of diabatic potential energy matrices by the Grow method is introduced. The new procedure benefits from penetration of the wave packet into classically forbidden regions, and the accurate quantum mechanical description of nonadiabatic transitions. The increased complexity associated with running quantum dynamics is reduced by using approximate low order expansions of the nuclear wave function within a Multi-configuration time-dependent Hartree scheme during the Grow process. The sampling algorithm is formulated and applied for three representative test cases, demonstrating the recovery of analytic potentials by the interpolated ones, and the convergence of a dynamic observable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Detection of Lung Contour with Closed Principal Curve and Machine Learning

Radiation therapy plays an essential role in the treatment of cancer. In radiation therapy, the ideal radiation doses are delivered to the observed tumor while not affecting neighboring normal tissues. In three-dimensional computed tomography (3D-CT) scans, the contours of tumors and organs-at-risk (OARs) are often manually delineated by radiologists. The task is complicated and time-consuming, and the manually delineated results will be variable from different radiologists. We propose a semi-supervised contour detection algorithm, which firstly uses a few points of region of interest (ROI) as an approximate initialization. Then the data sequences are achieved by the closed polygonal line (CPL) algorithm, where the data sequences consist of the ordered projection indexes and the corresponding initial points. Finally, the smooth lung contour can be obtained, when the data sequences are trained by the backpropagation neural network model (BNNM). We use the private clinical dataset and the public Lung Image Database Consortium and Image Database Resource Initiative (LIDC-IDRI) dataset to measure the accuracy of the presented method, respectively. To the private dataset, experimental results on the initial points which are as low as 15% of the manually delineated points show that the Dice coefficient reaches up to 0.95 and the global error is as low as 1.47 × 10{sup −2}. The performance of the proposed algorithm is also better than the cubic spline interpolation (CSI) algorithm. While on the public LIDC-IDRI dataset, our method achieves superior segmentation performance with average Dice of 0.83.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Model-Free Primal-Dual Methods for Network Optimization with Application to Real-Time Optimal Power Flow

This paper examines the problem of real-time optimization of networked systems and develops online algorithms that steer the system towards the optimal trajectory without explicit knowledge of the system model. The problem is modeled as a dynamic optimization problem with time-varying performance objectives and engineering constraints. The design of the algorithms leverages the online zero-order primal-dual projected-gradient method. In particular, the primal step that involves the gradient of the objective function (and hence requires a networked systems model) is replaced by its zero-order approximation with two function evaluations using a deterministic perturbation signal. The evaluations are performed using the measurements of the system output, hence giving rise to a feedback interconnection, with the optimization algorithm serving as a feedback controller. The paper provides some insights on the stability and tracking properties of this interconnection. Finally, the paper applies this methodology to a real-time optimal power flow problem in power systems, and shows its efficacy on the IEEE 37-node distribution test feeder for reference power tracking and voltage regulation.

61 RADIATION PROTECTION AND DOSIMETRY↗

Adaptive hybrid simulations for multiscale stochastic reaction networks

The probability distribution describing the state of a Stochastic Reaction Network (SRN) evolves according to the Chemical Master Equation (CME). It is common to estimate its solution using Monte Carlo methods such as the Stochastic Simulation Algorithm (SSA). In many cases, these simulations can take an impractical amount of computational time. Therefore, many methods have been developed that approximate sample paths of the underlying stochastic process and estimate the solution of the CME. A prominent class of these methods include hybrid methods that partition the set of species and the set of reactions into discrete and continuous subsets. Such a partition separates the dynamics into a discrete and a continuous part. Simulating such a stochastic process can be computationally much easier than simulating the exact discrete stochastic process with SSA. Moreover, the quasi-stationary assumption to approximate the dynamics of fast subnetworks can be applied for certain classes of networks. However, as the dynamics of a SRN evolves, these partitions may have to be adapted during the simulation. We develop a hybrid method that approximates the solution of a CME by automatically partitioning the reactions and species sets into discrete and continuous components and applying the quasi-stationary assumption on identifiable fast subnetworks. Our method does not require any user intervention and it adapts to exploit the changing timescale separation between reactions and/or changing magnitudes of copy-numbers of constituent species. We demonstrate the efficiency of the proposed method by considering examples from systems biology and showing that very good approximations to the exact probability distributions can be achieved in significantly less computational time. This is especially the case for systems with oscillatory dynamics, where the system dynamics change considerably throughout the time-period of interest.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient algorithm for generating spectra using line-by-lne methods

A method is presented for efficient generation of spectra using line-by-line approaches. The only approximation is replacing the line shape function with an interpolation procedure, which makes the method independent of the line profile functional form. The resulting computational savings for large number of lines is proportional to the number of frequency points in the spectral range. Therefore, for large-scale problems the method can provide speedups of two orders of magnitude or more. A method was presented to generate line-by-line spectra efficiently. The first step was to replace the explicit calculation of the profile by the Newton divided-differences interpolating polynomial. The second step is to accumulate the lines effectively reducing their number to the number of frequency points. The final step is recognizing the resulting expression as a convolution and amenable to FFT methods. The reduction in computational effort for a configuration-to-configuration transition array with large number of lines is proportional to the number of frequency points. The method involves no approximations except for replacing the explicit profile evaluation by interpolation. Specifically, the line accumulation and convolution are exact given the interpolation procedure. Furthermore, the interpolation makes the method independent of the line profile functional form contrary to other schemes using FFT methods to generate line-by-line spectra but relying on the analytic form of the profile Fourier transform. Finally, the method relies on a uniform frequency mesh. For non-uniform frequency meshes, however, the method can be applied by using a suitable temporary uniform mesh and the results interpolated onto the final mesh with little additional cost.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Localized Pisot Matrices and Joint Approximations of Algebraic Numbers

A development of the simplex-module algorithm for expansion of algebraic numbers in multidimensional continued fractions is proposed. To this end, localized Pisot matrices are constructed, whose eigenvalues with moduli less than one are contained in an interval of small length. Such Pisot matrices generate continued fractions whose convergents are arbitrarily close to the best approximations.

97 MATHEMATICS AND COMPUTING↗

Triangulation Made Easy

We describe a simple and efficient algorithm for two-view triangulation of 3D points from approximate 2D matches based on minimizing the L2 reprojection error. Our iterative algorithm improves on the one by Kanatani et al. by ensuring that in each iteration the epipolar constraint is satisfied. In the case where the two cameras are pointed in the same direction, the method provably converges to an optimal solution in exactly two iterations. For more general camera poses, two iterations are sufficient to achieve convergence to machine precision, which we exploit to devise a fast, non-iterative method. The resulting algorithm amounts to little more than solving a quadratic equation, and involves a fixed, small number of simple matrixvector operations and no conditional branches. We demonstrate that the method computes solutions that agree to very high precision with those of Hartley and Sturm's original polynomial method, though achieves higher numerical stability and 1-4 orders of magnitude greater speed.

99 GENERAL AND MISCELLANEOUS↗

A NEW APPROACH TO DETERMINE OPTICALLY THICK H{sub 2} COOLING AND ITS EFFECT ON PRIMORDIAL STAR FORMATION

We present a new method for estimating the H{sub 2} cooling rate in the optically thick regime in simulations of primordial star formation. Our new approach is based on the TreeCol algorithm, which projects matter distributions onto a spherical grid to create maps of column densities for each fluid element in the computational domain. We have improved this algorithm by using the relative gas velocities to weight the individual matter contributions with the relative spectral line overlaps, in order to properly account for the Doppler effect. We compare our new method to the widely used Sobolev approximation, which yields an estimate for the column density based on the local velocity gradient and the thermal velocity. This approach generally underestimates the photon escape probability because it neglects the density gradient and the actual shape of the cloud. We present a correction factor for the true line overlap in the Sobolev approximation and a new method based on local quantities, which fits the exact results reasonably well during the collapse of the cloud, with the error in the cooling rates always being less than 10%. Analytical fitting formulae fail at determining the photon escape probability after formation of the first protostar (error of ∼40%) because they are based on the assumption of spherical symmetry and therefore break down once a protostellar accretion disk has formed. Our method yields lower temperatures and hence promotes fragmentation for densities above ∼10{sup 10} cm{sup –3} at a distance of ∼200 AU from the first protostar. Since the overall accretion rates are hardly affected by the cooling implementation, we expect Pop III stars to have lower masses in our simulations, compared to the results of previous simulations that used the Sobolev approximation.

79 ASTRONOMY AND ASTROPHYSICS↗

SELF-GRAVITATIONAL FORCE CALCULATION OF SECOND-ORDER ACCURACY FOR INFINITESIMALLY THIN GASEOUS DISKS IN POLAR COORDINATES

Investigating the evolution of disk galaxies and the dynamics of proto-stellar disks can involve the use of both a hydrodynamical and a Poisson solver. These systems are usually approximated as infinitesimally thin disks using two-dimensional Cartesian or polar coordinates. In Cartesian coordinates, the calculations of the hydrodynamics and self-gravitational forces are relatively straightforward for attaining second-order accuracy. However, in polar coordinates, a second-order calculation of self-gravitational forces is required for matching the second-order accuracy of hydrodynamical schemes. We present a direct algorithm for calculating self-gravitational forces with second-order accuracy without artificial boundary conditions. The Poisson integral in polar coordinates is expressed in a convolution form and the corresponding numerical complexity is nearly linear using a fast Fourier transform. Examples with analytic solutions are used to verify that the truncated error of this algorithm is of second order. The kernel integral around the singularity is applied to modify the particle method. The use of a softening length is avoided and the accuracy of the particle method is significantly improved.

79 ASTRONOMY AND ASTROPHYSICS↗