SEARCH · Search NASA

Results for “Inverse problem”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 577 records · Page 32

All sources NASA NTRS DOE OSTI

NASA NTRS1987

Polynomial compensation, inversion, and approximation of discrete time linear systems

The least-squares transformation of a discrete-time multivariable linear system into a desired one by convolving the first with a polynomial system yields optimal polynomial solutions to the problems of system compensation, inversion, and approximation. The polynomial coefficients are obtained from the solution to a so-called normal linear matrix equation, whose coefficients are shown to be the weighting patterns of certain linear systems. These, in turn, can be used in the recursive solution of the normal equation.

Baram, Yoram↗

NASA NTRS1986

Numerical pole assignment by eigenvalue Jacobian inversion

A numerical procedure for solving the linear pole placement problem is developed which operates by the inversion of an analytically determined eigenvalue Jacobian matrix. Attention is given to convergence characteristics and pathological situations. It is not concluded that the algorithm developed is suitable for computer-aided control system design with particular reference to the scan platform pointing control system for the Galileo spacecraft.

Sevaston, George E.↗

NASA NTRS1987

Parallel processing architecture for computing inverse differential kinematic equations of the PUMA arm

In advanced robot control problems, on-line computation of inverse Jacobian solution is frequently required. Parallel processing architecture is an effective way to reduce computation time. A parallel processing architecture is developed for the inverse Jacobian (inverse differential kinematic equation) of the PUMA arm. The proposed pipeline/parallel algorithm can be inplemented on an IC chip using systolic linear arrays. This implementation requires 27 processing cells and 25 time units. Computation time is thus significantly reduced.

Hsia, T. C.↗

NASA NTRS1990

Spatial operator approach to flexible manipulator inverse and forward dynamics

This study extends to flexible multibody manipulators the recent results of the author on the use of spatially recursive filtering and smoothing techniques for robot arm dynamics. The configuration analyzed is that of a mechanical system of flexible bodies joined together by articulated joints. The inverse and forward dynamics problems are solved using the techniques of spatially recursive Kalman filtering and smoothing. The algorithms are easily developed using a set of identities associated with mass matrix factorization and inversion. The identities are easily derived using a spatial operator algebra developed by the author.

Rodriguez, G.↗

NASA NTRS1991

Spatial operator approach to flexible multibody system dynamics and control

The inverse and forward dynamics problems for flexible multibody systems were solved using the techniques of spatially recursive Kalman filtering and smoothing. These algorithms are easily developed using a set of identities associated with mass matrix factorization and inversion. These identities are easily derived using the spatial operator algebra developed by the author. Current work is aimed at computational experiments with the described algorithms and at modelling for control design of limber manipulator systems. It is also aimed at handling and manipulation of flexible objects.

Rodriguez, G.↗

NASA NTRS1971

Inversion of very large matrices encountered in large scale problems of photogrammetry and photographic astrometry

The simultaneous adjustment of very large nets of overlapping plates covering the celestial sphere becomes computationally feasible by virtue of a twofold process that generates a system of normal equations having a bordered-banded coefficient matrix, and solves such a system in a highly efficient manner. Numerical results suggest that when a well constructed spherical net is subjected to a rigorous, simultaneous adjustment, the exercise of independently established control points is neither required for determinancy nor for production of accurate results.

Brown, D. C.↗

NASA NTRS2014

Validation of Spherically Symmetric Inversion by Use of a Tomographically Reconstructed Three-Dimensional Electron Density of the Solar Corona

Determining the coronal electron density by the inversion of white-light polarized brightness (pB) measurements by coronagraphs is a classic problem in solar physics. An inversion technique based on the spherically symmetric geometry (spherically symmetric inversion, SSI) was developed in the 1950s and has been widely applied to interpret various observations. However, to date there is no study of the uncertainty estimation of this method. We here present the detailed assessment of this method using a three-dimensional (3D) electron density in the corona from 1.5 to 4 solar radius as a model, which is reconstructed by a tomography method from STEREO/COR1 observations during the solar minimum in February 2008 (Carrington Rotation, CR 2066).We first show in theory and observation that the spherically symmetric polynomial approximation (SSPA) method and the Van de Hulst inversion technique are equivalent. Then we assess the SSPA method using synthesized pB images from the 3D density model, and find that the SSPA density values are close to the model inputs for the streamer core near the plane of the sky (POS) with differences generally smaller than about a factor of two; the former has the lower peak but extends more in both longitudinal and latitudinal directions than the latter. We estimate that the SSPA method may resolve the coronal density structure near the POS with angular resolution in longitude of about 50 deg. Our results confirm the suggestion that the SSI method is applicable to the solar minimum streamer (belt), as stated in some previous studies. In addition, we demonstrate that the SSPA method can be used to reconstruct the 3D coronal density, roughly in agreement with the reconstruction by tomography for a period of low solar activity (CR 2066). We suggest that the SSI method is complementary to the 3D tomographic technique in some cases, given that the development of the latter is still an ongoing research effort.

corona↗

NASA NTRS1991

Generalized multi-point inverse airfoil design

In a rather general sense, inverse airfoil design can be taken to mean the problem of specifying a desired set of airfoil characteristics, such as the airfoil maximum thickness ratio, pitching moment, part of the velocity distribution or boundary-layer development, etc., then from this information determine the corresponding airfoil shape. This paper presents a method which approaches the design problem from this perspective. In particular, the airfoil is divided into segments along which, together with the design conditions, either the velocity distribution or boundary-layer development may be prescribed. In addition to these local desired distributions, single parameters like the airfoil thickness can be specified. The problem of finding the airfoil shape is determined by coupling an incompressible, inviscid, inverse airfoil design method with a direct integral boundary-layer analysis method and solving the resulting nonlinear equations via a multidimensional Newton iteration technique. The approach is fast and easily allows for interactive design. It is also flexible and could be adapted to solving compressible, inverse airfoil design problems.

Selig, Michael S.↗

NASA NTRS1999

Co-evolution for Problem Simplification

This paper explores a co-evolutionary approach applicable to difficult problems with limited failure/success performance feedback. Like familiar "predator-prey" frameworks this algorithm evolves two populations of individuals - the solutions (predators) and the problems (prey). The approach extends previous work by rewarding only the problems that match their difficulty to the level of solut,ion competence. In complex problem domains with limited feedback, this "tractability constraint" helps provide an adaptive fitness gradient that, effectively differentiates the candidate solutions. The algorithm generates selective pressure toward the evolution of increasingly competent solutions by rewarding solution generality and uniqueness and problem tractability and difficulty. Relative (inverse-fitness) and absolute (static objective function) approaches to evaluating problem difficulty are explored and discussed. On a simple control task, this co-evolutionary algorithm was found to have significant advantages over a genetic algorithm with either a static fitness function or a fitness function that changes on a hand-tuned schedule.

Haith, Gary L.↗

NASA NTRS1990

Automatic generation of forward and inverse kinematics for a reconfigurable modular manipulator system

An algorithm is proposed for automatically generating both the forward and inverse kinematics of a serial-link N-degree-of-freedom reconfigurable manipulator (RM). Generation of the kinematic equations that govern a modular manipulator starts with geometric descriptions of the units, or modules, as well as their sequence in the manipulator. This geometric information is used to obtain the Denavit-Hartenberg (DH) parameters of an RM. The DH kinematic parameters are then used to obtain the forward kinematic transformation of the system. The problem of obtaining the inverse kinematics of RMs is addressed, and the idea of scaling an RM to automate the inverse kinematics and make the procedure as general as possible is proposed.

Kelmar, Laura↗

NASA NTRS1992

Kinematics of an in-parallel actuated manipulator based on the Stewart platform mechanism

This paper presents kinematic equations and solutions for an in-parallel actuated robotic mechanism based on Stewart's platform. These equations are required for inverse position and resolved rate (inverse velocity) platform control. NASA LaRC has a Vehicle Emulator System (VES) platform designed by MIT which is based on Stewart's platform. The inverse position solution is straight-forward and computationally inexpensive. Given the desired position and orientation of the moving platform with respect to the base, the lengths of the prismatic leg actuators are calculated. The forward position solution is more complicated and theoretically has 16 solutions. The position and orientation of the moving platform with respect to the base is calculated given the leg actuator lengths. Two methods are pursued in this paper to solve this problem. The resolved rate (inverse velocity) solution is derived. Given the desired Cartesian velocity of the end-effector, the required leg actuator rates are calculated. The Newton-Raphson Jacobian matrix resulting from the second forward position kinematics solution is a modified inverse Jacobian matrix. Examples and simulations are given for the VES.

Williams, Robert L., II↗

NASA NTRS1986

Kalman filtering, smoothing and recursive robot arm forward and inverse dynamics

The inverse and forward dynamics problems for multi-link serial manipulators are solved by using recursive techniques from linear filtering and smoothing theory. The pivotal step is to cast the system dynamics and kinematics as a two-point boundary-value problem. Solution of this problem leads to filtering and smoothing techniques identical to the equations of Kalman filtering and Bryson-Frazier fixed time-interval smoothing. The solutions prescribe an inward filtering recursion to compute a sequence of constraint moments and forces followed by an outward recursion to determine a corresponding sequence of angular and linear accelerations. In addition to providing techniques to compute joint accelerations from applied joint moments (and vice versa), the report provides an approach to evaluate recursively the composite multi-link system inertia matrix and its inverse. The report lays the foundation for the potential use of filtering and smoothing techniques in robot inverse and forward dynamics and in robot control design.

Rodriguez, G.↗

NASA NTRS1988

Recursive dynamics of topological trees of rigid bodies via Kalman filtering and Bryson-Frazier smoothing

The inverse and forward dynamics problems for a set of rigid bodies connected by hinges to form a topological tree are solved by using recursive techniques from linear filtering and smoothing theory. An inward filtering sequence computes a set of constraint moments and forces. This is followed by an outward sequence to determine a corresponding set of angular and linear accelerations. An inward sequence begins at the tips of all of the terminal bodies of the tree and proceeds inwardly through all of the branches until it reaches the root. Similarly, an outward sequence begins at the root and propagates to all of the tree branches until it reaches the tips of the terminal bodies. The paper also provides an approach to evaluate recursively the composite multibody system inertia matrix and its inverse.

Rodriguez, G.↗

NASA NTRS2015

Estimation of Surface Temperature and Heat Flux by Inverse Heat Transfer Methods Using Internal Temperatures Measured While Radiantly Heating a Carbon/Carbon Specimen up to 1920 F

The ability to solve the heat conduction equation is needed when designing materials to be used on vehicles exposed to extremely high temperatures; e.g. vehicles used for atmospheric entry or hypersonic flight. When using test and flight data, computational methods such as finite difference schemes may be used to solve for both the direct heat conduction problem, i.e., solving between internal temperature measurements, and the inverse heat conduction problem, i.e., using the direct solution to march forward in space to the surface of the material to estimate both surface temperature and heat flux. The completed research first discusses the methods used in developing a computational code to solve both the direct and inverse heat transfer problems using one dimensional, centered, implicit finite volume schemes and one dimensional, centered, explicit space marching techniques. The developed code assumed the boundary conditions to be specified time varying temperatures and also considered temperature dependent thermal properties. The completed research then discusses the results of analyzing temperature data measured while radiantly heating a carbon/carbon specimen up to 1920 F. The temperature was measured using thermocouple (TC) plugs (small carbon/carbon material specimens) with four embedded TC plugs inserted into the larger carbon/carbon specimen. The purpose of analyzing the test data was to estimate the surface heat flux and temperature values from the internal temperature measurements using direct and inverse heat transfer methods, thus aiding in the thermal and structural design and analysis of high temperature vehicles.

Pizzo, Michelle↗

NASA NTRS1992

Sources of unbounded priority inversions in real-time systems and a comparative study of possible solutions

In the design of real-time systems, tasks are often assigned priorities. Preemptive priority driven schedulers are used to schedule tasks to meet the timing requirements. Priority inversion is the term used to describe the situation when a higher priority task's execution is delayed by lower priority tasks. Priority inversion can occur when there is contention for resources among tasks of different priorities. The duration of priority inversion could be long enough to cause tasks to miss their dead lines. Priority inversion cannot be completely eliminated. However, it is important to identify sources of priority inversion and minimize the duration of priority inversion. In this paper, a comprehensive review of the problem of and solutions to unbounded priority inversion is presented.

Davari, Sadegh↗

DOE OSTI2024

Implementation and (Inverse Modified) Error Analysis for Implicitly Templated ODE-Nets

We focus on learning unknown dynamics from data using ODE-nets templated on implicit numerical initial value problem solvers. First, we perform inverse modified error analysis of the ODE-nets using unrolled implicit schemes for ease of interpretation. It is shown that training an ODE-net using an unrolled implicit scheme returns a close approximation of an inverse modified differential equation (IMDE). In addition, we establish a theoretical basis for hyperparameter selection when training such ODE-nets, whereas current strategies usually treat numerical integration of ODE-nets as a black box. We thus formulate an adaptive algorithm which monitors the level of error and adapts the number of (unrolled) implicit solution iterations during the training process, so that the error of the unrolled approximation is less than the current learning loss. This helps accelerate training while maintaining accuracy. Several numerical experiments are performed to demonstrate the advantages of the proposed algorithm compared to nonadaptive unrollings and validate the theoretical analysis. Here, we also note that this approach naturally allows for incorporating partially known physical terms in the equations, giving rise to what is termed “gray box” identification.

ODE-nets↗

NASA NTRS1964

Inverse estimation

Inverse estimation technique for problems in experimental design

PROBLEM SOLVING↗

NASA NTRS1981

The design and analysis of low-speed airfoils

PROFILE program solves diverse and inverse airfoil-flow problems. It combines conformational mapping method for design of airfoils with prescribed velocity-distribution characteristics, panel method for potential-flow analysis, and boundary-layer method. PROFILE is written in FORTRAN IV for implementation on CDC 6000-series computer.

Eppler, R.↗