Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximate Newton”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Large-scale harmonic balance simulations with Krylov subspace and preconditioner recycling

The multi-harmonic balance method combined with numerical continuation provides an efficient framework to compute a family of time-periodic solutions, or response curves, for large-scale, nonlinear mechanical systems. The predictor and corrector steps repeatedly solve a sequence of linear systems that scale by the model size and number of harmonics in the assumed Fourier series approximation. In this paper, a novel Newton–Krylov iterative method is embedded within the multi-harmonic balance and continuation algorithm to efficiently compute the approximate solutions from the sequence of linear systems that arise during the prediction and correction steps. Further, the method recycles, or reuses, both the preconditioner and the Krylov subspace generated by previous linear systems in the solution sequence. A delayed frequency preconditioner refactorizes the preconditioner only when the performance of the iterative solver deteriorates. The GCRO-DR iterative solver recycles a subset of harmonic Ritz vectors to initialize the solution subspace for the next linear system in the sequence. The performance of the iterative solver is demonstrated on two exemplars with contact-type nonlinearities and benchmarked against a direct solver with traditional Newton–Raphson iterations.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1978

Preliminary design of composite wings for buckling, strength and displacement constraints

An unstiffened panel buckling constraint for balanced, symmetric laminated composites is included on the global design level in a mathematical programming structural optimization procedure for designing wing structures. Constraints are introduced by penalty functions, and Newton's method based on approximate second derivatives of the penalty terms is used as the search algorithm to obtain minimum-mass designs. Constraint approximations used during the optimization process contribute to the computational efficiency of the procedure. A criterion is developed that identifies the appropriate conservative form of the constraint approximations that are used with the optimization procedure. Minimum-mass design results are obtained for a multispar high-aspect-ratio wing subjected to material strength, minimum-gage, displacement, panel buckling and twist constraints. The material systems considered for the examples are all graphite-epoxy, graphite-epoxy with boron-epoxy spar caps, and all aluminum. The composite material designs are shown to have an advantage over the aluminum designs since they can often satisfy additional constraints with only small mass increases.

Starnes, J. H., Jr.↗
NASA NTRS1987

Fast simulation techniques for switching converters

Techniques for simulating a switching converter are examined. The state equations for the equivalent circuits, which represent the switching converter, are presented and explained. The uses of the Newton-Raphson iteration, low ripple approximation, half-cycle symmetry, and discrete time equations to compute the interval durations are described. An example is presented in which these methods are illustrated by applying them to a parallel-loaded resonant inverter with three equivalent circuits for its continuous mode of operation.

King, Roger J.↗
NASA NTRS1990

An upwind approach to unsteady flowfield simulation

A numerical method to determine unsteady solutions of the laminar, perfect gas Navier-Stokes equations has been developed. The structured finite-volume, approximately factored implicit scheme uses Newton subiterations to obtain the spatially and temporally second-order accurate time history of the interaction of blast-waves with stationary targets. The inviscid flux is evaluated using either of two upwind techniques, while the viscous terms are computed by central differencing. Comparisons of numerical, analytical, and experimental results are made in two and three dimensions. The results show accurate wave speed resolution and nonoscillatory discontinuity capturing.

Atwood, Christopher A.↗
NASA NTRS1991

Computation of viscous blast wave flowfields

A method to determine unsteady solutions of the Navier-Stokes equations was developed and applied. The structural finite-volume, approximately factored implicit scheme uses Newton subiterations to obtain the spatially and temporally second-order accurate time history of the interaction of blast-waves with stationary targets. The inviscid flux is evaluated using MacCormack's modified Steger-Warming flux or Roe flux difference splittings with total variation diminishing limiters, while the viscous flux is computed using central differences. The use of implicit boundary conditions in conjunction with a telescoping in time and space method permitted solutions to this strongly unsteady class of problems. Comparisons of numerical, analytical, and experimental results were made in two and three dimensions. These comparisons revealed accurate wave speed resolution with nonoscillatory discontinuity capturing. The purpose of this effort was to address the three-dimensional, viscous blast-wave problem. Test cases were undertaken to reveal these methods' weaknesses in three regimes: (1) viscous-dominated flow; (2) complex unsteady flow; and (3) three-dimensional flow. Comparisons of these computations to analytic and experimental results provided initial validation of the resultant code. Addition details on the numerical method and on the validation can be found in the appendix. Presently, the code is capable of single zone computations with selection of any permutation of solid wall or flow-through boundaries.

Atwood, Christopher A.↗
NASA NTRS1992

Navier-Stokes simulations of unsteady transonic flow phenomena

Numerical simulations of two classes of unsteady flows are obtained via the Navier-Stokes equations: a blast-wave/target interaction problem class and a transonic cavity flow problem class. The method developed for the viscous blast-wave/target interaction problem assumes a laminar, perfect gas implemented in a structured finite-volume framework. The approximately factored implicit scheme uses Newton subiterations to obtain the spatially and temporally second-order accurate time history of the blast-waves with stationary targets. The inviscid flux is evaluated using either of two upwind techniques, while the full viscous terms are computed by central differencing. Comparisons of unsteady numerical, analytical, and experimental results are made in two- and three-dimensions for Couette flows, a starting shock-tunnel, and a shock-tube blockage study. The results show accurate wave speed resolution and nonoscillatory discontinuity capturing of the predominantly inviscid flows. Viscous effects were increasingly significant at large post-interaction times. While the blast-wave/target interaction problem benefits from high-resolution methods applied to the Euler terms, the transonic cavity flow problem requires the use of an efficient scheme implemented in a geometrically flexible overset mesh environment. Hence, the Reynolds averaged Navier-Stokes equations implemented in a diagonal form are applied to the cavity flow class of problems. Comparisons between numerical and experimental results are made in two-dimensions for free shear layers and both rectangular and quieted cavities, and in three-dimensions for Stratospheric Observatory For Infrared Astronomy (SOFIA) geometries. The acoustic behavior of the rectangular and three-dimensional cavity flows compare well with experiment in terms of frequency, magnitude, and quieting trends. However, there is a more rapid decrease in computed acoustic energy with frequency than observed experimentally owing to numerical dissipation. In addition, optical phase distortion due to the time-varying density field is modelled using geometrical constructs. The computed optical distortion trends compare with the experimentally inferred result, but underpredicts the fluctuating phase difference magnitude.

Atwood, C. A.↗
NASA NTRS1993

Computational analysis of methods for reduction of induced drag

The purpose of this effort was to perform a computational flow analysis of a design concept centered around induced drag reduction and tip-vortex energy recovery. The flow model solves the unsteady three-dimensional Euler equations, discretized as a finite-volume method, utilizing a high-resolution approximate Riemann solver for cell interface flux definitions. The numerical scheme is an approximately-factored block LU implicit Newton iterative-refinement method. Multiblock domain decomposition is used to partition the field into an ordered arrangement of blocks. Three configurations are analyzed: a baseline fuselage-wing, a fuselage-wing-nacelle, and a fuselage-wing-nacelle-propfan. Aerodynamic force coefficients, propfan performance coefficients, and flowfield maps are used to qualitatively access design efficacy. Where appropriate, comparisons are made with available experimental data.

Janus, J. M.↗
NASA NTRS1999

Computation of Steady and Unsteady Laminar Flames: Theory

In this paper we describe the numerical analysis underlying our efforts to develop an accurate and reliable code for simulating flame propagation using complex physical and chemical models. We discuss our spatial and temporal discretization schemes, which in our current implementations range in order from two to six. In space we use staggered meshes to define discrete divergence and gradient operators, allowing us to approximate complex diffusion operators while maintaining ellipticity. Our temporal discretization is based on the use of preconditioning to produce a highly efficient linearly implicit method with good stability properties. High order for time accurate simulations is obtained through the use of extrapolation or deferred correction procedures. We also discuss our techniques for computing stationary flames. The primary issue here is the automatic generation of initial approximations for the application of Newton's method. We use a novel time-stepping procedure, which allows the dynamic updating of the flame speed and forces the flame front towards a specified location. Numerical experiments are presented, primarily for the stationary flame problem. These illustrate the reliability of our techniques, and the dependence of the results on various code parameters.

Hagstrom, Thomas↗
NASA NTRS2008

Solar Wind Change Exchange from the Magnetosheath

We report the results of a long (approximately 100 ks) XMM-Newton observation designed to observe solar wind charge exchange emission (SWCX) from Earth's magnetosheath. By luck, the observation took place during a period of minimal solar wind flux so the SWCX emission was also minimal. Never-the-less, there is a significant if not stunning correlation between the observed O VIII count rate and our model for magnetosheath emission. We also report on the observed O VII and O VII emission.

Snowden, Steve↗
NASA NTRS1989

Application of Newton's method to the postbuckling of rings under pressure loadings

The postbuckling response of circular rings (or long cylinders) is examined. The rings are subjected to four types of external pressure loadings; each type of pressure is defined by its magnitude and direction at points on the buckled ring. Newton's method is applied to the nonlinear differential equations of the exact inextensional theory for the ring problem. A zeroth approximation for the solution of the nonlinear equations, based on the mode shape corresponding to the first buckling pressure, is derived in closed form for each of the four types of pressure. The zeroth approximation is used to start the iteration cycle in Newton's method to compute numerical solutions of the nonlinear equations. The zeroth approximations for the postbuckling pressure-deflection curves are compared with the converged solutions from Newton's method and with similar results reported in the literature.

Thurston, Gaylen A.↗
DOE OSTI2024

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗
DOE OSTI2025

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↗
NASA NTRS1983

Progress on a generalized coordinates tensor product finite element 3DPNS algorithm for subsonic

A generalized coordinates form of the penalty finite element algorithm for the 3-dimensional parabolic Navier-Stokes equations for turbulent subsonic flows was derived. This algorithm formulation requires only three distinct hypermatrices and is applicable using any boundary fitted coordinate transformation procedure. The tensor matrix product approximation to the Jacobian of the Newton linear algebra matrix statement was also derived. Tne Newton algorithm was restructured to replace large sparse matrix solution procedures with grid sweeping using alpha-block tridiagonal matrices, where alpha equals the number of dependent variables. Numerical experiments were conducted and the resultant data gives guidance on potentially preferred tensor product constructions for the penalty finite element 3DPNS algorithm.

Baker, A. J.↗
NASA NTRS1986

Rapid computation of chemical equilibrium composition - An application to hydrocarbon combustion

A scheme for rapidly computing the chemical equilibrium composition of hydrocarbon combustion products is derived. A set of ten governing equations is reduced to a single equation that is solved by the Newton iteration method. Computation speeds are approximately 80 times faster than the often used free-energy minimization method. The general approach also has application to many other chemical systems.

Erickson, W. D.↗
NASA NTRS1989

Advances in upwind relaxation methods

Numerical techniques for solving the compressible Euler and Navier-Stokes equations are discussed with an emphasis on characteristic-based schemes. Two popular approaches, flux difference splitting and flux vector splitting, are described in one-dimensional Cartesian coordinates and then extended to three-dimensional generalized coordinates. A technique for increasing the spatial accuracy is presented, followed by a discussion of numerical dissipation mechanisms. An introduction to the use of implicit time integration schemes for accelerating the convergence rate to steady-state solutions including Newton's method, relaxation strategies, and approximate factorization techniques and their implementation on a vector processor concludes the chapter.

Walters, R. W.↗
NASA NTRS1991

Implicit solvers for unstructured meshes

Implicit methods were developed and tested for unstructured mesh computations. The approximate system which arises from the Newton linearization of the nonlinear evolution operator is solved by using the preconditioned GMRES (Generalized Minimum Residual) technique. Three different preconditioners were studied, namely, the incomplete LU factorization (ILU), block diagonal factorization, and the symmetric successive over relaxation (SSOR). The preconditioners were optimized to have good vectorization properties. SSOR and ILU were also studied as iterative schemes. The various methods are compared over a wide range of problems. Ordering of the unknowns, which affects the convergence of these sparse matrix iterative methods, is also studied. Results are presented for inviscid and turbulent viscous calculations on single and multielement airfoil configurations using globally and adaptively generated meshes.

Venkatakrishnan, V.↗
NASA NTRS1996

The Newton Modified Barrier Method for QP Problems

The Modified Barrier Functions (MBF) have elements of both Classical Lagrangians (CL) and Classical Barrier Functions (CBF). The MBF methods find an unconstrained minimizer of some smooth barrier function in primal space and then update the Lagrange multipliers, while the barrier parameter either remains fixed or can be updated at each step. The numerical realization of the MBF method leads to the Newton MBF method, where the primal minimizer is found by using Newton's method. This minimizer is then used to update the Lagrange multipliers. In this paper, we examine the Newton MBF method for the Quadratic Programming (QP) problem. It will be shown that under standard second-order optimality conditions, there is a ball around the primal solution and a cut cone in the dual space such that for a set of Lagrange multipliers in this cut cone, the method converges quadratically to the primal minimizer from any point in the aforementioned ball, and continues to do so after each Lagrange multiplier update. The Lagrange multipliers remain within the cut cone and converge linearly to their optimal values. Any point in this ball will be called a "hot start". Starting at such a "hot start", at most Omicron(1n 1n epsilon(exp -1)) Newton steps are sufficient to perform the primal minimization which is necessary for the Lagrange multiplier update. Here, epsilon > 0 is the desired accuracy. Because of the linear convergence of the Lagrange multipliers, this means that only Omicron(1n epsilon(exp -1))omicron(ln 1n epsilon(exp-1)) Newton steps are required to reach an epsilon-approximation to the solution from any "hot start". In order to reach the "hot start", one has to perform Omicron(square root(m) 1n C) Newton steps, where m characterizes the size of the problem and C > 0 is the condition number of the QP problem. This condition number will be characterized explicitly in terms of key parameters of the QP problem, which in turn depend on the input data and the size of the problem.

Melman, A.↗