Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics & 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 253 records · Page 14

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↗

Brittleness and Bayesian Inference

In a recent report, “Bayesian Brittleness: Why no Bayesian model is ‘good enough,’” (arXiv, 1304.6772v1) the authors prove rigorously that under a seemingly natural class of priors Π, the posterior expectation of a function Φ(θ) can achieve essentially any value that Φ(θ) alone can achieve, so that Bayesian inference appears to have no robustness whatsoever. We explain this puzzling result, and show why it does not imply a breakdown of Bayesian inference. The problem is that the priors leading to the extreme results depend on the observed data, which means they are not valid priors. The corresponding posteriors are also invalid, so the extreme variation in these posteriors does not imply that Bayesian inference is brittle. The report, however, provides a new framework which may be used for any assumed class of priors Π, and which we explain in detail. This framework may be a useful new tool for deriving quantitative robustness results.

97 MATHEMATICS AND COMPUTING↗

Emergent long-range couplings in arrays of fluid cells

We present a system exhibiting extraordinarily long-range cooperative effects, on a length scale far exceeding the bulk correlation length. We give a theoretical explanation of these phenomena based on the mesoscopic picture of phase coexistence in finite systems, which is confirmedly Monte Carlo (MC) simulation studies. Our work demonstrates that such action-at-a-distance can occur in classical systems involving simple or complex fluids, such as colloid-polymer mixtures, or ferromagnets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analyzing Task-Based User Study Data to Determine Colormap Efficiency

Domain scientists use colormaps to visualize their data. These are useful for identifying areas of interest including Eddy Identification and Characterizing Currents. New colormaps have been designed by visual artist Francesca Samsel. User studies have been implemented to determine whether or not these colormaps are an improvement.

97 MATHEMATICS AND COMPUTING↗

Analyzing task-based user study data to determine colormap efficiency

Domain scientists need colormaps to visualize their data and are especially useful for identifying areas of interest, like in ocean data to identify eddies or characterize currents. However, traditional Rainbow colormap performs poorly for understanding details, because of the small perceptual range. In order to assist domain scientists in recognizing and identifying important details in their data, different colormaps need to be applied to allow higher perceptual definition. Visual artist Francesca Samsel used her understanding of color theory to create new colormaps to improve perception. While domain scientists find the new colormaps to be useful, we implemented a rigorous and quantitative study to determine whether or not the new colormaps have perceptually more colors. Color count data from one of these studies will be analyzed in depth in order to determine whether or not the new colormaps have more perceivable colors and what affects the number of perceivable colors.

97 MATHEMATICS AND COMPUTING↗

HPC - Platforms Penta Chart

Strategy, Planning, Acquiring- very large scale computing platforms come and go and planning for immensely scalable machines often precedes actual procurement by 3 years. Procurement can be another year or more. Integration- After Acquisition, machines must be integrated into the computing environments at LANL. Connection to scalable storage via large scale storage networking, assuring correct and secure operations. Management and Utilization – Ongoing operations, maintenance, and trouble shooting of the hardware and systems software at massive scale is required.

Computer Hardware↗

HPC - Facilities Penta

Strategy, Planning, Acquiring- very large scale computing require very large physical infrastructures, pipes, pumps, power, etc. Planning and acquiring $25M+ infrastructure projects and bringing in more power to the county takes a lot of long lead time / planning. Integration- New physical infrastructure must be integrated into our buildings, with the LANL site power and water systems, with existing infrastructure, and with the machines. Very large physical infrastructure projects are necessary. Management and Utilization – Ongoing operations, monitoring, maintenance, and trouble shooting of the physical infrastructure is required.

Computer Hardware↗

Arbitrary Order Mixed Mimetic Finite Differences Method with Nodal Degrees of Freedom

In this work we consider a modification to an arbitrary order mixed mimetic finite difference method (MFD) for a diffusion equation on general polygonal meshes [1]. The modification is based on moving some degrees of freedom (DoF) for a flux variable from edges to vertices. We showed that for a non-degenerate element this transformation is locally equivalent, i.e. there is a one-to-one map between the new and the old DoF. Globally, on the other hand, this transformation leads to a reduction of the total number of degrees of freedom (by up to 40%) and additional continuity of the discrete flux.

97 MATHEMATICS AND COMPUTING↗

C1-continuous Virtual Element Method for Poisson-Kirchhoff plate problem

We present a family of C1-continuous high-order Virtual Element Methods for Poisson-Kirchho plate bending problem. The convergence of the methods is tested on a variety of meshes including rectangular, quadrilateral, and meshes obtained by edge removal (i.e. highly irregular meshes). The convergence rates are presented for all of these tests.

97 MATHEMATICS AND COMPUTING↗