Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convergence”

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 109 records · Page 6

Surface wind convergence as a short-term predictor of cloud-to-ground lightning at Kennedy Space Center: A four-year summary and evaluation

Since 1986, USAF forecasters at NASA-Kennedy have had available a surface wind convergence technique for use during periods of convective development. In Florida during the summer, most of the thunderstorm development is forced by boundary layer processes. The basic premise is that the life cycle of convection is reflected in the surface wind field beneath these storms. Therefore the monitoring of the local surface divergence and/or convergence fields can be used to determine timing, location, longevity, and the lightning hazards which accompany these thunderstorms. This study evaluates four years of monitoring thunderstorm development using surface wind convergence, particularly the average over the area. Cloud-to-ground (CG) lightning is related in time and space with surface convergence for 346 days during the summers of 1987 through 1990 over the expanded wind network at KSC. The relationships are subdivided according to low level wind flow and midlevel moisture patterns. Results show a one in three chance of CG lightning when a convergence event is identified. However, when there is no convergence, the chance of CG lightning is negligible.

Watson, Andrew I.↗

Convergence characteristics of the multiple input, multiple output LMS algorithm

The convergence characteristics of the multiple input, multiple output LMS algorithm, as applied to active noise and vibration control systems, are examined. The mean square error during the convergence process, as well as the final converged value, are examined analytically and in computer simulation. It is shown that the ratio of number of error sensors to number of control sources has a significant influence upon both the converging and converged value of the mean square error. Other active control system variables, such as the inherent time delays and structural/acoustic transfer functions, are also shown to have a significant influence upon the convergence process.

Snyder, Scott D.↗

Non-LTE radiative transfer with lambda-acceleration - Convergence properties using exact full and diagonal lambda-operators

We investigate the convergence properties of Lambda-acceleration methods for non-LTE radiative transfer problems in planar and spherical geometry. Matrix elements of the 'exact' A-operator are used to accelerate convergence to a solution in which both the radiative transfer and atomic rate equations are simultaneously satisfied. Convergence properties of two-level and multilevel atomic systems are investigated for methods using: (1) the complete Lambda-operator, and (2) the diagonal of the Lambda-operator. We find that the convergence properties for the method utilizing the complete Lambda-operator are significantly better than those of the diagonal Lambda-operator method, often reducing the number of iterations needed for convergence by a factor of between two and seven. However, the overall computational time required for large scale calculations - that is, those with many atomic levels and spatial zones - is typically a factor of a few larger for the complete Lambda-operator method, suggesting that the approach should be best applied to problems in which convergence is especially difficult.

Macfarlane, J. J.↗

On domains of convergence in optimization problems

Numerical optimization algorithms require the knowledge of an initial set of design variables. Starting from an initial design x(sup 0), improved solutions are obtained by updating the design iteratively in a way prescribed by the particular algorithm used. If the algorithm is successful, convergence is achieved to a local optimal solution. Let A denote the iterative procedure that characterizes a typical optimization algorithm, applied to the problem: Find x belonging to R(sup n) that maximizes f(x) subject to x belonging to Omega contained in R(sup n). We are interested in problems with several local maxima (x(sub j))(sup *), j=1, ..., m, in the feasible design space Omega. In general, convergence of the algorithm A to a specific solution (x(sub j))(sup *) is determined by the choice of initial design x(sup 0). The domain of convergence D(sub j) of A associated with a local maximum (x(sub j))(sup *) is a subset of initial designs x(sup 0) in Omega such that the sequence (x(sup k)), k=0,1,2,... defined by x(sup k+1) = A(x(sup k)), k=0,1,... converges to (x(sub j))(sup *). The set D(sub j) is also called the basin of attraction of (x(sub j))(sup *). Cayley first proposed the problem of finding the basin of attraction for Newton's method in 1897. It has been shown that the basin of attraction for Newton's method exhibits chaotic behavior in problems with polynomial objective. This implies that there may be regions in the feasible design space where arbitrarily close starting points will converge to different local optimal solutions. Furthermore, the boundaries of the domains of convergence may have a very complex, even fractal structure. In this paper we show that even simple structural optimization problems solved using standard gradient based (first order) algorithms exhibit similar features.

Diaz, Alejandro R.↗

Convergent properties of vestibular-related brain stem neurons in the gerbil

Three classes of vestibular-related neurons were found in and near the prepositus and medial vestibular nuclei of alert or decerebrate gerbils, those responding to: horizontal translational motion, horizontal head rotation, or both. Their distribution ratios were 1:2:2, respectively. Many cells responsive to translational motion exhibited spatiotemporal characteristics with both response gain and phase varying as a function of the stimulus vector angle. Rotationally sensitive neurons were distributed as Type I, II, or III responses (sensitive to ipsilateral, contralateral, or both directions, respectively) in the ratios of 4:6:1. Four tested factors shaped the response dynamics of the sampled neurons: canal-otolith convergence, oculomotor-related activity, rotational Type (I or II), and the phase of the maximum response. Type I nonconvergent cells displayed increasing gains with increasing rotational stimulus frequency (0.1-2.0 Hz, 60 degrees /s), whereas Type II neurons with convergent inputs had response gains that markedly decreased with increasing translational stimulus frequency (0.25-2.0 Hz, +/-0.1 g). Type I convergent and Type II nonconvergent neurons exhibited essentially flat gains across the stimulus frequency range. Oculomotor-related activity was noted in 30% of the cells across all functional types, appearing as burst/pause discharge patterns related to the fast phase of nystagmus during head rotation. Oculomotor-related activity was correlated with enhanced dynamic range compared with the same category that had no oculomotor-related response. Finally, responses that were in-phase with head velocity during rotation exhibited greater gains with stimulus frequency increments than neurons with out-of-phase responses. In contrast, for translational motion, neurons out of phase with head acceleration exhibited low-pass characteristics, whereas in-phase neurons did not. Data from decerebrate preparations revealed that although similar response types could be detected, the sampled cells generally had lower background discharge rates, on average one-third lower response gains, and convergent properties that differed from those found in the alert animals. On the basis of the dynamic response of identified cell types, we propose a pair of models in which inhibitory input from vestibular-related neurons converges on oculomotor neurons with excitatory inputs from the vestibular nuclei. Simple signal convergence and combinations of different types of vestibular labyrinth information can enrich the dynamic characteristics of the rotational and translational vestibuloocular responses.

Non-NASA Center↗

Deep Neural Network Based Convergence Classification for Computational Fluid Dynamics

A supervised deep learning approach is coupled with heuristic convergence criteria to construct a classification model for detecting the completion (convergence) of computational fluid dynamics (CFD) simulations. Heuristic convergence criteria alone are not always sufficient and more complex decisions are often left to a human analyst. The proposed approach leverages heuristic convergence criteria as well as two deep neural network (DNN) models, one binary and one multi-class, to improve the efficiency and consistency of convergence classification across a wide range of flight regimes. The DNN models presented are each trained on a subset of ascent aerodynamic CFD simulations for NASA’s Space Launch System and were produced using NASA’s unstructured Navier-Stokes solver FUN3D. Individual solutions are analyzed intermittently and are classified as sufficiently converged, further iterations required, or switch from steady Reynolds Averaged Navier-Stokes (RANS) to unsteady RANS CFD based on the iterative histories of four aerodynamic coefficients. The implemented classification model is shown to produce solutions that closely correlate to solutions produced by a human analyst. This work lays groundwork for expanding the capabilities of DNNs for automating and improving more of the CFD process.

SLS↗

Converging flow joint insert system at an intersection between adjacent transitions extending between a combustor and a turbine assembly in a gas turbine engine

A transition duct system (100) for routing a gas flow from a combustor (102) to the first stage (104) of a turbine section (106) in a combustion turbine engine (108), wherein the transition duct system (100) includes one or more converging flow joint inserts (120) forming a trailing edge (122) at an intersection (124) between adjacent transition ducts (126, 128) is disclosed. The transition duct system (100) may include a transition duct (126, 128) having an internal passage (130) extending between an inlet (132, 184) to an outlet (134, 186) and may expel gases into the first stage turbine (104) with a tangential component. The converging flow joint insert (120) may be contained within a converging flow joint insert receiver (136) and disconnected from the transition duct bodies (126, 128) by which the converging flow joint insert (120) is positioned. Being disconnected eliminates stress formation within the converging flow joint insert (120), thereby enhancing the life of the insert. The converging flow joint insert (120) may be removable such that the insert (120) can be replaced once worn beyond design limits.

42 ENGINEERING↗

Converging flow joint insert system at an intersection between adjacent transitions extending between a combustor and a turbine assembly in a gas turbine engine

A transition duct system for routing a gas flow in a combustion turbine engine is provided. The transition duct system includes one or more converging flow joint inserts forming a trailing edge at an intersection between adjacent transition ducts. The converging flow joint insert may be contained within a converging flow joint insert receiver and may be disconnected from the transition duct bodies by which the converging flow joint insert is positioned. Being disconnected eliminates stress formation within the converging flow joint insert, thereby enhancing the life of the insert. The converging flow joint insert may be removable such that the insert can be replaced once worn beyond design limits.

42 ENGINEERING↗

Revisiting Source Convergence Diagnostics in the KENO Monte Carlo Neutron Transport Codes [Abstract]

Monte Carlo criticality transport codes, which rely on the power iteration procedure, are a fundamental tool for nuclear criticality safety practitioners in assessing the neutron multiplication factor (k eff ) for problems involving fissile material. In these calculations, ensuring the convergence of both the fission source distributions and the k eff estimate for accurate results is crucial. However, a converged k eff estimate does not necessarily mean the fission source distribution is also converged because the fission source and flux distribution may continue to evolve even after k eff convergence. Therefore, most Monte Carlo transport criticality codes now offer various diagnostic tests to assess fission source convergence in addition to the k eff convergence by analyzing the trends of these quantities over multiple generations.

AZURE↗

Short‐term time step convergence in a climate model

Abstract This paper evaluates the numerical convergence of very short (1 h) simulations carried out with a spectral‐element (SE) configuration of the Community Atmosphere Model version 5 (CAM5). While the horizontal grid spacing is fixed at approximately 110 km, the process‐coupling time step is varied between 1800 and 1 s to reveal the convergence rate with respect to the temporal resolution. Special attention is paid to the behavior of the parameterized subgrid‐scale physics. First, a dynamical core test with reduced dynamics time steps is presented. The results demonstrate that the experimental setup is able to correctly assess the convergence rate of the discrete solutions to the adiabatic equations of atmospheric motion. Second, results from full‐physics CAM5 simulations with reduced physics and dynamics time steps are discussed. It is shown that the convergence rate is 0.4—considerably slower than the expected rate of 1.0. Sensitivity experiments indicate that, among the various subgrid‐scale physical parameterizations, the stratiform cloud schemes are associated with the largest time‐stepping errors, and are the primary cause of slow time step convergence. While the details of our findings are model specific, the general test procedure is applicable to any atmospheric general circulation model. The need for more accurate numerical treatments of physical parameterizations, especially the representation of stratiform clouds, is likely common in many models. The suggested test technique can help quantify the time‐stepping errors and identify the related model sensitivities.

54 ENVIRONMENTAL SCIENCES↗

When finite becomes infinite: convergence properties of vibrational spectra of oligomer chains

We present a computational study of convergence properties of vibrational IR and Raman spectra for a series of increasingly long units of polyethylene, cis- and trans-polyacetylenes, and polyynes. Convergent behavior to the spectra of infinitely long polymers was observed in all cases when chains reached lengths of approximately 60 carbon atoms, both with respect to the positions of the bands and to their intensities. The vibrational spectra of longer chains are practically indistinguishable. The convergence rate depends on the degree of the π conjugation in a studied system: Vibrational spectra for oligoethylenes converge noticeably faster than the spectra for the conjugated systems. Here, the slowest convergence is observed for skeletal motions of the oligomer chains, which may require more than a hundred carbon atoms in the chain to show deviations smaller than 1 cm –1 to the corresponding solid-state calculations. The results suggest that the boundary between the properties of finite and infinite molecular systems fades away for a surprisingly small number of atoms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Unconditionally convergent nonlinear solver for hyperbolic conservation laws with S-shaped flux functions

This paper addresses the convergence properties of implicit numerical solution algorithms for nonlinear hyperbolic transport problems. It is shown that the Newton-Raphson (NR) method converges for any time step size, if the flux function is convex, concave, or linear, which is, in general, the case for CFD problems. In some problems, e.g., multiphase flow in porous media, the nonlinear flux function is S-shaped (not uniformly convex or concave); as a result, a standard NR iteration can diverge for large time steps, even if an implicit discretization scheme is used to solve the nonlinear system of equations. In practice, when such convergence difficulties are encountered, the current time step is cut, previous iterations are discarded, a smaller time step size is tried, and the NR process is repeated. The criteria for time step cutting and selection are usually based on heuristics that limit the allowable change in the solution over a time step and/or NR iteration. Here, we propose a simple modification to the NR iteration scheme for conservation laws with S-shaped flux functions that converges for any time step size. The new scheme allows one to choose the time step size based on accuracy consideration only without worrying about the convergence behavior of the nonlinear solver. The proposed method can be implemented in an existing simulator, e.g., for CO{sub 2} sequestration or reservoir flow modeling, quite easily. The numerical analysis is confirmed with simulation studies using various test cases of nonlinear multiphase transport in porous media. The analysis and numerical experiments demonstrate that the modified scheme allows for the use of arbitrarily large time steps for this class of problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Removing Numerical Pathologies in a Turbulence Parameterization Through Convergence Testing

Abstract Discretized numerical models of the atmosphere are usually intended to faithfully represent an underlying set of continuous equations, but this necessary condition is violated sometimes by subtle pathologies that have crept into the discretized equations. Such pathologies can introduce undesirable artifacts, such as sawtooth noise, into the model solutions. The presence of these pathologies can be detected by numerical convergence testing. This study employs convergence testing to verify the discretization of the Cloud Layers Unified By Binormals (CLUBB) model of clouds and turbulence. That convergence testing identifies two aspects of CLUBB's equation set that contribute to undesirable noise in the solutions. First, numerical limiters (i.e., clipping) used by CLUBB introduce discontinuities or slope discontinuities in model fields. Second, nonlinear artificial diffusion employed for improving numerical stability can introduce unintended small‐scale features into the solution of the model equations. Smoothing the limiters and using linear artificial diffusion reduces the noise and restores the expected first‐order convergence in CLUBB's solutions. These model reformulations enhance our confidence in the trustworthiness of solutions from CLUBB by eliminating the unphysical oscillations in high‐resolution simulations. The improvements in the results at coarser, near‐operational grid spacing and timestep are also seen in cumulus cloud and dry turbulence tests. In addition, convergence testing is proven to be a valuable tool for detecting pathologies, including unintended discontinuities and grid dependence, in the model equation set.

58 GEOSCIENCES↗

IS THE TWO MICRON ALL SKY SURVEY CLUSTERING DIPOLE CONVERGENT?

There is a long-standing controversy about the convergence of the dipole moment of the galaxy angular distribution (the so-called clustering dipole). Is the dipole convergent at all, and if so, what is the scale of the convergence? We study the growth of the clustering dipole of galaxies as a function of the limiting flux of the sample from the Two Micron All Sky Survey (2MASS). Contrary to some earlier claims, we find that the dipole does not converge before the completeness limit of the 2MASS Extended Source Catalog, i.e., up to 13.5 mag in the near-infrared K{sub s} band (equivalent to an effective distance of 300 Mpc h{sup -1}). We compare the observed growth of the dipole with the theoretically expected, conditional one (i.e., given the velocity of the Local Group relative to the cosmic microwave background), for the {Lambda}CDM power spectrum and cosmological parameters constrained by the Wilkinson Microwave Anisotropy Probe. The observed growth turns out to be within 1{sigma} confidence level of its theoretical counterpart once the proper observational window of the 2MASS flux-limited catalog is included. For a contrast, if the adopted window is a top hat, then the predicted dipole grows significantly faster and converges (within the errors) to its final value for a distance of about 300 Mpc h{sup -1}. By comparing the observational windows, we show that for a given flux limit and a corresponding distance limit, the 2MASS flux-weighted window passes less large-scale signal than the top-hat one. We conclude that the growth of the 2MASS dipole for effective distances greater than 200 Mpc h{sup -1} is only apparent. On the other hand, for a distance of 80 Mpc h{sup -1} (mean depth of the 2MASS Redshift Survey) and the {Lambda}CDM power spectrum, the true dipole is expected to reach only {approx}80% of its final value. Eventually, since for the window function of 2MASS the predicted growth is consistent with the observed one, we can compare the two to evaluate {beta} {identical_to} {Omega}{sub m}{sup 0.55}/b. The result is {beta} = 0.38 {+-} 0.04, which leads to an estimate of the density parameter {Omega}{sub m} = 0.20 {+-} 0.08.

79 ASTRONOMY AND ASTROPHYSICS↗

PROBABILITY DISTRIBUTION FUNCTIONS OF COSMOLOGICAL LENSING: CONVERGENCE, SHEAR, AND MAGNIFICATION

We perform high-resolution ray-tracing simulations to investigate probability distribution functions (PDFs) of lensing convergence, shear, and magnification on distant sources up to the redshift of z{sub s} = 20. We pay particular attention to the shot noise effect in N-body simulations by explicitly showing how it affects the variance of the convergence. We show that the convergence and magnification PDFs are closely related to each other via the approximate relation {mu} = (1 - {kappa}){sup -2}, which can reproduce the behavior of PDFs surprisingly well up to the high magnification tail. The mean convergence measured in the source plane is found to be systematically negative, rather than zero as often assumed, and is correlated with the convergence variance. We provide simple analytical formulae for the PDFs, which reproduce simulated PDFs reasonably well for a wide range of redshifts and smoothing sizes. As explicit applications of our ray-tracing simulations, we examine the strong-lensing probability and the magnification effects on the luminosity functions of distant galaxies and quasars.

79 ASTRONOMY AND ASTROPHYSICS↗

NUMERICAL CONVERGENCE IN SMOOTHED PARTICLE HYDRODYNAMICS

We study the convergence properties of smoothed particle hydrodynamics (SPH) using numerical tests and simple analytic considerations. Our analysis shows that formal numerical convergence is possible in SPH only in the joint limit N → ∞, h → 0, and N{sub nb} → ∞, where N is the total number of particles, h is the smoothing length, and N{sub nb} is the number of neighbor particles within the smoothing volume used to compute smoothed estimates. Previous work has generally assumed that the conditions N → ∞ and h → 0 are sufficient to achieve convergence, while holding N{sub nb} fixed. We demonstrate that if N{sub nb} is held fixed as the resolution is increased, there will be a residual source of error that does not vanish as N → ∞ and h → 0. Formal numerical convergence in SPH is possible only if N{sub nb} is increased systematically as the resolution is improved. Using analytic arguments, we derive an optimal compromise scaling for N{sub nb} by requiring that this source of error balance that present in the smoothing procedure. For typical choices of the smoothing kernel, we find N{sub nb} ∝N {sup 0.5}. This means that if SPH is to be used as a numerically convergent method, the required computational cost does not scale with particle number as O(N), but rather as O(N {sup 1} {sup +} {sup δ}), where δ ≈ 0.5, with a weak dependence on the form of the smoothing kernel.

79 ASTRONOMY AND ASTROPHYSICS↗

A convex pseudolikelihood framework for high dimensional partial correlation estimation with convergence guarantees

Sparse high dimensional graphical model selection is a topic of much interest in modern day statistics. A popular approach is to apply l1-penalties to either parametric likelihoods, or regularized regression/pseudolikelihoods, with the latter having the distinct advantage that they do not explicitly assume Gaussianity. As none of the popular methods proposed for solving pseudolikelihood-based objective functions have provable convergence guarantees, it is not clear whether corresponding estimators exist or are even computable, or if they actually yield correct partial correlation graphs. We propose a new pseudolikelihood-based graphical model selection method that aims to overcome some of the shortcomings of current methods, but at the same time retain all their respective strengths. In particular, we introduce a novel framework that leads to a convex formulation of the partial covariance regression graph problem, resulting in an objective function comprised of quadratic forms. The objective is then optimized via a coordinate wise approach. The specific functional form of the objective function facilitates rigorous convergence analysis leading to convergence guarantees; an important property that cannot be established by using standard results, when the dimension is larger than the sample size, as is often the case in high dimensional applications. These convergence guarantees ensure that estimators are well defined under very general conditions and are always computable. In addition, the approach yields estimators that have good large sample properties and also respect symmetry. Furthermore, application to simulated and real data, timing comparisons and numerical convergence is demonstrated. We also present a novel unifying framework that places all graphical pseudolikelihood methods as special cases of a more general formulation, leading to important insights.

97 MATHEMATICS AND COMPUTING↗

Removing numerical pathologies in a turbulence parameterization through convergence testing

Discretized numerical models of the atmosphere are usually intended to faithfully represent an underlying set of continuous equations, but this necessary condition is violated sometimes by subtle pathologies that have crept into the discretized equations. Such pathologies can introduce undesirable artifacts, such as sawtooth noise, into the model solutions. The presence of these pathologies can be detected by numerical convergence testing. This study employs convergence testing to verify the discretization of the Cloud Layers Unified By Binormals (CLUBB) model of clouds and turbulence. That convergence testing identifies two aspects of CLUBB's equation set that contribute to undesirable noise in the solutions. First, numerical limiters (i.e. clipping) used by CLUBB introduce discontinuities or slope discontinuities in model fields. Second, this noise can be amplified by an advective term in CLUBB's background diffusion. Smoothing the limiters and removing the advective component of the background diffusion reduces the noise and restores the expected first-order convergence in CLUBB's solutions. These model reformulations improve the results at coarser, near-operational grid spacing and time step in cumulus cloud and dry turbulence tests. In addition, convergence testing is proved to be a valuable tool for detecting pathologies, including unintended discontinuities and grid dependence, in the model equation set.

Mathematics and Computing, Geosciences↗