Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

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 55 records · Page 3

Solar Occultation Retrieval Algorithm Development

This effort addresses the comparison and validation of currently operational solar occultation retrieval algorithms, and the development of generalized algorithms for future application to multiple platforms. initial development of generalized forward model algorithms capable of simulating transmission data from of the POAM II/III and SAGE II/III instruments. Work in the 2" quarter will focus on: completion of forward model algorithms, including accurate spectral characteristics for all instruments, and comparison of simulated transmission data with actual level 1 instrument data for specific occultation events.

Lumpe, Jerry D.↗

A robust return-map algorithm for general multisurface plasticity

Three new contributions to the field of multisurface plasticity are presented for general situations with an arbitrary number of nonlinear yield surfaces with hardening or softening. A method for handling linearly dependent flow directions is described. A residual that can be used in a line search is defined. An algorithm that has been implemented and comprehensively tested is discussed in detail. Examples are presented to illustrate the computational cost of various components of the algorithm. The overall result is that a single Newton-Raphson iteration of the algorithm costs between 1.5 and 2 times that of an elastic calculation. Examples also illustrate the successful convergence of the algorithm in complicated situations. For example, without using the new contributions presented here, the algorithm fails to converge for approximately 50% of the trial stresses for a common geomechanical model of sedementary rocks, while the current algorithm results in complete success. Since it involves no approximations, the algorithm is used to quantify the accuracy of an efficient, pragmatic, but approximate, algorithm used for sedimentary-rock plasticity in a commercial software package. Furthermore, the main weakness of the algorithm is identified as the difficulty of correctly choosing the set of initially active constraints in the general setting.

15 GEOTHERMAL ENERGY↗

Randomized algorithms for generalized singular value decomposition with application to sensitivity analysis

The generalized singular value decomposition (GSVD) is a valuable tool that has many applications in computational science. However, computing the GSVD for large-scale problems is challenging. Motivated by applications in hyper-differential sensitivity analysis (HDSA), in this work we propose new randomized algorithms for computing the GSVD which use randomized subspace iteration and weighted QR factorization. Detailed error analysis is given which provides insight into the accuracy of the algorithms and the choice of the algorithmic parameters. We demonstrate the performance of our algorithms on test matrices and a large-scale model problem where HDSA is used to study subsurface flow.

97 MATHEMATICS AND COMPUTING↗

Atmospheric River Detection Under Changing Seasonality and Mean-State Climate: ARTMIP Tier 2 Paleoclimate Experiments

Atmospheric rivers (ARs) are filamentary structures within the atmosphere that account for a substantial portion of poleward moisture transport and play an important role in Earth's hydroclimate. However, there is no one quantitative definition for what constitutes an atmospheric river, leading to uncertainty in quantifying how these systems respond to global change. This study seeks to better understand how different AR detection tools (ARDTs) respond to changes in climate states utilizing single-forcing climate model experiments under the aegis of the Atmospheric River Tracking Method Intercomparison Project (ARTMIP). We compare a simulation with an early Holocene orbital configuration and another with CO2 levels of the Last Glacial Maximum to a preindustrial control simulation to test how the ARDTs respond to changes in seasonality and mean climate state, respectively. We find good agreement among the algorithms in the AR response to the changing orbital configuration, with a poleward shift in AR frequency that tracks seasonal poleward shifts in atmospheric water vapor and zonal winds. In the low CO2 simulation, the algorithms generally agree on the sign of AR changes, but there is substantial spread in their magnitude, indicating that mean-state changes lead to larger uncertainty. This disagreement likely arises primarily from differences between algorithms in their thresholds for water vapor and its transport used for identifying ARs. These findings warrant caution in ARDT selection for paleoclimate and climate change studies in which there is a change to the mean climate state, as ARDT selection contributes substantial uncertainty in such cases.

Atmospheric river, paleoclimate↗

Kharitonov's theorem: Generalizations and algorithms

In 1978, the Russian mathematician V. Kharitonov published a remarkably simple necessary and sufficient condition in order that a rectangular parallelpiped of polynomials be a stable set. Here, stable is taken to mean that the polynomials have no roots in the closed right-half of the complex plane. The possibility of generalizing this result was studied by numerous authors. A set, Q, of polynomials is given and a necessary and sufficient condition that the set be stable is sought. Perhaps the most general result is due to Barmish who takes for Q a polytope and proceeds to construct a complicated nonlinear function, H, of the points in Q. With the notion of stability which was adopted, Barmish asks that the boundary of the closed right-half plane be swept, that the set G is considered = to (j(omega)(bar) - infinity is less than omega is less than infinity) and for each j(omega)(sigma)G, require H(delta) is greater than 0. Barmish's scheme has the merit that it describes a true generalization of Kharitonov's theorem. On the other hand, even when Q is a polyhedron, the definition of H requires that one do an optimization over the entire set of vertices, and then a subsequent optimization over an auxiliary parameter. In the present work, only the case where Q is a polyhedron is considered and the standard definition of stability described, is used. There are straightforward generalizations of the method to the case of discrete stability or to cases where certain root positions are deemed desirable. The cases where Q is non-polyhedral are less certain as candidates for the method. Essentially, a method of geometric programming was applied to the problem of finding maximum and minimum angular displacements of points in the Nyquist locus (Q(j x omega)(bar) - infinity is less than omega is less than infinity). There is an obvious connection with the boundary sweeping requirement of Barmish.

Rublein, George↗

Robust volume calculations for Constructive Solid Geometry (CSG) components in Monte Carlo transport calculations

In this paper we consider a new generalized algorithm for the efficient calculation of component object volumes given their equivalent constructive solid geometry (CSG) definition. The new method relies on domain decomposition to recursively subdivide the original component into smaller pieces with volumes that can be computed analytically or stochastically, if needed. Unlike simpler brute-force approaches, the proposed decomposition scheme is guaranteed to be robust and accurate to within a user-defined tolerance. The new algorithm is also fully general and can handle any valid CSG component definition, without the need for additional input from the user. The new technique has been specifically optimized to calculate volumes of component definitions commonly found in models used for Monte Carlo particle transport simulations for criticality safety and reactor analysis applications. However, the algorithm can be easily extended to any application which uses CSG representations for component objects. The paper provides a complete description of the novel volume calculation algorithm, along with a discussion of the conjectured error bounds on volumes calculated within the method. In addition, numerical results comparing the new algorithm with a standard stochastic volume calculation algorithm are presented for a series of problems spanning a range of representative component sizes and complexities. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A new algorithm for general multiobjective optimization

Described is a new technique for converting a constrained optimization problem to an unconstrained one, and a new method for multiobjective optimization based on that technique. The technique transforms the objective functions into goal constraints. The goal constraints are appended to the set of behavior constraints and the envelope of all functions in the set is searched for an unconstrained minimum. The technique may be categorized as a SUMT algorithm. In multiobjective applications, the approach has the advantage of locating a compromise minimum without the need to optimize for each individual objective function separately. The constrained to unconstrained conversion is described, followed by a description of the multiobjective problem. Two example problems are presented to demonstrate the robustness of the method.

Sobieszczanski-Sobieski, Jaroslaw↗

A new algorithm for general multiobjective optimization

The paper describes a new technique for converting a constrained optimization problem to an unconstrained one, and a new method for multiobjective optimization based on that technique. The technique transforms the objective functions into goal constraints. The goal constraints are appended to the set of behavior constraints, and the envelope of all functions in the set is searched for an unconstrained minimum. The technique can be categorized as a SUMT algorithm. In multiobjective applications, the approach has the advantage of locating a compromise minimum without the need to optimize for each individual objective function separately. The constrained to unconstrained conversion is described, followed by a description of the multiobjective problem. Two example problems are presented to demonstrate the robustness of the method.

Sobieszczanski-Sobieski, Jaroslaw↗

Prior-based artifact correction (PBAC) in computed tomography

Purpose: Image quality in computed tomography (CT) often suffers from artifacts which may reduce the diagnostic value of the image. In many cases, these artifacts result from missing or corrupt regions in the projection data, e.g., in the case of metal, truncation, and limited angle artifacts. The authors propose a generalized correction method for different kinds of artifacts resulting from missing or corrupt data by making use of available prior knowledge to perform data completion. Methods: The proposed prior-based artifact correction (PBAC) method requires prior knowledge in form of a planning CT of the same patient or in form of a CT scan of a different patient showing the same body region. In both cases, the prior image is registered to the patient image using a deformable transformation. The registered prior is forward projected and data completion of the patient projections is performed using smooth sinogram inpainting. The obtained projection data are used to reconstruct the corrected image. Results: The authors investigate metal and truncation artifacts in patient data sets acquired with a clinical CT and limited angle artifacts in an anthropomorphic head phantom data set acquired with a gantry-based flat detector CT device. In all cases, the corrected images obtained by PBAC are nearly artifact-free. Compared to conventional correction methods, PBAC achieves better artifact suppression while preserving the patient-specific anatomy at the same time. Further, the authors show that prominent anatomical details in the prior image seem to have only minor impact on the correction result. Conclusions: The results show that PBAC has the potential to effectively correct for metal, truncation, and limited angle artifacts if adequate prior data are available. Since the proposed method makes use of a generalized algorithm, PBAC may also be applicable to other artifacts resulting from missing or corrupt data.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Generalized, Energy-conserving Numerical Simulations of Particles in General Relativity. I. Time-like and Null Geodesics

The numerical integration of particle trajectories in curved spacetimes is fundamental for obtaining realistic models of the particle dynamics around massive compact objects such as black holes and neutron stars. Generalized algorithms capable of handling generic metrics are needed for studies of both standard (Schwarzschild and Kerr metrics) and nonstandard (e.g., Schwarzschild metric plus nonclassical perturbations or multiple black hole metrics) spacetimes. The most commonly employed explicit numerical schemes (e.g., Runge–Kutta) are incapable of producing highly accurate results at critical points, e.g., in the regions close to the event horizon where gravity causes extreme curvature of the spacetime, at an acceptable computational cost. In this work we describe a generalized algorithm for the numerical integration of time-like (massive particles) and null (photons) geodesics in any given 3 + 1 split spacetime. We introduce a new, exactly energy-conserving implicit integration scheme based on the preservation of the underlying Hamiltonian, and we compare its properties with a standard fourth-order Runge–Kutta explicit scheme and an implicit midpoint scheme. We test the numerical performance of the three schemes against analytic solutions of particle and photon orbits in Schwarzschild and Kerr spacetimes. We additionally prove the versatility of our framework in handling more exotic metrics, such as Morris–Thorne wormholes and quantum-perturbed Schwarzschild black holes. The generalized method is also discussed in the perspective of future extensions to more complex particle dynamics, e.g., the addition of the Lorentz force acting on charged particles, which allows for test particle diagnostics in GRMHD simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

A general Bayesian algorithm for the autonomous alignment of beamlines

Autonomous methods to align beamlines can decrease the amount of time spent on diagnostics, and also uncover better global optima leading to better beam quality. The alignment of these beamlines is a high-dimensional expensive-to-sample optimization problem involving the simultaneous treatment of many optical elements with correlated and nonlinear dynamics. Bayesian optimization is a strategy of efficient global optimization that has proved successful in similar regimes in a wide variety of beamline alignment applications, though it has typically been implemented for particular beamlines and optimization tasks. In this paper, we present a basic formulation of Bayesian inference and Gaussian process models as they relate to multi-objective Bayesian optimization, as well as the practical challenges presented by beamline alignment. We show that the same general implementation of Bayesian optimization with special consideration for beamline alignment can quickly learn the dynamics of particular beamlines in an online fashion through hyperparameter fitting with no prior information. We present the implementation of a concise software framework for beamline alignment and test it on four different optimization problems for experiments on X-ray beamlines at the National Synchrotron Light Source II and the Advanced Light Source, and an electron beam at the Accelerator Test Facility, along with benchmarking on a simulated digital twin. We discuss new applications of the framework, and the potential for a unified approach to beamline alignment at synchrotron facilities.

47 OTHER INSTRUMENTATION↗

Direct leaf trajectory optimization for volumetric modulated arc therapy planning with sliding window delivery

Purpose: The authors propose a novel optimization model for volumetric modulated arc therapy (VMAT) planning that directly optimizes deliverable leaf trajectories in the treatment plan optimization problem, and eliminates the need for a separate arc-sequencing step. Methods: In this model, a 360° arc is divided into a given number of arc segments in which the leaves move unidirectionally. This facilitates an algorithm that determines the optimal piecewise linear leaf trajectories for each arc segment, which are deliverable in a given treatment time. Multileaf collimator constraints, including maximum leaf speed and interdigitation, are accounted for explicitly. The algorithm is customized to allow for VMAT delivery using constant gantry speed and dose rate, however, the algorithm generalizes to variable gantry speed if beneficial. Results: The authors demonstrate the method for three different tumor sites: a head-and-neck case, a prostate case, and a paraspinal case. The authors first obtain a reference plan for intensity modulated radiotherapy (IMRT) using fluence map optimization and 20 intensity-modulated fields in equally spaced beam directions, which is beyond the standard of care. Modeling the typical clinical setup for the treatment sites considered, IMRT plans using seven or nine beams are also computed. Subsequently, VMAT plans are optimized by dividing the 360° arc into 20 corresponding arc segments. Assuming typical machine parameters (a dose rate of 600 MU/min, and a maximum leaf speed of 3 cm/s), it is demonstrated that the optimized VMAT plans with 2–3 min delivery time are of noticeably better quality than the 7–9 beam IMRT plans. The VMAT plan quality approaches the quality of the 20-beam IMRT benchmark plan for delivery times between 3 and 4 min. Conclusions: The results indicate that high quality treatments can be delivered in a single arc with 20 arc segments if sufficient time is allowed for modulation in each segment.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Comparison of Monte Carlo Particle Transport Algorithms for Binary Stochastic Mixtures

Two Monte Carlo algorithms originally proposed by Zimmerman and Zimmerman and Adams for particle transport through a binary stochastic mixture are numerically compared using a standard set of planar geometry benchmark problems. In addition to previously-published comparisons of the ensemble-averaged probabilities of reflection and transmission, we include comparisons of detailed ensemble-averaged total and material scalar flux distributions. Because not all benchmark scalar flux distribution data used to produce plots in previous publications remains available, we have independently regenerated the benchmark solutions including scalar flux distributions. Both Monte Carlo transport algorithms robustly produce physically-realistic scalar flux distributions for the transport problems examined. The first algorithm reproduces the standard Levermore-Pomraning model results for the probabilities of reflection and transmission. The second algorithm generally produces significantly more accurate probabilities of reflection and transmission and also significantly more accurate total and material scalar flux distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A generalized implicit algorithm for multi-dimensional particle-in-cell simulations in Cartesian geometry

An implicit multi-dimensional particle-in-cell (PIC) code is developed to study the interaction of ultrashort pulse lasers with matter. The algorithm is based on current density decomposition and is only marginally more complicated compared to explicit PIC codes, but it completely eliminates grid heating and possesses good energy conserving properties with relaxed time step and grid resolution. This is demonstrated in a test case study, in which high-energy protons are generated from a thin carbon foil at solid density using linear and circular polarizations. The grid heating rate is estimated to be 1-10 eV/ps.

36 MATERIALS SCIENCE↗