Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximate inverses”

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 19 records

Wavelet Sparse Approximate Inverse Preconditioners

There is an increasing interest in using sparse approximate inverses as preconditioners for Krylov subspace iterative methods. Recent studies of Grote and Huckle and Chow and Saad also show that sparse approximate inverse preconditioner can be effective for a variety of matrices, e.g. Harwell-Boeing collections. Nonetheless a drawback is that it requires rapid decay of the inverse entries so that sparse approximate inverse is possible. However, for the class of matrices that, come from elliptic PDE problems, this assumption may not necessarily hold. Our main idea is to look for a basis, other than the standard one, such that a sparse representation of the inverse is feasible. A crucial observation is that the kind of matrices we are interested in typically have a piecewise smooth inverse. We exploit this fact, by applying wavelet techniques to construct a better sparse approximate inverse in the wavelet basis. We shall justify theoretically and numerically that our approach is effective for matrices with smooth inverse. We emphasize that in this paper we have only presented the idea of wavelet approximate inverses and demonstrated its potential but have not yet developed a highly refined and efficient algorithm.

Chan, Tony F.↗

Inversion and approximation of Laplace transforms

A method of inverting Laplace transforms by using a set of orthonormal functions is reported. As a byproduct of the inversion, approximation of complicated Laplace transforms by a transform with a series of simple poles along the left half plane real axis is shown. The inversion and approximation process is simple enough to be put on a programmable hand calculator.

Lear, W. M.↗

An approximation for inverse Laplace transforms

Programmable calculator runs simple finite-series approximation for Laplace transform inversions. Utilizing family of orthonormal functions, approximation is used for wide range of transforms, including those encountered in feedback control problems. Method works well as long as F(t) decays to zero as it approaches infinity and so is appliable to most physical systems.

Lear, W. M.↗

Galerkin approximation for inverse problems for nonautonomous nonlinear distributed systems

An abstract framework and convergence theory is developed for Galerkin approximation for inverse problems involving the identification of nonautonomous nonlinear distributed parameter systems. A set of relatively easily verified conditions is provided which are sufficient to guarantee the existence of optimal solutions and their approximation by a sequence of solutions to a sequence of approximating finite dimensional identification problems. The approach is based on the theory of monotone operators in Banach spaces and is applicable to a reasonably broad class of nonlinear distributed systems. Operator theoretic and variational techniques are used to establish a fundamental convergence result. An example involving evolution systems with dynamics described by nonstationary quasilinear elliptic operators along with some applications are presented and discussed.

Banks, H. T.↗

Polynomial Compensation, Inversion, And Approximation

New criterion introduced for design of discrete-time compensator. Method devised for polynomial compensation, inversion, and approximation of discrete-time linear systems. Involves quadratic measure of difference between response of compensated system and desired response. Impulse response of compensated system improves as degree of polynomial increases. Compensator emphasizes matching of large initial response. Compensators used in variety of applications, including navigation systems for spacecraft, aircraft, ships, and automated manufacturing equipment.

Baram, Yoram↗

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↗

Approximated Stable Inversion for Nonlinear Systems with Nonhyperbolic Internal Dynamics

A technique to achieve output tracking for nonminimum phase nonlinear systems with non- hyperbolic internal dynamics is presented. The present paper integrates stable inversion techniques (that achieve exact-tracking) with approximation techniques (that modify the internal dynamics) to circumvent the nonhyperbolicity of the internal dynamics - this nonhyperbolicity is an obstruction to applying presently available stable inversion techniques. The theory is developed for nonlinear systems and the method is applied to a two-cart with inverted-pendulum example.

Devasia, Santosh↗

A unified framework for approximation in inverse problems for distributed parameter systems

A theoretical framework is presented that can be used to treat approximation techniques for very general classes of parameter estimation problems involving distributed systems that are either first or second order in time. Using the approach developed, one can obtain both convergence and stability (continuous dependence of parameter estimates with respect to the observations) under very weak regularity and compactness assumptions on the set of admissible parameters. This unified theory can be used for many problems found in the recent literature and in many cases offers significant improvements to existing results.

Banks, H. T.↗

A fast semi-implicit algorithm for problems of mixed type

Certain physical processes are modeled by partial differential equations which are parabolic over part of the domain and elliptic over the remainder. A family of semi-implicit algorithms which are well suited to initial-boundary value problems of this mixed type is discussed. One important feature of these algorithms is the use of an approximate inverse for the solution of the implicit linear system. A strong error analysis results in an estimate of the total error as a function of approximate inverse error e and time step h.

Frederickson, P. O.↗

Recursive inversion of externally defined linear systems

The approximate inversion of an internally unknown linear system, given by its impulse response sequence, by an inverse system having a finite impulse response, is considered. The recursive least squares procedure is shown to have an exact initialization, based on the triangular Toeplitz structure of the matrix involved. The proposed approach also suggests solutions to the problems of system identification and compensation.

Bach, Ralph E., Jr.↗

Recursive inversion of externally defined linear systems by FIR filters

The approximate inversion of an internally unknown linear system, given by its impulse response sequence, by an inverse system having a finite impulse response, is considered. The recursive least-squares procedure is shown to have an exact initialization, based on the triangular Toeplitz structure of the matrix involved. The proposed approach also suggests solutions to the problem of system identification and compensation.

Bach, Ralph E., Jr.↗

Mie forward scattering - Improved semiempirical approximation with application to particle size distribution inversion

The approximation of Penndorf (1962) and Shifrin-Punina (1968) to the Mie solution at forward scattering angles are extended to small size parameters. The proposed semiempirical approximation accurately represents the Mie results down to x = 0.5-1 for refractive index m = 1.33, and to x = 2.0 for larger index values. The implications of the result for the inversion of particle size distribution from single scattering data in the forward direction are discussed.

Fymat, A. L.↗

Second-order p-iterative solution of the Lambert/Gauss problem

An algorithm is presented for efficient p-iterative solution of the Lambert/Gauss orbit-determination problem using second-order Newton iteration. The algorithm is based on a universal transformation of Kepler's time-of-flight equation and approximate inverse solutions of this equation for short-way and long-way flight paths. The approximate solutions provide both good starting values for iteration and simplified computation of the second-order term in the iteration formula. Numerical results are presented which indicate that in many cases of practical significance (except those having collinear position vectors) the algorithm produces at least eight significant digits of accuracy with just two or three steps of iteration.

Boltz, F. W.↗

A thin-shock-layer solution for nonequilibrium, inviscid hypersonic flows in earth, Martian, and Venusian atmospheres

An approximate inverse solution is presented for the nonequilibrium flow in the inviscid shock layer about a vehicle in hypersonic flight. The method is based upon a thin-shock-layer approximation and has the advantage of being applicable to both subsonic and supersonic regions of the shock layer. The relative simplicity of the method makes it ideally suited for programming on a digital computer with a significant reduction in storage capacity and computing time required by other more exact methods. Comparison of nonequilibrium solutions for an air mixture obtained by the present method is made with solutions obtained by two other methods. Additional cases are presented for entry of spherical nose cones into representative Venusian and Martian atmospheres. A digital computer program written in FORTRAN language is presented that permits an arbitrary gas mixture to be employed in the solution. The effects of vibration, dissociation, recombination, electronic excitation, and ionization are included in the program.

Grose, W. L.↗

A Hybrid Parallel Preconditioning Algorithm For CFD

A new hybrid preconditioning algorithm will be presented which combines the favorable attributes of incomplete lower-upper (ILU) factorization with the favorable attributes of the approximate inverse method recently advocated by numerous researchers. The quality of the preconditioner is adjustable and can be increased at the cost of additional computation while at the same time the storage required is roughly constant and approximately equal to the storage required for the original matrix. In addition, the preconditioning algorithm suggests an efficient and natural parallel implementation with reduced communication. Sample calculations will be presented for the numerical solution of multi-dimensional advection-diffusion equations. The matrix solver has also been embedded into a Newton algorithm for solving the nonlinear Euler and Navier-Stokes equations governing compressible flow. The full paper will show numerous examples in CFD to demonstrate the efficiency and robustness of the method.

Barth,Timothy J.↗

Round-off errors in cutting plane algorithms based on the revised simplex procedure

This report statistically analyzes computational round-off errors associated with the cutting plane approach to solving linear integer programming problems. Cutting plane methods require that the inverse of a sequence of matrices be computed. The problem basically reduces to one of minimizing round-off errors in the sequence of inverses. Two procedures for minimizing this problem are presented, and their influence on error accumulation is statistically analyzed. One procedure employs a very small tolerance factor to round computed values to zero. The other procedure is a numerical analysis technique for reinverting or improving the approximate inverse of a matrix. The results indicated that round-off accumulation can be effectively minimized by employing a tolerance factor which reflects the number of significant digits carried for each calculation and by applying the reinversion procedure once to each computed inverse. If 18 significant digits plus an exponent are carried for each variable during computations, then a tolerance value of 0.1 x 10 to the minus 12th power is reasonable.

Moore, J. E.↗

Backed Bending Actuator

Bending actuators of a proposed type would partly resemble ordinary bending actuators, but would include simple additional components that would render them capable of exerting large forces at small displacements. Like an ordinary bending actuator, an actuator according to the proposal would include a thin rectangular strip that would comprise two bonded layers (possibly made of electroactive polymers with surface electrodes) and would be clamped at one end in the manner of a cantilever beam. Unlike an ordinary bending actuator, the proposed device would include a rigid flat backplate that would support part of the bending strip against backward displacement; because of this feature, the proposed device is called a backed bending actuator. When an ordinary bending actuator is inactive, the strip typically lies flat, the tip displacement is zero, and the force exerted by the tip is zero. During activation, the tip exerts a transverse force and undergoes a bending displacement that results from the expansion or contraction of one or more of the bonded layers. The tip force of an ordinary bending actuator is inversely proportional to its length; hence, a long actuator tends to be weak. The figure depicts an ordinary bending actuator and the corresponding backed bending actuator. The bending, the tip displacement (d(sub t)), and the tip force (F) exerted by the ordinary bending actuator are well approximated by the conventional equations for the loading and deflection of a cantilever beam subject to a bending moment which, in this case, is applied by the differential expansion or contraction of the bonded layers. The bending, displacement, and tip force of the backed bending actuator are calculated similarly, except that it is necessary to account for the fact that the force F(sub b) that resists the displacement of the tip could be sufficient to push part of the strip against the backplate; in such a condition, the cantilever beam would be effectively shortened (length L*) and thereby stiffened and, hence, made capable of exerting a greater tip force for a given degree of differential expansion or contraction of the bonded layers. Taking all of these effects into account, the cantilever-beam equations show that F(sub b) would be approximately inversely proportional to d(sup 1/2) for d less than a calculable amount, denoted the transition displacement (dt). For d less than d(sub t), part of the strip would be pressed against the backplate. Therefore, the force F(sub b) would be very large for d at or near zero and would decrease as d increases toward d(sub t). At d greater than d(sub t), none of the strip would be pressed against the backplate and F(sub b) would equal the tip force F of the corresponding ordinary bending actuator. The advantage of the proposal is that a backed bending actuator could be made long to obtain large displacement when it encountered little resistance but it could also exert a large zero-displacement force, so that it could more easily start the movement of a large mass, throw a mechanical switch, or release a stuck mechanism.

Costen, Robert C.↗

Inverse kinematic solution for near-simple robots and its application to robot calibration

This paper provides an inverse kinematic solution for a class of robot manipulators called near-simple manipulators. The kinematics of these manipulators differ from those of simple-robots by small parameter variations. Although most robots are by design simple, in practice, due to manufacturing tolerances, every robot is near-simple. The method in this paper gives an approximate inverse kinematics solution for real time applications based on the nominal solution for these robots. The validity of the results are tested both by a simulation study and by applying the algorithm to a PUMA robot.

Hayati, Samad A.↗