SEARCH · Engineering Papers

Results for “convergence rate”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 523 records · Page 29

All sources NASA NTRS DOE OSTI

NASA NTRS1995

A vehicle health monitoring system for the Space Shuttle Reaction Control System during reentry

A general two tier framework for vehicle health monitoring of Guidance Navigation and Control (GN&C) system actuators, effectors, and propulsion devices is presented. In this context, a top level monitor that estimates jet thrust is designed for the Space Shuttle Reaction Control System (RCS) during the reentry phase of flight. Issues of importance for the use of estimation technologies in vehicle health monitoring are investigated and quantified for the Shuttle RCS demonstration application. These issues include rate of convergence, robustness to unmodeled dynamics, sensor quality, sensor data rates, and information recording objectives. Closed loop simulations indicate that a Kalman filter design is sensitive to modeling error and robust estimators may reduce this sensitivity. Jet plume interaction with the aerodynamic flowfield is shown to be a significant effect adversely impacting the ability to accurately estimate thrust.

Rosello, Anthony David↗

NASA NTRS1971

A stochastic constrained optimization technique and its application to detector array processing.

A stochastic projected gradient algorithm is proposed which can be used for finding a constrained optimum point for a concave or convex objective function subject to nonlinear constraints which form a connected region even when only a noisy estimate of the objective function is available. For a constraint described by a single linear equation, convergence to the constrained optimum value is proved, and the rate of convergence of the algorithm to the constrained optimum value is determined. The algorithm is applied to the nonlinear problem of obtaining automatically an array of detectors which forms a beam in a desired direction in space in the presence of interfering noise so as to maximize the SNR subject to a constraint on the super-gain ratio.

Winkler, L. P.↗

NASA NTRS1989

Euler procedure for three-dimensional transonic wall interference

Based on an optimization formulation, a procedure has been developed to evaluate Mach number and angle-of-attack corrections. The Euler equations are assumed to be the flow governing equations. To obtain efficient solutions for the optimization problem, the iterative solutions for the flow variables and the design parameters are simultaneously updated. In addition to the model lift and geometry, the procedure requires pressure measurements near the tunnel walls. The tunnel boundary conditions are based on the introduction of Reimann invariants for a one-dimensional flow normal to the boundary. Computations are performed to verify that the errors introduced by this approximate boundary-condition formulation are acceptably small. The correction scheme is applied to an aircraft configuration in an open jet. The results indicate that the optimization scheme is highly efficient with the rate of convergence of the flow solution nearly equal to the corresponding rate of a regular analysis problem.

Rizk, Magdi H.↗

DOE OSTI2021

A deterministic verification strategy for electrostatic particle-in-cell algorithms in arbitrary spatial dimensions using the method of manufactured solutions

As simulations of kinetic plasmas continue to increase in scope and complexity, a rigorous and straightforward method for verifying particle-in-cell (PIC) implementations is necessary to ensure their correctness. Here, in this paper, we present a deterministic method for the rigorous verification of multidimensional, multispecies, electrostatic particle-in-cell codes based on the method of manufactured solutions. Specifically, we prove that rigorous verification is possible through the exclusive examination of errors of grid quantities (i.e., moments and/or fields), allowing for a very light-weight and non-intrusive implementation in existing PIC codes. This is a marked improvement over earlier PIC verification approaches (only demonstrated with one species in 1D-1V), which rely on the comparison of cumulative distribution functions, and are invasive on the code base, introduce additional stochastic noise, are significantly more computationally expensive, and lack rigorous convergence properties. Interestingly, we show that different grid quantities feature different rates of convergence with the number of particles and mesh size, impacting the verification process. These theoretical results are confirmed numerically with a multi-species 2D-2V particle-in-cell code, including the ability of the method to detect order reduction due to an incorrect implementation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1973

A dual method for optimal control problems with initial and final boundary constraints.

This paper presents two new algorithms belonging to the family of dual methods of centers. The first can be used for solving fixed time optimal control problems with inequality constraints on the initial and terminal states. The second one can be used for solving fixed time optimal control problems with inequality constraints on the initial and terminal states and with affine instantaneous inequality constraints on the control. Convergence is established for both algorithms. Qualitative reasoning indicates that the rate of convergence is linear.

Pironneau, O.↗

NASA NTRS1993

The piecewise-linear predictor-corrector code - A Lagrangian-remap method for astrophysical flows

We describe a time-explicit finite-difference algorithm for solving the nonlinear fluid equations. The method is similar to existing Eulerian schemes in its use of operator-splitting and artificial viscosity, except that we solve the Lagrangian equations of motion with a predictor-corrector and then remap onto a fixed Eulerian grid. The remap is formulated to eliminate errors associated with coordinate singularities, with a general prescription for remaps of arbitrary order. We perform a comprehensive series of tests on standard problems. Self-convergence tests show that the code has a second-order rate of convergence in smooth, two-dimensional flow, with pressure forces, gravity, and curvilinear geometry included. While not as accurate on idealized problems as high-order Riemann-solving schemes, the predictor-corrector Lagrangian-remap code has great flexibility for application to a variety of astrophysical problems.

Lufkin, Eric A.↗

NASA NTRS2001

Global Discrete Artificial Boundary Conditions for Time-Dependent Wave Propagation

We construct global artificial boundary conditions (ABCs) for the numerical simulation of wave processes on unbounded domains using a special non-deteriorating algorithm that has been developed previously for the long-term computation of wave-radiation solutions. The ABCs are obtained directly for the discrete formulation of the problem; in so doing, neither a rational approximation of 'non-reflecting kernels,' nor discretization of the continuous boundary conditions is required. The extent of temporal nonlocality of the new ABCs appears fixed and limited; in addition, the ABCs can handle artificial boundaries of irregular shape on regular grids with no fitting/adaptation needed and no accuracy loss induced. The non-deteriorating algorithm, which is the core of the new ABCs is inherently three-dimensional, it guarantees temporally uniform grid convergence of the solution driven by a continuously operating source on arbitrarily long time intervals, and provides unimprovable linear computational complexity with respect to the grid dimension. The algorithm is based on the presence of lacunae, i.e., aft fronts of the waves, in wave-type solutions in odd-dimension spaces, It can, in fact, be built as a modification on top of any consistent and stable finite-difference scheme, making its grid convergence uniform in time and at the same time keeping the rate of convergence the same as that of the non-modified scheme. In the paper, we delineate the construction of the global lacunae-based ABCs in the framework of a discretized wave equation. The ABCs are obtained for the most general formulation of the problem that involves radiation of waves by moving sources (e.g., radiation of acoustic waves by a maneuvering aircraft). We also present systematic numerical results that corroborate the theoretical design properties of the ABCs' algorithm.

Ryabenkii, V. S.↗

DOE OSTI2021

A Privacy-Preserving Distributed Control of Optimal Power Flow

Here, we consider a distributed optimal power flow formulated as an optimization problem that maximizes a nondifferentiable concave function. Solving such a problem by the existing distributed algorithms can lead to data privacy issues because the solution information exchanged within the algorithms can be utilized by an adversary to infer the data. To preserve data privacy, in this paper we propose a differentially private projected subgradient (DP-PS) algorithm that includes a solution encryption step. We show that a sequence generated by DP-PS converges in expectation, in probability, and with probability 1. Moreover, we show that the rate of convergence in expectation is affected by a target privacy level of DP-PS chosen by the user. We conduct numerical experiments that demonstrate the convergence and data privacy preservation of DP-PS.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1972

Adaptive nonlinear optimization of the signal-to-noise ratio of an array subject to a constraint.

Investigation of a stochastic projected gradient algorithm which can be used to find a constrained optimum point for a concave or convex objective function subject to nonlinear constraints. When the constraint consists of only one linear equation, convergence to the constrained optimum value is proven, and bounds are obtained for the rate of convergence of the algorithm to the constrained optimum value. This algorithm is then applied to the nonlinear problem of automatically making an array of detectors form a beam in a desired direction in space when unknown interfering noise is present so as to maximize the signal-to-noise ratio subject to a constraint on the supergain ratio.

Winkler, L. P.↗

DOE OSTI2024

Newton-Raphson AC Power Flow Convergence Based on Deep Learning Initialization and Homotopy Continuation

Power flow forms the basis of many power system studies. With the increased penetration of renewable energy, grid planners tend to perform multiple power flow simulations under various operating conditions and not just selected snapshots at peak or light load conditions. Getting a converged AC power flow (ACPF) case remains a significant challenge for grid planners especially in large power grid networks. This paper proposes a two-stage approach to improve Newton-Raphson ACPF convergence and was applied to a 6102 bus Electric Reliability Council of Texas (ERCOT) system. The first stage utilizes a deep learning-based initializer with data re-training. Here a deep neural network (DNN) initializer is developed to provide better initial voltage magnitude and angle guesses to aid in power flow convergence. This is because Newton-Raphson ACPF is quite sensitive to the initial conditions and bad initialization could lead to divergence. The DNN initializer includes a data re-training framework that improves the initializer's performance when faced with limited training data. The DNN initializer successfully solved 3,285 cases out of 3,899 non-converging dispatch and performed better than random forest and DC power flow initialization methods. ACPF cases not solved in this first stage are then passed through a hot-starting algorithm based on homotopy continuation with switched shunt control. The hot-starting algorithm successfully converged 416 cases out of the remaining 614 non-converging ACPF dispatch. In conclusion, the combined two-stage approach achieved a 94.9% success rate, by converging a total of 3,701 cases out of the initial 3,899 unsolved cases.

Deep learning↗

DOE OSTI2021

Convergence of Eigenvector Continuation

Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to selected training values of the control parameters. The method has proven to be very efficient and accurate for interpolating and extrapolating eigenvectors. However, almost nothing is known about how the method converges, and its rapid convergence properties have remained mysterious. In this Letter, we present the first study of the convergence of eigenvector continuation. In order to perform the mathematical analysis, we introduce a new variant of eigenvector continuation that we call vector continuation. We first prove that eigenvector continuation and vector continuation have identical convergence properties and then analyze the convergence of vector continuation. Our analysis shows that, in general, eigenvector continuation converges more rapidly than perturbation theory. The faster convergence is achieved by eliminating a phenomenon that we call differential folding, the interference between nonorthogonal vectors appearing at different orders in perturbation theory. From our analysis we can predict how eigenvector continuation converges both inside and outside the radius of convergence of perturbation theory. Further, while eigenvector continuation is a nonperturbative method, we show that its rate of convergence can be deduced from power series expansions of the eigenvectors. Our results also yield new insights into the nature of divergences in perturbation theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

On nonlocal problems with Neumann boundary conditions: scaling and convergence for nonlocal operators and solutions

Formulations of Neumann-type boundary conditions for boundary value problems in the nonlocal framework are beset with difficulties, some related to the choice of a proper scaling. Here we identify a space-dependent scaling for a nonlocal Neumann operator, for which we prove linear in δ (δ being the radius for the support for the kernel) convergence of the Neumann operator and $\mathcal{O}$(δ 2 ) convergence of solutions to their classical counterparts. The pointwise-like convergence of the nonlocal normal operator is cast as a new type of two-scale operator-point convergence, which we call condensated convergence . The results hold for general integrable kernels, a setting which is favored in numerical simulations. We support this analysis with numerical convergence studies using a piecewise linear discontinuous Galerkin discretization and show an $\mathcal{O}$(δ 2 ) rate of convergence of solutions, also exhibiting an $\mathcal{O}$(h 2 ) convergence, where h is the mesh size.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1981

The stability of pseudospectral-Chebyshev methods

The pseudospectral-Chebyshev methods are shown to be convergent in variable coefficient problems and, in some cases, hyperbolic problems. The analysis demonstrates that the rate of convergence is greater for finite difference methods or the finite element method. For a single first-order hyperbolic equation, the method is seen as remaining stable even when the coefficient changes sign, although in this case it is specified that care must be taken to have adequate spatial resolution. It is noted that this fact, combined with the fact that collocation methods are easy to apply in the nonlinear case, shows that the pseudospectral method is in general preferable to the Galerkin or Tau methods.

Gottlieb, D.↗

NASA NTRS1985

Convergence to steady state of solutions of Burgers' equation

Consider the initial boundary value problem for Burgers' equation. It is shown that its solutions converge, in time, to a unique steady state. The speed of the convergence depends on the boundary conditions and can be exponentially slow. Methods to speed up the rate of convergence are also discussed.

Kreiss, G.↗

NASA NTRS1974

Transverse vibrations of non-uniform beams

The free vibrations of elastic beams with nonuniform characteristics are investigated theoretically by a new method. The new method is seen to combine the advantages of a finite element approach and of a Rayleigh-Ritz analysis. Comparison with the known analytical results for uniform beams shows good convergence of the method for natural frequencies and modes. For internal shear forces and bending moments, the rate of convergence is less rapid. Results from experiments conducted with a cantilevered helicopter blade with strong nonuniformities and also from alternative theoretical methods, indicate that the theory adequately predicts natural frequencies and mode shapes. General guidelines for efficient use of the method are presented.

Klein, L.↗

NASA NTRS1982

Power series expansions for the frequency and period of the limit cycle of the van der Pol equation

An equation reported by van der Pol (1926) in connection with relaxation-oscillations studies is considered. The equation contains the factor epsilon which can assume values in the range from zero to infinity. The period T(epsilon), or equivalently the frequency nu(epsilon) of the limit cycle has been studied. However, to date there has been little success in discovering the analytical structure of T(epsilon) as a function of epsilon. The present investigation has the objectives to present the Taylor series expansion of nu(epsilon), to locate the singularities which determine the radius of convergence of that expansion, to introduce a new damping variable in terms of which the expansion converges for all epsilon, to form a new expansion for the period T(epsilon) which improves the rate of convergence of the series, to attempt to 'complete' the series, and to compare the obtained results with the numerically determined values of T(epsilon) and with the asymptotic approximation valid for large epsilon.

Andersen, C. M.↗

NASA NTRS1986

Application of a Runge-Kutta scheme for high-speed inviscid internal flows

A multi-stage Runge-Kutta method is analyzed for solving the two-dimensional Euler equations for external and internal flow problems. Subsonic, supersonic and, highly supersonic flows are studied. Various techniques for accelerating the convergence to a steady state are described and analyzed. Effects of the grid aspect ratio on the rate of convergence are evaluated. An enthalpy damping technique applicable to supersonic flows is described in detail. Numerical results for supersonic flows containing both oblique and normal shocks are presented confirming the efficiency of the method.

Moitra, A.↗

NASA NTRS1986

Application of Runge-Kutta scheme for high-speed inviscid internal flows

Moitra, A.↗