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 793 records · Page 44

Numerical techniques for the linear, nonadiabatic stellar pulsation problem

The linear, nonadiabatic eigenvalue problem is formulated using Castor's method for calculating radial pulsations of stellar models. Both left and right eigenvectors are calculated. Initial eigenvalues for the linear, nonadiabatic solutions are obtained from the adiabatic eigenvalues and left and right eigenvectors. The orthogonality relation is obtained. Simple formulas for the Newton method are given. The iteration procedure is constrained to improve convergence. The Newton method is less satisfactory than the secant method for difficult cases. The linear, nonadiabatic solutions are shown to be sensitive to the number of zones with tau smaller than 2/3, and the value of (P/P sub r) surface or tau (surface). Optimum values can be determined for the number of zones and tau (surface). Application of the method to Population II Cepheids is briefly presented.

Bednarek, T. A.↗

The derivation of vector magnetic fields from Stokes profiles - Integral versus least squares fitting techniques

The results of two methods for deriving photospheric vector magnetic fields from the Zeeman effect, as observed in the Fe I line at 6302.5 A at high spectral resolution (45 mA), are compared. The first method does not take magnetooptical effects into account, but determines the vector magnetic field from the integral properties of the Stokes profiles. The second method is an iterative least-squares fitting technique which fits the observed Stokes profiles to the profiles predicted by the Unno-Rachkovsky solution to the radiative transfer equation. For sunspot fields above about 1500 gauss, the two methods are found to agree in derived azimuthal and inclination angles to within about + or - 20 deg.

Ronan, R. S.↗

A method for the retrieval of atomic oxygen density and temperature profiles from ground-based measurements of the O(+)(2D-2P) 7320 A twilight airglow

This paper describes a technique for extracting thermospheric profiles of the atomic-oxygen density and temperature, using ground-based measurements of the O(+)(2D-2P) doublet at 7320 and 7330 A in the twilight airglow. In this method, a local photochemical model is used to calculate the 7320-A intensity; the method also utilizes an iterative inversion procedure based on the Levenberg-Marquardt method described by Press et al. (1986). The results demonstrate that, if the measurements are only limited by errors due to Poisson noise, the altitude profiles of neutral temperature and atomic oxygen concentration can be determined accurately using currently available spectrometers.

Fennelly, J. A.↗

Solar and Storage Integration in the U.S. Southeast: Implications for Resource Adequacy [Slides]

In this study, we evaluate how an iterative portfolio approach compares to a more traditional capacity credit method, using the U.S. Southeast as a case study region. Using open-source planning and resource adequacy tools, we compare results using a capacity credit approximation method with those from iterating behind the two. We also explore how the iterative approach performs under a range of sensitivities, including higher load growth, regional coordination, and alternative weather years. We find that traditional capacity credit approximation methods can function well in today's system, but may face challenges for systems with higher levels of solar and storage. As such, integrating planning and resource adequacy models can address some of these gaps, helping planners deliver more reliable systems.

14 SOLAR ENERGY↗

Some aspects of the inversion problem in remote sensing

Several commonly used methods for inversion--constrained linear inversion, synthesis (Backus-Gilbert) methods and nonlinear iterative techniques for the Chahine type--are discussed. It is demonstrated that a very close connection exists between Backus-Gilbert solutions and those given by constrained linear inversion. A number of examples of the application of such methods are presented, showing that resolution is not greatly different for quite different algorithms, a result quite in accord with general theoretical considerations: more resolution can be achieved at the expense of introducing greater a priori bias in the procedure.

Twomey, S.↗

Medical Image Compression Using a New Subband Coding Method

A recently introduced iterative complexity- and entropy-constrained subband quantization design algorithm is generalized and applied to medical image compression. In particular, the corresponding subband coder is used to encode Computed Tomography (CT) axial slice head images, where statistical dependencies between neighboring image subbands are exploited. Inter-slice conditioning is also employed for further improvements in compression performance. The subband coder features many advantages such as relatively low complexity and operation over a very wide range of bit rates. Experimental results demonstrate that the performance of the new subband coder is relatively good, both objectively and subjectively.

Kossentini, Faouzi↗

One-Dimensional Ablation with Pyrolysis Gas Flow Using a Full Newton's Method and Finite Control Volume Procedure

The development and verification of a one-dimensional material thermal response code with ablation is presented. The implicit time integrator, control volume finite element spatial discretization, and Newton's method for nonlinear iteration on the entire system of residual equations have been implemented and verified for the thermochemical ablation of internally decomposing materials. This study is a continuation of the work presented in "One-Dimensional Ablation with Pyrolysis Gas Flow Using a Full Newton's Method and Finite Control Volume Procedure" (AIAA-2006-2910), which described the derivation, implementation, and verification of the constant density solid energy equation terms and boundary conditions. The present study extends the model to decomposing materials including decomposition kinetics, pyrolysis gas flow through the porous char layer, and a mixture (solid and gas) energy equation. Verification results are presented for the thermochemical ablation of a carbon-phenolic ablator which involves the solution of the entire system of governing equations.

Amar, Adam J.↗

Effects of cosine tapering window on quantum phase estimation

Here, we provide a modification to the quantum phase estimation algorithm (QPEA) [Abrams and Lloyd, Phys. Rev. Lett. 83, 5162 (1999); Cleve et al., Proc. R. Soc. A 454, 339 (1998); Nielsen and Chuang, Quantum computation and quantum information, 2002.] inspired by classical windowing methods for spectral density estimation. From this modification we obtain an upper bound in the cost that implies a cubic improvement with respect to the algorithm's error rate. Numerical evaluation of the costs also demonstrates an improvement. Moreover, with similar techniques, we detail an iterative projective measurement method for ground state preparation that gives an exponential improvement over previous bounds using QPEA. Numerical tests that confirm the expected scaling behavior are also obtained. For these numerical tests we have used a lattice Thirring model as testing ground. Using well-known perturbation theory results, we also show how to more appropriately estimate the cost scaling with respect to state error instead of evolution operator error.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An installed nacelle design code using a multiblock Euler solver. Volume 1: Theory document

An efficient multiblock Euler design code was developed for designing a nacelle installed on geometrically complex airplane configurations. This approach employed a design driver based on a direct iterative surface curvature method developed at LaRC. A general multiblock Euler flow solver was used for computing flow around complex geometries. The flow solver used a finite-volume formulation with explicit time-stepping to solve the Euler Equations. It used a multiblock version of the multigrid method to accelerate the convergence of the calculations. The design driver successively updated the surface geometry to reduce the difference between the computed and target pressure distributions. In the flow solver, the change in surface geometry was simulated by applying surface transpiration boundary conditions to avoid repeated grid generation during design iterations. Smoothness of the designed surface was ensured by alternate application of streamwise and circumferential smoothings. The capability and efficiency of the code was demonstrated through the design of both an isolated nacelle and an installed nacelle at various flow conditions. Information on the execution of the computer program is provided in volume 2.

Chen, H. C.↗

Rotor-body coupling revisited

Two analytical procedures are discussed that are currently used to couple rotor and body equations. The first approach, a 'rotor-body iteration' procedure, is often used in flight dynamics simulations. In this approach, acceleration response at the hub interface between the rotor and body are calculated from the body set of equations. These hub acceleration responses are substituted into the rotor set of equations and the remaining rotor acceleration responses are calculated. These rotor responses are used to calculate the rotor hub loads which are transferred back to the body equations to initiate the next iteration. The second method is a 'fully coupled' equations approach that is used in finite element-based analyses. The body and rotor sets of equations are coupled using a kinematic constraint relation at the hub interface. This paper compares the advantages of the two approaches and shows where convergence problems occur in the rotor-body iteration procedure.

Stephens, Wendell B.↗

Iterative Strain-Gage Balance Calibration Data Analysis for Extended Independent Variable Sets

A new method was developed that makes it possible to use an extended set of independent calibration variables for an iterative analysis of wind tunnel strain gage balance calibration data. The new method permits the application of the iterative analysis method whenever the total number of balance loads and other independent calibration variables is greater than the total number of measured strain gage outputs. Iteration equations used by the iterative analysis method have the limitation that the number of independent and dependent variables must match. The new method circumvents this limitation. It simply adds a missing dependent variable to the original data set by using an additional independent variable also as an additional dependent variable. Then, the desired solution of the regression analysis problem can be obtained that fits each gage output as a function of both the original and additional independent calibration variables. The final regression coefficients can be converted to data reduction matrix coefficients because the missing dependent variables were added to the data set without changing the regression analysis result for each gage output. Therefore, the new method still supports the application of the two load iteration equation choices that the iterative method traditionally uses for the prediction of balance loads during a wind tunnel test. An example is discussed in the paper that illustrates the application of the new method to a realistic simulation of temperature dependent calibration data set of a six component balance.

Ulbrich, Norbert Manfred↗

Determination of design and operation parameters for upper atmospheric research instrumentation to yield optimum resolution with deconvolution, appendix 3

The Always-Convergent Iterative Noise Removal and Deconvolution Method of Ioup is applied as a single-filter in the transform domain to deconvolution with both narrow and wide Gaussian impulse response functions. The wraparound error for both cases is also studied. A method is developed by which one can find the optimum iteration number for single-filter iterative deconvolution of sampled data. The method employs the mean square error (MSE), the square of the difference between the deconvolved result and the input, for optimization. The MSE decreases as the deconvolution iterations proceed, but at the optimum iteration number, the MSE starts to increase. This procedure is repeated for signal-to-noise ratio of 10 to 150. The optimum iteration number and the MSE are plotted vs SNR. By knowing the SNR for a particular experiment, one can find the optimum iteration number and MSE.

Ioup, George E.↗

Stochastic Trust-Region Algorithm in Random Subspaces with Convergence and Expected Complexity Analyses

Here, this work proposes a framework for large-scale stochastic derivative-free optimization (DFO) by introducing STARS, a trust-region method based on iterative minimization in random subspaces. This framework is both an algorithmic and theoretical extension of a random subspace derivative-free optimization (RSDFO) framework, and an algorithm for stochastic optimization with random models (STORM). Moreover, like RSDFO, STARS achieves scalability by minimizing interpolation models that approximate the objective in low-dimensional affine subspaces, thus significantly reducing per-iteration costs in terms of function evaluations and yielding strong performance on largescale stochastic DFO problems. The user-determined dimension of these subspaces, when the latter are defined, for example, by the columns of so-called Johnson-Lindenstrauss transforms, turns out to be independent of the dimension of the problem. For convergence purposes, inspired by the analyses of RSDFO and STORM, both a particular quality of the subspace and the accuracies of random function estimates and models are required to hold with sufficiently high, but fixed, probabilities. Using martingale theory under the latter assumptions, an almost sure global convergence of STARS to a first-order stationary point is shown, and the expected number of iterations required to reach a desired first-order accuracy is proved to be similar to that of STORM and other stochastic DFO algorithms, up to constants.

97 MATHEMATICS AND COMPUTING↗

Absolute Radiometric Calibration of Narrow-Swath Imaging Sensors with Reference to Non-Coincident Wide-Swath Sensors

An inter-calibration method is developed to provide absolute radiometric calibration of narrow-swath imaging sensors with reference to non-coincident wide-swath sensors. The method predicts at-sensor radiance using non-coincident imagery from the reference sensor and knowledge of spectral reflectance of the test site. The imagery of the reference sensor is restricted to acquisitions that provide similar view and solar illumination geometry to reduce uncertainties due to directional reflectance effects. Spectral reflectance of the test site is found with a simple iterative radiative transfer method using radiance values of a well-understood wide-swath sensor and spectral shape information based on historical ground-based measurements. At-sensor radiance is calculated for the narrow-swath sensor using this spectral reflectance and atmospheric parameters that are also based on historical in situ measurements. Results of the inter-calibration method show agreement on the 2 5 percent level in most spectral regions with the vicarious calibration technique relying on coincident ground-based measurements referred to as the reflectance-based approach. While the variability of the inter-calibration method based on non-coincident image pairs is significantly larger, results are consistent with techniques relying on in situ measurements. The method is also insensitive to spectral differences between the sensors by transferring to surface spectral reflectance prior to prediction of at-sensor radiance. The utility of this inter-calibration method is made clear by its flexibility to utilize image pairings with acquisition dates differing in excess of 30 days allowing frequent absolute calibration comparisons between wide- and narrow-swath sensors.

McCorkel, Joel↗

Iterative edge- and wavelet-based image registration of AVHRR and GOES satellite imagery

Most automatic registration methods are either correlation-based, feature-based, or a combination of both. Examples of features which can be utilized for automatic image registration are edges, regions, corners, or wavelet-extracted features. In this paper, we describe two proposed approaches, based on edge or edge-like features, which are very appropriate to highlight regions of interest such as coastlines. The two iterative methods utilize the Normalized Cross-Correlation of edge and wavelet features and are applied to such problems as image-to-map registration, landmarking, and channel-to-channel co-registration, utilizing test data, AVHRR data, as well as GOES image data.

LeMoigne, Jacqueline↗

Calculation of transonic potential flowfields about complex, three-dimensional configurations

Methods for extending iterative, finite-difference calculations of transonic potential flowfields to complex three-dimensional configurations are discussed. One particularly attractive approach is to use relatively simple conformal mappings in combination with shearing transformations to generate computational domains that are nearly-conformally mapped from the physical space in one family of coordinate surfaces, and which map the complex boundaries to grid surfaces. The application of such a method to a general wing-body combination or to a multi-bladed fan is discussed. A transformation to map the wing-fuselage or fan-hub combination to a convenient computational domain is proposed. The transformation is useful in its own right for treating the two-dimensional problems of flow past a profile in a wind tunnel or through a cascade. Some results of preliminary calculations are presented.

Caughey, D. A.↗

A Principled Approach to the Specification of System Architectures for Space Missions

Modern space systems are increasing in complexity and scale at an unprecedented pace. Consequently, innovative methods, processes, and tools are needed to cope with the increasing complexity of architecting these systems. A key systems challenge in practice is the ability to scale processes, methods, and tools used to architect complex space systems. Traditionally, the process for specifying space system architectures has largely relied on capturing the system architecture in informal descriptions that are often embedded within loosely coupled design documents and domain expertise. Such informal descriptions often lead to misunderstandings between design teams, ambiguous specifications, difficulty in maintaining consistency as the architecture evolves throughout the system development life cycle, and costly design iterations. Therefore, traditional methods are becoming increasingly inefficient to cope with ever-increasing system complexity. We apply the principles of component-based design and platform-based design to the development of the system architecture for a practical space system to demonstrate feasibility of our approach using SysML. Our results show that we are able to apply a systematic design method to manage system complexity, thus enabling effective data management, semantic coherence and traceability across different levels of abstraction in the design chain. Just as important, our approach enables interoperability among heterogeneous tools in a concurrent engineering model based design environment.

platform-based design↗

Domain decomposition methods for systems of conservation laws: Spectral collocation approximations

Hyperbolic systems of conversation laws are considered which are discretized in space by spectral collocation methods and advanced in time by finite difference schemes. At any time-level a domain deposition method based on an iteration by subdomain procedure was introduced yielding at each step a sequence of independent subproblems (one for each subdomain) that can be solved simultaneously. The method is set for a general nonlinear problem in several space variables. The convergence analysis, however, is carried out only for a linear one-dimensional system with continuous solutions. A precise form of the error reduction factor at each iteration is derived. Although the method is applied here to the case of spectral collocation approximation only, the idea is fairly general and can be used in a different context as well. For instance, its application to space discretization by finite differences is straight forward.

Quarteroni, Alfio↗