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 847 records · Page 47

A Posteriori Analysis of Adaptive Multiscale Operator Decomposition Methods for Multiphysics Problems

This project was concerned with the accurate computational error estimation for numerical solutions of multiphysics, multiscale systems that couple different physical processes acting across a large range of scales relevant to the interests of the DOE. Multiscale, multiphysics models are characterized by intimate interactions between different physics across a wide range of scales. This poses significant computational challenges addressed by the proposal, including: (1) Accurate and efficient computation; (2) Complex stability; and (3) Linking different physics. The research in this project focused on Multiscale Operator Decomposition methods for solving multiphysics problems. The general approach is to decompose a multiphysics problem into components involving simpler physics over a relatively limited range of scales, and then to seek the solution of the entire system through some sort of iterative procedure involving solutions of the individual components. MOD is a very widely used technique for solving multiphysics, multiscale problems; it is heavily used throughout the DOE computational landscape. This project made a major advance in the analysis of the solution of multiscale, multiphysics problems.

97 MATHEMATICS AND COMPUTING↗

EpiK: A Knowledge Base for Epidemiological Modeling and Analytics of Infectious Diseases

Computational epidemiology seeks to develop computational methods to study the distribution and determinants of health-related states or events (including disease), and the application of this study to the control of diseases and other health problems. Recent advances in computing and data sciences have led to the development of innovative modeling environments to support this important goal. The datasets used to drive the dynamic models as well as the data produced by these models presents unique challenges owing to their size, heterogeneity and diversity. These datasets form the basis of effective and easy to use decision support and analytical environments. As a result, it is important to develop scalable data management systems to store, manage and integrate these datasets. In this paper, we develop EpiK —a knowledge base that facilitates the development of decision support and analytical environments to support epidemic science. An important goal is to develop a framework that links the input as well as output datasets to facilitate effective spatio-temporal and social reasoning that is critical in planning and intervention analysis before and during an epidemic. The data management framework links modeling workflow data and its metadata using a controlled vocabulary. The metadata captures information about storage, the mapping between the linked model and the physical layout, and relationships to support services. EpiK is designed to support agent-based modeling and analytics frameworks—aggregate models can be seen as special cases and are thus supported. We use semantic web technologies to create a representation of the datasets that encapsulates both the location and the schema heterogeneity. The choice of RDF as a representation language is motivated by the diversity and growth of the datasets that need to be integrated. A query bank is developed—the queries capture a broad range of questions that can be posed and answered during a typical case study pertaining to disease outbreaks. The queries are constructed using SPARQL Protocol and RDF Query Language (SPARQL) over the EpiK. EpiK can hide schema and location heterogeneity while efficiently supporting queries that span the computational epidemiology modeling pipeline: from model construction to simulation output. As a result, we show that the performance of benchmark queries varies significantly with respect to the choice of hardware underlying the database and resource description framework (RDF) engine.

60 APPLIED LIFE SCIENCES↗

How Many Trip Requests Could We Support? An Activity-Travel Based Vehicle Scheduling Approach

In a world of ever-changing travel behavior and ever-increasing modal options, is vital to have integrated models that could capture the interactions between supply and demand layers of travel. Addressing this need, we propose three different versions of network representation and mathematical models for the activity-based vehicle routing problem to connect activity-travel graphs of passengers (demand layer) to spatio-temporal networks of vehicles (supply layer). Versions I and II are arc-based, while version III is path-based. In version I, we introduce the concept of activity-travel graphs for passengers. For vehicles, we construct space–time networks and add a new dimension, called “under-service state”, to track the execution status of trip requests at any location and time. In version II, we reduce the complexity of the network structure by eliminating the state dimension and some other modifications in the structure of the passengers’ and vehicles’ network. Although both versions can capture various behavioral constraints of the activity-based vehicle routing problem (e.g., mandatory and optimal activities, duration of activities, chain of activities, preferred starting and ending times of activities), due to the high level of complexity of the network structure, both versions can only solve small-sized problems. To tackle the computational complexity, we propose a path-based network representation in version III, and to make a balance between the disutility of passengers and vehicles, we present a tolled user equilibrium problem. Mathematical models are coded in C and GAMS and implemented on real-world Phoenix regional transportation network with more than 39 million trip requests, which demonstrate the effectiveness of the proposed solution for the original and restricted master problems.

33 ADVANCED PROPULSION SYSTEMS↗

Motion Planning Algorithms for Safety and Quantum Computing Efficiency

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.

97 MATHEMATICS AND COMPUTING↗

Constrained Graph Optimization: Interdiction and Preservation Problems

The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.

97 MATHEMATICS AND COMPUTING↗

Computational Particle Dynamic Simulations on Multicore Processors (CPDMu) Final Report Phase I

Statement of Problem - Department of Energy has many legacy codes for simulation of computational particle dynamics and computational fluid dynamics applications that are designed to run on sequential processors and are not easily parallelized. Emerging high-performance computing architectures employ massively parallel multicore architectures (e.g., graphics processing units) to increase throughput. Parallelization of legacy simulation codes is a high priority, to achieve compatibility, efficiency, accuracy, and extensibility. General Statement of Solution - A legacy simulation application designed for implementation on mainly-sequential processors has been represented as a graph G. Mathematical transformations, applied to G, produce a graph representation {und G} for a high-performance architecture. Key computational and data movement kernels of the application were analyzed/optimized for parallel execution using the mapping G {yields} {und G}, which can be performed semi-automatically. This approach is widely applicable to many types of high-performance computing systems, such as graphics processing units or clusters comprised of nodes that contain one or more such units. Phase I Accomplishments - Phase I research decomposed/profiled computational particle dynamics simulation code for rocket fuel combustion into low and high computational cost regions (respectively, mainly sequential and mainly parallel kernels), with analysis of space and time complexity. Using the research team's expertise in algorithm-to-architecture mappings, the high-cost kernels were transformed, parallelized, and implemented on Nvidia Fermi GPUs. Measured speedups (GPU with respect to single-core CPU) were approximately 20-32X for realistic model parameters, without final optimization. Error analysis showed no loss of computational accuracy. Commercial Applications and Other Benefits - The proposed research will constitute a breakthrough in solution of problems related to efficient parallel computation of particle and fluid dynamics simulations. These problems occur throughout DOE, military and commercial sectors: the potential payoff is high. We plan to license or sell the solution to contractors for military and domestic applications such as disaster simulation (aerodynamic and hydrodynamic), Government agencies (hydrological and environmental simulations), and medical applications (e.g., in tomographic image reconstruction). Keywords - High-performance Computing, Graphic Processing Unit, Fluid/Particle Simulation. Summary for Members of Congress - Department of Energy has many simulation codes that must compute faster, to be effective. The Phase I research parallelized particle/fluid simulations for rocket combustion, for high-performance computing systems.

97 MATHEMATICS AND COMPUTING↗

Minimizing phase-space energies

A primary technical challenge for harnessing fusion energy is to control and extract energy from a nonthermal distribution of charged particles. The fact that phase space evolves by symplectomorphisms fundamentally limits how a distribution may be manipulated. While the constraint of phase-space volume preservation is well understood, other constraints remain to be fully appreciated. To better understand these constraints, we study the problem of extracting energy from a distribution of particles using area-preserving and symplectic linear maps. When a quadratic potential is imposed, we find that the maximal extractable energy can be computed as trace minimization problems. We solve these problems and show that the extractable energy under linear symplectomorphisms may be much smaller than the extractable energy under special linear maps. As a result, the method introduced in the present study enables an energy-based proof of the linear Gromov nonsqueezing theorem.

First-principles calculations in plasma physics↗

Multidimensional Analogs of the Cauchy–Riemann System and Representations of Their Solutions via Harmonic Functions

At present, there are numerous multidimensional generalizations of holomorphic vectors. The most general of these is the four-dimensional generalization of the Cauchy–Riemann system. In the present work, by introducing two quaternion functions and the notion of quaternion differentiation, we obtain, for the first time, a five-dimensional generalization of holomorphic vectors. By using the representation of holomorphic vectors via the quaternion harmonic function and its derivatives, we consider the Riemann–Hilbert problem and one problem in a layer. A new solution of the Riemann–Hilbert problem in the five-dimensional half space is obtained.

97 MATHEMATICS AND COMPUTING↗

Active Learning for Metamaterial Optimization on HPC and QC Integrated Systems

Active learning algorithms, integrating machine learning, quantum computing and optics simulation in an iterative loop, offer a promising approach to optimizing metamaterials. However, these algorithms can face difficulties in optimizing highly complex structures due to computational limitations. High-performance computing (HPC) and quantum computing (QC) integrated systems can address these issues by enabling parallel computing. In this study, we develop an active learning algorithm working on HPC-QC integrated systems. We evaluate the performance of optimization processes within active learning (i.e., training a machine learning model, problem-solving with quantum computing, and evaluating optical properties through wave-optics simulation) for highly complex metamaterial cases. Our results showcase that utilizing multiple cores on the integrated system can significantly reduce computational time, thereby enhancing the efficiency of optimization processes. Therefore, we expect that leveraging HPC-QC integrated systems helps effectively tackle large-scale optimization challenges in general.

Kim, Seongmin↗

Hidden fluid mechanics: Learning velocity and pressure fields from flow visualizations

For centuries, flow visualization has been the art of making fluid motion visible in physical and biological systems. Although such flow patterns can be, in principle, described by the Navier-Stokes equations, extracting the velocity and pressure fields directly from the images is challenging. We addressed this problem by developing hidden fluid mechanics (HFM), a physics-informed deep-learning framework capable of encoding the Navier-Stokes equations into the neural networks while being agnostic to the geometry or the initial and boundary conditions. We demonstrate HFM for several physical and biomedical problems by extracting quantitative information for which direct measurements may not be possible.

Raissi, Maziar↗

The Discrete Equation Method (DEM) for Fully Compressible, Two-Phase Flows in Ducts of Spatially Varying Cross-Section

For the simulation of light water nuclear reactor coolant flows, general two-phase models (valid for all volume fractions) have been generally used which, while allowing for velocity disequilibrium, normally force pressure equilibrium between the phases (see, for example, the numerous models of this type described in H. Städtke, Gasdynamic Aspects of Two-Phase Flow, Wiley-VCH, 2006). These equations are not hyperbolic, their physical wave dynamics are incorrect, and their solution algorithms rely on dubious truncation error induced artificial viscosity to render them numerically well posed over a portion of the computational spectrum. The inherent problems of the traditional approach to multiphase modeling, which begins with an averaged system of (ill-posed) partial differential equations (PDEs) which are then discretized to form a numerical scheme, are avoided by employing a new homogenization method known as the Discrete Equation Method (DEM) (R. Abgrall and R. Saurel, Discrete Equations for Physical and Numerical Compressible Multiphase Mixtures, J. Comp. Phys. 186, 361-396, 2003). This method results in well-posed hyperbolic systems, this property being important for transient flows. This also allows a clear treatment of non-conservative terms (terms involving interfacial variables and volume fraction gradients) permitting the solution of interface problems without conservation errors, this feature being important for the direct numerical simulation of two-phase flows. Unlike conventional methods, the averaged system of PDEs for the mixture are not used, and the DEM method directly obtains a well-posed discrete equation system from the single-phase conservation laws, producing a numerical scheme which accurately computes fluxes for arbitrary number of phases and solves non-conservative products. The method effectively uses a sequence of single phase Riemann problem solutions. Phase interactions are accounted for by Riemann solvers at each interface. Non-conservative terms are correctly approximated. Some of the closure relations missing from the traditional approach are automatically obtained. Lastly, the continuous equation system resulting from the discrete equations can be identified by taking the continuous limit with weak-wave assumptions. In this work, this approach is tested by constructing a DEM model for the flow of two compressible phases in 1-D ducts of spatially varying cross-section with explicit time integration. An analytical equation of state is included for both water vapor and liquid phases, and a realistic interphase mass transfer model is developed based on interphase heat transfer. A robust compliment of boundary conditions are developed and discussed. Though originally conceived as a first step toward implict time integration of the DEM method (to relieve time step size restrictions due to stiffness and to achieve tighter coupling of equations) in multidimensions, this model offers some unique capabilities for incorporation into next generation light water reactor safety analysis codes. We demonstrate, on a converging-diverging two-phase nozzle, that this well-posed, 2-pressure, 2-velocity DEM model can be integrated to a realistic and meaningful steady-state with both phases treated as compressible.

42 ENGINEERING↗

Statistically Rigorous Uncertainty Quantification for Physical Parameter Model Calibration with Functional Output

In experiments conducted on the Z-machine at Sandia National Laboratories, dynamic material properties cannot be analyzed using traditional analytic methods, necessitating solving an inverse problem. Bayesian model calibration is a statistical framework for solving an inverse problem to estimate parameters input into a computational model in the presence of multiple uncertainties. Disentangling input parameter uncertainty and model misspecification is often poorly identified problem. When using computational models for physical parameter estimation, the issue of parameter identifiability must be carefully considered to obtain accurate and precise estimates of physical parameters. Additionally, in dynamic material properties applications, the experimental output is a function, velocity over time. While we can sample an arbitrarily large number of points from the measured velocity, these curves only contain a finite amount of information about the calibration parameters. In this report, we propose modifications to the Bayesian model calibration framework to simplify and improve the estimation of physical parameters with functional outputs. Specifically, we propose scaling the likelihood function by an effective sample size rather than modeling the discrepancy function; and modularizing input nuisance parameters with weakly identified parameters. We evaluate the performance of these proposed methods using a statistical simulation study and then apply these methods to estimate parameters of the tantalum equation of state. We conclude that these proposed methods can provide simple, fast, and statistically valid alternatives to the full Bayesian model calibration procedure; and that these methods can be used to estimate parameters of the equation of state for tantalum.

97 MATHEMATICS AND COMPUTING↗

Quantifying Uncertainties through Advanced Theoretical Analysis for Image and Signal Reconstruction NLV-02-15, Year 1 of 2

Presentation describes project to (1) adapt accelerated matrix-free linear system solvers for applying new statistical approaches to very large–scale problems, (2) characterize the degree to which new statistical methods are superior to classical methods in respect to the sensitivity to “tuning parameters,” and (3) develop a new mathematical theory and associated numerical methods for computing the point spread function of an x-ray imaging system.

97 MATHEMATICS AND COMPUTING↗

HPC Interconnection Networks: The Key to Exascale Computing

Scientists from many domains desire to address problems within the next decade that, by all estimates, require computer systems that can achieve sustained exaflop computing rates (i.e., 1 x 10{sup 18} floating point operations per second) with real-world applications. Simply scaling existing designs is insufficient: analysis of current technological trends suggests that only a few architectural components are on track to reach the performance levels needed for exascale computing. The network connecting computer system nodes presents a particularly difficult challenge because of the prevalence of a wide variety of communication patterns and collective communication operations in algorithms used in scientific applications and their tendency to be the most significant limit to application scalability. Researchers at Oak Ridge National Laboratory and elsewhere are actively working to overcome these network-related scalability barriers using advanced hardware and software design, alternative network topologies, and performance prediction using modeling and simulation.

97 MATHEMATICS AND COMPUTING↗

The continuous spectrum and the effect of parametric resonance. The case of bounded operators

The paper is concerned with the Mathieu-type differential equation u{sup ″}=−A{sup 2}u+εB(t)u in a Hilbert space H. It is assumed that A is a bounded self-adjoint operator which only has an absolutely continuous spectrum and B(t) is almost periodic operator-valued function. Sufficient conditions are obtained under which the Cauchy problem for this equation is stable for small ε and hence free of parametric resonance. Bibliography: 10 titles.

97 MATHEMATICS AND COMPUTING↗