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 289 records · Page 16

Approximate Bayesian computation for forward modeling in cosmology

Bayesian inference is often used in cosmology and astrophysics to derive constraints on model parameters from observations. This approach relies on the ability to compute the likelihood of the data given a choice of model parameters. In many practical situations, the likelihood function may however be unavailable or intractable due to non-gaussian errors, non-linear measurements processes, or complex data formats such as catalogs and maps. In these cases, the simulation of mock data sets can often be made through forward modeling. We discuss how Approximate Bayesian Computation (ABC) can be used in these cases to derive an approximation to the posterior constraints using simulated data sets. This technique relies on the sampling of the parameter set, a distance metric to quantify the difference between the observation and the simulations and summary statistics to compress the information in the data. We first review the principles of ABC and discuss its implementation using a Population Monte-Carlo (PMC) algorithm and the Mahalanobis distance metric. We test the performance of the implementation using a Gaussian toy model. We then apply the ABC technique to the practical case of the calibration of image simulations for wide field cosmological surveys. We find that the ABC analysis is able to provide reliable parameter constraints for this problem and is therefore a promising technique for other applications in cosmology and astrophysics. Our implementation of the ABC PMC method is made available via a public code release.

79 ASTRONOMY AND ASTROPHYSICS↗

SU-E-I-01: A Fast, Analytical Pencil Beam Based Method for First Order X-Ray Scatter Estimation of Kilovoltage Cone Beam X-Rays

Purpose: To analytically estimate first-order x-ray scatter for kV cone beam x-ray imaging with high computational efficiency. Methods: In calculating first-order scatter using the Klein-Nishina formula, we found that by integrating the point-to-point scatter along an interaction line, a “pencil-beam” scatter kernel (BSK) can be approximated to a quartic expression when the imaging field is small. This BSK model for monoenergetic, 100keV x-rays has been verified on homogeneous cube and cylinder water phantoms by comparing with the exact implementation of KN formula. For heterogeneous medium, the water-equivalent length of a BSK was acquired with an improved Siddon's ray-tracing algorithm, which was also used in calculating pre- and post- scattering attenuation. To include the electron binding effect for scattering of low-kV photons, the mean corresponding scattering angle is determined from the effective point of scattered photons of a BSK. The behavior of polyenergetic x-rays was also investigated for 120kV x-rays incident to a sandwiched infinite heterogeneous slab phantom, with the electron binding effect incorporated. Exact computation and Monte Carlo simulations were performed for comparisons, using the EGSnrc code package. Results: By reducing the 3D volumetric target (o(n{sup 3})) to 2D pencil-beams (o(n{sup 2})), the computation expense can be generally lowered by n times, which our experience verifies. The scatter distribution on a flat detector shows high agreement between the analytic BSK model and exact calculations. The pixel-to-pixel differences are within (-2%, 2%) for the homogeneous cube and cylinder phantoms and within (0, 6%) for the heterogeneous slab phantom. However, the Monte Carlo simulation shows increased deviation of the BSK model toward detector periphery. Conclusion: The proposed BSK model, accommodating polyenergetic x-rays and electron binding effect at low kV, shows great potential in efficiently estimating the first-order scatter from small imaging fields. We are investigating more thoroughly to improve performance and explore applications.

07 ISOTOPE AND RADIATION SOURCES↗

Simulation of biochemical reactions with time-dependent rates by the rejection-based algorithm

We address the problem of simulating biochemical reaction networks with time-dependent rates and propose a new algorithm based on our rejection-based stochastic simulation algorithm (RSSA) [Thanh et al., J. Chem. Phys. 141(13), 134116 (2014)]. The computation for selecting next reaction firings by our time-dependent RSSA (tRSSA) is computationally efficient. Furthermore, the generated trajectory is exact by exploiting the rejection-based mechanism. We benchmark tRSSA on different biological systems with varying forms of reaction rates to demonstrate its applicability and efficiency. We reveal that for nontrivial cases, the selection of reaction firings in existing algorithms introduces approximations because the integration of reaction rates is very computationally demanding and simplifying assumptions are introduced. The selection of the next reaction firing by our approach is easier while preserving the exactness.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum Simulators and Applications on Quantum Framework

Simulating quantum circuits is essential for validating quantum algorithms. However, no single simulator consistently performs best - efficiency depends on circuit structure, entanglement, and depth. In this work, we integrate Qiskit-Aer (state-vector and matrix product state) and QTensor, a tree-tensor-network based simulator, into the Quantum Framework (QFw), a modular platform that supports multiple quantum backends via a unified interface. We also enable distributed quantum approximate optimization algorithm (DQAOA) application compatibility with QFw, allowing sub-problems to be solved in parallel at scale. We then benchmark DQAOA and TFIM (transverse field Ising model) circuits across supported simulators, showing how performance varies significantly with problem type. All simulations are deployed on the Frontier supercomputer using QFw's MPI-based orchestration for distributed, multinode execution. These results underscore the need for simulatoragnostic infrastructure to enable systematic evaluation and highperformance scaling of quantum workloads. QFw provides a practical and extensible path toward reproducible quantum algorithm development across diverse application domains.

Chundury, Srikar [ORNL] (ORCID:0009000183359259)↗

Solving numerically nonlinear systems of balance laws by multivariate sigmoidal functions approximation

A numerical method for solving systems of nonlinear one-dimensional balance laws, based on multivariate sigmoidal functions approximation, is developed. Constructive approximation theorems are first established in both, uniform and L{sup p} norms. A priori as well as a posteriori error estimates are derived for the numerical solutions, when various kinds of sigmoidal functions, such as unit step, logistic and Gompertz functions, are chosen. The residual of the numerical method is also estimated. Numerical examples are given to test the performance of the algorithm, a comparison with the Godunov method is made concerning accuracy and computational cost. Finally, the numerical stability of the method is analyzed.

97 MATHEMATICS AND COMPUTING↗

Towards Robustness Guarantees for Feedback-Based Optimization

Feedback-based online optimization algorithms have gained traction in recent years because of their simple implementation, their ability to reject disturbances in real time, and their increased robustness to model mismatch. While the robustness properties have been observed both in simulation and experimental results, the theoretical analysis in the literature is mostly limited to nominal conditions. In this work, we propose a framework to systematically assess the robust stability of feedback-based online optimization algorithms. We leverage tools from monotone operator theory, variational inequalities and classical robust control to obtain tractable numerical tests that guarantee robust convergence properties of online algorithms in feedback with a physical system, even in the presence of disturbances and model uncertainty. The results are illustrated via an academic example and a case study of a power distribution system.

approximation algorithms↗

IBS for non-gaussian distributions

In many situations distribution can significantly deviate from Gaussian which requires accurate treatment of IBS. Our original interest in this problem was motivated by the need to have an accurate description of beam evolution due to IBS while distribution is strongly affected by the external electron cooling force. A variety of models with various degrees of approximation were developed and implemented in BETACOOL in the past to address this topic. A more complete treatment based on the friction coefficient and full 3-D diffusion tensor was introduced in BETACOOL at the end of 2007 under the name 'local IBS model'. Such a model allowed us calculation of IBS for an arbitrary beam distribution. The numerical benchmarking of this local IBS algorithm and its comparison with other models was reported before. In this paper, after briefly describing the model and its limitations, they present its comparison with available experimental data.

43 PARTICLE ACCELERATORS↗

The Best Rank-(R{sub 1},R{sub 2},R{sub 3}) Approximation of Tensors by Means of a Geometric Newton Method

In the matrix case, the best low-rank approximation can be obtained directly from the truncated singular value decomposition. However, the best rank-(R{sub 1},R{sub 2},...,R{sub N}) approximation of higher-order tensors cannot be computed in a straightforward way. An additional difficulty comes from an invariance property of the cost function by the action of the orthogonal group. This means that the zeros of the cost function are not isolated and the plain Newton method might have difficulties. In this paper, we derive a geometric Newton method using the theory of quotient manifolds. Our algorithm has fast convergence in a neighborhood of the solution and is useful for a large class of problems. We mention some applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automated temporal tracking and segmentation of lymphoma on serial CT examinations

Purpose: It is challenging to reproducibly measure and compare cancer lesions on numerous follow-up studies; the process is time-consuming and error-prone. In this paper, we show a method to automatically and reproducibly identify and segment abnormal lymph nodes in serial computed tomography (CT) exams. Methods: Our method leverages initial identification of enlarged (abnormal) lymph nodes in the baseline scan. We then identify an approximate region for the node in the follow-up scans using nonrigid image registration. The baseline scan is also used to locate regions of normal, non-nodal tissue surrounding the lymph node and to map them onto the follow-up scans, in order to reduce the search space to locate the lymph node on the follow-up scans. Adaptive region-growing and clustering algorithms are then used to obtain the final contours for segmentation. We applied our method to 24 distinct enlarged lymph nodes at multiple time points from 14 patients. The scan at the earlier time point was used as the baseline scan to be used in evaluating the follow-up scan, resulting in 70 total test cases (e.g., a series of scans obtained at 4 time points results in 3 test cases). For each of the 70 cases, a ''reference standard'' was obtained by manual segmentation by a radiologist. Assessment according to response evaluation criteria in solid tumors (RECIST) using our method agreed with RECIST assessments made using the reference standard segmentations in all test cases, and by calculating node overlap ratio and Hausdorff distance between the computer and radiologist-generated contours. Results: Compared to the reference standard, our method made the correct RECIST assessment for all 70 cases. The average overlap ratio was 80.7 {+-} 9.7% s.d., and the average Hausdorff distance was 3.2 {+-} 1.8 mm s.d. The concordance correlation between automated and manual segmentations was 0.978 (95% confidence interval 0.962, 0.984). The 100% agreement in our sample between our method and the standard with regard to RECIST classification suggests that the true disagreement rate is no more than 6%. Conclusions: Our automated lymph node segmentation method achieves excellent overall segmentation performance and provides equivalent RECIST assessment. It potentially will be useful to streamline and improve cancer lesion measurement and tracking and to improve assessment of cancer treatment response.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Controlled Nonlinear Stochastic Delay Equations: Part I: Modeling and Approximations

This two-part paper deals with 'foundational' issues that have not been previously considered in the modeling and numerical optimization of nonlinear stochastic delay systems. There are new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. There are two basic and interconnected themes for these models. The first, dealt with in this part, concerns the definition of admissible control. The classical definition of an admissible control as a nonanticipative relaxed control is inadequate for these models and needs to be extended. This is needed for the convergence proofs of numerical approximations for optimal controls as well as to have a well-defined model. It is shown that the new classes of admissible controls do not enlarge the range of the value functions, is closed (together with the associated paths) under weak convergence, and is approximatable by ordinary controls. The second theme, dealt with in Part II, concerns transportation equation representations, and their role in the development of numerical algorithms with much reduced memory and computational requirements.

97 MATHEMATICS AND COMPUTING↗

Ab-initio Calculations of Absorption Spectra of Semiconducting Nanowires Within Many Body Perturbation Theory

We present a study of the optical absorption spectra of thin silicon nanowires using many-body perturbation theory. We solve the Bethe-Salpeter equation in the static approximation using a technique that avoids explicit calculation of empty electronic states, as well as storage and inversion of the dielectric matrix. We provide a detailed assessment of the numerical accuracy of this technique, when using plane wave basis sets and periodically repeated supercells. Our calculations show that establishing numerical error bars of computed spectra is critical, in order to draw meaningful comparisons with experiments and between results obtained within different algorithms. We also discuss the influence of surface structure on the absorption spectra of nanowires with {approx_equal}1-nm diameter. Finally, we compare our calculations with those obtained within time-dependent density functional theory and find substantial differences, more pronounced than in the case of Si nanoparticles with the same diameter.

36 MATERIALS SCIENCE↗

Continuous Energy, Multi-Dimensional Transport Calculations for Problem Dependent Resonance Self-Shielding

The overall objective of the work here has been to eliminate the approximations used in current resonance treatments by developing continuous energy multi-dimensional transport calculations for problem dependent self-shielding calculations. The work here builds on the existing resonance treatment capabilities in the ORNL SCALE code system.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Optimizing Approximate Weighted Matching on Nvidia Kepler K40

Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand generally compute high quality solutions and are amenable to parallelization. In this paper, we present efficient implementations of the current best algorithm for half-approximate weighted matching, the Suitor algorithm, on Nvidia Kepler K-40 platform. We develop four variants of the algorithm that exploit hardware features to address key challenges for a GPU implementation. We also experiment with different combinations of work assigned to a warp. Using an exhaustive set of $269$ inputs, we demonstrate that the new implementation outperforms the previous best GPU algorithm by $10$ to $100\times$ for over $100$ instances, and from $100$ to $1000\times$ for $15$ instances. We also demonstrate up to $20\times$ speedup relative to $2$ threads, and up to $5\times$ relative to $16$ threads on Intel Xeon platform with $16$ cores for the same algorithm. The new algorithms and implementations provided in this paper will have a direct impact on several applications that repeatedly use matching as a key compute kernel. Further, algorithm designs and insights provided in this paper will benefit other researchers implementing graph algorithms on modern GPU architectures.

GPU↗

A model for the oxidative pyrolysis of wood

A generalized pyrolysis model (Gpyro) is applied to simulate the oxidative pyrolysis of white pine slabs irradiated under nonflaming conditions. Conservation equations for gaseous and solid mass, energy, species, and gaseous momentum (Darcy's law approximation) inside the decomposing solid are solved to calculate profiles of temperature, mass fractions, and pressure inside the decomposing wood. The condensed phase consists of four species, and the gas that fills the voids inside the decomposing solid consists of seven species. Four heterogeneous (gas/solid) reactions and two homogeneous (gas/gas) reactions are included. Diffusion of oxygen from the ambient into the decomposing solid and its effect on local reactions occurring therein is explicitly modeled. A genetic algorithm is used to extract the required material properties from experimental data at 25 kW/m{sup 2} and 40 kW/m{sup 2} irradiance and ambient oxygen concentrations of 0%, 10.5% and 21% by volume. Optimized model calculations for mass loss rate, surface temperature, and in-depth temperatures reproduce well the experimental data, including the experimentally observed increase in temperature and mass loss rate with increasing oxygen concentration. (author)

09 BIOMASS FUELS↗

A structural framework for anomalous change detection and characterization

We present a spatially adaptive scheme for automatically searching a pair of images of a scene for unusual and interesting changes. Our motivation is to bring into play structural aspects of image features alongside the spectral attributes used for anomalous change detection (ACD). We leverage a small but informative subset of pixels, namely edge pixels of the images, as anchor points of a Delaunay triangulation to jointly decompose the images into a set of triangular regions, called trixels, which are spectrally uniform. Such decomposition helps in image regularization by simple-function approximation on a feature-adaptive grid. Applying ACD to this trixel grid instead of pixels offers several advantages. It allows: (1) edge-preserving smoothing of images, (2) speed-up of spatial computations by significantly reducing the representation of the images, and (3) the easy recovery of structure of the detected anomalous changes by associating anomalous trixels with polygonal image features. The latter facility further enables the application of shape-theoretic criteria and algorithms to characterize the changes and recognize them as interesting or not. This incorporation of spatial information has the potential to filter out some spurious changes, such as due to parallax, shadows, and misregistration, by identifying and filtering out those that are structurally similar and spatially pervasive. Our framework supports the joint spatial and spectral analysis of images, potentially enabling the design of more robust ACD algorithms.

99 GENERAL AND MISCELLANEOUS↗

The use of Jacobi wavelets for constrained approximation of rational Bézier curves

This paper presents an efficient method to solve the approximation problem of the rational Bézier curve by continuous piecewise polynomial curve in L{sub 2}-norm. For this purpose, extended Jacobi wavelets together with the Gauss–Jacobi quadrature rules are employed. The proposed technique has some advantages such as: simplicity, high accuracy and fast computation. Also, the method in the paper performs multi-degree reduction at one time and does not need the stepwise computing. Several examples are given to illustrate the effectiveness of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Improving the efficiency of configurational-bias Monte Carlo: A density-guided method for generating bending angle trials for linear and branched molecules

A new method has been developed to generate bending angle trials to improve the acceptance rate and the speed of configurational-bias Monte Carlo. Whereas traditionally the trial geometries are generated from a uniform distribution, in this method we attempt to use the exact probability density function so that each geometry generated is likely to be accepted. In actual practice, due to the complexity of this probability density function, a numerical representation of this distribution function would be required. This numerical table can be generated a priori from the distribution function. This method has been tested on a united-atom model of alkanes including propane, 2-methylpropane, and 2,2-dimethylpropane, that are good representatives of both linear and branched molecules. It has been shown from these test cases that reasonable approximations can be made especially for the highly branched molecules to reduce drastically the dimensionality and correspondingly the amount of the tabulated data that is needed to be stored. Despite these approximations, the dependencies between the various geometrical variables can be still well considered, as evident from a nearly perfect acceptance rate achieved. For all cases, the bending angles were shown to be sampled correctly by this method with an acceptance rate of at least 96% for 2,2-dimethylpropane to more than 99% for propane. Since only one trial is required to be generated for each bending angle (instead of thousands of trials required by the conventional algorithm), this method can dramatically reduce the simulation time. The profiling results of our Monte Carlo simulation code show that trial generation, which used to be the most time consuming process, is no longer the time dominating component of the simulation.

2-2-DIMETHYLPROPANE↗

Numerical Approximation of a Transport Equation with a Time-Dependent Dispersion Flux

The objective of this work is to discuss a more general one-dimensional diffusion equation that accounts for certain aspects such as the variation of a parameter that describes the relaxation time of the mass flux and also the presence of a potential field. The equation will have properties similar to a an hyperbolic equation or parabolic equation according to which values of the relaxation parameter or the potential field we consider. In the hyperbolic case we deal with some discontinuities. We apply a numerical scheme to solve this equation, which consists of using an inverse Laplace transform algorithm. The Laplace method is used to remove the time-dependent terms in the governing equation and boundary conditions. For a constant potential field general solutions can be determined. On the other hand for a non-constant potential field, a spatial discretisation must be considered. We will study the convergence of the numerical scheme based on the inverse of Laplace transform and present some test problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗