Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Newton’s 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 145 records · Page 8

Rapid Design of Gravity Assist Trajectories

Several International Solar Terrestrial Physics (ISTP) missions require the design of complex gravity assisted trajectories in order to investigate the interaction of the solar wind with the Earth's magnetic field. These trajectories present a formidable trajectory design and optimization problem. The philosophy and methodology that enable an analyst to design and analyse such trajectories are discussed. The so called 'floating end point' targeting, which allows the inherently nonlinear multiple body problem to be solved with simple linear techniques, is described. The combination of floating end point targeting with analytic approximations with a Newton method targeter to achieve trajectory design goals quickly, even for the very sensitive double lunar swingby trajectories used by the ISTP missions, is demonstrated. A multiconic orbit integration scheme allows fast and accurate orbit propagation. A prototype software tool, Swingby, built for trajectory design and launch window analysis, is described.

Carrico, J.↗

Rapid design of gravity assist trajectories

Several International Solar-Terrestrial Physics (ISTP) missions require the design of complex gravity-assisted trajectories in order to investigate the interaction of the solar wind with the earth's magnetic field. These trajectories present a formidable trajectory design and optimization problem. This paper discusses the philosophy and methodology that enable an analyst to design and analyze such trajectories. The authors describe what is called 'floating end-point' targeting, which allows the inherently nonlinear multiple body problem to be solved with simple linear techniques. This paper demonstrates how floating end-point targeting combines analytic approximations with a Newton method targeter to achieve trajectory design goals quickly, even for the very sensitive double lunar swingby trajectories used by the ISTP missions. A Multiconic orbit integration scheme allows fast and accurate orbit propagation. This paper also describes a prototype software tool, Swingby, which has been built for trajectory design and launch window analysis.

Carrico, J.↗

Solution of free-boundary problems using finite-element/Newton methods and locally refined grids - Application to analysis of solidification microstructure

A new method is presented for the solution of free-boundary problems using Lagrangian finite element approximations defined on locally refined grids. The formulation allows for direct transition from coarse to fine grids without introducing non-conforming basis functions. The calculation of elemental stiffness matrices and residual vectors are unaffected by changes in the refinement level, which are accounted for in the loading of elemental data to the global stiffness matrix and residual vector. This technique for local mesh refinement is combined with recently developed mapping methods and Newton's method to form an efficient algorithm for the solution of free-boundary problems, as demonstrated here by sample calculations of cellular interfacial microstructure during directional solidification of a binary alloy.

Tsiveriotis, K.↗

Parallel Newton-Krylov-Schwarz algorithms for the transonic full potential equation

We study parallel two-level overlapping Schwarz algorithms for solving nonlinear finite element problems, in particular, for the full potential equation of aerodynamics discretized in two dimensions with bilinear elements. The overall algorithm, Newton-Krylov-Schwarz (NKS), employs an inexact finite-difference Newton method and a Krylov space iterative method, with a two-level overlapping Schwarz method as a preconditioner. We demonstrate that NKS, combined with a density upwinding continuation strategy for problems with weak shocks, is robust and, economical for this class of mixed elliptic-hyperbolic nonlinear partial differential equations, with proper specification of several parameters. We study upwinding parameters, inner convergence tolerance, coarse grid density, subdomain overlap, and the level of fill-in in the incomplete factorization, and report their effect on numerical convergence rate, overall execution time, and parallel efficiency on a distributed-memory parallel computer.

Cai, Xiao-Chuan↗

Nonlinear Transient Problems Using Structure Compatible Heat Transfer Code

The report documents the recent effort to enhance a transient linear heat transfer code so as to solve nonlinear problems. The linear heat transfer code was originally developed by Dr. Kim Bey of NASA Largely and called the Structure-Compatible Heat Transfer (SCHT) code. The report includes four parts. The first part outlines the formulation of the heat transfer problem of concern. The second and the third parts give detailed procedures to construct the nonlinear finite element equations and the required Jacobian matrices for the nonlinear iterative method, Newton-Raphson method. The final part summarizes the results of the numerical experiments on the newly enhanced SCHT code.

Hou, Gene↗

Molecular Simulations in Astrobiology

One of the main goals of astrobiology is to understand the origin of cellular life. The most direct approach to this problem is to construct laboratory models of protocells. Such efforts, currently underway in the NASA Astrobiology Program, are accompanied by computational studies aimed at explaining self-organization of simple molecules into ordered structures that are capable of performing protocellular functions. Many of these functions, such as importing nutrients, capturing energy and responding to changes in the environment, are carried out by proteins bound to membranes. We use computer simulations to address the following questions about these proteins: (1) How do small proteins self-organize into ordered structures at water-membrane interfaces and insert into membranes? (2) How do peptides form membrane-spanning structures (e.g. channels)? (3) By what mechanisms do such structures perform their functions? The simulations are performed using the molecular dynamics method. In this method, Newton's equations of motion for each atom in the system are solved iteratively. At each time step, the forces exerted on each atom by the remaining atoms are evaluated by dividing them into two parts. Short-range forces are calculated in real space while long-range forces are evaluated in reciprocal space, using a particle-mesh algorithm which is of order O(NInN). With a time step of 2 femtoseconds, problems occurring on multi-nanosecond time scales (10(exp 6)-10(exp 8) time steps) are accessible. To address a broader range of problems, simulations need to be extended by three orders of magnitude, which requires algorithmic improvements and codes scalable to a large number of processors. Work in this direction is in progress. Two series of simulations are discussed. In one series, it is shown that nonpolar peptides, disordered in water, translocate to the nonpolar interior of the membrane and fold into helical structures (see Figure). Once in the membrane, the peptides exhibit orientational flexibility with changing conditions, which may have provided a mechanism of transmitting signals between the protocell and its environment. In another series of simulations, the mechanism by which a simple protein channel efficiently mediates proton transport across membranes was investigated. This process is a key step in cellular bioenergetics. In the channel under study, proton transport is gated by four histidines that occlude the channel pore. The simulations identify the mechanisms by which protons move through the gate.

Pohorille, Andrew↗

Molecular Simulations in Astrobiology

One of the main goals of astrobiology is to understand the origin of cellular life. In the absence of any record of the earliest ancestors of contemporary cells, protocells, the most direct way to test our understanding of their characteristics is to construct laboratory models of protocells. Such efforts, currently underway in the NASA Astrobiology Program, are accompanied by computational studies aimed at explaining self-organization of simple molecules into ordered structures and developing designs of molecules that are capable of performing protocellular functions. Many of these functions, such as importing nutrients, capturing and storing energy, and responding to changes in the environment, are carried out by proteins bound to membranes. We use computer simulations to address the following, questions about these proteins: (1) How do small proteins (peptides) organize themselves into ordered structures at water-membrane interfaces and insert into membranes? (2) How do peptides aggregate to form membrane-spannin(y structures (e.g., channels)? (3) By what mechanisms do such aggregates perform their functions? The simulations are performed using the molecular dynamics (MD) method. In this method, Newton's equations of motion for each atom in the system are solved iteratively. At each time step, the forces exerted on each atom by the remaining atoms are evaluated by dividing them into two parts. Short-range forces are calculated directly in real space while long-range forces are evaluated in reciprocal space, usually using a particle-mesh algorithm which is of order O(NlnN). Currently, a time step of 2 femtoseconds is typically used, thereby making studies of problems occurring on multi-nanosecond time scales (10(exp 6) - 10(exp 8) time steps) accessible. To address a broader range of problems, simulations need to be extended by three orders of magnitude. Such an extension requires both algorithmic improvements and codes scalable to a large number of parallel processors. Work in this direction is in progress. Two specific series of simulations that demonstrate how peptides self-organize and function in membranes are discussed. In one series of simulations, it was shown that nonpolar peptides, disordered in water, translocate to the nonpolar interior of the membrane and, simultaneously, fold into two different helical structures, which remain in equilibrium. Once in the membrane, the peptides can readily change their orientation, especially in response to local electric fields. This structural and orientational flexibility of peptides with changing conditions may have provided a mechanism of transmitting signals between the environment and the interior of the protocell. In another series of simulations, the mechanism by which a simple protein channel efficiently mediates proton transport across membranes was investigated. This process is a key step in cellular bioenergetics. In the channel under study, proton transport is gated by four histidines that occlude the channel pore. The simulations demonstrate that protons move through the gate by a "shuttle" mechanism, wherein one histidine is protonated on the extracellular side and, subsequently, the proton bound on the opposite side is released.

Pohorille, Andrew↗

Finding the Closest Surface Point

To find the closest surface point to a given point is one of the most frequently used operations in geometric computation. Traditionally, this problem has been formulated by a linear Newton method. To improve robustness for this operation, I present a different formulation, with a second order method, for the general cases, and ways to handle the degeneracy at the apex of a cone, a commonly occurring surface degeneracy.

Chou, Jin J.↗

Variable X-Ray Absorption in the Mini-BAL QSO PG 1126-041

Context. X-ray studies of AGN with powerful nuclear winds are important to constrain the physics of the inner accretion/ejection flow around SMBH, and to understand the impact of such winds on the AGN environment. Aims. Our main scientific goal is to constrain the properties of a variable outflowing absorber that is thought to be launched near the SMBH of the mini-BAL QSO PG 1126-041 using a multi-epoch observational campaign performed with XMM-Newton. Methods. We performed temporally resolved X-ray spectroscopy and simultaneous UV and X-ray photometry on the most complete set of observations and on the deepest X-ray exposure of a mini-BAL QSO to date. Results. We found complex X-ray spectral variability on time scales of both months and hours, best reproduced by means of variable massive ionized absorbers along the line of sight. As a consequence, the observed optical-to-X-ray spectral index is found to be variable with time. In the highest signal-to-noise observation we detected highly ionized X-ray absorbing material outflowing much faster (u(sub X) approx. 16 500 km/s) than the UV absorbing one (u(sub uv) approx. 5,000 km/s). This highly ionized absorber is found to be variable on very short (a few kiloseconds) time scales. Conclusions. Our findings are qualitatively consistent with line driven accretion disk winds scenarios. Our observations have opened the time-resolved X-ray spectral analysis field for mini-BAL QSOs; only with future deep studies will we be able to map the dynamics of the inner flow and understand the physics of AGN winds and their impact on the environment.

Giustini, M.↗

An Experimental and Computational Study on Soot Formation in a Coflow Jet Flame Under Microgravity and Normal Gravity

Upon the completion of the Structure and Liftoff in Combustion Experiment (SLICE) in March 2012, a comprehensive and unique set of microgravity coflow diffusion flame data was obtained. This data covers a range of conditions from weak flames near extinction to strong, highly sooting flames, and enabled the study of gravitational effects on phenomena such as liftoff, blowout and soot formation. The microgravity experiment was carried out in the Microgravity Science Glovebox (MSG) on board the International Space Station (ISS), while the normal gravity experiment was performed at Yale utilizing a copy of the flight hardware. Computational simulations of microgravity and normal gravity flames were also carried out to facilitate understanding of the experimental observations. This paper focuses on the different sooting behaviors of CH4 coflow jet flames in microgravity and normal gravity. The unique set of data serves as an excellent test case for developing more accurate computational models.Experimentally, the flame shape and size, lift-off height, and soot temperature were determined from line-of-sight flame emission images taken with a color digital camera. Soot volume fraction was determined by performing an absolute light calibration using the incandescence from a flame-heated thermocouple. Computationally, the MC-Smooth vorticity-velocity formulation was employed to describe the chemically reacting flow, and the soot evolution was modeled by the sectional aerosol equations. The governing equations and boundary conditions were discretized on an axisymmetric computational domain by finite differences, and the resulting system of fully coupled, highly nonlinear equations was solved by a damped, modified Newtons method. The microgravity sooting flames were found to have lower soot temperatures and higher volume fraction than their normal gravity counterparts. The soot distribution tends to shift from the centerline of the flame to the wings from normal gravity to microgravity.

microgravity↗

The GPM Combined Algorithm

In this paper, the operational Global Precipitation Measurement (GPM) mission combined radar-radiometer algorithm is thoroughly described. The operational combined algorithm is designed to reduce uncertainties in GPM Core Observatory precipitation estimates by effectively integrating complementary information from the GPM Dual-Frequency Precipitation Radar (DPR) and the GPM Microwave Imager (GMI) into an optimal, physically consistent precipitation product. Although similar in many respects to previously developed combined algorithms, the GPM combined algorithm has several unique features that are specifically designed to meet the GPM objectives of deriving, based on GPM Core Observatory information, accurate and physically consistent precipitation estimates from multiple spaceborne instruments, and ancillary environmental data from reanalyses. The algorithm features an optimal estimation framework based on a statistical formulation of the Gauss-Newton method, a parameterization for the nonuniform distribution of precipitation within the radar fields of view, a methodology to detect and account for multiple scattering in Ka-band DPR observations, and a statistical deconvolution technique that allows for an efficient sequential incorporation of radiometer information into DPR precipitation retrievals.

Grecu, Mircea↗

Rapid and Accurate Computation of Invariant Tori, Manifolds, and Connections Near Mean Motion Resonances in the Periodically Perturbed Planar Circular Restricted 3-Body Problem Models

When the planar circular restricted 3-body problem (RTBP) is periodically perturbed, most unstable resonant periodic orbits become invariant tori. In this study, we 1) develop a quasi-Newton method which simultaneously solves for the tori and their center, stable, and unstable directions; 2) implement continuation by both perturbation as well as rotation numbers; 3) compute Fourier-Taylor parameterizations of the stable and unstable manifolds; 4) globalize these manifolds; 5) compute homoclinic and heteroclinic connections. Our methodology improves on efficiency and accuracy compared to prior studies, and applies to a variety of periodic perturbations. We demonstrate the tools on the planar elliptic RTBP.

de la Llave, Rafael↗

An actuator extension transformation for a motion simulator and an inverse transformation applying Newton-Raphson's method

A set of equations which transform position and angular orientation of the centroid of the payload platform of a six-degree-of-freedom motion simulator into extensions of the simulator's actuators has been derived and is based on a geometrical representation of the system. An iterative scheme, Newton-Raphson's method, has been successfully used in a real time environment in the calculation of the position and angular orientation of the centroid of the payload platform when the magnitude of the actuator extensions is known. Sufficient accuracy is obtained by using only one Newton-Raphson iteration per integration step of the real time environment.

Dieudonne, J. E.↗

Newton trust-region methods with primary variable switching for simulating high temperature multiphase porous media flow

Coupling multiphase flow with energy transport due to high temperature heat sources introduces significant new challenges since boiling and condensation processes can lead to dry-out conditions with subsequent re-wetting. The transition between two-phase and single-phase behavior can require changes to the primary dependent variables adding discontinuities as well as extending constitutive nonlinear relations to extreme physical conditions. Practical simulations of large-scale engineered domains lead to Jacobian systems with a very large number of unknowns that must be solved efficiently using iterative methods in parallel on high-performance computers. Performance assessment of potential nuclear repositories, carbon sequestration sites and geothermal reservoirs can require numerous Monte-Carlo simulations to explore uncertainty in material properties, boundary conditions, and failure scenarios. Due to the numerical challenges, standard NR iteration may not converge over the range of required simulations and require more sophisticated optimization method like trust-region. In this study, we use the open-source simulator PFLOTRAN for the important practical problem of the safety assessment of future nuclear waste repositories in the U.S. DOE geologic disposal safety assessment Framework. The simulator applies the PETSc parallel framework and a backward Euler, finite volume discretization. We demonstrate failure of the conventional NR method and the success of trust-region modifications to Newton’s method for a series of test problems of increasing complexity. Trust-region methods essentially modify the Newton step size and direction under some circumstances where the standard NR iteration can cause the solution to diverge or oscillate. Furthermore, we show how the Newton Trust-Region method can be adapted for Primary Variable Switching (PVS) when the multiphase state changes due to boiling or condensation. The simulations with high-temperature heat sources which led to extreme nonlinear processes with many state changes in the domain did not converge with NR, but they do complete successfully with the trust-region methods modified for PVS. This implementation effectively decreased weeks of simulation time needing manual adjustments to complete a simulation down to a day. Finally, we show the strong scalability of the methods on a single node and multiple nodes in an HPC cluster.

54 ENVIRONMENTAL SCIENCES↗

Efficient shallow Ritz method for 1D diffusion problems

This paper studies the shallow Ritz method for solving the one-dimensional diffusion problem. It is shown that the shallow Ritz method improves the order of approximation dramatically for non-smooth problems. To realize this optimal or nearly optimal order of the shallow Ritz approximation, we develop a damped block Newton (dBN) method that alternates between updates of the linear and non-linear parameters. Per each iteration, the linear and the non-linear parameters are updated by exact inversion and one step of a modified, damped Newton method applied to a reduced non-linear system, respectively. The computational cost of each dBN iteration is $\mathcal{O}$(n). Starting with the non-linear parameters as a uniform partition of the interval, numerical experiments show that the dBN is capable of efficiently moving mesh points to nearly optimal locations. In conclusion, to improve the efficiency of the dBN further, we propose an adaptive damped block Newton (AdBN) method by combining the dBN with the adaptive neuron enhancement (ANE) method [28].

Diffusion problems↗

On the Derivation of Quasi-Newton Formulas for Optimization in Function Spaces

Newton’s method is usually preferred when solving optimization problems due to its superior convergence properties compared to gradient-based or derivative-free optimization algorithms. However, deriving and computing second-order derivatives needed by Newton’s method often is not trivial and, in some cases, not possible. In such cases quasi-Newton algorithms are a great alternative. In this paper, we provide a new derivation of well-known quasi-Newton formulas in an infinite-dimensional Hilbert space setting. Furthermore, it is known that quasi-Newton update formulas are solutions to certain variational problems over the space of symmetric matrices. In this paper, we formulate similar variational problems over the space of bounded symmetric operators in Hilbert spaces. By changing the constraints of the variational problem we obtain updates (for the Hessian and Hessian inverse) not only for the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method but also for Davidon–Fletcher–Powell (DFP), Symmetric Rank One (SR1), and Powell-Symmetric-Broyden (PSB). In addition, for an inverse problem governed by a partial differential equation (PDE), we derive DFP and BFGS “structured” secant formulas that explicitly use the derivative of the regularization and only approximates the second derivative of the misfit term. We show numerical results that demonstrate the desired mesh-independence property and superior performance of the resulting quasi-Newton methods.

97 MATHEMATICS AND COMPUTING↗

Davidon-Broyden rank-one minimization methods in Hilbert space with application to optimal control problems

The Davidon-Broyden class of rank one, quasi-Newton minimization methods is extended from Euclidean spaces to infinite-dimensional, real Hilbert spaces. For several techniques of choosing the step size, conditions are found which assure convergence of the associated iterates to the location of the minimum of a positive definite quadratic functional. For those techniques, convergence is achieved without the problem of the computation of a one-dimensional minimum at each iteration. The application of this class of minimization methods for the direct computation of the solution of an optimal control problem is outlined. The performance of various members of the class are compared by solving a sample optimal control problem. Finally, the sample problem is solved by other known gradient methods, and the results are compared with those obtained with the rank one quasi-Newton methods.

Straeter, T. A.↗