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 703 records · Page 39

Infinite-dimensional approach to system identification of Space Control Laboratory Experiment (SCOLE)

The identification of a unique set of system parameters in large space structures poses a significant new problem in control technology. Presented is an infinite-dimensional identification scheme to determine system parameters in large flexible structures in space. The method retains the distributed nature of the structure throughout the development of the algorithm and a finite-element approximation is used only to implement the algorithm. This approach eliminates many problems associated with model truncation used in other methods of identification. The identification is formulated in Hilbert space and an optimal control technique is used to minimize weighted least squares of error between the actual and the model data. A variational approach is used to solve the problem. A costate equation, gradients of parameter variations and conditions for optimal estimates are obtained. Computer simulation studies are conducted using a shuttle-attached antenna configuration, more popularly known as the Space Control Laboratory Experiment (SCOLE) as an example. Numerical results show a close match between the estimated and true values of the parameters.

Hossain, S. A.↗

Traffic Prediction for Uncommunicative Aircraft in Terminal Airspace: Development Framework and Performance Evaluations

This paper presents an air traffic prediction algorithm that takes observations of an aircraft and classifies aircraft type, estimates the aircraft's intent to and method of joining an airport traffic pattern, and predicts the aircaft's future trajectory. To develop algorithms that enable autonomous aircraft to safely insert into un-towered traffic patterns, several challenges need to be addressed. These challenges range from traffic detection to sensor fusion to own-ship trajectory replanning. Critical to a trajectory replanning algorithm is information regarding the future behavior of all traffic aircraft in the operational environment. The presented traffic prediction algorithm generates this information using regular measurements of traffic aircraft position and velocity to classify the aircraft by speed-class, estimate how the aircraft will approach the runway, and construct a predicted trajectory to the runway including future positions and velocities at specific times. The predictions of the presented algorithm are the necessary inputs for any downstream traffic pattern sequencing and own-ship trajectory planning routines. The presented algorithm is benchmarked using approximately 300 randomized traffic trajectories, spanning four vehicle weight classes and eight traffic entry types. While the algorithm can process multiple traffic vehicles in the terminal area, there is no prediction of traffic-on-traffic interaction. Each traffic vehicle is processed separately.

John D McMinn↗

Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

Halappanavar, Mahantesh↗

A Hierarchical OPF Algorithm with Improved Gradient Evaluation in Three-Phase Networks

Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient algorithms converge to solutions with voltage violation. In this paper, we improve a recent hierarchical OPF algorithm that rested on primal-dual gradients evaluated with a linearized distribution power flow model. Specifically, we propose a more accurate gradient evaluation method based on an unbalanced three-phase nonlinear distribution power flow model to mitigate the errors arising from linearization. The resultant gradients feature a blocked structure that enables our development of an improved hierarchical primal-dual algorithm to solve the OPF problem. Numerical results on the IEEE 123-bus test feeder and a 4,518-node test feeder show that the proposed method can enhance voltage safety at comparable computational efficiency with the linearized algorithm.

approximation algorithms↗

Parallel k-means++ for Multiple Shared-Memory Architectures

In recent years k-means++ has become a popular initialization technique for improved k-means clustering. To date, most of the work done to improve its performance has involved parallelizing algorithms that are only approximations of k-means++. In this paper we present a parallelization of the exact k-means++ algorithm, with a proof of its correctness. We develop implementations for three distinct shared-memory architectures: multicore CPU, high performance GPU, and the massively multithreaded Cray XMT platform. We demonstrate the scalability of the algorithm on each platform. In addition we present a visual approach for showing which platform performed k-means++ the fastest for varying data sizes.

data clustering↗

Limited range spatial load balancing in non-convex environments using sampling-based motion planners

This paper analyzes the limited range, spatial load balancing problem for agents deployed in non-convex environments and subject to differential constraints which restricts how the agents can move. First, the (unlimited range) spatial load balancing problem is introduced and the minimization problem with area constraints is defined. Then, to extend the problem for limited ranges, two cost functions and a sub-partition are defined. The problems are then analyzed and the results prove the existence of a partition that satisfies the area constraints. The non-convex environment makes the problem difficult to solve in continuous-space. Therefore, a probabilistic roadmap is used to approximate agents’ cells via a graph. A distributed algorithm is proven to converge to an approximate solution. Lastly, the convergence of the algorithm is shown in simulation.

42 ENGINEERING↗

A center-of-mass principle for the multiparticle Schroedinger equation

The center-of-mass principle is the key to the rapid computation of the interaction of a large number of classical particles. Electrons governed by the multiparticle Schroedinger equation have a much more complicated interaction mainly due to their spatial extent and the antisymmetry constraint on the total wave function of the combined electron system. We present a center-of-mass principle for quantum particles that accounts for this spatial extent, the antisymmetry constraint, and the potential operators. We use it to construct an algorithm for computing a size-consistent approximate wave function for large systems with simple geometries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Assessment of biases in MODIS surface reflectance due to Lambertian approximation

Using MODIS data and the AERONET-based Surface Reflectance Validation Network (ASRVN), this work studies errors of MODIS atmospheric correction caused by the Lambertian approximation. On one hand, this approximation greatly simplifies the radiative transfer model, reduces the size of the look-up tables, and makes operational algorithm faster. On the other hand, uncompensated atmospheric scattering caused by Lambertian model systematically biases the results. For example, for a typical bowl-shaped bidirectional reflectance distribution function (BRDF), the derived reflectance is underestimated at high solar or view zenith angles, where BRDF is high, and is overestimated at low zenith angles where BRDF is low. The magnitude of biases grows with the amount of scattering in the atmosphere, i.e., at shorter wavelengths and at higher aerosol concentration. The slope of regression of Lambertian surface reflectance vs. ASRVN bidirectional reflectance factor (BRF) is about 0.85 in the red and 0.6 in the green bands. This error propagates into the MODIS BRDF/albedo algorithm, slightly reducing the magnitude of overall reflectance and anisotropy of BRDF. This results in a small negative bias of spectral surface albedo. An assessment for the GSFC (Greenbelt, USA) validation site shows the albedo reduction by 0.004 in the near infrared, 0.005 in the red, and 0.008 in the green MODIS bands.

54 ENVIRONMENTAL SCIENCES↗

Grid-based diffusion Monte Carlo for fermions without the fixed-node approximation

A diffusion Monte Carlo algorithm is introduced that can determine the correct nodal structure of the wave function of a few-fermion system and its ground-state energy without an uncontrolled bias. This is achieved by confining signed random walkers to the points of a uniform infinite spatial grid, allowing them to meet and annihilate one another to establish the nodal structure without the fixed-node approximation. An imaginary-time propagator is derived rigorously from a discretized Hamiltonian, governing a non-Gaussian, sign-flipping, branching, and mutually annihilating random walk of particles. The accuracy of the resulting stochastic representations of a fermion wave function is limited only by the grid and imaginary-time resolutions and can be improved in a controlled manner. Here, the method is tested for a series of model problems including fermions in a harmonic trap as well as the He atom in its singlet or triplet ground state. For the latter case, the energies approach from above with increasing grid resolution and converge within 0.015 E h of the exact basis-set-limit value for the grid spacing of 0.08 a.u. with a statistical uncertainty of 10 –5 E h without an importance sampling or Jastrow factor.

74 ATOMIC AND MOLECULAR PHYSICS↗

Multigroup Neutron Transport Using a Collision-Based Hybrid Method

A collision-based hybrid algorithm for the discrete ordinates approximation of the neutron transport equation is extended to the isotropic multigroup setting. The algorithm uses discrete energy and angle grids at two different resolutions and approximates the fission and scattering sources on the coarser grids. The coupling of a collided transport equation, discretized on the coarse grid, with an uncollided transport equation, discretized on the fine grid, yields an algorithm that, in most cases, is more efficient than the traditional multigroup approach. In conclusion, the improvement over existing techniques is demonstrated for time-dependent problems with different materials, geometries, and energy groups.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. Although obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most nonblocking commercial code is only lock-free. This article suggests a simple solution to this problem. We show that for a large class of lock-free algorithms, under scheduling conditions that approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can continue to design simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes to the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1 but that in fact a general subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. Here, to the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst-case adversary, in a stochastic model capturing their expected asymptotic behavior.

97 MATHEMATICS AND COMPUTING↗

SU-G-BRC-16: Theory and Clinical Implications of the Constant Dosimetric Leaf Gap (DLG) Approximation

Purpose: Commercial dose calculation algorithms incorporate a single DLG value for a given beam energy that is applied across an entire treatment field. However, the physical processes associated with beam generation and dose delivery suggest that the DLG is not constant. The aim of this study is to evaluate the variation of DLG among all leaf pairs, to quantify how this variation impacts delivered dose, and to establish a novel method to correct dose distributions calculated using the approximation of constant DLG. Methods: A 2D diode array was used to measure the DLG for all 60 leaf pairs at several points along each leaf pair travel direction. This approach was validated by comparison to DLG values measured at select points using a 0.6 cc ion chamber with the standard formalism. In-house software was developed to enable incorporation of position dependent DLG values into dose distribution optimization and calculation. The accuracy of beam delivery of both the corrected and uncorrected treatment plans was studied through gamma pass rate evaluation. A comparison of DVH statistics in corrected and uncorrected treatment plans was made. Results: The outer 20 MLC leaf pairs (1.0 cm width) have DLG values that are 0.32 mm (mean) to 0.65 mm (maximum) lower than the central leaf-pair. VMAT plans using a large number of 1 cm wide leaves were more accurately delivered (gamma pass rate increased by 5%) and dose coverage was higher (D100 increased by 3%) when the 2D DLG was modeled. Conclusion: Using a constant DLG value for a given beam energy will result in dose optimization, dose calculation and treatment delivery inaccuracies that become significant for treatment plans with high modulation complexity scores delivered with 1 cm wide leaves.

60 APPLIED LIFE SCIENCES↗

First and second order approximations to stage numbers in multicomponent enrichment cascades

This paper describes closed form, Taylor series approximations to the number product stages in a multicomponent enrichment cascade. Such closed form approximations are required when a symbolic, rather than a numeric, algorithm is used to compute the optimal cascade state. Both first and second order approximations were implemented. The first order solution was found to be grossly incorrect, having the wrong functional form over the entire domain. On the other hand, the second order solution shows excellent agreement with the 'true' solution over the domain of interest. An implementation of the symbolic, second order solver is available in the free and open source PyNE library. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A model and variance reduction method for computing statistical outputs of stochastic elliptic partial differential equations

We present a model and variance reduction method for the fast and reliable computation of statistical outputs of stochastic elliptic partial differential equations. Our method consists of three main ingredients: (1) the hybridizable discontinuous Galerkin (HDG) discretization of elliptic partial differential equations (PDEs), which allows us to obtain high-order accurate solutions of the governing PDE; (2) the reduced basis method for a new HDG discretization of the underlying PDE to enable real-time solution of the parameterized PDE in the presence of stochastic parameters; and (3) a multilevel variance reduction method that exploits the statistical correlation among the different reduced basis approximations and the high-fidelity HDG discretization to accelerate the convergence of the Monte Carlo simulations. The multilevel variance reduction method provides efficient computation of the statistical outputs by shifting most of the computational burden from the high-fidelity HDG approximation to the reduced basis approximations. Furthermore, we develop a posteriori error estimates for our approximations of the statistical outputs. Based on these error estimates, we propose an algorithm for optimally choosing both the dimensions of the reduced basis approximations and the sizes of Monte Carlo samples to achieve a given error tolerance. We provide numerical examples to demonstrate the performance of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Semi-analytical covariance matrices for two-point correlation function for DESI 2024 data

We present an optimized way of producing the fast semi-analytical covariance matrices for the Legendre moments of the two-point correlation function, taking into account survey geometry and mimicking the non-Gaussian effects. We validate the approach on simulated (mock) catalogs for different galaxy types, representative of the Dark Energy Spectroscopic Instrument (DESI) Data Release 1, used in 2024 analyses. We find only a few percent differences between the mock sample covariance matrix and our results, which can be expected given the approximate nature of the mocks, although we do identify discrepancies between the shot-noise properties of the DESI fiber assignment algorithm and the faster approximation (emulator) used in the mocks. Importantly, we find a close agreement (≤ 8% relative differences) in the projected errorbars for distance scale parameters for the baryon acoustic oscillation measurements. This confirms our method as an attractive alternative to simulation-based covariance matrices, especially for non-standard models or galaxy sample selections, making it particularly relevant to the broad current and future analyses of DESI data.

79 ASTRONOMY AND ASTROPHYSICS↗

Liquid and liquid–gas flows at all speeds

All speed flows and in particular low Mach number flow algorithms are addressed for the numerical approximation of the Kapila et al. [1] multiphase flow model. This model is valid for fluid mixtures evolving in mechanical equilibrium but out of temperature equilibrium and is efficient for material interfaces computation separating miscible and non-miscible fluids. In this context, the interface is considered as a numerically diffused zone, captured as well as all present waves (shocks, expansion waves). The same flow model can be used to solve cavitating and boiling flows [2]. Many applications occurring with liquid–gas interfaces and cavitating flows involve a very wide range of Mach number, from 10{sup −3} to supersonic (and even hypersonic) conditions with respect to the mixture sound speed. It is thus important to address numerical methods free of restrictions regarding the Mach number. To do this, a preconditioned Riemann solver is built and embedded into the Godunov explicit scheme. It is shown that this method converges to exact solutions but needs too small time steps to be efficient. An implicit version is then derived, first in one dimension and second in the frame of 2D unstructured meshes. Two-phase flow preconditioning is then addressed in the frame of the Saurel et al. [3] algorithm. Modifications of the preconditioned Riemann solver are needed and detailed. Convergence of both single phase and two-phase numerical solutions are demonstrated with the help of single phase and two-phase steady nozzle flow solutions. Last, the method is illustrated by the computation of real cavitating flows in Venturi nozzles. Vapour pocket size and instability frequencies are reproduced by the model and method without using any adjustable parameter.

42 ENGINEERING↗

Data-driven modeling and control of dynamical systems using Koopman and Perron-Frobenius operators

This dissertation studies the data-driven modeling and control problem of nonlinear systems by exploiting the linear operator theoretic framework involving Koopman and Perro-Frobenius operator. A systematic linear-operator based controller design procedure has been established, which can be used to solve a variety of nonlinear control problems, including feedback stabilization using control Lyapunov functions, optimal quadratic regulation using Koopman eigenfunctions and convex optimization formulation of optimal control problem using P-F and Koopman operator approximation. As the core of data-driven modeling, we first propose a new algorithm for the finite-dimensional approximation of the linear transfer Koopman and Perron-Frobenius operator from time-series data. We argue that the existing approach for the finite-dimensional approximation of these transfer operators such as Dynamic Mode Decomposition (DMD) and Extended Dynamic Mode Decomposition (EDMD) do not capture two important properties of these operators, namely positivity and Markov property. The algorithm we propose preserves these two properties. We call the proposed algorithm as naturally structured DMD (NSDMD) since it retains the inherent properties of these operators. Naturally structured DMD algorithm leads to a better approximation of the steady-state dynamics of the system regarding computing Koopman and Perron- Frobenius operator eigenfunctions and eigenvalues. However, preserving positivity property is critical for capturing the real transient dynamics of the system. This positivity property of the transfer operators and it's finite-dimensional approximation play an important role for controller and estimator design of nonlinear systems. To solve the feedback stabilization problem for nonlinear control systems, we tried to take advantage of the Koopman operator framework. The Koopman operator approach provides a linear representation for a nonlinear dynamical system and a bilinear representation for a nonlinear control system. The problem of feedback stabilization of a nonlinear control system is then transformed to the stabilization of a bilinear control system. We propose a control Lyapunov function (CLF)-based approach for the design of stabilizing feedback controllers for the bilinear system. The search for finding a CLF for the bilinear control system is formulated as a convex optimization problem. This leads to a schematic procedure for designing CLF-based stabilizing feedback controllers for the bilinear system and hence the original nonlinear system. Another advantage of the proposed controller design approach outlined in this dissertation is that it does not require explicit knowledge of system dynamics. In particular, the bilinear representation of a nonlinear control system in the Koopman eigenfunction space can be obtained from time-series data. Next, we study the optimal quadratic regulation problem for nonlinear systems. The linear operator theoretic framework involving the Koopman operator is used to lift the dynamics of nonlinear control system to an infinite-dimensional bilinear system. The optimal quadratic regulation problem for nonlinear system is formulated in terms of the finite-dimensional approximation of the bilinear system. A convex optimization-based approach is proposed for solving the quadratic regulator problem for bilinear system. We applied a variety of examples and compared the simulation results between our framework and conventional LQR control using linearized model. For more general optimal control problems, we provide a density-function based convex formulation for the optimal control problem of the nonlinear system. The convex formulation relies on the duality result in the stability theory of a dynamical system involving density function and Perron-Frobenius operator. The optimal control problem is formulated as an infinite-dimensional convex optimization program. The finite-dimensional approximation of the optimization problem relies on the recent advances made in the data-driven computation of the Koopman operator, which is dual to the Perron-Frobenius operator. Simulation results are presented to demonstrate the application of the developed framework.

Huang, Bowen↗