Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “least square approximations”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1977

Geodetic linear estimation technique and the norm choice problem

In this work the mathematical and probabilistic background of standard linear estimation techniques used in geodesy is clarified, and their interrelationship is revealed with the help of best approximation theory and the normal equations. Emphasis is given to the separation of the deterministic solution to the approximation problem from the probabilistic justification of the metric of the approximation. Least squares prediction has been related to deterministic (exact) collocation, and minimum error bound has been identified as a prediction optimality criterion in the latter. Criteria for the optimal choice of norm in Hilbert space collocation are proposed for gravimetric geodesy problems.

Dermanis, A.↗
NASA NTRS1978

ORACLS: A system for linear-quadratic-Gaussian control law design

A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

Armstrong, E. S.↗
NASA NTRS1982

On the geodetic applications of simultaneous range-differencing to LAGEOS

The possibility of improving the accuracy of geodetic results by use of simultaneously observed ranges to Lageos, in a differencing mode, from pairs of stations was studied. Simulation tests show that model errors can be effectively minimized by simultaneous range differencing (SRD) for a rather broad class of network satellite pass configurations. The methods of least squares approximation are compared with monomials and Chebyshev polynomials and the cubic spline interpolation. Analysis of three types of orbital biases (radial, along- and across track) shows that radial biases are the ones most efficiently minimized in the SRC mode. The degree to which the other two can be minimized depends on the type of parameters under estimation and the geometry of the problem. Sensitivity analyses of the SRD observation show that for baseline length estimations the most useful data are those collected in a direction parallel to the baseline and at a low elevation. Estimating individual baseline lengths with respect to an assumed but fixed orbit not only decreases the cost, but it further reduces the effects of model biases on the results as opposed to a network solution. Analogous results and conclusions are obtained for the estimates of the coordinates of the pole.

Pablis, E. C.↗
NASA NTRS1982

Automatic evaluation of interferograms

A system for the evaluation of interference patterns was developed. For digitizing and processing of the interferograms from classical and holographic interferometers a picture analysis system based upon a computer with a television digitizer was installed. Depending on the quality of the interferograms, four different picture enhancement operations may be used: Signal averaging; spatial smoothing, subtraction of the overlayed intensity function and the removal of distortion-patterns using a spatial filtering technique in the frequency spectrum of the interferograms. The extraction of fringe loci from the digitized interferograms is performed by a foating-threshold method. The fringes are numbered using a special scheme after the removal of any fringe disconnections which appeared if there was insufficient contrast in the holograms. The reconstruction of the object function from the fringe field uses least squares approximation with spline fit. Applications are given.

Becker, F.↗
NASA NTRS1986

Well-posedness of one-way wave equations and absorbing boundary conditions

The one-way wave equations occurring in geophysics, underwater acoustics, and numerical studies involving absorbing boundary conditions are characterized analytically. The conditions under which such equations are well posed are obtained by examining the rational functions used to reduce them. Results are presented for Chebyshev, Pade, least-squares, and symmetric least-squares approximations.

Trefethen, Lloyd N.↗
NASA NTRS1992

A variational method for finite element stress recovery: Applications in one-dimension

It is well-known that stresses (and strains) calculated by a displacement-based finite element analysis are generally not as accurate as the displacements. In addition, the calculated stress field is typically discontinuous at element interfaces. Because the stresses are typically of more interest than the displacements, several procedures have been proposed to obtain a smooth stress field, given the finite element stresses, and to improve the accuracy. Hinton and Irons introduced global least squares smoothing of discrete data defined on a plane using a finite element formulation. Tessler and co-workers recently developed a conceptually similar formulation for smoothing of two-dimensional data based on a discrete least square approximation with a penalty constraint. The penalty constraint results in a stress field which is C(exp 1)-continuous, a result not previously obtained. The approach requires additional, 'smoothing' finite element analysis and for their two-dimensional application, they used a conforming C(exp 0)-continuous triangular finite element based on a conforming plate element. This paper presents the results of a detailed investigation into the application of Tessler's smoothing procedure to the smoothing of finite element stresses from one-dimensional problems. Although the one-dimensional formulation has some practical applicability, such as in truss, beam, axisymmetric mechanics, and one-dimensional heat conduction, the primary motivation for developing the one-dimensional smoothing case is to explore the characteristics of the general smoothing strategy. In particular, it is used to describe the behavior of the method and to explore the suitability of criteria proposed for the smoothing analysis. Prior to presenting numerical results, the variational formulation of the smoothing strategy is presented and a criterion for the smoothing analysis is described.

Riggs, H. Ronald↗
NASA NTRS1986

Efficient identification of critical stresses in structures subject to dynamic loads

Optimum structural design problems generally employ constraints which are parametric in terms of space and time variables. A parametric constraint may be replaced by equivalent critical point constraints at its local minima for optimization applications. In complex structures, accurate identification of such critical points is computationally expensive due to the cost of finite element analyses. Three techniques are described for efficiently and accurately identifying critical points for space- and time-dependent parametric constraints. An adaptive search technique and a spline interpolation technique are developed for exactly known response. A least squares spline approximation is suggested for noisy behavior. A helicopter tail-boom structure subjected to transient loading is used as an example to demonstrate the techniques described. All three techniques are shown to be computationally efficient for critical point identification and the least squares approximation also removes noise from the data. The case of multiple constraints per element is shown to be particularly suited to the use of spline techniques.

Haftka, R. T.↗
DOE OSTI2025

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1972

The least squares process of MEDIA for computing DRVID calibration polynomials

A process is described and evaluated for computing a least squares polynomial approximation of data points in which the optimum degree of the polynomial is automatically determined. An iterative smoothing technique is used to replace every point with the value taken on by a moving least squares polynomial computed from a subset of points centered at the point to be replaced. The optimum degree of the resulting polynomial approximation is determined by analyzing the finite differences of each successive set of smoothed points. To evaluate the process, both artificially constructed data and actual Mariner Mars 1971 (MM'71) tracking data are used. This process was incorporated into a transmission media calibration computer program (MEDIA), which calibrates radiometric data to overcome the effects on the tracking signal of charged particle media. MEDIA was used in support of MM'71.

Leavitt, R. K.↗
NASA NTRS1992

Essentially nonoscillatory postprocessing filtering methods

High order accurate centered flux approximations used in the computation of numerical solutions to nonlinear partial differential equations produce large oscillations in regions of sharp transitions. Here, we present a new class of filtering methods denoted by Essentially Nonoscillatory Least Squares (ENOLS), which constructs an upgraded filtered solution that is close to the physically correct weak solution of the original evolution equation. Our method relies on the evaluation of a least squares polynomial approximation to oscillatory data using a set of points which is determined via the ENO network. Numerical results are given in one and two space dimensions for both scalar and systems of hyperbolic conservation laws. Computational running time, efficiency, and robustness of method are illustrated in various examples such as Riemann initial data for both Burgers' and Euler's equations of gas dynamics. In all standard cases, the filtered solution appears to converge numerically to the correct solution of the original problem. Some interesting results based on nonstandard central difference schemes, which exactly preserve entropy, and have been recently shown generally not to be weakly convergent to a solution of the conservation law, are also obtained using our filters.

Lafon, F.↗
NASA NTRS1980

Discrete Tchebycheff orthonormal polynomials and applications

Discrete Tchebycheff orthonormal polynomials offer a convenient way to make least squares polynomial fits of uniformly spaced discrete data. Computer programs to do so are simple and fast, and appear to be less affected by computer roundoff error, for the higher order fits, than conventional least squares programs. They are useful for any application of polynomial least squares fits: approximation of mathematical functions, noise analysis of radar data, and real time smoothing of noisy data, to name a few.

Lear, W. M.↗
NASA NTRS1984

Design oriented identification of critical times in transient response

Two techniques are presented for reducing the computational effort in identifying the critical time points. One approach is an adaptive search technique, well suited for the case where the response is exactly known. The other technique, useful for noisy response, is based on a least-squares spline approximation of the response. The possibility of grouping several closely spaced local peaks to identify a single super peak from each group is also investigated. The computational efficiency of the techniques proposed here is illustrated by two examples.

Haftka, R. T.↗
NASA NTRS2008

Accuracy of Gradient Reconstruction on Grids with High Aspect Ratio

Gradient approximation methods commonly used in unstructured-grid finite-volume schemes intended for solutions of high Reynolds number flow equations are studied comprehensively. The accuracy of gradients within cells and within faces is evaluated systematically for both node-centered and cell-centered formulations. Computational and analytical evaluations are made on a series of high-aspect-ratio grids with different primal elements, including quadrilateral, triangular, and mixed element grids, with and without random perturbations to the mesh. Both rectangular and cylindrical geometries are considered; the latter serves to study the effects of geometric curvature. The study shows that the accuracy of gradient reconstruction on high-aspect-ratio grids is determined by a combination of the grid and the solution. The contributors to the error are identified and approaches to reduce errors are given, including the addition of higher-order terms in the direction of larger mesh spacing. A parameter GAMMA characterizing accuracy on curved high-aspect-ratio grids is discussed and an approximate-mapped-least-square method using a commonly-available distance function is presented; the method provides accurate gradient reconstruction on general grids. The study is intended to be a reference guide accompanying the construction of accurate and efficient methods for high Reynolds number applications

Thomas, James↗
NASA NTRS2011

Least-Squares Adaptive Control Using Chebyshev Orthogonal Polynomials

This paper presents a new adaptive control approach using Chebyshev orthogonal polynomials as basis functions in a least-squares functional approximation. The use of orthogonal basis functions improves the function approximation significantly and enables better convergence of parameter estimates. Flight control simulations demonstrate the effectiveness of the proposed adaptive control approach.

Nguyen, Nhan T.↗