Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical differentiation”

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 NTRS1998

Numerical Differentiation for Adaptively Refined Finite Element Meshes

Postprocessing of point-wise data is a fundamental process in many fields of research. Numerical differentiation is a key operation in computational electromagnetics. In the case of data obtained from a finite element method with automatic mesh refinement much work needs still to be done. This paper addresses some issues in differentiating data obtained from a finite element electromagnetic code with adaptive mesh refinement, and it proposes a methodology for deriving the electric field given the magnetic field on a mesh of linear triangular elements. The procedure itself is nevertheless more general and might be extended for numerically differentiating any point-wise solution based on triangular meshes.

Borgioli, Andrea↗
NASA NTRS1969

Numerical solutions of differential equations

Various numerical methods for solving differential equations were analyzed and refined in an effort to develop a method which was adaptable to a large class of problems. The prime capabilities of the method included accuracy, numerical stability, and economic use of computer time. In multistep processes the corrector was changed at each step.

Wesson, J. R.↗
NASA NTRS1992

Numerical Asymptotic Solutions Of Differential Equations

Numerical algorithms derived and compared with classical analytical methods. In method, expansions replaced with integrals evaluated numerically. Resulting numerical solutions retain linear independence, main advantage of asymptotic solutions.

Thurston, Gaylen A.↗
NASA NTRS1974

Changing stepsize in the integration of differential equations using modified divided differences

Multistep methods for solving differential equations based on numerical integration formulas or numerical differentiation formulas (for stiff equations) require special provision for changing the stepsize. New algorithms are given which make the use of modified divided differences an attractive way to carry out the change in stepsize for such methods. Error estimation and some of the important factors in stepsize selection and the selection of integration order are also considered.

Krogh, F. T.↗
NASA NTRS1985

Differentiating matrices for arbitrarily spaced grid points

Differentiating matrices allow the numerical differentiation of functions defined at points of a discrete grid. A type of differentiating matrix based on local approximation on a sequence of sliding subgrids is considered. Previous derivations of this type of matrix have been restricted to grids with uniformly spaced points, and the resulting derivative approximations have lacked precision, especially at endpoints. The new formulation allows grids which have arbitrarily space points. It is shown that high accuracy can be achieved through use of differentiating matrices on non-uniform grids which include near-boundary points. Use of the differentiating matrix as an operator to solve eigenvalue problems involving ordinary differential equations is also considered.

Lakin, W. D.↗
NASA NTRS1986

Differentiating matrices for arbitrarily spaced grid points

Differentiating matrices allow the numerical differentiation of functions defined at points of a discrete grid. Previous derivations of these matrices have been restricted to grids with uniformly spaced points, and the resulting derivative approximations have lacked precision, especially at endpoints. The present work derives differentiating matrices on grids with arbitrarily spaced points. It is shown that high accuracy can be achieved through use of differentiating matrices on non-uniform grids through the expedient of including 'near boundary' points. Use of the differentiating matrix as an operator in the solution of problems involving ordinary differential equations is also considered.

Lakin, W. D.↗
NASA NTRS1989

Recursive linearization of multibody dynamics equations of motion

The equations of motion of a multibody system are nonlinear in nature, and thus pose a difficult problem in linear control design. One approach is to have a first-order approximation through the numerical perturbations at a given configuration, and to design a control law based on the linearized model. Here, a linearized model is generated analytically by following the footsteps of the recursive derivation of the equations of motion. The equations of motion are first written in a Newton-Euler form, which is systematic and easy to construct; then, they are transformed into a relative coordinate representation, which is more efficient in computation. A new computational method for linearization is obtained by applying a series of first-order analytical approximations to the recursive kinematic relationships. The method has proved to be computationally more efficient because of its recursive nature. It has also turned out to be more accurate because of the fact that analytical perturbation circumvents numerical differentiation and other associated numerical operations that may accumulate computational error, thus requiring only analytical operations of matrices and vectors. The power of the proposed linearization algorithm is demonstrated, in comparison to a numerical perturbation method, with a two-link manipulator and a seven degrees of freedom robotic manipulator. Its application to control design is also demonstrated.

Lin, Tsung-Chieh↗
NASA NTRS1973

On the stability of numerical integration routines for ordinary differential equations.

Numerical integration methods for the solution of initial value problems for ordinary vector differential equations may be modelled as discrete time feedback systems. The stability criteria discovered in modern control theory are applied to these systems and criteria involving the routine, the step size and the differential equation are derived. Linear multistep, Runge-Kutta, and predictor-corrector methods are all investigated.

Glover, K.↗
NASA NTRS2005

Multi-reference evaluation of uncertainty in earth orientation parameter measurements

Uncertainties in polar motion and length-of-day measurements are evaluated empirically using several data series from the space-geodetic techniques of the global positioning system (GPS), satellite laser ranging (SLR), and very long baseline interferometry (VLBI) during 1997-2002. In the evaluation procedure employed here, known as the three-corner hat (TCH) technique, the signal common to each series is eliminated by forming pair-wise differences between the series, thus requiring no assumed values for the 'truth' signal. From the variances of the differenced series, the uncertainty of each series can be recovered when reasonable assumptions are made about the correlations between the series. In order to form the pair-wise differences, the series data must be given at the same epoch. All measurement data sets studied here were sampled at noon (UTC); except for the VLBI series, whose data are interpolated to noon and whose UT1 values are also numerically differentiated to obtain LOD. The numerical error introduced to the VLBI values by the interpolation and differentiation is shown to be comparable in magnitude to the values determined by the TCH method for the uncertainties of the VLBI series. The TCH estimates for the VLBI series are corrupted by such numerical errors mostly as a result of the relatively large data intervals. Of the remaining data sets studied here, it is found that the IGS Final combined series has the smallest polar motion and length-of-day uncertainties.

Combination↗