Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iteration method”

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 1,099 records · Page 61
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Engineering calculations of three-dimensional inviscid hypersonic flow fields

An approximate solution technique has been developed for three-dimensional, inviscid, hypersonic flows. The method uses Maslen's explicit pressure equation and the assumption of approximate stream surfaces in the shock layer. This approximation represents a simplification of Maslen's asymmetric method. The solution procedure involves iteratively changing the shock shape in the subsonic-transonic region until the correct body shape is obtained. Beyond this region, the shock surface is determined by using a marching procedure. Results are presented herein for a paraboloid and elliptic cone at angle of attack. Calculated surface pressure distributions, shock shapes, and property profiles are compared with experimental data and finite-difference solutions of the Euler equations. Comparisons of the results of the present method with experimental data and detailed predictions are very good. Since the present method provides a very rapid computational procedure, it can be used for parametric or preliminary design applications. One useful application would be to incorporate a heating procedure for aerothermal studies.

Riley, Christopher J.↗
NASA NTRS1932

Calculation of potential flow past airship bodies in yaw

An outline of Von Karman's method of computing the potential flow of airships in yaw by means of partially constant dipolar superposition on the axis of the body is followed by several considerations for beginning and end of the superposition. Then this method is improved by postulating a continuous, in part linearly variable dipolar superposition on the axis. The second main part of the report brings the calculation of the potential flow by means of sources and sinks, arranged on the surface of the airship body. The integral equation which must satisfy this surface superposition is posed, and the core reduced to functions developed from whole elliptical normal integrals. The functions are shown diagrammatically. The integration is resolvable by iteration. The consequence of the method is good. The formulas for computing the velocity on the surface and of the potential for any point conclude the report.

Lotz, I↗
NASA NTRS1993

Sensitivity analysis of discrete systems

A selection is presented of methods used in the calculation of sensitivity derivatives of behavior and response of discretely modeled structure. Attention is given to methods for the selection of finite-difference step sizes for structural constraint derivatives, and techniques for finite difference derivatives in iteratively-solved problems. Also noted are methods for sensitivity of linear static response, and methods for second derivatives of structural response, derivatives of stresses, and nonlinear response; an emerging area of interest concerns the derivatives of transient response.

Adelman, Howard M.↗
NASA NTRS1996

Conversion of Osculating Orbital Elements to Mean Orbital Elements

Orbit determination and ephemeris generation or prediction over relatively long elapsed times can be accomplished with mean elements. The most simple and efficient method for orbit determination, which is also known as epoch point conversion, performs the conversion of osculating elements to mean elements by iterative procedures. Previous epoch point conversion methods are restricted to shorter elapsed times with linear convergence. The new method presented in this paper calculates an analytic initial guess of the unknown mean elements from a first order theory of secular perturbations and computes a transition matrix with accurate numerical partials. It thereby eliminates the problem of an inaccurate initial guess and an identity transition matrix employed by previous methods. With a good initial guess of the unknown mean elements and an accurate transition matrix, converging osculating elements to mean elements can be accomplished over long elapsed times with quadratic convergence.

Der, Gim J.↗
DOE OSTI2020

Understanding performance variability in standard and pipelined parallel Krylov solvers

In this work, we collect data from runs of Krylov subspace methods and pipelined Krylov algorithms in an effort to understand and model the impact of machine noise and other sources of variability on performance. We find large variability of Krylov iterations between compute nodes for standard methods that is reduced in pipelined algorithms, directly supporting conjecture, as well as large variation between statistical distributions of runtimes across iterations. Based on these results, we improve upon a previously introduced nondeterministic performance model by allowing iterations to fluctuate over time. We present our data from runs of various Krylov algorithms across multiple platforms as well as our updated non-stationary model that provides good agreement with observations. We also suggest how it can be used as a predictive tool.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Developments and Challenges in the Design of the ITER DRGA

We report the ITER Diagnostic Residual Gas Analyzer (DRGA) will measure the distribution of gas species, i.e., deuterium (D), tritium (T), and impurities, in the divertor exhaust stream and in the plasma periphery, with time resolution relevant to fusion plasma–wall particle dynamics. The uniqueness of the DRGA, over previous implementations of plasma dynamics residual gas analysis, is an integrated approach, combining mass and low-temperature plasma-activated optical spectroscopy, in a differentially pumped analysis station. A further unique feature of the ITER divertor-specific DRGA is an ~8-m separation of the analysis station from the sampled pumping duct, while still maintaining a ~1-s response time for hydrogen isotopic concentrations. ITER DRGA final design activities are strongly benefiting from testing of prototypical DRGA components and methods on present fusion devices, most currently on JET and W7-X. DRGA systems are implemented on both these devices and include sensors (and pumping methods) that are directly relevant to the ITER DRGA design. The recent JET-DTE2 campaign has provided the first experience on operating the combined ITER DRGA sensors with D-T plasmas. While enhancing system design for ITER, this experience on operating devices has also revealed additional engineering challenges, which further guide the continuing final design project. Meanwhile, the recent determination that the ITER DRGA, with slight optimization, will resolve the helium isotopes well enough to support an ITER pre-DT, He-3-based heating scheme, has greatly increased ITER Research Program interest in the DRGA and its implementation well ahead of the DT phase.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1989

Applications of a transonic wing design method

A method for designing wings and airfoils at transonic speeds using a predictor/corrector approach was developed. The procedure iterates between an aerodynamic code, which predicts the flow about a given geometry, and the design module, which compares the calculated and target pressure distributions and modifies the geometry using an algorithm that relates differences in pressure to a change in surface curvature. The modular nature of the design method makes it relatively simple to couple it to any analysis method. The iterative approach allows the design process and aerodynamic analysis to converge in parallel, significantly reducing the time required to reach a final design. Viscous and static aeroelastic effects can also be accounted for during the design or as a post-design correction. Results from several pilot design codes indicated that the method accurately reproduced pressure distributions as well as the coordinates of a given airfoil or wing by modifying an initial contour. The codes were applied to supercritical as well as conventional airfoils, forward- and aft-swept transport wings, and moderate-to-highly swept fighter wings. The design method was found to be robust and efficient, even for cases having fairly strong shocks.

Campbell, Richard L.↗
NASA NTRS1974

Adjustment technique without explicit formation of normal equations /conjugate gradient method/

For a simultaneous adjustment of a large geodetic triangulation system, a semiiterative technique is modified and used successfully. In this semiiterative technique, known as the conjugate gradient (CG) method, original observation equations are used, and thus the explicit formation of normal equations is avoided, 'huge' computer storage space being saved in the case of triangulation systems. This method is suitable even for very poorly conditioned systems where solution is obtained only after more iterations. A detailed study of the CG method for its application to large geodetic triangulation systems was done that also considered constraint equations with observation equations. It was programmed and tested on systems as small as two unknowns and three equations up to those as large as 804 unknowns and 1397 equations. When real data (573 unknowns, 965 equations) from a 1858-km-long triangulation system were used, a solution vector accurate to four decimal places was obtained in 2.96 min after 1171 iterations (i.e., 2.0 times the number of unknowns).

Saxena, N. K.↗
NASA NTRS1990

Iterative computation of the optimal H(infinity) norm by using two-Riccati-equation method

The two-Riccati-equation method solution to a standard H(infinity) control problem can be used to characterize all possible stabilizing optimal or suboptimal H(infinity) controllers if the optimal or suboptimal H(infinity) norm is available in the literature. An iterative algorithm for computing the optimal H(infinity) norm is proposed. The algorithm employs fixed-point, double secant and bisection to guarantee a super linear convergence.

Chang, B. C.↗
DOE OSTI2020

Deep Reinforcement Learning Based Volt-VAR Optimization in Smart Distribution Systems

This paper develops a model-free volt-VAR optimization (VVO) algorithm via multi-agent deep reinforcement learning (DRL) in unbalanced distribution systems. This method is novel since we cast the VVO problem in distribution networks to an intelligent deep Q-network (DQN) framework, which avoids solving a specific optimization model directly when facing time-varying operating conditions in the systems. We consider statuses/ratios of switchable capacitors, voltage regulators, and smart inverters installed at distributed generators as the action variables of the agents. A delicately designed reward function guides these agents to interact with the distribution system, in the direction of reinforcing voltage regulation and power loss reduction simultaneously. The forward-backward sweep method for radial three-phase distribution systems provides accurate power flow results within a few iterations to the DRL environment. The proposed method realizes the dual goals for VVO. We test this algorithm on the unbalanced IEEE 13-bus and 123-bus systems. Numerical simulations validate the excellent performance of this method in voltage regulation and power loss reduction.

41 EE - Solar Energy Technologies Office (EE-4S)↗
DOE OSTI2024

SLICE

For most of their lifetime, pebble-bed reactors (PBRs) operate at an equilibrium state in which the core is filled with fuel pebbles at various levels of burnup. A fuel pebble travels multiple times in so-called passes through the reactor before it reaches its target discharge burnup and is replaced with a fresh fuel pebble. Given the stochastic nature of the fuel pebble travel paths and consequently the individual fuel pebble histories, it is not possible with standard methods developed for traditional reactor concepts to calculate the fuel inventory in the reactor core. An iterative approach, the SCALE Leap-In method for Cores at Equilibrium (SLICE), was developed to generate region-average fuel inventory for a PBR. The SLICE code enables automatic generation of input files for the SCALE code system (https://www.ornl.gov/scale), management of the SCALE result files, and analysis of results.

Bostelmann, Friederike [Oak Ridge National Laborat↗
DOE OSTI2023

Feasibility of raised inner strike point equilibria scenario in ITER for detritiation from beryllium co-deposits

Abstract In ITER, tritium retention primarily occurs through co-deposition with beryllium. To avoid exceeding the strict tritium inventory limit, efficient tritium recovery techniques are essential. Baking is the ITER baseline for tritium recovery, but its effectiveness in removing tritium from thick beryllium layers is limited. A raised strike point scenario is considered an alternative method for removing tritium from the ITER inner vertical divertor target by heating components via plasma flux. This paper presents SOLPS-ITER code simulations conducted under various conditions, assessing the divertor performance and tritium outgassing of the raised strike point scenario. As the strike point is raised, recycled neutrals are not efficiently baffled by the dome and scrape-off layer, significantly changing the neutral trajectory and ionization source distribution. This improves detachment accessibility but worsens core-edge compatibility compared to the baseline scenario. However, in the partially detached condition, the impact of raising the strike point, perpendicular transport, and q 95 on target heat flux is not significant, as it primarily scales with the input power. Target heat flux is translated to target surface temperature using a simplified heat transfer model that considers the 3D target monoblock geometry and active cooling condition, excluding Be layer thermal properties. For partially detached divertor conditions, the bulk tungsten monoblock surface temperature remains below the baking temperature, which is insufficient for efficient tritium outgassing under the actively cooled ITER divertor condition. However, considering the potential thermal contact resistance between the beryllium and tungsten layers, which may significantly impact temperature distribution, the temperature of the beryllium layer can be raised to a level sufficient for efficient tritium outgassing. Therefore, the raised strike point scenario can be considered as an alternative in-vessel tritium removal technique.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1975

A study of the effects of vertical resolution and measurement errors on an iteratively inverted temperature profile

A direct inversion method for inverting the temperature profile from satellite-measured radiation is discussed. The nth power of the weighting function in the integral radiative-transfer equation is used as the weight in the averaging process. The vertical resolution of the inverted temperature profile and the response of the inverted temperature profile to the measurement errors are examined in terms of n. It is found that for smaller values of n, the vertical resolution and the effect of measurement errors are reduced. When n = 0, both the vertical resolution and error effect are minimum. The temperature profile is adjusted by a constant; any structure different from the initial shape cannot be resolved. This is equivalent to the case where the entire atmosphere is treated as one layer with a fixed shape of temperature profile. When n approaches infinity, both the vertical resolution and error effect are maximum. This is equivalent to the case where the entire atmosphere is divided into m (the number of spectral channels) layers. Within each layer, the temperatures are adjusted by a constant, and any structure different from the initial shape cannot be resolved. Also, the shape of the final solution is closer to the initial profile if the value of n is smaller.

Chow, M.-D.↗
NASA NTRS1979

A dual method for maximum entropy restoration

A simple iterative dual algorithm for maximum entropy image restoration is presented. The dual algorithm involves fewer parameters than conventional minimization in the image space. Minicomputer test results for Fourier synthesis with inadequate phantom data are given.

Smith, C. B.↗
NASA NTRS1988

Predictive wall adjustment strategy for two-dimensional flexible walled adaptive wind tunnel: A detailed description of the first one-step method

Following the realization that a simple iterative strategy for bringing the flexible walls of two-dimensional test sections to streamline contours was too slow for practical use, Judd proposed, developed, and placed into service what was the first Predictive Strategy. The Predictive Strategy reduced by 75 percent or more the number of iterations of wall shapes, and therefore the tunnel run-time overhead attributable to the streamlining process, required to reach satisfactory streamlines. The procedures of the Strategy are embodied in the FORTRAN subroutine WAS (standing for Wall Adjustment Strategy) which is written in general form. The essentials of the test section hardware, followed by the underlying aerodynamic theory which forms the basis of the Strategy, are briefly described. The subroutine is then presented as the Appendix, broken down into segments with descriptions of the numerical operations underway in each, with definitions of variables.

Wolf, Stephen W. D.↗
DOE OSTI2025

Efficient proximal subproblem solvers for a nonsmooth trust-region method

In [R. J. Baraldi and D. P. Kouri, Mathematical Programming, (2022), pp. 1-40], we introduced an inexact trust-region algorithm for minimizing the sum of a smooth nonconvex and nonsmooth convex function. The principle expense of this method is in computing a trial iterate that satisfies the so-called fraction of Cauchy decrease condition—a bound that ensures the trial iterate produces sufficient decrease of the subproblem model. In this paper, we expound on various proximal trust-region subproblem solvers that generalize traditional trust-region methods for smooth unconstrained and convex-constrained problems. We introduce a simplified spectral proximal gradient solver, a truncated nonlinear conjugate gradient solver, and a dogleg method. Finally, we compare algorithm performance on examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1971

An analysis and comparison of several trajectory optimization methods

The sensitivities of the convergence characteristics of the methods to initially assumed parameters and trial solution, convergence times, computer logic, and storage requirements are discussed. Numerical comparison of the convergence characteristics is made by considering a minimum time, low thrust, Earth-Mars transfer trajectory. A modified quasi-linearization method reduces convergence time by approximately 70% when compared with the generalized Newton-Raphson method and allows the terminal boundary to be specified by a general function of the problem variables. A uniquely specified and easily determined, time dependent weighting matrix for the gradient techniques accelerates the shaping of the optimal control program and improves the convergence characteristics during the terminal iterations. Convergence envelopes, indicating how sensitive the convergence characteristics are to initially assumed parameters, are plotted for the perturbation and quasi-linearization methods. Several iteration schemes are proposed which increase the size of the convergence envelopes and decrease the sensitivity of the method to initially assumed parameters.

Lewallen, J. M.↗
NASA NTRS1990

Attitude determination and parameter estimation using vector observations - Application

This paper presents tests of a new method for the simultaneous estimation of spacecraft attitude and sensor biases, based on a quaternion estimation algorithm minimizing Wahba's loss function. The new method is compared with a conventional batch least-squares differential correction algorithm. The estimates are based on data from strapdown gyros and star trackers, simulated with varying levels of Gaussian noise for both inertially-fixed and earth-pointing attitudes. Both algorithms solve for the spacecraft attitude and the gyro drift rate biases. In the majority of tests performed, the two methods converge to the same estimates in the same number of iterations, but the new algorithm requires about 60 percent more computational effort. Some cases were found in which the new method converges in fewer iterations than the differential correction, and some for which the differential correction requires fewer iterations.

Markley, F. Landis↗