Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematical Computing”

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

Mastering HPC Runtime Prediction: From Observing Patterns to a Methodological Approach

The continual expansion of high-performance computing (HPC) brings with it an increasing need for efficiency. Heavy investment in energy, hardware, and software infrastructure to support peta- and exascale computing requires the optimization of existing systems and, wherever possible, the discernment and adoption of best-practices towards these goals. Such is the case for runtime prediction. When a job is submitted to an HPC system, an estimate of its runtime is provided by the user in the form of "requested wallclock". Error in this user-provided estimate can lead to jobs being prematurely killed by the scheduler, increased wait time on the queue, and decreased system utilization. More than fifteen years of research has been directed at mitigating these effects by using data-driven runtime predictions. Codified here is a set of commonalities and insights emerging from this body of work, which we present as recommendations and best practices. These practices are combined into a methodological approach described and evaluated on an 11-million-job dataset from the National Renewable Energy Laboratory's petascale HPC system, Eagle. This dataset and the accompanying codebase have been released to the public domain for the benefit of the wider HPC research community.

high performance computing↗

Single reader between-cases AUC estimator with nested data

The area under the receiver operating characteristic curve (AUC) is widely used in evaluating diagnostic performance for many clinical tasks. It is still challenging to evaluate the reading performance of distinguishing between positive and negative regions of interest (ROIs) in the nested-data problem, where multiple ROIs are nested within the cases. To address this issue, we identify two kinds of AUC estimators, within-cases AUC and between-cases AUC. We focus on the between-cases AUC estimator, since our main research interest is in patient-level diagnostic performance rather than location-level performance (the ability to separate ROIs with and without disease within each patient). Another reason is that as the case number increases, the number of between-cases paired ROIs is much larger than the number of within-cases ROIs. We provide estimators for the variance of the between-cases AUC and for the covariance when there are two readers. We derive and prove the above estimators’ theoretical values based on a simulation model and characterize their behavior using Monte Carlo simulation results. We also provide a real-data example. Moreover, we connect the distribution-based simulation model with the simulation model based on the linear mixed-effect model, which helps better understand the sources of variation in the simulated dataset.

Health Care Sciences & Services↗

Control of multi-agent systems: Results, open problems, and applications

The purpose of this review article is to present some recent results on the modeling and control of large systems of agents. We focus on particular applications where the agents are capable of independent actions instead of simply reacting to external forces. In the literature, such agents were referred to as autonomous, intelligent, self-propelled, greedy, and others. The main applications we have in mind are social systems (as opinion dynamics), pedestrians’ movements (also called crowd dynamics), animal groups, and vehicular traffic. We note that the last three examples include physical constraints; however, the agents are able to inject energy into the system, thus preventing the typical conservation of momentum and energy. In addition, the control problems posed by such systems are new and require innovative methods. We illustrate some ideas developed recently, including the use of sparse controls, limiting the total variation of controls, and defining new control problems for measures. After reviewing various approaches, we discuss some future research directions of potential interest. The latter encompasses both new types of equations and new types of limiting procedures to connect several scales at which a system can be represented. We conclude by illustrating a recent real-life experiment using autonomous vehicles on an open highway to smooth traffic waves. This opens the door to a new era of interventions to control real-time multi-agent systems and to increase the societal impact of such interventions guided by control research.

97 MATHEMATICS AND COMPUTING↗

Order conditions for nonlinearly partitioned Runge-Kutta methods

Recently, a new class of nonlinearly partitioned Runge–Kutta (NPRK) methods was proposed for nonlinearly partitioned systems of autonomous ordinary differential equations y' = F(y, y). The target class of problems are those in which different scales, stiffnesses, or physics are coupled in a nonlinear way, wherein the desired partition cannot be written in a classical additive or component-wise fashion. Here we use a rooted-tree analysis to derive full-order conditions for NPRKM methods, where M denotes the number of nonlinear partitions. Due to the nonlinear coupling and thereby the mixed product differentials, it turns out that the standard node-colored rooted tree analysis used in analyzing ODE integrators does not naturally apply. Instead we develop a new edge-colored rooted-tree framework to address the nonlinear coupling. The resulting order conditions are enumerated, are provided directly for up to fourth order with M = 2 and third order with M = 3, and are related to existing order conditions of additive and partitioned RK methods. We conclude with an example that shows how the nonlinear order conditions can be used to obtain an embedded estimate of the state-dependent nonlinear coupling strength in a dynamical system.

97 MATHEMATICS AND COMPUTING↗

"Spectrally gapped" random walks on networks: a Mean First Passage Time formula

We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only input the transition probabilities into the target node. It is derived from the calculation of the average resolvent of a deformed ensemble of random sub-stochastic matrices H=\langle H\rangle +\delta H H = ⟨ H ⟩ + δ H , with \langle H\rangle ⟨ H ⟩ rank- 1 1 and non-negative. The accuracy of the formula depends on the spectral gap of the reduced transition matrix, and it is tested numerically on several instances of (weighted) networks away from the high sparsity regime, with an excellent agreement.

97 MATHEMATICS AND COMPUTING↗

Design, analysis and preliminary numerical results for the nonconforming VEM for parabolic problems

The virtual element method (VEM) is a numerical methodology for solving partial differential equations on unstructured polytopal meshes. In this work, we extend the nonconforming high-order formulation suitable to time-dependent diffusion problems with possibly nonlinear forcing terms. Coupling high-order virtual element formulations in space with time-marching schemes based on Backward Differention Formulas (BDFs) makes a fully discrete method with optimal order of convergence in the Method of Lines framework. We investigate and assess the performance of the method through theoretical analysis and a set of numerical experiments.

97 MATHEMATICS AND COMPUTING↗

EpiCast: Simulating Epidemics with Extreme Detail

In early 2020, COVID-19 swept the globe. Governments attempted to “flatten the curve” through business shutdowns and stay-at-home orders, but the United States was hit hard. By the end of March, mere months after the virus first emerged in humans 7,000 miles away, the U.S. had recorded 192,300 cases and 5,300 deaths. While this unprecedented disaster sent shockwaves through every level of society and clouded an uncertain future, state and local governments turned to computational and mathematical epidemiology researchers to help formulate intervention strategies to limit the spread of the disease. Traditional forecasting models provided a reasonable understanding of how the near future was likely to look, but local policy makers and public health communities still struggled to understand how potential mitigations ought to be implemented. Decision makers needed a way to measure the impact of their policy choices—they needed better technology. EpiCast answered the call, bringing urgently needed answers to policymakers grappling with how to adjust school and business schedules. EpiCast is modeling software that generates a synthetic, representative population to simulate infectious disease transmission in the United States with extreme detail and granularity. The software models human behavior combined with community-specific information to provide a fine-grained preview of the effect of potential mitigation strategies for decision makers.

60 APPLIED LIFE SCIENCES↗

Disease Precognition [Slides]

How can we reduce the health and economic impacts future epidemics and pandemics? Global Real-Time Disease Forecasting is not just for weather anymore! Disease precognition technology is discussed.

59 BASIC BIOLOGICAL SCIENCES↗