Search NASA⌕ Search

SEARCH · Search NASA

Results for “Newton 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 379 records · Page 21

General Fluid System Simulation Program to Model Secondary Flows in Turbomachinery

The complexity and variety of turbomachinery flow circuits created a need for a general fluid system simulation program for test data anomaly resolution as well as design review. The objective of the paper is to present a computer program that has been developed to support Marshall Space Flight Center's turbomachinery internal flow analysis efforts. The computer program solves for the mass. energy and species conservation equation at each node and flow rate equation at each branch of the network by a novel numerical procedure which is a combination of both Newton-Ralphson and successive substitution method and uses a thermodynamic property program for computing real gas properties. A generalized, robust, modular, and 'user-friendly' computer program has been developed to model internal flow rates, pressures, temperatures, concentrations of gas mixtures and axial thrusts. The program can be used for any network for compressible and incompressible flows, choked flow, change of phase and gaseous mixturecs. The code has been validated by comparing the predictions with Space Shuttle Main Engine test data.

Majumdar, Alok K.↗

Dust and gas absorption in the High Mass X-ray Binary IGR J16318−4848

Context. With an absorption column density on the order of 10(exp 24)per sq. cm, IGR J16318-4848 is one of the most extreme cases of a highly obscured High Mass X-ray Binary. Besides the overall continuum absorption, the source spectrum exhibits a strong iron and nickel fluorescence line complex at 6.4 keV. Previous empirical modeling of these features and comparison with radiative transfer simulations raised questions about the structure and covering fraction of the absorber and the profile of the fluorescence lines. Aims. We aim at a self-consistent description of the continuum absorption, the absorption edges and the fluorescent lines to constrain properties of the absorbing material, such as ionization structure and geometry. We further investigate the effects of dust absorption on the observed spectra and the possibility of fluorescent emission from dust grains. Methods. We use XMM-Newton and NuSTAR spectra to first constrain empirically the incident continuum and fluorescence lines. Next, we use XSTAR to construct a customized photoionization model where we vary the ionization parameter, column density, and covering fraction. In a third step, we model the absorption and fluorescence in a dusty olivine absorber and employ both, a simple analytical model for the fluorescent line emission and Monte Carlo radiative transfer, spectral shapes and line fluxes that are very close to the data are generated. Results. Our empirical spectral modeling is in agreement with previous works. Our second model, the single gas absorber does not describe the observational data. In particular, irrespective of the ionization state or column density of the absorber, a much higher covering fraction than previously estimated is needed to produce the strong fluorescence lines and the large continuum absorption. A dusty, spherical absorber (modeled as consisting of olivine dust, although the nature of dust cannot be constrained) is well able to produce the observed continuum absorption and edges. Conclusions. A dense, dusty absorber in the direct vicinity of the source consisting of dust offers a consistent description of both the strong continuum absorption and the strong emission features in the X-ray spectrum of IGR J16318􀀀4848. In particular, for low optical depth of individual grains the dust will contribute significantly to the fluorescent emission, which is the case for typical densities and grain size distribution models.

Ralf Ballhausen↗

A general rough-surface inversion algorithm: Theory and application to SAR data

Rough-surface inversion has significant applications in interpretation of SAR data obtained over bare soil surfaces and agricultural lands. Due to the sparsity of data and the large pixel size in SAR applications, it is not feasible to carry out inversions based on numerical scattering models. The alternative is to use parameter estimation techniques based on approximate analytical or empirical models. Hence, there are two issues to be addressed, namely, what model to choose and what estimation algorithm to apply. Here, a small perturbation model (SPM) is used to express the backscattering coefficients of the rough surface in terms of three surface parameters. The algorithm used to estimate these parameters is based on a nonlinear least-squares criterion. The least-squares optimization methods are widely used in estimation theory, but the distinguishing factor for SAR applications is incorporating the stochastic nature of both the unknown parameters and the data into formulation, which will be discussed in detail. The algorithm is tested with synthetic data, and several Newton-type least-squares minimization methods are discussed to compare their convergence characteristics. Finally, the algorithm is applied to multifrequency polarimetric SAR data obtained over some bare soil and agricultural fields. Results will be shown and compared to ground-truth measurements obtained from these areas. The strength of this general approach to inversion of SAR data is that it can be easily modified for use with any scattering model without changing any of the inversion steps. Note also that, for the same reason it is not limited to inversion of rough surfaces, and can be applied to any parameterized scattering process.

Moghaddam, M.↗

Stress measurement in thin films by geometrical optics

A variation of Newton's rings experiment is proposed for measuring film stress. The procedure described, the geometrical optics method, is used to measure radii of curvature for a series of film depositions with Ta, Al, and Mo films. The method has a sensitivity of 1 x 10 to the 9th dyn/sq cm, corresponding to the practical radius limit of about 50 m, and a repeatability usually within five percent. For the purposes of comparison, radii are also measured by Newton's rings method and the Talysurf method; all results are found to be in general agreement. Measurement times are also compared: the geometrical optics method requires only 1/2-1 minute. It is concluded that the geometrical optics method provides an inexpensive, fast, and a reasonably correct technique with which to measure stresses in film.

Rossnagel, S. M.↗

Advancing attenuation estimation through integration of the Hessian in multiparameter viscoacoustic full-waveform inversion

Accurate seismic attenuation models of subsurface structures not only enhance subsequent migration processes by improving fidelity, resolution, and facilitating amplitude-compliant angle gather generation but also provide valuable constraints on subsurface physical properties. Leveraging full-wavefield information, multiparameter viscoacoustic full-waveform inversion ( Q-FWI) simultaneously estimates seismic velocity and attenuation ( Q) models. However, a major challenge in Q-FWI is the contamination of crosstalk artifacts, where inaccuracies in the velocity model are mistakenly mapped to the inverted attenuation model. While incorporating the Hessian is expected to mitigate these artifacts, the explicit implementation is prohibitively expensive due to its formidable computational cost. In this study, we formulate and develop a Q-FWI algorithm via the Newton-conjugate gradient (CG) framework, where the search direction at each iteration is determined through an internal CG loop. In particular, the Hessian is integrated into each CG step in a matrix-free fashion using the second-order adjoint-state method. We find through synthetic experiments that our Newton-CG Q-FWI significantly mitigates crosstalk artifacts compared with the limited-memory Broyden-Fletcher-Goldfarb-Shanno method and the CG method, albeit with a notable computational cost. In the discussion of several key implementation details, we also determine the significance of the approximate Gauss-Newton Hessian, the second-order adjoint-state method, and the two-stage inversion strategy.

Geochemistry & Geophysics↗

First‐Order Empirical Interpolation Method for Real‐Time Solution of Parametric Time‐Dependent Nonlinear PDEs

ABSTRACT We present a model reduction approach for the real‐time solution of time‐dependent nonlinear partial differential equations (PDEs) with parametric dependencies. A major challenge in constructing efficient and accurate reduced‐order models for nonlinear PDEs is the efficient treatment of nonlinear terms. We address this by unifying the implementation of hyperreduction methods to deal with nonlinear terms. Furthermore, we introduce a first‐order empirical interpolation method (EIM) to provide an efficient approximation of the nonlinear terms in time‐dependent PDEs. We demonstrate the effectiveness of our approach on the Allen–Cahn equation, which models phase separation, and the Buckley–Leverett equation, which describes two‐phase fluid flow in porous media. Numerical results highlight the accuracy, efficiency, and stability of the proposed method compared with both the Galerkin–Newton approach and hyper‐reduced models using the standard EIM.

Nguyen, Ngoc Cuong [Center for Computational Engin↗

Method for constructing periodic orbits in nonlinear dynamic systems

Method is modification of generalized Newton-Ralphson algorithm for analyzing two-point boundary problems. It constructs sequence of solutions that converge to precise dynamic solution in the sequence limit. Program calculates periodic orbits in either circular or elliptical restricted three-body problems.

Bennett, A. G.↗

Program for analysis of nonlinear equilibrium and stability (PANES)

PANES utilizes improved techniques for analysis of structures with material and geometric nonlinearities, including limit point and bifurcations behavior which occurs in buckling and collapse problems. Incremental loading, Newton-Raphson iteration, and higher order methods are used in program.

Vos, R. G.↗

Interplanetary trajectory optimization

A procedure for minimizing total impulsive Delta-V for constrained multiple-flyby trajectories, which was originally developed for application to satellite tours, has been modified for application to interplanetary trajectories. The modification includes adding to the cost function the Delta-V required to escape from a parking orbit about the launch planet and the Delta-V required for insertion into orbit about the arrival planet. The hyperbolic excess velocity vector with respect to the launch planet and the launch date have been added to the set of independent variables for the optimization. Each trajectory originates at departure from the parking orbit rather than at a fixed position in space, as is the case for the satellite tour application. The multi-conic trajectory propagation techniques and the Newton optimization algorithm of the original method have been retained. Examples of the application of this new method are given for several types of Galileo interplanetary trajectory options, including Mars powered flyby, broken plane, VEGA, and Delta VEGA trajectories.

Damario, L. A.↗

Hierarchial implicit dynamic least-square solution algorithm

This paper develops an implicit type transient solution strategy which possesses hierarchial levels of application. In particular, due to the manner of formulation, stiffness updating, assembly inversion, solution constraint, as well as iteration are all performed at a localized level. The level of iterative calculations depends on the type of hierarchial partitioning employed, namely degree of freedom, nodal, elemental, material/nonlinear group, substructural, and so on. Since the iterative solution process and application of constraints are applied at a local level, the resulting so-called hierarchial implicit solution algorithm possesses very stable and efficient numerical properties and is highly storage efficient. To demonstrate the scheme, the results of several benchmark examples are presented. These enable comparisons with the Newton-Raphson solved implicit transient solution method. Overall the comparisons illustrate the superior stability and efficiency of the hierarchial scheme.

Padovan, J.↗

Adjoint methods for aerodynamic wing design

A model inverse design problem is used to investigate the effect of flow discontinuities on the optimization process. The optimization involves finding the cross-sectional area distribution of a duct that produces velocities that closely match a targeted velocity distribution. Quasi-one-dimensional flow theory is used, and the target is chosen to have a shock wave in its distribution. The objective function which quantifies the difference between the targeted and calculated velocity distributions may become non-smooth due to the interaction between the shock and the discretization of the flowfield. This paper offers two techniques to resolve the resulting problems for the optimization algorithms. The first, shock-fitting, involves careful integration of the objective function through the shock wave. The second, coordinate straining with shock penalty, uses a coordinate transformation to align the calculated shock with the target and then adds a penalty proportional to the square of the distance between the shocks. The techniques are tested using several popular sensitivity and optimization methods, including finite-differences, and direct and adjoint discrete sensitivity methods. Two optimization strategies, Gauss-Newton and sequential quadratic programming (SQP), are used to drive the objective function to a minimum.

Grossman, Bernard↗

A Method to Solve Interior and Exterior Camera Calibration Parameters for Image Resection

An iterative method is presented to solve the internal and external camera calibration parameters, given model target points and their images from one or more camera locations. The direct linear transform formulation was used to obtain a guess for the iterative method, and herein lies one of the strengths of the present method. In all test cases, the method converged to the correct solution. In general, an overdetermined system of nonlinear equations is solved in the least-squares sense. The iterative method presented is based on Newton-Raphson for solving systems of nonlinear algebraic equations. The Jacobian is analytically derived and the pseudo-inverse of the Jacobian is obtained by singular value decomposition.

Samtaney, Ravi↗

Novae as a Class of Transient X-ray Sources

Motivated by the recently discovered class of faint (10(exp 34)-10(exp 35) ergs/s) X-ray transients in the Galactic Center region, we investigate the 2-10 keV properties of classical and recurrent novae. Existing data are consistent with the idea that all classical novae are transient X-ray sources with durations of months to years and peak luminosities in the 10(exp 34)-10(exp 35)ergs/s range. This makes classical novae a viable candidate class for the faint Galactic Center transients. We estimate the rate of classical novae within a 15 arcmin radius region centered on the Galactic Center (roughly the field of view of XMM-Newton observations centered on Sgr A*) to be approx.0.1 per year. Therefore, it is plausible that some of the Galactic Center transients that have been announced to date are unrecognized classical novae. The continuing monitoring of the Galactic Center region carried out by Chandra and XMM-Newton may therefore provide a new method to detect classical novae in this crowded and obscured region, an

Mukai, K.↗

Program for Analyzing Flows in a Complex Network

Generalized Fluid System Simulation Program (GFSSP) version 4 is a general-purpose computer program for analyzing steady-state and transient flows in a complex fluid network. The program is capable of modeling compressibility, fluid transients (e.g., water hammers), phase changes, mixtures of chemical species, and such externally applied body forces as gravitational and centrifugal ones. A graphical user interface enables the user to interactively develop a simulation of a fluid network consisting of nodes and branches. The user can also run the simulation and view the results in the interface. The system of equations for conservation of mass, energy, chemical species, and momentum is solved numerically by a combination of the Newton-Raphson and successive-substitution methods.

Majumdar, Alok Kumar↗

A methodology for airplane parameter estimation and confidence interval determination in nonlinear estimation problems

An algorithm for maximum likelihood (ML) estimation is developed with an efficient method for approximating the sensitivities. The ML algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. With the fitted surface, sensitivity information can be updated at each iteration with less computational effort than that required by either a finite-difference method or integration of the analytically determined sensitivity equations. MNRES eliminates the need to derive sensitivity equations for each new model, and thus provides flexibility to use model equations in any convenient format. A random search technique for determining the confidence limits of ML parameter estimates is applied to nonlinear estimation problems for airplanes. The confidence intervals obtained by the search are compared with Cramer-Rao (CR) bounds at the same confidence level. The degree of nonlinearity in the estimation problem is an important factor in the relationship between CR bounds and the error bounds determined by the search technique. Beale's measure of nonlinearity is developed in this study for airplane identification problems; it is used to empirically correct confidence levels and to predict the degree of agreement between CR bounds and search estimates.

Murphy, P. C.↗

An Algorithm for Efficient Maximum Likelihood Estimation and Confidence Interval Determination in Nonlinear Estimation Problems

An algorithm for maximum likelihood (ML) estimation is developed with an efficient method for approximating the sensitivities. The algorithm was developed for airplane parameter estimation problems but is well suited for most nonlinear, multivariable, dynamic systems. The ML algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort. MNRES determines the sensitivities with less computational effort than using either a finite-difference method or integrating the analytically determined sensitivity equations. MNRES eliminates the need to derive sensitivity equations for each new model, thus eliminating algorithm reformulation with each new model and providing flexibility to use model equations in any format that is convenient. A random search technique for determining the confidence limits of ML parameter estimates is applied to nonlinear estimation problems for airplanes. The confidence intervals obtained by the search are compared with Cramer-Rao (CR) bounds at the same confidence level. It is observed that the degree of nonlinearity in the estimation problem is an important factor in the relationship between CR bounds and the error bounds determined by the search technique. The CR bounds were found to be close to the bounds determined by the search when the degree of nonlinearity was small. Beale's measure of nonlinearity is developed in this study for airplane identification problems; it is used to empirically correct confidence levels for the parameter confidence limits. The primary utility of the measure, however, was found to be in predicting the degree of agreement between Cramer-Rao bounds and search estimates.

Murphy, Patrick Charles↗

Domain decomposition methods for the parallel computation of reacting flows

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors.

Keyes, David E.↗

Numerical recovery of material parameters in Euler-Bernoulli beam models

A fully Sinc-Galerkin method for recovering the spatially varying stiffness parameter in fourth-order time-dependence problems with fixed and cantilever boundary conditions is presented. The forward problems are discretized with a sinc basis in both the spatial and temporal domains. This yields an approximation solution which converges exponentially and is valid on the infinite time interval. When the forward methods are applied to parameter recovery problems, the resulting inverse problems are ill-posed. Tikhonov regularization is applied and the resulting minimization problems are solved via a quasi-Newton/trust region algorithm. The L-curve method is used to determine an appropriate value of the regularization parameter. Numerical results which highlight the method are given for problems with both fixed and cantilever boundary conditions.

Smith, R. C.↗