SEARCH · Engineering Papers
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.
Inviscid flux Jacobian matrices and their properties used in numerical solutions of conservation laws are extended to general, equilibrium gas laws. Exact and approximate generalizations of the Roe average are presented. Results are given for one-dimensional flow, and then extended to three-dimensional flow with time-varying grids.
Improved formulation includes generalized Roe average and extension to three dimensions. Flux Jacobian matrices derived for use in numerical solutions of conservation-law differential equations of inviscid flows of ideal gases extended to real gases. Real-gas formulation of these matrices retains simplifying assumptions of thermodynamic and chemical equilibrium, but adds effects of vibrational excitation, dissociation, and ionization of gas molecules via general equation of state.
There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernel of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. Here, variants of the conjugate gradient algorithm are implemented in the context of homotopy curve tracking and compared with Craig's preconditioned conjugate gradient method used in HOMPACK. The test problems used include actual large scale, sparse structural mechanics problems.
Future space-based coronagraphs will rely critically on focal-plane wavefront sensing and control with deformable mirrors to reach deep contrast by mitigating optical aberrations in the primary beam path. Until now, most focal-plane wavefront control algorithms have been formulated in terms of Jacobian matrices, which encode the predicted effect of each deformable mirror actuator on the focal-plane electric field. A disadvantage of these methods is that Jacobian matrices can be cumbersome to compute and manipulate, particularly when the number of deformable mirror actuators is large. Recently, we proposed a new class of focal-plane wavefront control algorithms that utilize gradient-based optimization with algorithmic differentiation to compute wavefront control solutions while avoiding the explicit computation and manipulation of Jacobian matrices entirely. In simulations using a coronagraph design for the proposed Large UV/Optical/Infrared Surveyor (LUVOIR), we showed that our approach reduces overall CPU time and memory consumption compared to a Jacobian-based algorithm. Here, we expand on these results by implementing the proposed algorithm on the High Contrast Imager for Complex Aperture Telescopes (HiCAT) testbed at the Space Telescope Science Institute (STScI) and present initial experimental results, demonstrating contrast suppression capabilities equivalent to Jacobian-based methods.
Many scientific and engineering problems benefit from analytic expressions for eigenvalue and eigenvector derivatives with respect to the elements of the parent matrix. While there exists extensive literature on the calculation of these derivatives, which take the form of Jacobian matrices, there are a variety of deficiencies that have yet to be addressed — including the need for both left and right eigenvectors, limitations on the matrix structure, and issues with complex eigenvalues and eigenvectors. This work addresses these deficiencies by proposing a new analytic solution for the eigenvalue and eigenvector derivatives. The resulting analytic Jacobian matrices are numerically efficient to compute and are valid for the general complex case. It is further shown that this new general result collapses to previously known relations for the special cases of real symmetric matrices and real diagonal matrices. Finally, the new Jacobian expressions are validated using forward finite differencing and performance is compared with another technique.
A solution is presented for the optimal force distributions of two redundant coordinating robots. Two robots whose end-effectors firmly grasp a common inertial load form a closed-chain structure, and thus the robots must observe a set of constraint conditions on (1) the end-effector positions, orientations, linear and angular velocities and (2) the forces and torques inserted onto the end-effectors by the load. To achieve the maximum load capability, the optimal force distribution under the known posture is developed. If the robots are redundant, joint solutions may be obtained if some optimization criterion such as manipulability is imposed. The singularity, manipulability, and force ellipsoids are investigated in terms of the two manipulator Jacobian matrices. The manipulability is shown to correspond to the cascade structure, while the force ellipsoid corresponds to the parallel structure in terms of the manipulator Jacobian matrices.
Three different implicit operators in a numerical method for solving the two-dimensional steady Euler equations using flux vector splitting are investigated. These include the implementation of the true Jacobian matrices in the implicit part, the use of their splitting approximate form, and a modification of the implicit part of the scheme that uses the scalar form of the implicit part based on the spectral radii of the split Jacobian matrices. The three versions of the basic algorithm are compared with the results given by two common numerical methods using several two-dimensional test cases. Special attention is paid to the quality of results as well as computational efficiency and convergence properties.
Numerical modeling of D-mappings was studied and applied to solving nonlinear stiff systems. These mappings were locally linearized for convergence analysis, and some applications were made to chemical kinetics. The technique avoids using multistep implicit codes that require inversion of Jacobian matrices, but depends on the Jacobians for its convergence analysis.
A seven degree of freedom robot arm with a six degree of freedom end effector is controlled by a processor employing a 6 by 7 Jacobian matrix for defining location and orientation of the end effector in terms of the rotation angles of the joints, a 1 (or more) by 7 Jacobian matrix for defining 1 (or more) user specified kinematic functions constraining location or movement of selected portions of the arm in terms of the joint angles, the processor combining the two Jacobian matrices to produce an augmented 7 (or more) by 7 Jacobian matrix, the processor effecting control by computing in accordance with forward kinematics from the augmented 7 by 7 Jacobian matrix and from the seven joint angles of the arm a set of seven desired joint angles for transmittal to the joint servo loops of the arm. One of the kinematic functions constraints the orientation of the elbow plane of the arm. Another one of the kinematic functions minimizes a sum of gravitational torques on the joints. Still another kinematic function constrains the location of the arm to perform collision avoidance. Generically, one kinematic function minimizes a sum of selected mechanical parameters of at least some of the joints associated with weighting coefficients which may be changed during arm movement. The mechanical parameters may be velocity errors or gravity torques associated with individual joints.
A seven-degree-of-freedom robot arm with a six-degree-of-freedom end effector is controlled by a processor employing a 6-by-7 Jacobian matrix for defining location and orientation of the end effector in terms of the rotation angles of the joints, a 1 (or more)-by-7 Jacobian matrix for defining 1 (or more) user-specified kinematic functions constraining location or movement of selected portions of the arm in terms of the joint angles, the processor combining the two Jacobian matrices to produce an augmented 7 (or more)-by-7 Jacobian matrix, the processor effecting control by computing in accordance with forward kinematics from the augmented 7-by-7 Jacobian matrix and from the seven joint angles of the arm a set of seven desired joint angles for transmittal to the joint servo loops of the arms. One of the kinematic functions constrains the orientation of the elbow plane of the arm. Another one of the kinematic functions minimizing a sum of gravitational torques on the joints. Still another one of the kinematic functions constrains the location of the arm to perform collision avoidance. Generically, one of the kinematic functions minimizes a sum of selected mechanical parameters of at least some of the joints associated with weighting coefficients which may be changed during arm movement. The mechanical parameters may be velocity errors or position errors or gravity torques associated with individual joints.
Four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture are presented. Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left and right-singular vectors) for sparse matrices arising from two practical applications: information retrieval and seismic reflection tomography are emphasized. The target architectures for implementations are the CRAY-2S/4-128 and Alliant FX/80. The sparse SVD problem is well motivated by recent information-retrieval techniques in which dominant singular values and their corresponding singular vectors of large sparse term-document matrices are desired, and by nonlinear inverse problems from seismic tomography applications which require approximate pseudo-inverses of large sparse Jacobian matrices.
A new coarse grid acceleration scheme for the Euler equations is presented. This flux based scheme eliminates the need, exhibited by previous accelerators, for computing flux vector Jacobian matrices. The method is derived and implemented in a two dimensional flow algorithm. Numerical results are presented for both subcritical and shocked, supercritical flow. These results demonstrate that the flux based accelerator is more efficient than its Jacobian based counterpart. Generalization to three dimensions is immediate. Construction of flux based accelerators for the Navier-Stokes equations is also discussed.
In the usual formulation of the aircraft state-estimation problem, motions along a flight trajectory are represented by a plant consisting of nonlinear state and measurement models. Problem solution using this formulation requires that both state- and measurement-dependent Jacobian matrices be evaluated along any trajectory. In this paper it is shown that a set of state variables can be chosen to realize a linear state model of very simple form, such that all nonlinearities appear in the measurement model. The potential advantage of the new formulation is computational: the Jacobian matrix corresponding to a linear state model is constant, a feature that should outweigh the fact that the measurement model is more complicated than in the conventinal formulation. To compare the modeling methods, aircraft motions from typical flight-test and accident data were estimated, using each formulation with the same off-line (smoothing) algorithm. The results of these experiments, reported in the paper, demonstrate clearly the computational superiority of the linear state-variable formulation. The procedure advocated here may be extended to other nonlinear estimation problems, including on-line (filtering) applications.
Although the Navier-Stokes equations describe most flows of interest in aerodynamics, the inviscid conservation law equations may be used for small regions with viscous forces. Thus, Euler equations and several time-accurate finite difference procedures, explicit and implicit, are discussed. Although implicit techniques require more computational work, they permit larger time steps to be taken without instability. It is noted that the Jacobian matrices for Euler equations in conservation-law form have certain eigenvalue-eigenvector properties which may be used to construct conservative-form coefficient matrices. This reduces the computation time of several implicit and semiimplicit schemes. Extensions of the basic approach to other areas are suggested.
Linear optimal regulator theory is applied to a nonlinear simulation of a transport aircraft performing a helical landing approach. A closed form expression for the quasi-steady nominal flight path is presented along with the method for determining the corresponding constant nominal control inputs. The Jacobian matrices and the weighting matrices in the cost functional are time varying. A method of solving for the optimal feedback gains is reviewed. The control system is tested on several alternative landing approaches using both three and six degree flight path angles. On each landing approach, the aircraft was subjected to large random initial state errors and to randomly directed crosswinds. The system was also tested for sensitivity to changes in the parameters of the aircraft and of the atmosphere. Performance of the optimal controller on all the three degree approaches was very good, and the control system proved to be reasonably insensitive to parametric uncertainties.
A linear optimal regulator theory was applied to a nonlinear simulation of a transport aircraft performing a helical landing approach. A closed-form expression for the quasi-steady nominal flight path is presented along with the method for determining the corresponding constant nominal control inputs. The Jacobian matrices and the weighting matrices in the cost functional were time varying. A method of solving for the optimal feedback gains is reviewed. The control system was tested on several alternative landing approaches using both 3 deg and 6 deg flight path angles. On each landing approach, the aircraft was subjected to large random initial-state errors and to randomly directed crosswinds. The system was also tested for sensitivity to changes in the parameters of the aircraft and of the atmosphere. Results indicate that performance of the optimal controller on all the 3 deg approaches is very good. The control system proved to be reasonably insensitive to parametric uncertainties. Performance is not as good on the 6 deg approaches. A modification to the 6 deg flight path was proposed for the purpose of improving performance.
A numerical technique was developed which generates linear perturbation models from nonlinear aircraft vehicle simulations. The technique is very general and can be applied to simulations of any system that is described by nonlinear differential equations. The computer program used to generate these models is discussed, with emphasis placed on generation of the Jacobian matrices, calculation of the coefficients needed for solving the perturbation model, and generation of the solution of the linear differential equations. An example application of the technique to a nonlinear model of the NASA terminal configured vehicle is included.
A Gauss-Newton algorithm is presented for solving nonlinear least squares problems. The problem statement may include simple bounds or more general constraints on the unknowns. The algorithm uses a trust region that allows the objective function to increase with logic for retreating to best values. The computations for the linear problem are done using a least squares system solver that allows for simple bounds and linear constraints. The trust region limits are defined by a box around the current point. In its current form the algorithm is effective only for problems with small residuals, linear constraints and dense Jacobian matrices. Results on a set of test problems are encouraging.