Engineering Papers⌕ Search

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.

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

At least 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1971

Comparison of a discrete steepest ascent method with the continuous steepest ascent method for optimal programing

A discrete steepest ascent method which allows controls which are not piecewise constant (for example, it allows all continuous piecewise linear controls) was derived for the solution of optimal programming problems. This method is based on the continuous steepest ascent method of Bryson and Denham and new concepts introduced by Kelley and Denham in their development of compatible adjoints for taking into account the effects of numerical integration. The method is a generalization of the algorithm suggested by Canon, Cullum, and Polak with the details of the gradient computation given. The discrete method was compared with the continuous method for an aerodynamics problem for which an analytic solution is given by Pontryagin's maximum principle, and numerical results are presented. The discrete method converges more rapidly than the continuous method at first, but then for some undetermined reason, loses its exponential convergence rate. A comparsion was also made for the algorithm of Canon, Cullum, and Polak using piecewise constant controls. This algorithm is very competitive with the continuous algorithm.

Childs, A. G.↗
NASA NTRS1972

Convergence of oscillator spectral estimators for counted-frequency measurements.

A common intermediary connecting frequency-noise calibration or testing of an oscillator to useful applications is the spectral density of the frequency-deviating process. In attempting to turn test data into predicts of performance characteristics, one is naturally led to estimation of statistical values by sample-mean and sample-variance techniques. However, sample means and sample variances themselves are statistical quantities that do not necessarily converge (in the mean-square sense) to actual ensemble-average means and variances, except perhaps for excessively large sample sizes. This is especially true for the flicker noise component of oscillators. This article shows, for the various types of noises found in oscillators, how sample averages converge (or do not converge) to their statistical counterparts. The convergence rate is shown to be the same for all oscillators of a given spectral type.

Tausworthe, R. C.↗
NASA NTRS1975

Numerical analysis and parametric studies of the buckling of composite orthotropic compression and shear panels

A computer program is presented which was developed for the combined compression and shear of stiffened variable thickness orthotropic composite panels on discrete springs: boundary conditions are general and include elastic boundary restraints. Buckling solutions are obtained by using a newly developed trigonometric finite difference procedure which improves the solution convergence rate over conventional finite difference methods. The classical general shear buckling results which exist only for simply supported panels over a limited range of orthotropic properties, were extended to the complete range of these properties for simply supported panels and, in addition, to the complete range of orthotropic properties for clamped panels. The program was also applied to parametric studies which examine the effect of filament orientation upon the buckling of graphite-epoxy panels. These studies included an examination of the filament orientations which yield maximum shear or compressive buckling strength for panels having all four edges simply supported or clamped over a wide range of aspect ratios. Panels with such orientations had higher buckling loads than comparable, equal weight, thin skinned aluminum panels. Also included among the parameter studies were examinations of combined axial compression and shear buckling and examinations of panels with rotational elastic edge restraints.

Housner, J. M.↗
NASA NTRS1975

Application of boundary integral equations to elastoplastic problems

The application of the boundary integral equation method (BIE) to the elastoplastic torsion problem is considered. It is found that the BIE is very suitable for the elastoplastic analysis of the torsion of prismatic bars. A comparison of the BIE with the finite difference method shows savings for the BIE concerning the number of unknowns which have to be determined and also a much faster convergence rate. Attention is given to the problem of an edge-notched beam in pure bending, taking into account a biharmonic formulation and a displacement formulation.

Mendelson, A.↗
NASA NTRS1976

A block iterative finite element algorithm for numerical solution of the steady-state, compressible Navier-Stokes equations

An iterative method for numerically solving the time independent Navier-Stokes equations for viscous compressible flows is presented. The method is based upon partial application of the Gauss-Seidel principle in block form to the systems of nonlinear algebraic equations which arise in construction of finite element (Galerkin) models approximating solutions of fluid dynamic problems. The C deg-cubic element on triangles is employed for function approximation. Computational results for a free shear flow at Re = 1,000 indicate significant achievement of economy in iterative convergence rate over finite element and finite difference models which employ the customary time dependent equations and asymptotic time marching procedure to steady solution. Numerical results are in excellent agreement with those obtained for the same test problem employing time marching finite element and finite difference solution techniques.

Cooke, C. H.↗
NASA NTRS1976

An iterative procedure for obtaining maximum-likelihood estimates of the parameters for a mixture of normal distributions, 2

The problem of obtaining numerically maximum likelihood estimates of the parameters for a mixture of normal distributions is addressed. In recent literature, a certain successive approximations procedure, based on the likelihood equations, is shown empirically to be effective in numerically approximating such maximum-likelihood estimates; however, the reliability of this procedure was not established theoretically. Here, a general iterative procedure is introduced, of the generalized steepest-ascent (deflected-gradient) type, which is just the procedure known in the literature when the step-size is taken to be 1. With probability 1 as the sample size grows large, it is shown that this procedure converges locally to the strongly consistent maximum-likelihood estimate whenever the step-size lies between 0 and 2. The step-size which yields optimal local convergence rates for large samples is determined in a sense by the separation of the component normal densities and is bounded below by a number between 1 and 2.

Peters, B. C., Jr.↗
NASA NTRS1976

The numerical evaluation of maximum-likelihood estimates of the parameters for a mixture of normal distributions from partially identified samples

Likelihood equations determined by the two types of samples which are necessary conditions for a maximum-likelihood estimate are considered. These equations, suggest certain successive-approximations iterative procedures for obtaining maximum-likelihood estimates. These are generalized steepest ascent (deflected gradient) procedures. It is shown that, with probability 1 as N sub 0 approaches infinity (regardless of the relative sizes of N sub 0 and N sub 1, i=1,...,m), these procedures converge locally to the strongly consistent maximum-likelihood estimates whenever the step size is between 0 and 2. Furthermore, the value of the step size which yields optimal local convergence rates is bounded from below by a number which always lies between 1 and 2.

Walker, H. F.↗
NASA NTRS1977

A block iterative finite element algorithm for numerical solution of the steady-state, compressible Navier-Stokes equations

An iterative method for numerically solving the time independent Navier-Stokes equations for viscous compressible flows is presented. The method is based upon partial application of the Gauss-Seidel principle in block form to the systems of the nonlinear algebraic equations which arise in construction of finite element (Galerkin) models approximating solutions of fluid dynamic problems. The continuous cubic element on triangles is employed for function approximation. Computational results for a free shear flow at Re = 1000 indicate significant achievement of economy in iterative convergence rate over finite element and finite difference models which employ the customary time dependent equations and symptotic time marching procedure to steady solution. Numerical results are in excellent agreement with those obtained for the same test problem employing time marching finite element and finite difference solution techniques.

Cooke, C. H.↗
NASA NTRS1978

An iterative procedure for obtaining maximum-likelihood estimates of the parameters for a mixture of normal distributions

This paper addresses the problem of obtaining numerically maximum-likelihood estimates of the parameters for a mixture of normal distributions. In recent literature, a certain successive-approximations procedure, based on the likelihood equations, was shown empirically to be effective in numerically approximating such maximum-likelihood estimates; however, the reliability of this procedure was not established theoretically. Here, we introduce a general iterative procedure, of the generalized steepest-ascent (deflected-gradient) type, which is just the procedure known in the literature when the step-size is taken to be 1. We show that, with probability 1 as the sample size grows large, this procedure converges locally to the strongly consistent maximum-likelihood estimate whenever the step-size lies between 0 and 2. We also show that the step-size which yields optimal local convergence rates for large samples is determined in a sense by the 'separation' of the component normal densities and is bounded below by a number between 1 and 2.

Peters, B. C., Jr.↗
NASA NTRS1979

Fast, conservative schemes for the full potential equation applied to transonic flows

Implicit approximate factorization techniques (AF) are investigated for the solution of matrix equations resulting from finite-difference approximations to the full potential equation in conservation form. For transonic flows, an artificial viscosity, required to maintain stability in supersonic regions, is introduced by an upwind bias of the density. Two implicit AF procedures are presented, and their convergence performance is compared with that of the standard transonic solution procedure: successive line overrelaxation (SLOR). Subcritical and supercritical test cases are considered. Results indicate a substantial improvement in convergence rate for AF schemes relative to SLOR.

Holst, T. L.↗
NASA NTRS1979

Vector processor algorithms for transonic flow calculations

This paper discusses a number of algorithms for solving the transonic full-potential equation in conservative form on a vector computer, such as the CDC STAR-100 or the CRAY-1. Recent research with the 'artificial density' method for transonics has led to development of some new iteration schemes which take advantage of vector-computer architecture without suffering significant loss of convergence rate. Several of these more promising schemes are described and 2-D and 3-D results are shown comparing the computational rates on the STAR and CRAY vector computers, and the CYBER-175 serial computer. Schemes included are: (1) Checkerboard SOR, (2) Checkerboard Leapfrog, (3) odd-even vertical line SOR, and (4) odd-even horizontal line SOR.

South, J. C., Jr.↗
NASA NTRS1978

Application of a trigonometric finite difference procedure to numerical analysis of compressive and shear buckling of orthotropic panels

A numerical analysis developed for the buckling of rectangular orthotropic layered panels under combined shear and compression is described. This analysis uses a central finite difference procedure based on trigonometric functions instead of using the conventional finite differences which are based on polynomial functions. Inasmuch as the buckle mode shape is usually trigonometric in nature, the analysis using trigonometric finite differences can be made to exhibit a much faster convergence rate than that using conventional differences. Also, the trigonometric finite difference procedure leads to difference equations having the same form as conventional finite differences; thereby allowing available conventional finite difference formulations to be converted readily to trigonometric form. For two-dimensional problems, the procedure introduces two numerical parameters into the analysis. Engineering approaches for the selection of these parameters are presented and the analysis procedure is demonstrated by application to several isotropic and orthotropic panel buckling problems. Among these problems is the shear buckling of stiffened isotropic and filamentary composite panels in which the stiffener is broken. Results indicate that a break may degrade the effect of the stiffener to the extent that the panel will not carry much more load than if the stiffener were absent.

Stein, M.↗
NASA NTRS1980

WIND: Computer program for calculation of three dimensional potential compressible flow about wind turbine rotor blades

A computer program is presented which numerically solves an exact, full potential equation (FPE) for three dimensional, steady, inviscid flow through an isolated wind turbine rotor. The program automatically generates a three dimensional, boundary conforming grid and iteratively solves the FPE while fully accounting for both the rotating cascade and Coriolis effects. The numerical techniques incorporated involve rotated, type dependent finite differencing, a finite volume method, artificial viscosity in conservative form, and a successive line overrelaxation combined with the sequential grid refinement procedure to accelerate the iterative convergence rate. Consequently, the WIND program is capable of accurately analyzing incompressible and compressible flows, including those that are locally transonic and terminated by weak shocks. The program can also be used to analyze the flow around isolated aircraft propellers and helicopter rotors in hover as long as the total relative Mach number of the oncoming flow is subsonic.

Dulikravich, D. S.↗
NASA NTRS1981

Numerical Boundary Condition Procedures

Topics include numerical procedures for treating inflow and outflow boundaries, steady and unsteady discontinuous surfaces, far field boundaries, and multiblock grids. In addition, the effects of numerical boundary approximations on stability, accuracy, and convergence rate of the numerical solution are discussed.

Source record↗
NASA NTRS1981

Accelerated convergence of structured banded systems using constrained corrections

An efficient iterative method for solving a structured banded system of equations is described. The method was developed for a full potential flow program and uses a basic interation step, a dynamic relation step, and a multigrid concept of constraining iterative corrections. The solution of a large linear system of equations is examined. Efficient iterative methods have become attractive for large problems. In the nonlinear cases, these iterations may be effectively merged to improve convergence rates.

Kneile, K.↗
NASA NTRS1981

Implicit calculations of transonic flows using monotone methods

Implicit approximate-factorization algorithms have been developed that use monotone methods for the calculation of steady and unsteady transonic flows governed by the small-disturbance-potential equation. These algorithms use the new Engquist-Osher switch in the type-dependent differencing in place of the standard Murman-Cole switch. The resulting algorithms are more stable; hence, calculations can be done more efficiently. For steady flows, the convergence rate is about 35% faster, and for unsteady flows the allowable time step is about 10 times larger. These improvements are achieved with no increase in computer storage and with only minor modifications in codes that use the Murman-Cole switch. Also an implicit algorithm has been developed for the steady full-potential equation in one-dimension, which uses monotone methods.

Goorjian, P. M.↗
NASA NTRS1980

An implicit algorithm for the transonic full-potential equation in conservative form

A fast, implicit approximate factorization algorithm for the solution of the conservative full-potential equation for transonic flow in two and three dimensions is presented. Stability in supersonic regions is maintained by the use of an upwind evaluation of the density coefficient along all coordinate directions, providing an effective upwind difference of the streamwise terms for any orientation of the velocity vector and thereby enhancing the reliability of the algorithm. The algorithm is shown to provide rapid convergence for the computation of certain difficult two-dimensional test cases, including cases with fishtail shock patterns, demonstrating the reliability and efficiency of the procedure. Surface pressure coefficient distributions obtained by the present method are also found to be in good agreement with those computed by successive-line overrelaxation and a hybrid direct-solver/successive-line overrelaxation scheme, with significant reductions in CPU time required. A three-dimensional solution for a swept wing mounted between parallel walls is also presented which demonstrates the high convergence rate of the algorithm in three dimensions as well as two.

Holst, T.↗