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 1,531 records · Page 85

On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming

Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear system of equations at each iteration. In common applications of linear programming, particularly in machine learning and scientific computing, the size of this linear system can become prohibitively large, requiring the use of iterative solvers, which provide an approximate solution to the linear system. However, approximately solving the linear system at each iteration of an IPM invalidates the theoretical guarantees of common IPM analyses. To remedy this, we theoretically and empirically analyze (slightly modified) predictor-corrector IPMs when using approximate linear solvers: our approach guarantees that, when certain conditions are satisfied, the number of IPM iterations does not increase and that the final solution remains feasible. We also provide practical instantiations of approximate linear solvers that satisfy these conditions for special classes of constraint matrices using randomized linear algebra.

Dexter, Gregory↗

Convergent Evolution of a New Arsenic Binding Site in the ArsR/SmtB Family of Metalloregulators

Acidithiobacillus ferrooxidans has an arsenic resistance operon that is controlled by an As(III)-responsive transcriptional repressor, AfArsR, a member of the ArsR/SmtB family of metalloregulators. AfArsR lacks the As(III) binding site of the ArsRs from plasmid R773 and Escherichia coli, which have a Cys{sup 32}-Val-Cys{sup 34}-Asp-Leu-Cys{sup 37} sequence in the DNA binding site. In contrast, it has three cysteine residues, Cys{sup 95}, Cys{sup 96}, and Cys{sup 102}, that are not present in the R773 and E. coli ArsRs. The results of direct As(III) binding measurements and x-ray absorption spectroscopy show that these three cysteine residues form a 3-coordinate As(III) binding site. DNA binding studies indicate that binding of As(III) to these cysteine residues produces derepression. Homology modeling indicates that As(III) binding sites in AfArsR are located at the ends of antiparallel C-terminal helices in each monomer that form a dimerization domain. These results suggest that the As(III)-S{sub 3} binding sites in AfArsR and R773 ArsR arose independently at spatially distinct locations in their three-dimensional structures.

59 BASIC BIOLOGICAL SCIENCES↗

Promoting India's development: energy security and climate security are convergent goals

This paper investigates three aspects of the energy-climate challenges faced by India. First, we examine energy security in light of anticipated growth in power generation in response to the national goal of maintaining close to 10% growth in GDP. Second, we examine possible options for mitigation and adaptation to climate change for India that it can take to the coming Copenhagen meeting on climate change. Lastly, we introduce an open web based tool for analyzing and planning global energy systems called the Global Energy Observatory (GEO).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Anderson acceleration stability in NDA-accelerated k-eigenvalue problems

Anderson acceleration (AA) has been used to improve the stability and convergence rate of multiphysics iterative methods for reactor analysis. Most applications studied assume a tightly converged solution for the different physics problems, and AA is usually applied to state variables like temperature, density, and heat generation rate. In this paper, we study the theoretical performance of AA in NDA-accelerated k-eigenvalue problems. The problems and algorithms studied are simplified from the coupled iteration scheme adopted by MPACT and many other high-fidelity whole-core reactor codes. Compared to previous analyses of AA for these iteration schemes, we study the case with a partially converged neutronics solution and possibly partially converged nonlinear diffusion acceleration (NDA)/coarse mesh finite difference (CMFD) solutions. We observe that the performance of the iteration scheme with AA is very sensitive to the initial guess and is affected by the partially converged CMFD solutions. When the NDA solution is fully converged, using AA cannot achieve the optimal convergence rate in large-sized problems. Conversely, if the NDA solution is partially converged, the iteration scheme with AA can diverge or converge extremely slowly. It is found that the loss of robustness for AA is due to the fact that it is applied to the iterative subspace of state variables rather than the fundamental unknowns of the governing equations. To improve the robustness, the scalar flux should also be considered in the implementation of AA. After considering the residuals of flux, we observe that the stability is regardless of the partial convergence of NDA solutions. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Solid Mechanics Code Verification: Contrasting Classical and Manufactured Reference Solutions

Verification results for Sierra/SM using inexact reference solutions have often exhibited unsatisfactory convergence behavior. With an understanding of the convergence behavior for these types of tests, one can avoid falsely attributing pathologies of the test with incorrectness of the code. Simple theoretical results highlight that for an inexact reference solution two conditions must be met to observe asymptotic convergence. These conditions, and the resulting types of convergence behaviors, are further illustrated with graphical examples depicting the exact, inexact reference, and sequence of numerical solutions as vectors (in a function space). A stress concentration problem is adopted to contrast convergence behaviors when using inexact (classical linear elastic) and exact (manufactured) reference solutions. Convergence is not initially attained with the classical solution. Convergence with the manufactured solution indicates the convergence failure with the classical reference did not result from code error and provides insight on how for this problem asymptotic convergence could be attained with the classical reference solution by modifying the computational models.

42 ENGINEERING↗

Eastern Ishtar Terra: Tectonic evolution derived from recognized features

Previous analyses have recognized several styles and orientations of compressional deformation, crustal convergence, and crustal thickening in Eastern Ishtar Terra. An east to west sense of crustal convergence through small scale folding, thrusting, and buckling is reflected in the high topography and ridge-and-valley morphology of Maxwell Montes and the adjacent portion of Fortuna Tessera. This east to west convergence was accompanied by up to 1000 km of lateral motion and large scale strike-slip faulting within two converging shear zones which has resulted in the present morphology of Maxwell Montes. A more northeast to southwest sense of convergence through large scale buckling and imbrication is reflected in large, northwest-trending scarps along the entire northern boundary of Ishtar Terra, with up to 2 km of relief present at many of the scarps. It was previously suggested that both styles of compression have occurred at the expense of pre-existing tessera regions which have then been overprinted by the latest convergence event. The difference in style is attributed mostly to differences in the properties of the crust converging with the tessera blocks. If one, presumably thick, tessera block converges with another tessera region, then the widespread, distributed style of deformation occurs, as observed in western Fortuna Tessera. However, if relatively thin crust (such as suggested for the North Polar Plains converges with thicker tessera regions, then localized deformation occurs, as reflected in the scarps along Northern Ishtar Terra. The purpose is to identify the types of features observed in Eastern Ishtar Terra. Their potential temporal and spatial relationships, is described, possible origins for them is suggested, and how the interpretation of some of these features has led to the multiple-style tectonic evolution model described is shown.

Vorderbruegge, R. W.↗

Higher-order time integration of Coulomb collisions in a plasma using Langevin equations

The extension of Langevin-equation Monte-Carlo algorithms for Coulomb collisions from the conventional Euler–Maruyama time integration to the next higher order of accuracy, the Milstein scheme, has been developed, implemented, and tested. This extension proceeds via a formulation of the angular scattering directly as stochastic differential equations in the fixed-frame spherical-coordinate velocity variables. Results from the numerical implementation show the expected improvement [O(Δt) vs. O(Δt{sup 1/2})] in the strong convergence rate both for the speed |v| and angular components of the scattering. An important result is that this improved convergence is achieved for the angular component of the scattering if and only if the “area-integral” terms in the Milstein scheme are included. The resulting Milstein scheme is of value as a step towards algorithms with both improved accuracy and efficiency. These include both algorithms with improved convergence in the averages (weak convergence) and multi-time-level schemes. The latter have been shown to give a greatly reduced cost for a given overall error level when compared with conventional Monte-Carlo schemes, and their performance is improved considerably when the Milstein algorithm is used for the underlying time advance versus the Euler–Maruyama algorithm. A new method for sampling the area integrals is given which is a simplification of an earlier direct method and which retains high accuracy. This method, while being useful in its own right because of its relative simplicity, is also expected to considerably reduce the computational requirements for the direct conditional sampling of the area integrals that is needed for adaptive strong integration.

97 MATHEMATICS AND COMPUTING↗

RE-CAPTURING COSMIC INFORMATION

Gravitational lensing of distant galaxies can be exploited to infer the convergence field as a function of angular position on the sky. The statistics of this field, much like that of the cosmic microwave background (CMB), can be studied to extract information about fundamental parameters in cosmology, most notably the dark energy in the universe. Unlike the CMB, the distribution of matter in the universe which determines the convergence field is highly non-Gaussian, reflecting the nonlinear processes that accompanied structure formation. Much of the cosmic information contained in the initial field is therefore unavailable to the standard power spectrum measurements. Here we propose a method for re-capturing cosmic information by using the power spectrum of a simple function of the observed (nonlinear) convergence field. We adapt the approach of Neyrinck et al. to lensing by using a modified logarithmic transform of the convergence field. The Fourier transform of the log-transformed field has modes that are nearly uncorrelated, which allows for additional cosmological information to be extracted from small-scale modes.

79 ASTRONOMY AND ASTROPHYSICS↗

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.↗