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 109 records · Page 6

On damping mechanisms in beams

A partial differential equation model of a cantilevered beam with a tip mass at its free end is used to study damping in a composite. Four separate damping mechanisms consisting of air damping, strain rate damping, spatial hysteresis and time hysteresis are considered experimentally. Dynamic tests were performed to produce time histories. The time history data is then used along with an approximate model to form a sequence of least squares problems. The solution of the least squares problem yields the estimated damping coefficients. The resulting experimentally determined analytical model is compared with the time histories via numerical simulation of the dynamic response. The procedure suggested here is compared with a standard modal damping ratio model commonly used in experimental modal analysis.

Banks, H. T.↗

On damping mechanisms in beams

A partial differential equation model of a cantilevered beam with a tip mass at its free end is used to study damping in a composite. Four separate damping mechanisms consisting of air damping, strain rate damping, spatial hysteresis and time hysteresis are considered experimentally. Dynamic tests were performed to produce time histories. The time history data is then used along with an approximate model to form a sequence of least squares problems. The solution of the least squares problem yields the estimated damping coefficients. The resulting experimentally determined analytical model is compared with the time histories via numerical simulation of the dynamic response. The procedure suggested here is compared with a standard modal damping ratio model commonly used in experimental modal analysis.

Banks, H. T.↗

Optimal moving grids for time-dependent partial differential equations

Various adaptive moving grid techniques for the numerical solution of time-dependent partial differential equations were proposed. The precise criterion for grid motion varies, but most techniques will attempt to give grids on which the solution of the partial differential equation can be well represented. Moving grids are investigated on which the solutions of the linear heat conduction and viscous Burgers' equation in one space dimension are optimally approximated. Precisely, the results of numerical calculations of optimal moving grids for piecewise linear finite element approximation of PDE solutions in the least-squares norm are reported.

Wathen, A. J.↗

Simulation of Two-Fluid Flows by the Least-Squares Finite Element Method Using a Continuum Surface Tension Model

In this paper a numerical procedure for simulating two-fluid flows is presented. This procedure is based on the Volume of Fluid (VOF) method proposed by Hirt and Nichols and the continuum surface force (CSF) model developed by Brackbill, et al. In the VOF method fluids of different properties are identified through the use of a continuous field variable (color function). The color function assigns a unique constant (color) to each fluid. The interfaces between different fluids are distinct due to sharp gradients of the color function. The evolution of the interfaces is captured by solving the convective equation of the color function. The CSF model is used as a means to treat surface tension effect at the interfaces. Here a modified version of the CSF model, proposed by Jacqmin, is used to calculate the tension force. In the modified version, the force term is obtained by calculating the divergence of a stress tensor defined by the gradient of the color function. In its analytical form, this stress formulation is equivalent to the original CSF model. Numerically, however, the use of the stress formulation has some advantages over the original CSF model, as it bypasses the difficulty in approximating the curvatures of the interfaces. The least-squares finite element method (LSFEM) is used to discretize the governing equation systems. The LSFEM has proven to be effective in solving incompressible Navier-Stokes equations and pure convection equations, making it an ideal candidate for the present applications. The LSFEM handles all the equations in a unified manner without any additional special treatment such as upwinding or artificial dissipation. Various bench mark tests have been carried out for both two dimensional planar and axisymmetric flows, including a dam breaking, oscillating and stationary bubbles and a conical liquid sheet in a pressure swirl atomizer.

Wu, Jie↗

An application of a linear programing technique to nonlinear minimax problems

A differential correction technique for solving nonlinear minimax problems is presented. The basis of the technique is a linear programing algorithm which solves the linear minimax problem. By linearizing the original nonlinear equations about a nominal solution, both nonlinear approximation and estimation problems using the minimax norm may be solved iteratively. Some consideration is also given to improving convergence and to the treatment of problems with more than one measured quantity. A sample problem is treated with this technique and with the least-squares differential correction method to illustrate the properties of the minimax solution. The results indicate that for the sample approximation problem, the minimax technique provides better estimates than the least-squares method if a sufficient amount of data is used. For the sample estimation problem, the minimax estimates are better if the mathematical model is incomplete.

Schiess, J. R.↗

Low rank approximation in simulations of quantum algorithms

Simulating quantum algorithms on classical computers is challenging when the system size, i.e., the number of qubits used in the quantum algorithm, is moderately large. However, some quantum algorithms and the corresponding quantum circuits can be simulated efficiently on a classical computer if the input quantum state is a low rank tensor and all intermediate states of the quantum algorithm can be represented or approximated by low rank tensors. Here, in this paper, we examine the possibility of simulating a few quantum algorithms by using low-rank canonical polyadic (CP) decomposition to represent the input and all intermediate states of these algorithms. Two rank reduction algorithms are used to enable efficient simulation. We show that some of the algorithms preserve the low rank structure of the input state and can thus be efficiently simulated on a classical computer. However, the rank of the intermediate states in other quantum algorithms can increase rapidly, making efficient simulation more difficult. To some extent, such difficulty reflects the advantage or superiority of a quantum computer over a classical computer. As a result, understanding the low rank structure of a quantum algorithm allows us to identify algorithms that can benefit significantly from quantum computers.

97 MATHEMATICS AND COMPUTING↗

An Inverse Interpolation Method Utilizing In-Flight Strain Measurements for Determining Loads and Structural Response of Aerospace Vehicles

An important and challenging technology aimed at the next generation of aerospace vehicles is that of structural health monitoring. The key problem is to determine accurately, reliably, and in real time the applied loads, stresses, and displacements experienced in flight, with such data establishing an information database for structural health monitoring. The present effort is aimed at developing a finite element-based methodology involving an inverse formulation that employs measured surface strains to recover the applied loads, stresses, and displacements in an aerospace vehicle in real time. The computational procedure uses a standard finite element model (i.e., "direct analysis") of a given airframe, with the subsequent application of the inverse interpolation approach. The inverse interpolation formulation is based on a parametric approximation of the loading and is further constructed through a least-squares minimization of calculated and measured strains. This procedure results in the governing system of linear algebraic equations, providing the unknown coefficients that accurately define the load approximation. Numerical simulations are carried out for problems involving various levels of structural approximation. These include plate-loading examples and an aircraft wing box. Accuracy and computational efficiency of the proposed method are discussed in detail. The experimental validation of the methodology by way of structural testing of an aircraft wing is also discussed.

Shkarayev, S.↗

An analytical technique for approximating unsteady aerodynamics in the time domain

An analytical technique is presented for approximating unsteady aerodynamic forces in the time domain. The order of elements of a matrix Pade approximation was postulated, and the resulting polynomial coefficients were determined through a combination of least squares estimates for the numerator coefficients and a constrained gradient search for the denominator coefficients which insures stable approximating functions. The number of differential equations required to represent the aerodynamic forces to a given accuracy tends to be smaller than that employed in certain existing techniques where the denominator coefficients are chosen a priori. Results are shown for an aeroelastic, cantilevered, semispan wing which indicate a good fit to the aerodynamic forces for oscillatory motion can be achieved with a matrix Pade approximation having fourth order numerator and second order denominator polynomials.

Dunn, H. J.↗

Thermal conductivity of Apollo 12 fines at intermediate density.

The thermal conductivity of an Apollo 12 fines sample (12001,19) was measured under vacuum conditions over a temperature range of 200 to 400 K for a density of 1640 kg/cu m. It was found to vary from approximately .0012 to about .0026 W/m-K. A least-squares curve was found to represent the data satisfactorily.

Cremers, C. J.↗

Techniques for obtaining regional radiation budgets from satellite radiometer observations, phase 4 and phase 5

A scheme was developed which divides the earth-atmosphere system into 2060 elemental areas. The regions previously described are defined in terms of these elemental areas which are fixed in size and position as the satellite moves. One method, termed the instantaneous technique, yields values of the radiant emittance (We) and the radiant reflectance (Wr) which the regions have during the time interval of a single satellite pass. The number of observations matches the number of regions under study and a unique solution is obtained using matrix inversion. The other method (termed the best fit technique), yields time averages of We and Wr for large time intervals (e.g., months, seasons). The number of observations in this technique is much greater than the number of regions considered, and an approximate solution is obtained by the method of least squares.

Pina, J. F.↗

X-ray reflectometer for optical efficiency and scatter measurements

An instrument has been developed to determine the reflection efficiency and scatter characteristics of optical samples at X-ray wavelengths from 1.5 to 113 A. The reflectometer operates in an oil-free vacuum chamber and measures the reflection efficiency and scatter characteristics as a function of the angle of incidence. The reflection efficiency is given for 8.34-A radiation incident on a fused silica sample finished to a flatness of one-tenth of a wavelength. The experimental reflection efficiency is compared with the theoretical data. The scatter curves are given for the direct X-ray beam and for the beam reflected from the fused silica sample at an angle of incidence of 50 arcmin. The full-width-at-half-maximum (FWHM) resolution of the instrument is approximately 13 arcsec, as determined by a least-squares smoothing of the experimental data.

Reynolds, J. M.↗

Development of an unsteady aerodynamic analysis for finite-deflection subsonic cascades

An unsteady potential flow analysis, which accounts for the effects of blade geometry and steady turning, was developed to predict aerodynamic forces and moments associated with free vibration or flutter phenomena in the fan, compressor, or turbine stages of modern jet engines. Based on the assumption of small amplitude blade motions, the unsteady flow is governed by linear equations with variable coefficients which depend on the underlying steady low. These equations were approximated using difference expressions determined from an implicit least squares development and applicable on arbitrary grids. The resulting linear system of algebraic equations is block tridiagonal, which permits an efficient, direct (i.e., noniterative) solution. The solution procedure was extended to treat blades with rounded or blunt edges at incidence relative to the inlet flow.

Verdon, J. M.↗

Optimal moving grids for time-dependent partial differential equations

Various adaptive moving grid techniques for the numerical solution of time-dependent partial differential equations were proposed. The precise criterion for grid motion varies, but most techniques will attempt to give grids on which the solution of the partial differential equation can be well represented. Moving grids are investigated on which the solutions of the linear heat conduction and viscous Burgers' equation in one space dimension are optimally approximated. Precisely, the results of numerical calculations of optimal moving grids for piecewise linear finite element approximation of partial differential equation solutions in the least squares norm.

Wathen, A. J.↗

The three-dimensional structure of cumulus clouds over the ocean. 1: Structural analysis

Thermal channel (channel 6, 10.4-12.5 micrometers) images of five Landsat thematic mapper cumulus scenes over the ocean are examined. These images are thresholded using the standard International Satellite Cloud Climatology Project (ISCCP) thermal threshold algorithm. The individual clouds in the cloud fields are segmented to obtain their structural statistics which include size distribution, orientation angle, horizontal aspect ratio, and perimeter-to-area (PtA) relationship. The cloud size distributions exhibit a double power law with the smaller clouds having a smaller absolute exponent. The cloud orientation angles, horizontal aspect ratios, and PtA exponents are found in good agreement with earlier studies. A technique also is developed to recognize individual cells within a cloud so that statistics of cloud cellular structure can be obtained. Cell structural statistics are computed for each cloud. Unicellular clouds are generally smaller (less than or equal to 1 km) and have smaller PtA exponents, while multicellular clouds are larger (greater than or equal to 1 km) and have larger PtA exponents. Cell structural statistics are similar to those of the smaller clouds. When each cell is approximated as a quadric surface using a linear least squares fit, most cells have the shape of a hyperboloid of one sheet, but about 15% of the cells are best modeled by a hyperboloid of two sheets. Less than 1% of the clouds are ellipsoidal. The number of cells in a cloud increases slightly faster than linearly with increasing cloud size. The mean nearest neighbor distance between cells in a cloud, however, appears to increase linearly with increasing cloud size and to reach a maximum when the cloud effective diameter is about 10 km; then it decreases with increasing cloud size. Sensitivity studies of threshold and lapse rate show that neither has a significant impact upon the results. A goodness-of-fit ratio is used to provide a quantitative measure of the individual cloud results. Significantly improved results are obtained after applying a smoothing operator, suggesting the eliminating subresolution scale variations with higher spatial resolution may yield even better shape analyses.

Kuo, Kwo-Sen↗

Real-Time Attitude Independent Three Axis Magnetometer Calibration

In this paper new real-time approaches for three-axis magnetometer sensor calibration are derived. These approaches rely on a conversion of the magnetometer-body and geomagnetic-reference vectors into an attitude independent observation by using scalar checking. The goal of the full calibration problem involves the determination of the magnetometer bias vector, scale factors and non-orthogonality corrections. Although the actual solution to this full calibration problem involves the minimization of a quartic loss function, the problem can be converted into a quadratic loss function by a centering approximation. This leads to a simple batch linear least squares solution. In this paper we develop alternative real-time algorithms based on both the extended Kalman filter and Unscented filter. With these real-time algorithms, a full magnetometer calibration can now be performed on-orbit during typical spacecraft mission-mode operations. Simulation results indicate that both algorithms provide accurate integer resolution in real time, but the Unscented filter is more robust to large initial condition errors than the extended Kalman filter. The algorithms are also tested using actual data from the Transition Region and Coronal Explorer (TRACE).

Crassidis, John L.↗

An Empirical State Error Covariance Matrix for Batch State Estimation

State estimation techniques serve effectively to provide mean state estimates. However, the state error covariance matrices provided as part of these techniques suffer from some degree of lack of confidence in their ability to adequately describe the uncertainty in the estimated states. A specific problem with the traditional form of state error covariance matrices is that they represent only a mapping of the assumed observation error characteristics into the state space. Any errors that arise from other sources (environment modeling, precision, etc.) are not directly represented in a traditional, theoretical state error covariance matrix. Consider that an actual observation contains only measurement error and that an estimated observation contains all other errors, known and unknown. It then follows that a measurement residual (the difference between expected and observed measurements) contains all errors for that measurement. Therefore, a direct and appropriate inclusion of the actual measurement residuals in the state error covariance matrix will result in an empirical state error covariance matrix. This empirical state error covariance matrix will fully account for the error in the state estimate. By way of a literal reinterpretation of the equations involved in the weighted least squares estimation algorithm, it is possible to arrive at an appropriate, and formally correct, empirical state error covariance matrix. The first specific step of the method is to use the average form of the weighted measurement residual variance performance index rather than its usual total weighted residual form. Next it is helpful to interpret the solution to the normal equations as the average of a collection of sample vectors drawn from a hypothetical parent population. From here, using a standard statistical analysis approach, it directly follows as to how to determine the standard empirical state error covariance matrix. This matrix will contain the total uncertainty in the state estimate, regardless as to the source of the uncertainty. Also, in its most straight forward form, the technique only requires supplemental calculations to be added to existing batch algorithms. The generation of this direct, empirical form of the state error covariance matrix is independent of the dimensionality of the observations. Mixed degrees of freedom for an observation set are allowed. As is the case with any simple, empirical sample variance problems, the presented approach offers an opportunity (at least in the case of weighted least squares) to investigate confidence interval estimates for the error covariance matrix elements. The diagonal or variance terms of the error covariance matrix have a particularly simple form to associate with either a multiple degree of freedom chi-square distribution (more approximate) or with a gamma distribution (less approximate). The off diagonal or covariance terms of the matrix are less clear in their statistical behavior. However, the off diagonal covariance matrix elements still lend themselves to standard confidence interval error analysis. The distributional forms associated with the off diagonal terms are more varied and, perhaps, more approximate than those associated with the diagonal terms. Using a simple weighted least squares sample problem, results obtained through use of the proposed technique are presented. The example consists of a simple, two observer, triangulation problem with range only measurements. Variations of this problem reflect an ideal case (perfect knowledge of the range errors) and a mismodeled case (incorrect knowledge of the range errors).

Frisbee, Joseph H., Jr.↗

Nonlinear programming extensions to rational function approximation methods for unsteady aerodynamic forces

The approximation of unsteady generalized aerodynamic forces in the equations of motion of a flexible aircraft are discussed. Two methods of formulating these approximations are extended to include the same flexibility in constraining the approximations and the same methodology in optimizing nonlinear parameters as another currently used extended least-squares method. Optimal selection of nonlinear parameters is made in each of the three methods by use of the same nonlinear, nongradient optimizer. The objective of the nonlinear optimization is to obtain rational approximations to the unsteady aerodynamics whose state-space realization is lower order than that required when no optimization of the nonlinear terms is performed. The free linear parameters are determined using the least-squares matrix techniques of a Lagrange multiplier formulation of an objective function which incorporates selected linear equality constraints. State-space mathematical models resulting from different approaches are described and results are presented that show comparative evaluations from application of each of the extended methods to a numerical example.

Tiffany, Sherwood H.↗

A Comparison of Approximation Modeling Techniques: Polynomial Versus Interpolating Models

Two methods of creating approximation models are compared through the calculation of the modeling accuracy on test problems involving one, five, and ten independent variables. Here, the test problems are representative of the modeling challenges typically encountered in realistic engineering optimization problems. The first approximation model is a quadratic polynomial created using the method of least squares. This type of polynomial model has seen considerable use in recent engineering optimization studies due to its computational simplicity and ease of use. However, quadratic polynomial models may be of limited accuracy when the response data to be modeled have multiple local extrema. The second approximation model employs an interpolation scheme known as kriging developed in the fields of spatial statistics and geostatistics. This class of interpolating model has the flexibility to model response data with multiple local extrema. However, this flexibility is obtained at an increase in computational expense and a decrease in ease of use. The intent of this study is to provide an initial exploration of the accuracy and modeling capabilities of these two approximation methods.

Giunta, Anthony A.↗