Search NASA⌕ Search

SEARCH · Search NASA

Results for “least squares solution”

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 217 records · Page 12

Inversion of the Solar Rotation Rate Versus Depth and Latitude

Three differential inversion techniques were used to compute the internal solar rotation rate from several sets of n-averaged frequency splittings. An iterative variation of the spectral expansion method; the optimal averaging kernel method; and a piecewise constant constrained least square method were used to invert the data. Each computation was carried out independently. While they present similar trends, each of the solutions differs in detail. A consistent feature in all the inversions is the disappearance of differential rotation below the base of the convection zone. Also, a strong differential signature in the deeper part of the convection zone is present in most of the solutions. A slow decrease of the rotation rate with depth for the equatorial and midlatitude curves is significant in the spectral expansion and the least square results but only marginally apparent in the averaging kernel results.

Korzennik, Sylvain G.↗

Geometrical geodesy techniques in Goddard earth models

The method for combining geometrical data with satellite dynamical and gravimetry data for the solution of geopotential and station location parameters is discussed. Geometrical tracking data (simultaneous events) from the global network of BC-4 stations are currently being processed in a solution that will greatly enhance of geodetic world system of stations. Previously the stations in Goddard earth models have been derived only from dynamical tracking data. A linear regression model is formulated from combining the data, based upon the statistical technique of weighted least squares. Reduced normal equations, independent of satellite and instrumental parameters, are derived for the solution of the geodetic parameters. Exterior standards for the evaluation of the solution and for the scale of the earth's figure are discussed.

Lerch, F. J.↗

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Viscous Fluxes - Part 1

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and efficiency are studied for six nominally second-order accurate schemes: a node-centered scheme, cell-centered node-averaging schemes with and without clipping, and cell-centered schemes with unweighted, weighted, and approximately mapped least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Results from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The second class of tests are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes are less accurate, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to the complexity of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping of the surface anisotropy or modifying the scheme stencil to reflect the direction of strong coupling.

Diskin, Boris↗

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Viscous Fluxes

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and complexity are studied for four nominally second-order accurate schemes: a node-centered scheme and three cell-centered schemes - a node-averaging scheme and two schemes with nearest-neighbor and adaptive compact stencils for least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Tests from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The tests of the second class are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes may degenerate on mixed grids, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to that of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping based on a distance function commonly available in practical schemes or modifying the scheme stencil to reflect the direction of strong coupling. The major conclusion is that accuracies of the node centered and the best cell-centered schemes are comparable at equivalent number of degrees of freedom.

Diskin, Boris↗

Determination of stability derivatives from flight data using a Newton-Raphson minimization technique

A modified Newton-Raphson or quasilinearization minimization technique for determining stability derivatives from flight data was developed and compared with simple-equations, analog-matching, least-squares, and Shinbrot methods of analysis. For the data analyzed, the solutions computed by using the estimates obtained from the Newton-Raphson technique fit the data and determined coefficients adequately. A further modification to include a priori information was found to be useful. A model statistically similar to the flight data was analyzed using the same methods (excluding analog matching), and the Newton-Raphson technique was found to yield superior estimates. An approximate Cramer-Rao bound was compared with the error covariance matrix of the model and was found to provide information about the reliability of the individual estimates obtained. The technique was successfully applied to data obtained from a light airplane, a large supersonic airplane, and a lifting body vehicle. It was shown that the reliability of the estimates of a given coefficient obtained from these vehicles depends upon the data analyzed.

Iliff, K. W.↗

Pole and zero placement in multivariable control systems

A method is proposed for designing multivariable systems based on an alternate derivation of Davison's theorem on pole placement and the solution of the nonlinear equations for the feedback gains by the least square error method. Output feedback is used to control a complex dynamical system. The freedom in design, after allocating poles, is used to place zeros and/or satisfy other design objectives. This method results in algorithms which are computationally attractive. However, this is done at a considerable sacrifice in terms of the design freedom available. For a system with m inputs and p outputs only m + p variables are available instead of mp variables.

Sridhar, B.↗

Post-flight differential correction analysis using Vinti's spheroidal method for the small astronomy satellite orbit

The results of an intensive analysis of a differential orbit improvement method utilizing observational data for a 550-kilometer altitude, near-circular, near-equatorial satellite orbit are presented. Observations of the Small Astronomy Satellite (SAS-1) are in the form of direction cosines as measured at two ground interferometer tracking stations near the Equator during the first 22 orbital revolutions (approximately 37 hours) after launch of the spacecraft. Numerical results, in both tabular and graphical form, are displayed for numerous iterated fittings of various observational arcs by differential correction of the orbital elements. Parameters varied in these comparative cases include the time duration of the observational data block, the number of pairs of direction cosine data and the number of tracking station passes included in the solution, the distribution of such passes between the two available tracking stations, and the acceptance criterion for the observational residuals in the least squares fitting procedure. It was found that three observational pairs of direction cosine data, the minimum number possible for a uniquely determined solution in theory, are sufficient to promote covergence to an accurate solution, if properly selected.

Walden, H.↗

Astrogeodetic geoid of Japan

Three kinds of astrogeodetic geoid maps for Japan are presented: one referred to the global (18, 18) geoid of the 1973 Smithsonian Standard Earth (III) (SE III), referred to the best-fitting ellipsoid of SE III, and one referred to the reference ellipsoid of the Tokyo datum. Interpolations of the deflection of the vertical are carried out by a least squares estimation method. The geoid height differences obtained are compared with solutions of satellite-derived station positions. Good agreement is found in a comparison with Doppler tracking stations.

Ganeko, Y.↗

An astrogeodetic geoid of Japan

Three kinds of astrogeodetic geoid maps for Japan are presented: one referred to the global (18, 18) geoid of the 1973 Smithsonian Standard Earth (3) (SE 3), one referred to the ellipsoid of the SE 3 system, and one referred to the reference ellipsoid of the Tokyo datum. Interpolations of the deflection of the vertical are carried out by a least squares estimation method. The geoid height differences obtained are compared with solutions of satellite-derived station positions.

Ganeko, Y.↗

The optimization of force inputs for active structural acoustic control using a neural network

This paper investigates the use of a neural network to determine which force actuators, of a multi-actuator array, are best activated in order to achieve structural-acoustic control. The concept is demonstrated using a cylinder/cavity model on which the control forces, produced by piezoelectric actuators, are applied with the objective of reducing the interior noise. A two-layer neural network is employed and the back propagation solution is compared with the results calculated by a conventional, least-squares optimization analysis. The ability of the neural network to accurately and efficiently control actuator activation for interior noise reduction is demonstrated.

Cabell, R. H.↗

A fast two-stage algorithm for non-negative matrix factorization in smoothly varying data

This article reports the study of algorithms for non-negative matrix factorization (NMF) in various applications involving smoothly varying data such as time or temperature series diffraction data on a dense grid of points. Utilizing the continual nature of the data, a fast two-stage algorithm is developed for highly efficient and accurate NMF. In the first stage, an alternating non-negative least-squares framework is used in combination with the active set method with a warm-start strategy for the solution of subproblems. In the second stage, an interior point method is adopted to accelerate the local convergence. The convergence of the proposed algorithm is proved. The new algorithm is compared with some existing algorithms in benchmark tests using both real-world data and synthetic data. Furthermore, the results demonstrate the advantage of the algorithm in finding high-precision solutions.

interior point method↗

Constrained hierarchical least square nonlinear equation solvers

The current paper develops a constrained hierarchical least square nonlinear equation solver. The procedure can handle the response behavior of systems which possess indefinite tangent stiffness characteristics. Due to the generality of the scheme, this can be achieved at various hierarchical application levels. For instance, in the case of finite element simulations, various combinations of either degree of freedom, nodal, elemental, substructural, and global level iterations are possible. Overall, this enables a solution methodology which is highly stable and storage efficient. To demonstrate the capability of the constrained hierarchical least square methodology, benchmarking examples are presented which treat structure exhibiting highly nonlinear pre- and postbuckling behavior wherein several indefinite stiffness transitions occur.

Padovan, J.↗

On the Formulation of Weakly Singular Displacement/Traction Integral Equations; and Their Solution by the MLPG Method

In this paper, a very simple method is used to derive the weakly singular traction boundary integral equation based on the integral relationships for displacement gradients. The concept of the MLPG method is employed to solve the integral equations, especially those arising in solid mechanics. A moving Least Squares (MLS) interpolation is selected to approximate the trial functions in this paper. Five boundary integral Solution methods are introduced: direct solution method; displacement boundary-value problem; traction boundary-value problem; mixed boundary-value problem; and boundary variational principle. Based on the local weak form of the BIE, four different nodal-based local test functions are selected, leading to four different MLPG methods for each BIE solution method. These methods combine the advantages of the MLPG method and the boundary element method.

Atluri, Satya N.↗

An interpretation and solution of ill-conditioned linear equations

Data insufficiency, poorly conditioned matrices and singularities in equations occur regularly in complex optimization, correlation, and interdisciplinary model studies. This work concerns itself with two methods of obtaining certain physically realistic solutions to ill-conditioned or singular algebraic systems of linear equations arising from such studies. Two efficient computational solution procedures that generally lead to locally unique solutions are presented when there is insufficient data to completely define the model, or a least-squares error formulation of this system results in an ill-conditioned system of equations. If it is assumed that a reasonable estimate of the uncertain data is available in both cases cited above, then we shall show how to obtain realistic solutions efficiently, in spite of the insufficiency of independent data. The proposed methods of solution are more efficient than singular-value decomposition for dealing with such systems, since they do not require solutions for all the non-zero eigenvalues of the coefficient matrix.

Ojalvo, I. U.↗

Numerical method for the solution of large systems of differential equations of the boundary layer type

A numerical method for the solution of large systems of nonlinear differential equations of the boundary-layer type is described. The method is a modification of the technique for satisfying asymptotic boundary conditions. The present method employs inverse interpolation instead of the Newton method to adjust the initial conditions of the related initial-value problem. This eliminates the so-called perturbation equations. The elimination of the perturbation equations not only reduces the user's preliminary work in the application of the method, but also reduces the number of time-consuming initial-value problems to be numerically solved at each iteration. For further ease of application, the solution of the overdetermined system for the unknown initial conditions is obtained automatically by applying Golub's linear least-squares algorithm. The relative ease of application of the proposed numerical method increases directly as the order of the differential-equation system increases. Hence, the method is especially attractive for the solution of large-order systems. After the method is described, it is applied to a fifth-order problem from boundary-layer theory.

Green, M. J.↗

BioXTAS RAW 2 : new developments for a free open-source program for small-angle scattering data reduction and analysis

BioXTAS RAW is a free open-source program for reduction, analysis and modelling of biological small-angle scattering data. Here, the new developments in RAW version 2 are described. These include improved data reduction using pyFAI ; updated automated Guinier fitting and D max finding algorithms; automated series ( e.g. size-exclusion chromatography coupled small-angle X-ray scattering or SEC-SAXS) buffer- and sample-region finding algorithms; linear and integral baseline correction for series; deconvolution of series data using regularized alternating least squares ( REGALS ); creation of electron-density reconstructions using electron density via solution scattering ( DENSS ); a comparison window showing residuals, ratios and statistical comparisons between profiles; and generation of PDF reports with summary plots and tables for all analysis. Furthermore, there is now a RAW API, which can be used without the graphical user interface (GUI), providing full access to all of the functionality found in the GUI. In addition to these new capabilities, RAW has undergone significant technical updates, such as adding Python 3 compatibility, and has entirely new documentation available both online and in the program.

97 MATHEMATICS AND COMPUTING↗

A linear aerodynamic analysis for unsteady transonic cascades

A potential flow analysis to predict unsteady airloads produced by the vibrations of turbomachinery blades operating at transonic Mach numbers is presented. The unsteady aerodynamic model includes the effects of blade geometry, finite mean pressure variation across the blade row, high frequency blade motion, and shock motion within the framework of a linearized, frequency domain formulation. The unsteady equations are solved implicit, least squares, finite difference approximation which is applicable on arbitrary grids. A numerical solution for the entire unsteady field is determined by matching a solution determined on a rectilinear type cascade mesh, which covers an extended blade passage region, to a solution determined on a detailed polar type local mesh, which covers and extends well beyond the supersonic region(s) adjacent to a blade surface. Cascades of double circular arc and flat plate blades demonstrate the unsteady analysis, and partially illustrate the effects of blade geometry, inlet Mach number, blade vibration frequency and shock motion on unsteady response.

Verdon, J. M.↗