Search NASA⌕ Search

SEARCH · Search NASA

Results for “extrapolation 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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

Implicit Extrapolation Methods for Variable Coefficient Problems

Implicit extrapolation methods for the solution of partial differential equations are based on applying the extrapolation principle indirectly. Multigrid tau-extrapolation is a special case of this idea. In the context of multilevel finite element methods, an algorithm of this type can be used to raise the approximation order, even when the meshes are nonuniform or locally refined. Here previous results are generalized to the variable coefficient case and thus become applicable for nonlinear problems. The implicit extrapolation multigrid algorithm converges to the solution of a higher order finite element system. This is obtained without explicitly constructing higher order stiffness matrices but by applying extrapolation in a natural form within the algorithm. The algorithm requires only a small change of a basic low order multigrid method.

Jung, M.↗
NASA NTRS1988

Recursive algorithms for vector extrapolation methods

Three classes of recursion relations are devised for implementing some extrapolation methods for vector sequences. One class of recursion relations can be used to implement methods like the modified minimal polynomial extrapolation and the topological epsilon algorithm; another allows implementation of methods like minimal polynomial and reduced rank extrapolation; while the remaining class can be employed in the implementation of the vector E-algorithm. Operation counts and storage requirements for these methods are also discussed, and some related techniques for special applications are also presented. Included are methods for the rapid evaluations of the vector E-algorithm.

Ford, William F.↗
NASA NTRS1987

Extrapolation methods for vector sequences

This paper derives, describes, and compares five extrapolation methods for accelerating convergence of vector sequences or transforming divergent vector sequences to convergent ones. These methods are the scalar epsilon algorithm (SEA), vector epsilon algorithm (VEA), topological epsilon algorithm (TEA), minimal polynomial extrapolation (MPE), and reduced rank extrapolation (RRE). MPE and RRE are first derived and proven to give the exact solution for the right 'essential degree' k. Then, Brezinski's (1975) generalization of the Shanks-Schmidt transform is presented; the generalized form leads from systems of equations to TEA. The necessary connections are then made with SEA and VEA. The algorithms are extended to the nonlinear case by cycling, the error analysis for MPE and VEA is sketched, and the theoretical support for quadratic convergence is discussed. Strategies for practical implementation of the methods are considered.

Smith, David A.↗
NASA NTRS1992

The solution of coupled Schroedinger equations using an extrapolation method

In this paper, extrapolation to the limit in a finite-difference method is applied to solve a system of coupled Schroedinger equations. This combination results in a method that only requires knowledge of the potential energy functions for the system. This numerical procedure has several distinct advantages over the more conventional methods. Namely, initial guesses for the term values are not needed; assumptions need be made about the behavior of the wavefunctions, such as the slope or magnitude in the nonclassical region; and the algorithm is easy to implement, has a firm mathematical foundation, and provides error estimates. Moreover, the method is less sensitive to round-off error than other methods since a small number of mesh points is used and it can be implemented on small computers. A comparison of the method with another numerical method shows results agreeing within 1 part in 10 exp 4.

Goorvitch, D.↗
NASA NTRS1990

Efficient Implementation of Minimal Polynomial and Reduced Rank Extrapolation Methods

The minimal polynomial extrapolation (MPE) and reduced rank extrapolation (RRE) are two effective techniques that have been used in accelerating the convergence of vector sequences, such as those that are obtained from iterative solution of linear and nonlinear systems of equation. Their definitions involve some linear least squares problems, and this causes difficulties in their numerical implementation. Timewise efficient and numerically stable implementations for MPE and RRE are developed. A computer program written in FORTRAN 77 is also appended and applied to some model problems.

Sidi, Avram↗
NASA NTRS1987

Extrapolation methods for divergent oscillatory infinite integrals that are defined in the sense of summability

In a recent work by the author an extrapolation method, the W-transformation, was developed, by which a large class of oscillatory infinite integrals can be computed very efficiently. The results of this work are extended to a class of divergent oscillatory infinite integrals in the present paper. It is shown in particular that these divergent integrals exist in the sense of Abel summability and that the W-transformation can be applied to them without any modifications. Convergence results are stated and numerical examples given.

Sidi, Avram↗
NASA NTRS1978

Extrapolation methods for dynamic partial differential equations

Several extrapolation procedures are presented for increasing the order of accuracy in time for evolutionary partial differential equations. These formulas are based on finite difference schemes in both the spatial and temporal directions. On practical grounds the methods are restricted to schemes that are fourth order in time and either second, fourth or sixth order in space. For hyperbolic problems the second order in space methods are not useful while the fourth order methods offer no advantage over the Kreiss-Oliger method unless very fine meshes are used. Advantages are first achieved using sixth order methods in space coupled with fourth order accuracy in time. Computational results are presented confirming the analytic discussions.

Turkel, E.↗
NASA NTRS1992

Upper bounds for convergence rates of vector extrapolation methods on linear systems with initial iterations

The application of the minimal polynomial extrapolation (MPE) and the reduced rank extrapolation (RRE) to a vector sequence obtained by the linear iterative technique x(sub j) + 1 = Ax(sub j) = b,j = 1,2,..., is considered. Both methods produce a two dimensional array of approximations s(sub n,k) to the solution of the system (I - A)x = b. Here, s(sub n,k) is obtained from the vectors x(sub j), n is less than or equal to j is less than or equal to n + k + 1. It was observed in an earlier publication by the first author that the sequence s(sub n,k), k = 1,2,..., for n greater than 0, but fixed, possesses better convergence properties than the sequence s(sub 0,k), k = 1,2,.... A detailed theoretical explanation for this phenomenon is provided in the present work. This explanation is heavily based on approximations by incomplete polynomials. It is demonstrated by numerical examples when the matrix A is sparse that cycling with s(sub n,k) for n greater than 0, but fixed, produces better convergence rates and costs less computationally than cycling with s(sub 0,k). It is also illustrated numerically with a convection-diffusion problem that the former may produce excellent results where the latter may fail completely. As has been shown in an earlier publication, the results produced by s(sub 0,k) are identical to the corresponding results obtained by applying the Arnoldi method or generalized minimal residual scheme (GMRES) to the system (I - A)x = b.

Sidi, Avram↗
NASA NTRS1982

Radar prediction of absolute rain fade distributions for earth-satellite paths and general methods for extrapolation of fade statistics to other locations

The first absolute rain fade distribution method described establishes absolute fade statistics at a given site by means of a sampled radar data base. The second method extrapolates absolute fade statistics from one location to another, given simultaneously measured fade and rain rate statistics at the former. Both methods employ similar conditional fade statistic concepts and long term rain rate distributions. Probability deviations in the 2-19% range, with an 11% average, were obtained upon comparison of measured and predicted levels at given attenuations. The extrapolation of fade distributions to other locations at 28 GHz showed very good agreement with measured data at three sites located in the continental temperate region.

Goldhirsh, J.↗
NASA NTRS1992

A regularization method for extrapolation of solar potential magnetic fields

The mathematical basis of a Tikhonov regularization method for extrapolating the chromospheric-coronal magnetic field using photospheric vector magnetograms is discussed. The basic techniques show that the Cauchy initial value problem can be formulated for potential magnetic fields. The potential field analysis considers a set of linear, elliptic partial differential equations. It is found that, by introducing an appropriate smoothing of the initial data of the Cauchy potential problem, an approximate Fourier integral solution is found, and an upper bound to the error in the solution is derived. This specific regularization technique, which is a function of magnetograph measurement sensitivities, provides a method to extrapolate the potential magnetic field above an active region into the chromosphere and low corona.

Gary, G. A.↗
NASA NTRS1942

New method of extrapolation of the resistance of a model planing boat to full size

The previously employed method of extrapolating the total resistance to full size with lambda(exp 3) (model scale) and thereby foregoing a separate appraisal of the frictional resistance, was permissible for large models and floats of normal size. But faced with the ever increasing size of aircraft a reexamination of the problem of extrapolation to full size is called for. A method is described by means of which, on the basis of an analysis of tests on planing surfaces, the variation of the wetted surface over the take-off range is analytically obtained. The friction coefficients are read from Prandtl's curve for turbulent boundary layer with laminar approach. With these two values a correction for friction is obtainable.

Sottorf, W↗
NASA NTRS1974

Correaltion of full-scale drag predictions with flight measurements on the C-141A aircraft. Phase 2: Wind tunnel test, analysis, and prediction techniques. Volume 1: Drag predictions, wind tunnel data analysis and correlation

The degree of cruise drag correlation on the C-141A aircraft is determined between predictions based on wind tunnel test data, and flight test results. An analysis of wind tunnel tests on a 0.0275 scale model at Reynolds number up to 3.05 x 1 million/MAC is reported. Model support interference corrections are evaluated through a series of tests, and fully corrected model data are analyzed to provide details on model component interference factors. It is shown that predicted minimum profile drag for the complete configuration agrees within 0.75% of flight test data, using a wind tunnel extrapolation method based on flat plate skin friction and component shape factors. An alternative method of extrapolation, based on computed profile drag from a subsonic viscous theory, results in a prediction four percent lower than flight test data.

Macwilkinson, D. G.↗
NASA NTRS1950

Approximate Turbulent Boundary-Layer Development in Plane Compressible Flow Along Thermally Insulated Surfaces with Application to Supersonic-Tunnel Contour Correction

Numerical solutions of the differential equation obtained from the momentum theorem for the development of a turbulent boundary layer along a thermally insulated surface in two-dimensional and in radial shock-free flow are presented in tabular form for a range of Mach numbers from 0.100 to 10. The solution can be used in a step-wise procedure with any given distribution of favorable pressure gradients and for zero pressure gradients. Solutions are also given for use with moderate adverse pressure gradients. The mean velocity in the boundary layer is approximated by a power-law profile. In view of the stepwise integration methods to be used, the exponent designated the profile shape can be varied along the surface between the integral fraction limits 1/5 and 1/11 through interpolation. Agreement obtained between theoretical and experimental boundary-layer development in a supersonic nozzle at a nominal Mach number of 2 indicates the general validity of the approximations used in the analysis - in particular, the method of extrapolating low-speed skin-friction relations to high Mach number flows. The extrapolation method used assumes that the skin-friction coefficient depend primarily on Reynolds number, provided that the density and the kinematic viscosity are evaluated at surface conditions.

BOUNDARY LAYER - WIND TUNNEL WALLS↗
NASA NTRS1974

Comparison of numerical integration techniques for orbital applications

The present work gives a brief comparison of the performance of programs for integrating differential equations for orbital applications. The evaluation criteria and the method of testing are described, and the results of the test problem set are included. Integration methods that were chosen for comparison include high-order Runge-Kutta methods; a rational extrapolation method (Bulirsch and Stoer, 1966); a variable step, variable order, multistep method (Krogh, 1969); classical multistep methods of Adams and Cowell; and modified multistep methods. The high-order Runge-Kutta methods used in the comparison include RKF 7(8) and RKF 8(9) (Fehlberg, 1968), and RKS 8-10 (Shanks, 1966).

Moore, H.↗
NASA NTRS1999

Design and Computational/Experimental Analysis of Low Sonic Boom Configurations

Recent studies have shown that inviscid CFD codes combined with a planar extrapolation method give accurate sonic boom pressure signatures at distances greater than one body length from supersonic configurations if either adapted grids swept at the approximate Mach angle or very dense non-adapted grids are used. The validation of CFD for computing sonic boom pressure signatures provided the confidence needed to undertake the design of new supersonic transport configurations with low sonic boom characteristics. An aircraft synthesis code in combination with CFD and an extrapolation method were used to close the design. The principal configuration of this study is designated LBWT (Low Boom Wing Tail) and has a highly swept cranked arrow wing with conventional tails, and was designed to accommodate either 3 or 4 engines. The complete configuration including nacelles and boundary layer diverters was evaluated using the AIRPLANE code. This computer program solves the Euler equations on an unstructured tetrahedral mesh. Computations and wind tunnel data for the LBWT and two other low boom configurations designed at NASA Ames Research Center are presented. The two additional configurations are included to provide a basis for comparing the performance and sonic boom level of the LBWT with contemporary low boom designs and to give a broader experiment/CFD correlation study. The computational pressure signatures for the three configurations are contrasted with on-ground-track near-field experimental data from the NASA Ames 9x7 Foot Supersonic Wind Tunnel. Computed pressure signatures for the LBWT are also compared with experiment at approximately 15 degrees off ground track.

Cliff, Susan E.↗
NASA NTRS1999

Loss tolerant speech decoder for telecommunications

A method and device for extrapolating past signal-history data for insertion into missing data segments in order to conceal digital speech frame errors. The extrapolation method uses past-signal history that is stored in a buffer. The method is implemented with a device that utilizes a finite-impulse response (FIR) multi-layer feed-forward artificial neural network that is trained by back-propagation for one-step extrapolation of speech compression algorithm (SCA) parameters. Once a speech connection has been established, the speech compression algorithm device begins sending encoded speech frames. As the speech frames are received, they are decoded and converted back into speech signal voltages. During the normal decoding process, pre-processing of the required SCA parameters will occur and the results stored in the past-history buffer. If a speech frame is detected to be lost or in error, then extrapolation modules are executed and replacement SCA parameters are generated and sent as the parameters required by the SCA. In this way, the information transfer to the SCA is transparent, and the SCA processing continues as usual. The listener will not normally notice that a speech frame has been lost because of the smooth transition between the last-received, lost, and next-received speech frames.

Prieto, Jr., Jaime L.↗