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 1,315 records · Page 73

Numerical computations on one-dimensional inverse scattering problems

An approximate method to determine the index of refraction of a dielectric obstacle is presented. For simplicity one dimensional models of electromagnetic scattering are treated. The governing equations yield a second order boundary value problem, in which the index of refraction appears as a functional parameter. The availability of reflection coefficients yield two additional boundary conditions. The index of refraction by a k-th order spline which can be written as a linear combination of B-splines is approximated. For N distinct reflection coefficients, the resulting N boundary value problems yield a system of N nonlinear equations in N unknowns which are the coefficients of the B-splines.

Dunn, M. H.↗

Reed Solomon codes for error control in byte organized computer memory systems

A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256K-bit DRAM's are organized in 32Kx8 bit-bytes. Byte oriented codes such as Reed Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. Some special decoding techniques for extended single-and-double-error-correcting RS codes which are capable of high speed operation are presented. These techniques are designed to find the error locations and the error values directly from the syndrome without having to use the iterative algorithm to find the error locator polynomial.

Lin, S.↗

Numerical computations on one-dimensional inverse scattering problems

An approximate method to determine the index of refraction of a dielectric obstacle is presented. For simplicity one dimensional models of electromagnetic scattering are treated. The governing equations yield a second order boundary value problem, in which the index of refraction appears as a functional parameter. The availability of reflection coefficients yield two additional boundary conditions. The index of refraction by a k-th order spline which can be written as a linear combination of B-splines is approximated. For N distinct reflection coefficients, the resulting N boundary value problems yield a system of N nonlinear equations in N unknowns which are the coefficients of the B-splines.

Dunn, M. H.↗

Parallel triangularization of substructured finite element problems

Much of the computational effort of the finite element process involves the solution of a system of linear equations. The coefficient matrix of this system, known as the global stiffness matrix, is symmetric, positive definite, and generally sparse. An important technique for reducing the time required to solve this system is substructuring or matrix partitioning. Substructuring is based on the idea of dividing a structure into pieces, each of which can then be analyzed relatively indepenently. As a result of this division, each point in the finite element discretization is either interior to a substructure or on a boundary between substructures. Contributions to the global stiffness matrix from connections between boundary points from the K(bb) matrix are reported. The triangularization of a general K(bb) matrix on a parallel machine is specifically discussed.

Leuze, M. R.↗

Simulation and control problems in elastic robots

Computational issues associated with modeling and control of robots with revolute joints and elastic arms are considered. A manipulator with one arm and pinned at one end is considered to investigate various aspects of the modeling procedure and the model, and the effect of coupling between the rigid-body and the elastic motions. The rigid-body motion of a manipulator arm is described by means of a reference frame attached to the shadow beam, and the linear elastic operator denoting flexibility is defined with respect to this reference frame. The small elastic motion assumption coupled with the method of assumed modes is used to model the elasticity in the arm. It is shown that only terms up to quadratic in these model amplitudes need to be retained. An important aspect of the coupling between the rigid-body and the elastic motion is the centrifugal stiffening effect. This effect stiffens the elastic structure, as to be expected on physical grounds, gives rise to a time-varying inertia term for the rigid-body motion, and, in general, results in an effective inertia term smaller than the rigid-body inertia term. Simulation results are presented for an elastic beam pinned at one end and free at the other, and rotating in a horizontal plane, and control issues such as the order of the model, number of sensors, and modal extraction are examined within this context.

Tadikonda, S. S. K.↗

Dynamically allocating sets of fine-grained processors to running computations

Researchers explore an approach to using general purpose parallel computers which involves mapping hardware resources onto computations instead of mapping computations onto hardware. Problems such as processor allocation, task scheduling and load balancing, which have traditionally proven to be challenging, change significantly under this approach and may become amenable to new attacks. Researchers describe the implementation of this approach used by the FFP Machine whose computation and communication resources are repeatedly partitioned into disjoint groups that match the needs of available tasks from moment to moment. Several consequences of this system are examined.

Middleton, David↗

A displacement gradient BEM for accurate stress computation near boundaries in 2-D anisotropic problems

A displacement gradient method for 2D anisotropic elasticity problems is presented, which effectively minimizes the boundary layer effect through a two-step procedure. First, the boundary integral equations are solved for the unknown boundary displacements and tractions. Second, a direct integral equation for displacement gradients is developed in terms of boundary tractions. Three methods based on different evaluation procedures and locations for determining the displacement gradients are proposed. In the first method the displacement gradients are averaged at nodes common to adjacent elements. The second method stores the gradients element-wise. In the third method, the gradients are evaluated at the nodes of discontinuous elements. The three methods are applied to near-isotropic plates with circular and elliptic cutouts. It is concluded that all three methods can yield accurate stress distributions.

Sistla, R.↗

Enhanced Simulation Techniques in Predicting Sonic Boom Loudness Using CFD

This paper outlines advancements in predicting sonic boom loudness within the Launch, Ascent, and Vehicle Aerodynamics (LAVA) computational framework. Traditionally, a two step process consisting of a steady state computational fluid dynamics problem for near-field analysis and a far-field propagation solver for calculation of loudness metrics has been used. Improvements to this process made in this work include utilizing a high-order space marching method for mid-field computations, developing a novel output-based mesh adaptation method targeting error in near-field pressure sig-natures, and developing a robust scripting system using curvilinear grids to increase robustness and simplify the process of running large databases of simulation cases. These advancements are detailed and applied to the simulation of the X-59, presenting comparative cost and timing analyses between the prior two step workflow and the current three step procedure. We achieve increased accuracy and robustness for loudness predictions with at least a50%computational cost reduction.

CST↗

Selecting Observation Platforms for Optimized Anomaly Detectability under Unreliable Partial Observations

Diagnosers for keeping track on the occurrences of special events in the framework of unreliable partially observed discrete-event dynamical systems were developed in previous work. This paper considers observation platforms consisting of sensors that provide partial and unreliable observations and of diagnosers that analyze them. Diagnosers in observation platforms typically perform better as sensors providing the observations become more costly or increase in number. This paper proposes a methodology for finding an observation platform that achieves an optimal balance between cost and performance, while satisfying given observability requirements and constraints. Since this problem is generally computational hard in the framework considered, an observation platform optimization algorithm is utilized that uses two greedy heuristics, one myopic and another based on projected performances. These heuristics are sequentially executed in order to find best observation platforms. The developed algorithm is then applied to an observation platform optimization problem for a multi-unit-operation system. Results show that improved observation platforms can be found that may significantly reduce the observation platform cost but still yield acceptable performance for correctly inferring the occurrences of special events.

97 MATHEMATICS AND COMPUTING↗

Developing A Navier-Stokes Algorithm For Supercomputers

Report discusses development of algorithm for solution of Navier-Stokes equations of flow on parallel-processing supercomputers. Involves combination of prior techniques to form algorithm to compute flows in complicated three-dimensional configurations. Includes explicit finite-difference numerical-integration scheme applicable to flows represented by hierarchy of mathematical models ranging from Euler to full Navier-Stokes. Of interest to researchers looking for ways to structure problems for greater computational efficiency.

Swisshelm, Julie M.↗

Sensor Configuration Selection for Discrete-Event Systems under Unreliable Observations

Algorithms for counting the occurrences of special events in the framework of partially-observed discrete event dynamical systems (DEDS) were developed in previous work. Their performances typically become better as the sensors providing the observations become more costly or increase in number. This paper addresses the problem of finding a sensor configuration that achieves an optimal balance between cost and the performance of the special event counting algorithm, while satisfying given observability requirements and constraints. Since this problem is generally computational hard in the framework considered, a sensor optimization algorithm is developed using two greedy heuristics, one myopic and the other based on projected performances of candidate sensors. The two heuristics are sequentially executed in order to find best sensor configurations. The developed algorithm is then applied to a sensor optimization problem for a multiunit- operation system. Results show that improved sensor configurations can be found that may significantly reduce the sensor configuration cost but still yield acceptable performance for counting the occurrences of special events.

97 MATHEMATICS AND COMPUTING↗

Technique for atmospheric rate chemistry calculations

The possibility that predictions of atmospheric photochemistry/transport models are sensitive to uncertainties in reaction rates and other inputs stresses the need for rapid numerical integration schemes in rate photochemistry problems. Reducing the computational burden has a major merit in facilitating sensitivity studies to assess the effect of uncertainties on predicted ozone diminutions from NOx (NO + NO2) in the exhaust plume of SST engines. The paper discusses the validity of an algorithmic approach to integration of rate chemistry problems in combustion, developed by Rubel and Baronti for an approximate calculation of the production rate of the i-th chemical species involved. An analysis of two projected SST engines confirms the validity of the proposed algorithm. Because of the relative arithmetical simplicity, it may be easier to treat diffusion rate chemistry calculations using the Rubel and Baronti approximation than would be possible by other approaches.

Matloff, G. L.↗

STRUTEX: A prototype knowledge-based system for initially configuring a structure to support point loads in two dimensions

Only recently have engineers begun making use of Artificial Intelligence (AI) tools in the area of conceptual design. To continue filling this void in the design process, a prototype knowledge-based system, called STRUTEX has been developed to initially configure a structure to support point loads in two dimensions. This prototype was developed for testing the application of AI tools to conceptual design as opposed to being a testbed for new methods for improving structural analysis and optimization. This system combines numerical and symbolic processing by the computer with interactive problem solving aided by the vision of the user. How the system is constructed to interact with the user is described. Of special interest is the information flow between the knowledge base and the data base under control of the algorithmic main program. Examples of computed and refined structures are presented during the explanation of the system.

Robers, James L.↗

Computer aided reliability, availability, and safety modeling for fault-tolerant computer systems with commentary on the HARP program

Many of the most challenging reliability problems of our present decade involve complex distributed systems such as interconnected telephone switching computers, air traffic control centers, aircraft and space vehicles, and local area and wide area computer networks. In addition to the challenge of complexity, modern fault-tolerant computer systems require very high levels of reliability, e.g., avionic computers with MTTF goals of one billion hours. Most analysts find that it is too difficult to model such complex systems without computer aided design programs. In response to this need, NASA has developed a suite of computer aided reliability modeling programs beginning with CARE 3 and including a group of new programs such as: HARP, HARP-PC, Reliability Analysts Workbench (Combination of model solvers SURE, STEM, PAWS, and common front-end model ASSIST), and the Fault Tree Compiler. The HARP program is studied and how well the user can model systems using this program is investigated. One of the important objectives will be to study how user friendly this program is, e.g., how easy it is to model the system, provide the input information, and interpret the results. The experiences of the author and his graduate students who used HARP in two graduate courses are described. Some brief comparisons were made with the ARIES program which the students also used. Theoretical studies of the modeling techniques used in HARP are also included. Of course no answer can be any more accurate than the fidelity of the model, thus an Appendix is included which discusses modeling accuracy. A broad viewpoint is taken and all problems which occurred in the use of HARP are discussed. Such problems include: computer system problems, installation manual problems, user manual problems, program inconsistencies, program limitations, confusing notation, long run times, accuracy problems, etc.

Shooman, Martin L.↗

Parallel quantum computing simulations via quantum accelerator platform virtualization

Quantum circuit execution is a central task in quantum computation. Due to inherent quantum-mechanical constraints, quantum computing workflows often involve a considerable number of independent measurements over a large set of slightly different quantum circuits. Here we discuss a simple model for parallelizing such quantum circuit executions that is based on introducing a large array of virtual quantum processing units (mapped to HPC nodes in our case) as a parallel quantum computing platform. Implemented within the XACC framework, the model can readily take advantage of its backend-agnostic features, enabling parallel quantum computing/simulation over any target backend supported by XACC. We illustrate the performance of this approach by demonstrating strong scaling in two pertinent domain science problems, namely in computing the gradients for the multi-contracted variational quantum eigensolver and in data-driven quantum circuit learning, where we vary the number of qubits and the number of circuit layers. Here, the latter simulation leverages the cuQuantum library to run efficiently on GPU-accelerated HPC platforms.

97 MATHEMATICS AND COMPUTING↗