Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “singular vectors”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Robust inverse kinematics using damped least squares with dynamic weighting

This paper presents a general method for calculating the inverse kinematics with singularity and joint limit robustness for both redundant and non-redundant serial-link manipulators. Damped least squares inverse of the Jacobian is used with dynamic weighting matrices in approximating the solution. This reduces specific joint differential vectors. The algorithm gives an exact solution away from the singularities and joint limits, and an approximate solution at or near the singularities and/or joint limits. The procedure is here implemented for a six d.o.f. teleoperator and a well behaved slave manipulator resulted under teleoperational control.

Schinstock, D. E.↗
NASA NTRS1976

Nonlinear motion analysis of flexible satellites

The article reviews research on pointing accuracies of flexible satellites with regard to derived equations of motion of individual elements and composite bodies. The solution of these equations may be achieved through the formulation of a set of singularly perturbed equations by eliminating the generalized position vector. These equations are generally solved by a method of asymptotic expansions if certain convergence criteria are satisfied. The analysis may be applied to dual-spin flexible satellites.

Huang, T. C.↗
NASA NTRS1991

On robustness analysis with non-diagonally structured uncertainty

The authors study the structured singular value for a class of robustness analysis problems in which the uncertainty is allowed to be nondiagonally structured, and the norm of each block is individually considered. The results extend the previous work conducted for problems where each uncertainty block is assumed to be a scalar. Computations of this generalized notion via both the similarity and nonsimilarity scaling methods are investigated. It is shown in particular that under certain circumstances the structured singular value defined here coincides with a vector-induced norm.

Chen, Jie↗
NASA NTRS2006

Kalman Filtering of Angular-Momentum-Based Attitude Parameters

This paper presents an extended Kalman filter using an attitude parameterization that is advantageous for attitude estimation of spinning spacecraft. The parameters are the angular momentum components in an inertial reference frame, the angular momentum components in the body frame, and a rotation angle. To avoid the singularity of the 7x7 covariance of this state vector arising from the constraint that the magnitude of the angular momentum vector is the same in the inertial and body frames, the Kalman filter employs the nonsingular 6x6 covariance of a reduced error state. Three of the components of this six-component error state are the usual infinitesimal attitude error angles, so the usual 3x3 attitude covariance matrix is a submatrix of the 6x6 covariance. The performance of the resulting filter is compared with that of a quaternion-based filter.

Markley, F. Landis↗
NASA NTRS1984

Modeling material failure with a vectorized routine

The computational aspects of modelling material failure in structural wood members are presented with particular reference to vector processing aspects. Wood members are considered to be highly orthotropic, inhomogeneous, and discontinuous due to the complex microstructure of wood material and the presence of natural growth characteristics such as knots, cracks and cross grain in wood members. The simulation of strength behavior of wood members is accomplished through the use of a special purpose finite element/fracture mechanics routine, program STARW (Strength Analysis Routine for Wood). Program STARW employs quadratic finite elements combined with singular crack tip elements in a finite element mesh. Vector processing techniques are employed in mesh generation, stiffness matrix formation, simultaneous equation solution, and material failure calculations. The paper addresses these techniques along with the time and effort requirements needed to convert existing finite element code to a vectorized version. Comparisons in execution time between vectorized and nonvectorized routines are provided.

Cramer, S. M.↗
DOE OSTI2023

Iterated Gauss-Seidel GMRES

The GMRES algorithm of Saad and Schultz [SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869] is an iterative method for approximately solving linear systems Ax = b, with initial guess x0 and residual r0 = b Ax0. The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of Vk ). It is well known that this process can be viewed as a QR factorization of the matrix Bk = [r0, AVk] at each iteration. Despite an O (..epsilon..)..kappa.. (Bk ) loss of orthogonality, for unit roundoff ..epsilon..and condition number ..kappa.. , the modified Gram-Schmidt formulation was shown to be backward stable in the seminal paper by Paige et al. [SIAM J. Matrix Anal.Appl., 28 (2006), pp. 264-284]. We present an iterated Gauss-Seidel formulation of the GMRES algorithm (IGS-GMRES) based on the ideas of Ruhe [Linear Algebra Appl., 52 (1983), pp. 591-601] and Swirydowicz et al. [Numer. Linear Algebra Appl., 28 (2020), pp. 1-20]. IGS-GMRES maintains orthogonality to the level O (..epsilon..)..kappa.. (Bk ) or O (..epsilon..), depending on the choice of one or two iterations; for two Gauss-Seidel iterations, the computed Krylov basis vectors remain orthogonal to working accuracy and the smallest singular value of Vk remains close to one. The resulting GMRES method is thus backward stable. We show that IGS-GMRES can be implemented with only a single synchronization point per iteration, making it relevant to large-scale parallel computing environments. We also demonstrate that, unlike MGS-GMRES, in IGS-GMRES the relative Arnoldi residual corresponding to the computed approximate solution no longer stagnates above machine precision even for highly nonnormal systems.

Arnoldi-QR↗
NASA NTRS1981

Topology of three-dimensional separated flows

Based on the hypothesis that patterns of skin-friction lines and external streamlines reflect the properties of continuous vector fields, topology rules define a small number of singular points (nodes, saddle points, and foci) that characterize the patterns on the surface and on particular projections of the flow (e.g., the crossflow plane). The restricted number of singular points and the rules that they obey are considered as an organizing principle whose finite number of elements can be combined in various ways to connect together the properties common to all steady three dimensional viscous flows. Introduction of a distinction between local and global properties of the flow resolves an ambiguity in the proper definition of a three dimensional separated flow. Adoption of the notions of topological structure, structural stability, and bifurcation provides a framework to describe how three dimensional separated flows originate and succeed each other as the relevant parameters of the problem are varied.

Tobak, M.↗
NASA NTRS1989

A multi-point force appropriation method based upon a singular value decomposition approach

Force appropriation methods aim to provide an estimate for the force pattern required to excite a 'pure' normal mode in a vibration test where multiple exciters are available. In this paper, a new method based upon a Singular Value Decompositon approach is presented. The appropriated force vector which minimizes the in-plane response components while maximizing the required quadrature components is found, subject to a fixed force norm. The method can accommodate more transducers than exciters and also more exciters than effective degrees of freedom. The method is demonstrated upon a six degree of freedom theoretical model and it is shown that an estimate for the effective degrees of freedom can be obtained.

Juang, Jer-Nan↗
DOE OSTI2024

Photon topology

The topology of photons in vacuum is interesting because there are no photons with k = 0, creating a hole in momentum space. We show that while the set of all photons forms a trivial vector bundle $γ$ over this momentum space, the R and L photons form topologically nontrivial subbundles $γ±$ with first Chern numbers ∓2. In contrast, $γ$ has no linearly polarized subbundles, and there is no Chern number associated with linear polarizations. It is a known difficulty that the standard version of Wigner’s little group method produces singular representations of the Poincaré group for massless particles. By considering representations of the Poincaré group on vector bundles we obtain a version of Wigner’s little group method for massless particles which avoids these singularities. Here we show that any massless bundle representation of the Poincaré group can be canonically decomposed into irreducible bundle representations labeled by helicity, which in turn can be associated to smooth irreducible Hilbert space representations. This proves that the R and L photons are globally well defined as particles and that the photon wave function can be uniquely split into R and L components. This formalism offers a method of quantizing the electromagnetic field without invoking discontinuous polarization vectors as in the traditional scheme. We also demonstrate that the spin-Chern number of photons is not a purely topological quantity. Lastly, there has been an extended debate on whether photon angular momentum can be split into spin and orbital parts. Our work explains the precise issues that prevent this splitting. Photons do not admit a spin operator; instead, the angular momentum associated with photons’ internal degree of freedom is described by a helicity-induced subalgebra corresponding to the translational symmetry of $γ$.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS2005

An Optimal Orthogonal Decomposition Method for Kalman Filter-Based Turbofan Engine Thrust Estimation

A new linear point design technique is presented for the determination of tuning parameters that enable the optimal estimation of unmeasured engine outputs such as thrust. The engine s performance is affected by its level of degradation, generally described in terms of unmeasurable health parameters related to each major engine component. Accurate thrust reconstruction depends upon knowledge of these health parameters, but there are usually too few sensors to be able to estimate their values. In this new technique, a set of tuning parameters is determined which accounts for degradation by representing the overall effect of the larger set of health parameters as closely as possible in a least squares sense. The technique takes advantage of the properties of the singular value decomposition of a matrix to generate a tuning parameter vector of low enough dimension that it can be estimated by a Kalman filter. A concise design procedure to generate a tuning vector that specifically takes into account the variables of interest is presented. An example demonstrates the tuning parameters ability to facilitate matching of both measured and unmeasured engine outputs, as well as state variables. Additional properties of the formulation are shown to lend themselves well to diagnostics.

Litt, Jonathan S.↗
NASA NTRS2007

An Optimal Orthogonal Decomposition Method for Kalman Filter-Based Turbofan Engine Thrust Estimation

A new linear point design technique is presented for the determination of tuning parameters that enable the optimal estimation of unmeasured engine outputs, such as thrust. The engine s performance is affected by its level of degradation, generally described in terms of unmeasurable health parameters related to each major engine component. Accurate thrust reconstruction depends on knowledge of these health parameters, but there are usually too few sensors to be able to estimate their values. In this new technique, a set of tuning parameters is determined that accounts for degradation by representing the overall effect of the larger set of health parameters as closely as possible in a least-squares sense. The technique takes advantage of the properties of the singular value decomposition of a matrix to generate a tuning parameter vector of low enough dimension that it can be estimated by a Kalman filter. A concise design procedure to generate a tuning vector that specifically takes into account the variables of interest is presented. An example demonstrates the tuning parameters ability to facilitate matching of both measured and unmeasured engine outputs, as well as state variables. Additional properties of the formulation are shown to lend themselves well to diagnostics.

Litt, Jonathan S.↗
NASA NTRS2007

An Optimal Orthogonal Decomposition Method for Kalman Filter-Based Turbofan Engine Thrust Estimation

A new linear point design technique is presented for the determination of tuning parameters that enable the optimal estimation of unmeasured engine outputs, such as thrust. The engine's performance is affected by its level of degradation, generally described in terms of unmeasurable health parameters related to each major engine component. Accurate thrust reconstruction depends on knowledge of these health parameters, but there are usually too few sensors to be able to estimate their values. In this new technique, a set of tuning parameters is determined that accounts for degradation by representing the overall effect of the larger set of health parameters as closely as possible in a least squares sense. The technique takes advantage of the properties of the singular value decomposition of a matrix to generate a tuning parameter vector of low enough dimension that it can be estimated by a Kalman filter. A concise design procedure to generate a tuning vector that specifically takes into account the variables of interest is presented. An example demonstrates the tuning parameters ability to facilitate matching of both measured and unmeasured engine outputs, as well as state variables. Additional properties of the formulation are shown to lend themselves well to diagnostics.

Litt, Jonathan S.↗
NASA NTRS2008

An Improved Wavefront Control Algorithm for Large Space Telescopes

Wavefront sensing and control is required throughout the mission lifecycle of large space telescopes such as James Webb Space Telescope (JWST). When an optic of such a telescope is controlled with both surface-deforming and rigid-body actuators, the sensitivity-matrix obtained from the exit pupil wavefront vector divided by the corresponding actuator command value can sometimes become singular due to difference in actuator types and in actuator command values. In this paper, we propose a simple approach for preventing a sensitivity-matrix from singularity. We also introduce a new "minimum-wavefront and optimal control compensator". It uses an optimal control gain matrix obtained by feeding back the actuator commands along with the measured or estimated wavefront phase information to the estimator, thus eliminating the actuator modes that are not observable in the wavefront sensing process.

adaptive optics↗
NASA NTRS1988

Three-dimensional singular points in aerodynamics

When three-dimensional separation occurs on a body immersed in a flow governed by the incompressible Navier-Stokes equations, the geometrical surfaces formed by the three vector fields (velocity, vorticity and the skin-friction) and a scalar field (pressure) become interrelated through topological maps containing their respective singular points and extremal points. A mathematically consistent description of these singular points becomes inevitable when we want to study the geometry of the separation. A separated stream surface requires, for example, the existence of a saddle-type singular point on the skin-friction surface. This singular point is actually, in the proper language of mathematics, a saddle of index two. The index is a measure of the dimension of the outset (set leaving the singular point). Hence, when a saddle of index two is specified, a two dimensional surface that becomes separated from the osculating plane of the saddle is implied. The three-dimensional singular point is interpreted mathematically and the most common aerodynamical singular points are discussed through this perspective.

Unal, Aynur↗
NASA NTRS1975

Comparison of some biased estimation methods (including ordinary subset regression) in the linear model

Ridge, Marquardt's generalized inverse, shrunken, and principal components estimators are discussed in terms of the objectives of point estimation of parameters, estimation of the predictive regression function, and hypothesis testing. It is found that as the normal equations approach singularity, more consideration must be given to estimable functions of the parameters as opposed to estimation of the full parameter vector; that biased estimators all introduce constraints on the parameter space; that adoption of mean squared error as a criterion of goodness should be independent of the degree of singularity; and that ordinary least-squares subset regression is the best overall method.

Sidik, S. M.↗
DOE OSTI2023

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1999

How to Estimate Attitude from Vector Observations

The most robust estimators minimizing Wahba's loss function are Davenport's q method and the Singular Value Decomposition (SVD) method. The q method is faster than the SVD method with three or more measurements. The other algorithms are less robust since they solve the characteristic polynomial equation to find the maximum eigenvalue of Davenport's K matrix. They are only preferable when speed or processor power is an important consideration. Of these, Fast Optimal Attitude Matrix (FOAM) is the most robust and faster than the q method. Robustness is only an issue for measurements with widely differing accuracies, so the fastest algorithms, Quaternion ESTimator (QUEST), EStimator of the Optimal Quaternion (ESOQ), and ESOQ2, are well suited to star sensor applications.

Markley, F. Landis↗
NASA NTRS1979

Investigations on the hierarchy of reference frames in geodesy and geodynamics

Problems related to reference directions were investigated. Space and time variant angular parameters are illustrated in hierarchic structures or towers. Using least squares techniques, model towers of triads are presented which allow the formation of linear observation equations. Translational and rotational degrees of freedom (origin and orientation) are discussed along with and the notion of length and scale degrees of freedom. According to the notion of scale parallelism, scale factors with respect to a unit length are given. Three-dimensional geodesy was constructed from the set of three base vectors (gravity, earth-rotation and the ecliptic normal vector). Space and time variations are given with respect to a polar and singular value decomposition or in terms of changes in translation, rotation, deformation (shear, dilatation or angular and scale distortions).

Grafarend, E. W.↗