Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

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 145 records · Page 8

Preconditioned upwind methods to solve 3-D incompressible Navier-Stokes equations for viscous flows

A computational method for calculating low-speed viscous flowfields is developed. The method uses the implicit upwind-relaxation finite-difference algorithm with a nonsingular eigensystem to solve the preconditioned, three-dimensional, incompressible Navier-Stokes equations in curvilinear coordinates. The technique of local time stepping is incorporated to accelerate the rate of convergence to a steady-state solution. An extensive study of optimizing the preconditioned system is carried out for two viscous flow problems. Computed results are compared with analytical solutions and experimental data.

Hsu, C.-H.↗

Two self-test methods applied to an inertial system problem

The paper describes two self-test procedures applied to the problem of estimating the biases in accelerometers and gyroscopes on an inertial platform. The first technique is the weighted sum-squared residual (WSSR) test, with which accelerator bias jumps are easily isolated, but gyro bias jumps are difficult to isolate. The WSSR method does not take full advantage of the knowledge of system dynamics. The other technique is a multiple hypothesis method developed by Buxbaum and Haddad (1969). It has the advantage of directly providing jump isolation information, but suffers from computational problems. It might be possible to use the WSSR to detect state jumps and then switch to the BH system for jump isolation and estimate compensation.

Willsky, A. S.↗

Model reduction by trimming for a class of semi-Markov reliability models and the corresponding error bound

Semi-Markov processes have proved to be an effective and convenient tool to construct models of systems that achieve reliability by redundancy and reconfiguration. These models are able to depict complex system architectures and to capture the dynamics of fault arrival and system recovery. A disadvantage of this approach is that the models can be extremely large, which poses both a model and a computational problem. Techniques are needed to reduce the model size. Because these systems are used in critical applications where failure can be expensive, there must be an analytically derived bound for the error produced by the model reduction technique. A model reduction technique called trimming is presented that can be applied to a popular class of systems. Automatic model generation programs were written to help the reliability analyst produce models of complex systems. This method, trimming, is easy to implement and the error bound easy to compute. Hence, the method lends itself to inclusion in an automatic model generator.

White, Allan L.↗

Theory for computing the field scattered from a smooth inflected surface

A theory is described for computing the reflected or scattered field from a smooth body with inflection points. These inflections occur in certain directions at each surface point for which the total (Gaussian) curvature is zero or negative. For surface illumination in one of these critical directions, the usual reflection formulas obtained by the high-frequency approximation are inapplicable, and a shadow zone exists in the reflected field. Scattering into the shadow zone is treated, as well as specular reflection. This theory should have a variety of applications such as for certain optics problems, computer graphics modeling of three-dimensional shapes, and the design and analysis of specialized microwave reflector antennas.

Barger, R. L.↗

Self-Scheduling Parallel Methods for Multiple Serial Codes with Application to WOPWOP

This paper presents a scheme for efficiently running a large number of serial jobs on parallel computers. Two examples are given of computer programs that run relatively quickly, but often they must be run numerous times to obtain all the results needed. It is very common in science and engineering to have codes that are not massive computing challenges in themselves, but due to the number of instances that must be run, they do become large-scale computing problems. The two examples given here represent common problems in aerospace engineering: aerodynamic panel methods and aeroacoustic integral methods. The first example simply solves many systems of linear equations. This is representative of an aerodynamic panel code where someone would like to solve for numerous angles of attack. The complete code for this first example is included in the appendix so that it can be readily used by others as a template. The second example is an aeroacoustics code (WOPWOP) that solves the Ffowcs Williams Hawkings equation to predict the far-field sound due to rotating blades. In this example, one quite often needs to compute the sound at numerous observer locations, hence parallelization is utilized to automate the noise computation for a large number of observers.

Long, Lyle N.↗

Multiresolution and Explicit Methods for Vector Field Analysis and Visualization

We first report on our current progress in the area of explicit methods for tangent curve computation. The basic idea of this method is to decompose the domain into a collection of triangles (or tetrahedra) and assume linear variation of the vector field over each cell. With this assumption, the equations which define a tangent curve become a system of linear, constant coefficient ODE's which can be solved explicitly. There are five different representation of the solution depending on the eigenvalues of the Jacobian. The analysis of these five cases is somewhat similar to the phase plane analysis often associate with critical point classification within the context of topological methods, but it is not exactly the same. There are some critical differences. Moving from one cell to the next as a tangent curve is tracked, requires the computation of the exit point which is an intersection of the solution of the constant coefficient ODE and the edge of a triangle. There are two possible approaches to this root computation problem. We can express the tangent curve into parametric form and substitute into an implicit form for the edge or we can express the edge in parametric form and substitute in an implicit form of the tangent curve. Normally the solution of a system of ODE's is given in parametric form and so the first approach is the most accessible and straightforward. The second approach requires the 'implicitization' of these parametric curves. The implicitization of parametric curves can often be rather difficult, but in this case we have been successful and have been able to develop algorithms and subsequent computer programs for both approaches. We will give these details along with some comparisons in a forthcoming research paper on this topic.

Source record↗

A History of High-Performance Computing

Faster than most speedy computers. More powerful than its NASA data-processing predecessors. Able to leap large, mission-related computational problems in a single bound. Clearly, it s neither a bird nor a plane, nor does it need to don a red cape, because it s super in its own way. It's Columbia, NASA s newest supercomputer and one of the world s most powerful production/processing units. Named Columbia to honor the STS-107 Space Shuttle Columbia crewmembers, the new supercomputer is making it possible for NASA to achieve breakthroughs in science and engineering, fulfilling the Agency s missions, and, ultimately, the Vision for Space Exploration. Shortly after being built in 2004, Columbia achieved a benchmark rating of 51.9 teraflop/s on 10,240 processors, making it the world s fastest operational computer at the time of completion. Putting this speed into perspective, 20 years ago, the most powerful computer at NASA s Ames Research Center, home of the NASA Advanced Supercomputing Division (NAS), ran at a speed of about 1 gigaflop (one billion calculations per second). The Columbia supercomputer is 50,000 times faster than this computer and offers a tenfold increase in capacity over the prior system housed at Ames. What s more, Columbia is considered the world s largest Linux-based, shared-memory system. The system is offering immeasurable benefits to society and is the zenith of years of NASA/private industry collaboration that has spawned new generations of commercial, high-speed computing systems.

Source record↗

State reduction for semi-Markov reliability models

Semi-Markov processes have proved to be an effective and convenient tool to construct models of systems that achieve reliability by redundancy and reconfiguration. These models are able to depict complex system architectures and to capture the dynamics of fault arrival and system recovery. A disadvantage of this approach is that the models can be extremely large, which poses both a model construction and a computational problem. Techniques are needed to reduce the model size. Because these systems are used in critical applications where failure can be expensive, there must be an analytically derived bound for the error produced by the model reduction technique. Automatic model generation programs have been written to help the reliability analyst produce models of complex systems. Because of the importance of these programs, the model reduction technique needs to be precise and easily implemented. This paper presents a model reduction technique called trimming that can be applied to a popular class of systems. An error bound for the trimming procedure is derived that uses readily available system parameters. The trimming procedure is precisely described and appears easy to implement in a model generation program.

Reduced order systems↗

Efficiency of parallel direct optimization

Tremendous progress has been made at the level of sequential computation in phylogenetics. However, little attention has been paid to parallel computation. Parallel computing is particularly suited to phylogenetics because of the many ways large computational problems can be broken into parts that can be analyzed concurrently. In this paper, we investigate the scaling factors and efficiency of random addition and tree refinement strategies using the direct optimization software, POY, on a small (10 slave processors) and a large (256 slave processors) cluster of networked PCs running LINUX. These algorithms were tested on several data sets composed of DNA and morphology ranging from 40 to 500 taxa. Various algorithms in POY show fundamentally different properties within and between clusters. All algorithms are efficient on the small cluster for the 40-taxon data set. On the large cluster, multibuilding exhibits excellent parallel efficiency, whereas parallel building is inefficient. These results are independent of data set size. Branch swapping in parallel shows excellent speed-up for 16 slave processors on the large cluster. However, there is no appreciable speed-up for branch swapping with the further addition of slave processors (>16). This result is independent of data set size. Ratcheting in parallel is efficient with the addition of up to 32 processors in the large cluster. This result is independent of data set size. c2001 The Willi Hennig Society.

NASA Discipline Evolutionary Biology↗

Computer grading of examinations

A method, using IBM cards and computer processing, automates examination grading and recording and permits use of computational problems. The student generates his own answers, and the instructor has much greater freedom in writing questions than is possible with multiple choice examinations.

Frigerio, N. A.↗

Estimation of elastic aircraft parameters using the maximum likelihood method

The application of the maximum likelihood method to estimate the aerodynamic parameters of elastic flight vehicles in a symmetric flight condition is discussed. In this application, particular attention is directed toward the center of mass, elastic deformation, and sensor equations of motion. It is shown that the two major computational problems to be overcome are the inversion of large-sized matrices and the time-wise integration of a large number of linear, ordinary, differential equations.

Schwanz, R. C.↗

Thermoacoustic convection of fluids in low gravity

The heat flow in a confined perfect gas in low gravity is investigated, including the effects of conduction and thermal convection. Buoyancy-driven flow is neglected, due to the low-gravity environment, but the effect of thermoacoustic motion due to fluid compressibility is included. One-dimensional mathematical models are constructed from the conservation equations for a compressible, viscous, heat-conducting fluid. A conservative, time-dependent finite-difference method is used to generate numerical solutions on a digital computer. Problems for flat plates and cylindrical segments are solved for specified thermal boundary conditions. Numerical results are given which indicate that thermoacoustic convection can significantly increase the transient heat flow over conduction model predictions for cases where a confined gas is rapidly heated.

Spradley, L. W.↗

A simulation of synthetic aperture radar imaging of ocean waves

A simulation of radar imaging of ocean waves with synthetic aperture techniques is presented. The modelling is simplistic from the oceanographic and electromagnetic viewpoint in order to minimize the computational problems, yet reveal some of the physical problems associated with the imaging of moving ocean waves. The model assumes: (1) The radar illuminates a one-dimensional, one harmonic ocean wave. (2) The scattering is assumed to be governed by geometrical optics. (3) The radar is assumed to be down-looking, with Doppler processing (range processing is suppressed due to the one-dimensional nature of the problem). (4) The beamwidth of the antenna (or integration time) is assumed to be sufficiently narrow to restrict the specular points of the peaks and troughs of the wave. The results show that conventional processing of the image gives familiar results if the ocean waves are stationary. When the ocean wave dispersion relationship is satisfied, the image is smeared due to the motion of the specular points over the integration time. In effect, the image of the ocean is transferred to the near field of the synthetic aperture.

Swift, C. T.↗

Absorption line studies of reflection from horizontally inhomogeneous layers

The article details an inhomogeneous reflecting layer (IRFL) model designed to survey absorption line behavior from a Squires-like cloud cover (which is characterized by convection cell structure). Computational problems and procedures are discussed in detail. The results show trends usually opposite to those predicted by a simple reflecting layer model. Per cent equivalent width variations for the tower model are usually somewhat greater for weak than for relatively strong absorption lines, with differences of a factor of about two or three. IRFL equivalent width variations do not differ drastically as a function of geometry when the total volume of absorbing gas is held constant. The IRFL results are in many instances consistent with observed equivalent width variations of Jupiter, Saturn, and Venus.

Appleby, J. F.↗

A model for sequential decoding overflow due to a noisy carrier reference

An approximate analysis of the effect of a noisy carrier reference on the performance of sequential decoding is presented. The analysis uses previously developed techniques for evaluating noisy reference performance for medium-rate uncoded communications adapted to sequential decoding for data rates of 8 to 2048 bits/s. In estimating the ten to the minus fourth power deletion probability thresholds for Helios, the model agrees with experimental data to within the experimental tolerances. The computational problem involved in sequential decoding, carrier loop effects, the main characteristics of the medium-rate model, modeled decoding performance, and perspectives on future work are discussed.

Layland, J. W.↗

Quantum chemical calculation of the equilibrium structures of small metal atom clusters

Metal atom clusters are studied based on the application of ab initio quantum mechanical approaches. Because these large 'molecular' systems pose special practical computational problems in the application of the quantum mechanical methods, there is a special need to find simplifying techniques that do not compromise the reliability of the calculations. Research is therefore directed towards various aspects of the implementation of the effective core potential technique for the removal of the metal atom core electrons from the calculations.

Kahn, L. R.↗

Shuttle automatic landing system

The Shuttle automatic landing system design requirements are discussed, the approach and landing flight phase is described, and the hardware and software subsystems are functionally described. Emphasis is placed on the complexity, flexibility, and criticality of the software function. The software structure, critical computational problems, and verification process as a subsystem are discussed. Finally, the hardware/software verification activities required before flight test of the autoland system are described, along with the results from two flight tests and the planned system certification to the operational flight boundaries.

Tsikalas, G.↗