Engineering topics

Yip, E. L.

Publications and source records attributed to Yip, E. L..

3 records

NASA NTRS1984

Development and applications of algorithms for calculating the transonic flow about harmonically oscillating wings

A finite difference method to solve the unsteady transonic flow about harmonically oscillating wings was investigated. The procedure is based on separating the velocity potential into steady and unsteady parts and linearizing the resulting unsteady differential equation for small disturbances. The differential equation for the unsteady velocity potential is linear with spatially varying coefficients and with the time variable eliminated by assuming harmonic motion. An alternating direction implicit procedure was investigated, and a pilot program was developed for both two and three dimensional wings. This program provides a relatively efficient relaxation solution without previously encountered solution instability problems. Pressure distributions for two rectangular wings are calculated. Conjugate gradient techniques were developed for the asymmetric, indefinite problem. The conjugate gradient procedure is evaluated for applications to the unsteady transonic problem. Different equations for the alternating direction procedure are derived using a coordinate transformation for swept and tapered wing planforms. Pressure distributions for swept, untaped wings of vanishing thickness are correlated with linear results for sweep angles up to 45 degrees.

Ehlers, F. E.↗

NASA NTRS1982

Out-of-Core Solutions of Complex Sparse Linear Equations

ETCLIB is library of subroutines for obtaining out-of-core solutions of complex sparse linear equations. Routines apply to dense and sparse matrices too large to be stored in core. Useful for solving any set of linear equations, but particularly useful in cases where coefficient matrix has no special properties that guarantee convergence with any of interative processes. The only assumption made is that coefficient matrix is not singular.

Yip, E. L.↗

NASA NTRS1979

FORTRAN subroutines for out-of-core solutions of large complex linear systems

The design and usage of two main subprograms using direct methods to solve large linear complex systems, of the form Ax = b, whose coeffficient matrices are too large to be stored in core are described. The first main subprogram is for systems whose coefficient matrices are of a particular sparse structure, namely, the matrix A can be written in the form B + D, where B is a block-banded system, and D has only a few columns of nonzeros. Key elements of the algorithms used in the subprograms include: the data structure, the strategy for preserving numerical stability, the adaptability of the algorithms for dense systems as well as for block-profile systems.

Yip, E. L.↗