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,099 records · Page 61

Vectorization on the star computer of several numerical methods for a fluid flow problem

A reexamination of some numerical methods is considered in light of the new class of computers which use vector streaming to achieve high computation rates. A study has been made of the effect on the relative efficiency of several numerical methods applied to a particular fluid flow problem when they are implemented on a vector computer. The method of Brailovskaya, the alternating direction implicit method, a fully implicit method, and a new method called partial implicitization have been applied to the problem of determining the steady state solution of the two-dimensional flow of a viscous imcompressible fluid in a square cavity driven by a sliding wall. Results are obtained for three mesh sizes and a comparison is made of the methods for serial computation.

Lambiotte, J. J., Jr.↗

Evaluation of accuracy and convergence of numerical coupling approaches for poroelasticity benchmark problems

Accurate modeling of subsurface flow and transport processes is vital as the prevalence of subsurface activities such as carbon sequestration, geothermal recovery, and nuclear waste disposal increases. Computational modeling of these problems leverages poroelasticity theory, which describes coupled fluid flow and mechanical deformation. Although fully coupled monolithic schemes are accurate for coupled problems, they can demand significant computational resources for large problems. In this work, a fixed stress scheme is implemented into the Sandia Sierra Multiphysics toolkit. Two implementation methods, along with the fully coupled method, are verified with one-dimensional (1D) Terzaghi, 2D Mandel, and 3D Cryer sphere benchmark problems. The impact of a range of material parameters and convergence tolerances on numerical accuracy and efficiency was evaluated. Overall the fixed stress schemes achieved acceptable numerical accuracy and efficiency compared to the fully coupled scheme. However, the accuracy of the fixed stress scheme tends to decrease with low permeable cases, requiring the finer tolerance to achieve a desired numerical accuracy. For the fully coupled scheme, high numerical accuracy was observed in most of cases except a low permeability case where an order of magnitude finer tolerance was required for accurate results. Finally, a two-layer Terzaghi problem and an injection–production well system were used to demonstrate the applicability of findings from the benchmark problems for more realistic conditions over a range of permeability. Simulation results suggest that the fixed stress scheme provides accurate solutions for all cases considered with the proper adjustment of the tolerance. Furthermore, this work clearly demonstrates the robustness of the fixed stress scheme for coupled poroelastic problems, while a cautious selection of numerical tolerance may be required under certain conditions with low permeable materials.

58 GEOSCIENCES↗

Numerical methods in Markov chain modeling

Several methods for computing stationary probability distributions of Markov chains are described and compared. The main linear algebra problem consists of computing an eigenvector of a sparse, usually nonsymmetric, matrix associated with a known eigenvalue. It can also be cast as a problem of solving a homogeneous singular linear system. Several methods based on combinations of Krylov subspace techniques are presented. The performance of these methods on some realistic problems are compared.

Philippe, Bernard↗

Computational models and resource allocation for supercomputers

There are several different architectures used in supercomputers, with differing computational models. These different models present a variety of resource allocation problems that must be solved. The computational needs of a program must be cast in terms of the computational model supported by the supercomputer, and this must be done in a way that makes effective use of the machine's resources. This is the resource allocation problem. The computational models of available supercomputers and the associated resource allocation techniques are surveyed. It is shown that many problems and solutions appear repeatedly in very different computing environments. Some case studies are presented, showing concrete computational models and the allocation strategies used.

Mauney, Jon↗

Development and application of computational aerothermodynamics flowfield computer codes

Multiple nozzle plume flow field is computed with a 3-D, Navier-Stokes solver. Numerical simulation is performed with a flux-split, two-factor, time asymptotic viscous flow solver of Ying and Steger. The two factor splitting provides a stable 3-D solution procedure under ideal-gas assumptions. An ad-hoc acceleration procedure that shows promise in improving the convergence rate by a factor of three for steady state problems is utilized. Computed solutions to generic problems at various altitude and flight conditions show flow field complexity and three-dimensional effects due to multiple nozzle jet interactions. Viscous, ideal gas solutions for the symmetric nozzle are compared with other numerical solutions.

Venkatapathy, Ethiraj↗

Accelerating Flash-X Simulations with Asynchronous I/O

Most high-fidelity physics simulation codes, such as Flash-X, need to save intermediate results (checkpoint files) to restart or gain insights into the evolution of the simulation. These simulation codes save such intermediate files synchronously, where computation is stalled while the data is written to storage. Depending on the problem size and computational requirements, this file write time can be a substantial portion of the total simulation time. In order to hide the I/O latency of checkpointing, asynchronous I/O methods have been introduced. These methods use background threads for performing I/O while the main threads continue with the simulation. The usage of background threads can compete for resources on the node as well as with communication. In this paper, we evaluate the overheads and the overall benefit of asynchronous I/O in HDF5 to simulations. Results from real-world high-fidelity simulations on the Summit supercomputer show that I/O operation is overlapped with application communication or computation or both, effectively hiding some or all of the I/O latency. Our evaluation shows that while using asynchronous I/O adds overhead to the application, the I/O time reduction is more significant, resulting in overall up to 1.5X performance speedup.

Jain, Rajeev↗

Microwave backscattering and emission model for grass canopies

Microwave radar and radiometer measurements of grasslands indicate a substantial reduction in sensor sensitivity to soil moisture in the presence of a thatch layer. When this layer is wet it masks changes in the underlying soil, making the canopy appear warm in the case of passive sensors (radiometer) and decreasing backscatter in the active case (scatterometer). A model for a grass canopy with thatch will be presented in this paper to explain this behavior and to compare with observations. The canopy model consists of three layers: grass, thatch, and the underlying soil. The grass blades are modeled by elongated elliptical discs and the thatch is modeled as a collection of disk shaped water droplets (i.e., the dry matter is neglected). The ground is homogeneous and flat. The distorted Born approximation is used to compute the radar cross section of this three layer canopy and the emissivity is computed from the radar cross section using the Peake formulation for the passive problem. Results are computed at L-band (1.4 GHz) and C-band (4.75 GHz) using canopy parameters (i.e., plant geometry, soil moisture, plant moisture, etc.) representative of Konza Prairie grasslands. The results are compared to C-band scatterometer measurements and L-band radiometer measurements at these grasslands.

TRT-THEORETICAL↗

Multifidelity Analysis and Optimization for Supersonic Design

Supersonic aircraft design is a computationally expensive optimization problem and multifidelity approaches over a significant opportunity to reduce design time and computational cost. This report presents tools developed to improve supersonic aircraft design capabilities including: aerodynamic tools for supersonic aircraft configurations; a systematic way to manage model uncertainty; and multifidelity model management concepts that incorporate uncertainty. The aerodynamic analysis tools developed are appropriate for use in a multifidelity optimization framework, and include four analysis routines to estimate the lift and drag of a supersonic airfoil, a multifidelity supersonic drag code that estimates the drag of aircraft configurations with three different methods: an area rule method, a panel method, and an Euler solver. In addition, five multifidelity optimization methods are developed, which include local and global methods as well as gradient-based and gradient-free techniques.

Kroo, Ilan↗

Fully Coupled Aeroelastic Stability Analysis of Adaptive Shape Memory Alloy Structural Technologies for Airframe Noise Reduction

This final report documents work performed by ATA Engineering, Inc., (ATA) to develop computational models and analyze the coupled fluid-structure response of two types of noise treatments applied to the leading-edge-slat component of a high-lift system typical of modern transport aircraft. The first treatment is a slat-gap filler (SGF), which closes the gap between the suction surfaces of a deployed slat and an aircraft main wing, and the second treatment is a slat-cove filler (SCF), which replaces the recirculating flow on the slat cove with a surface that promotes flow attachment. The representative airframe chosen for this work was NASA’s High-Lift Common Research Model (CRM-HL) in a baseline high-lift configuration. Superelastic shape memory alloys (SMAs) have been identified as enabling materials for these structural treatments. Since the technology elements rely upon having a highly reconfigurable structure, designs were assessed for their static aeroelastic deflection as well as their dynamic aeroelastic stability using coupled computational fluid dynamics (CFD) and nonlinear computational structural dynamics (NL-CSD) tools. Specifically, fluid-structure interaction (FSI) problems were solved computationally using the CFD solver Loci/CHEM and the NL-CSD solver Abaqus. As a part of the overall project, a similar capability was implemented using the CFD solver FUN3D coupled to Abaqus, although that work is documented in a separate report and that FSI framework was not used to analyze any of NASA’s SGF and SCF configurations. The technical approach consisted of solving for the flow field around the entire vehicle using a global CFD model, followed by extraction of relevant local subdomain data for CFD and NL-CSD co-simulations. The SGF design was analyzed using both 2D and 3D co-simulations to predict quasi-static aeroelastic deformations and to assess dynamic aeroelastic stability, whereas the SCF was analyzed in 2D only. SGF static aeroelastic response predictions focused on characterizing the deformed shape, with maximum displacements predicted to be on the order of magnitude of the technology element panel thickness. SGF dynamic aeroelastic response predictions used Partial Floquet analysis of the temporal evolution of selected nodal displacements to quantify the sign and magnitude of aeroelastic damping. Results suggest that the CRM-HL operating conditions would result in a dynamically stable response. The simulated dynamic pressure was also increased up to a factor of about four, and resulting responses suggest that predicted dynamic stability would be achieved with some margin.

Fluid Structure Interaction↗

PAGOSA Mesh Block Calculator

A method for automatically generating the “mesh namelist block” portion of a PAGOSA input file, which specifies the boundaries and zone sizes of the computational mesh, has been developed. This application standardizes the mesh block for 2-, and 3-dimensional problems and is computed after the user specifies the extent and resolution of the mesh and the number of processors which will be used to run the problem. The inputs may be provided directly through a series of command-line guided questions, or a separate input file. The mesh block is written to both standard output and to disk.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Structural zooming research and development of an interactive computer graphical interface for stress analysis of cracks

Engineering problems sometimes involve the numerical solution of boundary value problems over domains containing geometric feature with widely varying scales. Often, a detailed solution is required at one or more of these features. Small details in large structures may have profound effects upon global performance. Conversely, large-scale conditions may effect local performance. Many man-hours and CPU-hours are currently spent in modeling such problems. With the structural zooming technique, it is now possible to design an integrated program which allows the analyst to interactively focus upon a small region of interest, to modify the local geometry, and then to obtain highly accurate responses in that region which reflect both the properties of the overall structure and the local detail. A boundary integral equation analysis program, called BOAST, was recently developed for the stress analysis of cracks. This program can accurately analyze two-dimensional linear elastic fracture mechanics problems with far less computational effort than existing finite element codes. An interactive computer graphical interface to BOAST was written. The graphical interface would have several requirements: it would be menu-driven, with mouse input; all aspects of input would be entered graphically; the results of a BOAST analysis would be displayed pictorially but also the user would be able to probe interactively to get numerical values of displacement and stress at desired locations within the analysis domain; the entire procedure would be integrated into a single, easy to use package; and it would be written using calls to the graphic package called HOOPS. The program is nearing completion. All of the preprocessing features are working satisfactorily and were debugged. The postprocessing features are under development, and rudimentary postprocessing should be available by the end of the summer. The program was developed and run on a VAX workstation, and must be ported to the SUN workstation. This activity is currently underway.

Gerstle, Walter↗

Boundary and Initial Condition Issues for Computational Fluid Dynamics (CFD) and Modeling and Simulation (Mod-Sim)

For many important classes of Mod-Sim problems, even quantum computing will not enable accurate predictions/computation vis-à-vis the real world due to boundary/initial condition shortfalls in terms of both range of parameters and requisite amplitudes/coverage. The Mod-Sim community needs to consider going forward the knowability of initial and boundary conditions.

Dennis M. Bushnell↗

Quantum Computing and Cryptography: Analysis, Risks, and Recommendations for Decisionmakers

Some influential American policymakers, scholars, and analysts are extremely concerned with the effects that quantum computing will have on national security. Similar to the way space technology was viewed in the context of the US-Soviet rivalry in the Cold War, they view scientific advancement in quantum computing as a race with significant national security consequences and a part of the emerging US-China rivalry. It is claimed that the winner of this race will be able to thwart all the cryptographic efforts of the loser and gain unfettered access to any state secret of the losing government. Additionally, it is suggested that the winner will be able to protect their secrets with a higher level of security than contemporary cryptography guarantees at the moment. This paper argues that these three claims are considerably overstated, and that policymakers and scholars should shift focus to a different national security problem that quantum computing will create. Maintaining the long-term security of secret information secured by contemporary cryptographic protections, which will fail against an attack by a future quantum computer, is the predominant challenge needing attention. This paper takes a technically-informed approach to this issue. It first lays out the national security problems that are envisioned in much of the current discourse surrounding quantum computing. Then, it will assess the technical advantages that quantum computers will have over classical computers in the field of cryptography. Next, it will provide an explanation of the specific ways that the technical realities of quantum computing are inconsistent with the predominant areas of concern. Following, it will highlight the more pressing national security problem posed by quantum computing that the public discussion has, for the most part, missed. The piece will conclude with recommendations for how to mitigate this issue.

97 MATHEMATICS AND COMPUTING↗

Evaluating the Computational Requirements of using SVM software to train Data-Intensive Problems

Support vector machine (SVM) technology is a growing class of computational algorithms for solving classification problems using supervised learning. There are many freely available SVM codes with implementations of varying granularity in the core optimization task. The performance of SVM implementations is related to four key elements; (1) the size and dimension of the data set on which they are operating, (2) the granularity of their core SVM optimization implementation, (3) the kernel transformation applied to the data, and the (4) underlying hardware on which the implementation is running. To assess the performance of different SVM implementations, several freely available codes representing the spectrum of optimization granularity were built on a variety of hardware—two linux clusters, and a shared memory machine. Binary classifiers were trained on datasets of varying size containing anywhere from a few hundred to over 50,000 vectors. Performance of the methods was measured in terms of wall-clock time for training, statistical quality of the resulting classifier, hardware performance (memory footprint, memory bandwidth, floating point unit usage, I/O bandwidth, and instruction stalls), robustness and portability.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Hill Problem Analytical Theory to the Order Four. Application to the Computation of Frozen Orbits around Planetary Satellites

Frozen orbits of the Hill problem are determined in the double averaged problem, where short and long period terms are removed by means of Lie transforms. The computation of initial conditions of corresponding quasi periodic solutions in the non-averaged problem is straightforward for the perturbation method used provides the explicit equations of the transformation that connects the averaged and non-averaged models. A fourth order analytical theory reveals necessary for the accurate computation of quasi periodic, frozen orbits.

Lara, Martin↗

Mapping unstructured grid computations to massively parallel computers

Investigated here is this mapping problem: assign the tasks of a parallel program to the processors of a parallel computer such that the execution time is minimized. First, a taxonomy of objective functions and heuristics used to solve the mapping problem is presented. Next, we develop a highly parallel heuristic mapping algorithm, called Cyclic Pairwise Exchange (CPE), and discuss its place in the taxonomy. CPE uses local pairwise exchanges of processor assignments to iteratively improve an initial mapping. A variety of initial mapping schemes are tested and recursive spectral bipartitioning (RSB) followed by CPE is shown to result in the best mappings. For the test cases studied here, problems arising in computational fluid dynamics and structural mechanics on unstructured triangular and tetrahedral meshes, RSB and CPE outperform methods based on simulated annealing. Much less time is required to do the mapping and the results obtained are better. Compared with random and naive mappings, RSB and CPE reduce the communication time two fold for the test problems used. Finally, we use CPE in two applications on a CM-2. The first application is a data parallel mesh-vertex upwind finite volume scheme for solving the Euler equations on 2-D triangular unstructured meshes. CPE is used to map grid points to processors. The performance of this code is compared with a similar code on a Cray-YMP and an Intel iPSC/860. The second application is parallel sparse matrix-vector multiplication used in the iterative solution of large sparse linear systems of equations. We map rows of the matrix to processors and use an inner-product based matrix-vector multiplication. We demonstrate that this method is an order of magnitude faster than methods based on scan operations for our test cases.

Hammond, Steven Warren↗

Combining Hadoop with MPI to Solve Metagenomics Problems that are both Data- and Compute-intensive

Metagenomics, the study of all microbial species cohabitants in an environment, usually produces large amount of sequence data varying from several GBs to a few TBs. Analyzing metagenomics data includes both data-intensive and compute-intensive steps, making the entire process hard to scale. Here we aim to optimize a metagenomics application that partitions the shortgun metagenomics sequences based on their species of origin. Our solution combines MapReduce-based BioPig analytic toolkit with MPI to provide scalability in respective to both data and compute. We also made some improvements to the existing BioPig toolkit by using simplified data types and compressed k-mer storage. These optimizations leads up to 193× speedup for the computing-intensive step and 9.6× speedup over the entire pipeline. Our optimized application is also capable of processing datasets that are 16 times larger on the same hardware platform. These conclusions indicate integrating heterogeneous technologies such as Hadoop and MPI is quite efficient to solve large genomics problems that are both data-intensive and compute-intensive.

97 MATHEMATICS AND COMPUTING↗

Algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations with the use of parallel computations

An algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations is presented. The algorithm for systems of first-order differential equations is implemented in the EDELWEISS code with the possibility of parallel computations on supercomputers employing the MPI (Message Passing Interface) standard for the data exchange between parallel processes. The solution is represented by a series of orthogonal polynomials on the interval [0, 1]. The algorithm is characterized by simplicity and the possibility to solve nonlinear problems with a correction of the operator in accordance with the solution obtained in the previous iterative process.

74 ATOMIC AND MOLECULAR PHYSICS↗