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 811 records · Page 45

MASS TRANSFER IN BINARY STARS USING SMOOTHED PARTICLE HYDRODYNAMICS. I. NUMERICAL METHOD

Close interactions and mass transfer in binary stars can lead to the formation of many different exotic stellar populations, but detailed modeling of mass transfer is a computationally challenging problem. Here, we present an alternate smoothed particle hydrodynamics approach to the modeling of mass transfer in binary systems that allows a better resolution of the flow of matter between main-sequence stars. Our approach consists of modeling only the outermost layers of the stars using appropriate boundary conditions and ghost particles. We arbitrarily set the radius of the boundary and find that our boundary treatment behaves physically and conserves energy well. In particular, when used with our binary relaxation procedure, our treatment of boundary conditions is also shown to evolve circular binaries properly for many orbits. The results of our first simulation of mass transfer are also discussed and used to assess the strengths and limitations of our method. We conclude that it is well suited for the modeling of interacting binary stars. The method presented here represents a convenient alternative to previous hydrodynamical techniques aimed at modeling mass transfer in binary systems since it can be used to model both the donor and the accretor while maintaining the density profiles taken from realistic stellar models.

79 ASTRONOMY AND ASTROPHYSICS↗

PULSE PROFILES FROM THERMALLY EMITTING NEUTRON STARS

The problem of computing the pulse profiles from thermally emitting spots on the surface of a neutron star in general relativity is reconsidered. We show that it is possible to extend Beloborodov's approach to include (multiple) spots of finite size in different positions on the star surface. The results for the pulse profiles are expressed by comparatively simple analytical formulae which involve only elementary functions.

79 ASTRONOMY AND ASTROPHYSICS↗

Stochastic and a posteriori optimization to mitigate coil manufacturing errors in stellarator design

Abstract It was recently shown in Wechsung et al (2022 Proc. Natl Acad. Sci. USA 119 e2202084119) that there exist electromagnetic coils that generate magnetic fields, which are excellent approximations to quasi-symmetric fields and have very good particle confinement properties. Using a Gaussian process-based model for coil perturbations, we investigate the impact of manufacturing errors on the performance of these coils. We show that even fairly small errors result in noticeable performance degradation. While stochastic optimization yields minor improvements, it is not possible to mitigate these errors significantly. As an alternative to stochastic optimization, we then formulate a new optimization problem for computing optimal adjustments of the coil positions and currents without changing the shapes of the coil. These a-posteriori adjustments are able to reduce the impact of coil errors by an order of magnitude, providing a new perspective for dealing with manufacturing tolerances in stellarator design.

Physics↗

Predictions for non-Gaussianity from non-local inflation

In our previous work the non-linearity parameter f{sub NL}, which characterizes non-Gaussianity in the cosmic microwave background, was estimated for a class of inflationary models based on non-local field theory. These models include p-adic inflation and generically have the remarkable property that slow roll inflation can proceed even with an extremely steep potential. Previous calculations found that large non-Gaussianity is possible; however, the technical complications associated with studying perturbations in theories with infinitely many derivatives forced us to provide only an order of magnitude estimate for f{sub NL}. We reconsider the problem of computing f{sub NL} in non-local inflation models, showing that a particular choice of field basis and recent progress in cosmological perturbation theory makes an exact computation possible. We provide the first quantitatively accurate computation of the bispectrum in non-local inflation, confirming our previous claim that it can be observably large. We show that the shape of the bispectrum in this class of models makes it observationally distinguishable from Dirac-Born-Infeld inflation models.

79 ASTRONOMY AND ASTROPHYSICS↗

Friction forces on phase transition fronts

In cosmological first-order phase transitions, the microscopic interaction of the phase transition fronts with non-equilibrium plasma particles manifests itself macroscopically as friction forces. In general, it is a nontrivial problem to compute these forces, and only two limits have been studied, namely, that of very slow walls and, more recently, ultra-relativistic walls which run away. In this paper we consider ultra-relativistic velocities and show that stationary solutions still exist when the parameters allow the existence of runaway walls. Hence, we discuss the necessary and sufficient conditions for the fronts to actually run away. We also propose a phenomenological model for the friction, which interpolates between the non-relativistic and ultra-relativistic values. Thus, the friction depends on two friction coefficients which can be calculated for specific models. We then study the velocity of phase transition fronts as a function of the friction parameters, the thermodynamic parameters, and the amount of supercooling.

79 ASTRONOMY AND ASTROPHYSICS↗

The boundary density profile of a Coulomb droplet. Freezing at the edge

In this paper, we revisit the problem of computing the boundary density profile of a droplet of two-dimensional one-component plasma (2D OCP) with logarithmic inter- action between particles in a confining harmonic potential. At a sufficiently low temperature, but still in the liquid phase, the density exhibits oscillations as a function of the distance to the boundary of the droplet. We obtain the density profile numerically using Monte-Carlo simulations of the 2D OCP. We argue that the decay and period of those oscillations can be explained within a picture of the Wigner crystallization near the boundary, where the crystal is gradually melted with the increasing distance to the boundary.

2D OCP↗

Kmer-SSR: a fast and exhaustive SSR search algorithm

Motivation: One of the main challenges with bioinformatics software is that the size and complexity of datasets necessitate trading speed for accuracy, or completeness. To combat this problem of computational complexity, a plethora of heuristic algorithms have arisen that report a ‘good enough’ solution to biological questions. However, in instances such as Simple Sequence Repeats (SSRs), a ‘good enough’ solution may not accurately portray results in population genetics, phylogenetics and forensics, which require accurate SSRs to calculate intra- and inter-species interactions. Results: We present Kmer-SSR, which finds all SSRs faster than most heuristic SSR identification algorithms in a parallelized, easy-to-use manner. The exhaustive Kmer-SSR option has 100% precision and 100% recall and accurately identifies every SSR of any specified length. To identify more biologically pertinent SSRs, we also developed several filters that allow users to easily view a subset of SSRs based on user input. Kmer-SSR, coupled with the filter options, accurately and intuitively identifies SSRs quickly and in a more user-friendly manner than any other SSR identification algorithm. Availability and implementation: The source code is freely available on GitHub at https://github. com/ridgelab/Kmer-SSR.

59 BASIC BIOLOGICAL SCIENCES↗

Nucleon-to-Roper electromagnetic transition form factors at large Q 2

High-precision nucleon-resonance electroproduction data on a large kinematic domain of energy and momentum transfer have proven crucial in revealing novel features of strong interactions within the Standard Model and unfolding structural details of baryon excited states. Thus, in anticipation of new data reaching to unprecedented photon virtuality, we employ a quark-diquark approximation to the three-valence-quark bound-state problem to compute γ*p → R + and γ*n → R 0 transition form factors on Q 2 /m 2 N ϵ[0,12], where m N is the nucleon mass. Having simultaneously analyzed both charged and neutral channels, we also provide a quark-flavor separation of the transition form factors. Furthermore, the results should be useful in planning new-generation experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Molecular Viscosity and Diffusivity Effects in Transitional and Shock-Driven Mixing Flows

Here, this paper investigates the importance of molecular viscosity and diffusivity for the prediction of transitional and shock-driven mixing flows featuring high and low Reynolds and Mach number regions. Two representative problems are computed with implicit large-eddy simulations using the inviscid Euler equations (EE) and viscous Navier-Stokes equations (NSE): the Taylor-Green vortex at Reynolds number Re = 3000 and initial Mach number Ma = 0.28, and an air- SF 6 -air gas curtain subjected to two shock waves at Ma = 1.2. The primary focus is on differences between NSE and EE predictions due to viscous effects. The outcome of the paper illustrates the advantages of utilizing NSE. In contrast to the EE, where the effective viscosity decreases upon grid refinement, NSE predictions can be assessed for simulations of flows with transition to turbulence at prescribed constant Re. The NSE can achieve better agreement between solutions and reference data, and the results converge upon grid refinement. On the other hand, the EE predictions do not converge with grid refinement, and can only exhibit similarities with the NSE results at coarse grid resolutions. We also investigate the effect of viscous effects on the dynamics of the coherent and turbulent fields, as well as on the mechanisms contributing to the production and diffusion of vorticity. The results show that nominally inviscid calculations can exhibit significantly varying flow dynamics driven by changing effective resolution-dependent Reynolds number, and highlight the role of viscous processes affecting the vorticity field. These tendencies become more pronounced upon grid refinement. The discussion of the results concludes with the assessment of the computational cost of inviscid and viscous computations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Self-stabilizing Connected Components

For the problem of computing the connected components of a graph, this paper considers the design of algorithms that are resilient to transient hardware faults, like bit Hips. More specifically, it applies the technique of self-stabilization. A system is self-stabilizing if, when starting from a valid or invalid state, it is guaranteed to reach a valid state after a finite number of steps. Therefore on a machine subject to a transient fault, a self-stabilizing algorithm could recover if that fault caused the system to enter an invalid state. We give a comprehensive analysis of the valid and invalid states during label propagation and derive algorithms to verify and correct the invalid state. The self-stabilizing label-propagation algorithm performs O (V log V) additional computation and requires O (V) additional storage over its conventional counterpart (and, as such, does not increase asymptotic complexity over conventional label propagation). When run against a battery of simulated fault injection tests, the self-stabilizing label propagation algorithm exhibits more resilient behavior than a triple modular redundancy (TMR) based fault-tolerant algorithm in 80% of cases. From a performance perspective, it also outperforms TMR as it requires fewer iterations in total. Beyond the fault tolerance properties of self-stabilizing label-propagation, we believe, they are useful from the theoretical perspective; and may have other use-cases.

Sao, Piyush↗

Distributed Estimation of All the Eigenvalues and Eigenvectors of Matrices Associated With Strongly Connected Digraphs

This letter considers the problem of estimating all the eigenvalues and eigenvectors of an irreducible matrix, corresponding to a strongly connected digraph, in the absence of knowledge on the global network topology. To this end, in this work we propose a unified distributed strategy performed by each node in the network and relies only on the local information. The key idea is to transform the nonlinear problem of computing both the eigenvalues and eigenvectors of an irreducible matrix into a linear one. Specifically, we first transform distributively the irreducible matrix into a nonsingular irreducible matrix. Each node in the network then estimates in a distributed fashion the inverse of the nonsingular matrix by solving a set of linear equations based on a consensus-type algorithm. The eigenvalues and the corresponding eigenvectors are finally computed by exploiting the relations between the eigenvalues and eigenvectors of both the inverse and the original irreducible matrices. A numerical example is provided to demonstrate the effectiveness of the proposed distributed strategy.

14 SOLAR ENERGY↗

Robust Data-Driven Predictive Run-to-Run Control for Automated Serial Sectioning

This letter presents a one-step predictive run-to-run controller (R2R-MPC) for the automation of mechanical serial sectioning (MSS), a destructive material analysis process. To address the inherent uncertainty and disturbances in the MSS process, a robust closed-loop approach is presented. Here, the robust R2R-MPC models the uncertainty of the MSS process using a linear differential inclusion. As an analytical model of the MSS process is unavailable, the differential inclusion is identified from historical data. The R2R-MPC is posed as an optimization problem that computes incremental changes to the control input which minimize the worst-case material removal errors. This optimization-based controller is combined with a run-to-run controller to provide integral action that rejects constant disturbances and tracks constant reference removal rates. To demonstrate the efficacy of our robust R2R-MPC, we present simulation results which compare the presented controller with a conventional non-robust R2R.

42 ENGINEERING↗

Learning Optimal Power Flow Solutions using Linearized Models in Power Distribution Systems

Solving nonlinear optimal power flow (OPF) problem is computationally expensive, and poses scalability challenges for power distribution networks. An alternative to solving the original nonlinear OPF is the linear approximated OPF models. Although, these linear approximated OPF models are fast, the resulting solutions may result in significant optimality gap. Lately, the application of machine learning (ML) methods in successfully solving the nonlinear OPF has been reported. These methods learn and estimate the nonlinear control policies using a purely data-driven approach. In this paper, we propose an approach to complements the ML based approach to solving OPF using solutions from known linearized OPF model. Specifically, we use supervised learning to map the solutions of linear OPF to nonlinear control variables. Unlike, the traditional ML based methods for OPF that approximate the full distribution feeder model using function approximation, our approach uses a two-node approximation of radial networks. The proposed approach is validated using IEEE 123 bus test system for OPF solutions obtained using the nonlinear OPF models.

optimal power flow, power distribution systems, su↗

Adaptive stabilization of quantum circuits executed on unstable devices

Conventional computers have evolved to device components that demonstrate failure rates of 10 −17 or less, while current quantum computing devices typically exhibit error rates of 10 −2 or greater. This raises concerns about the reliability and reproducibility of the results obtained from quantum computers. The problem is highlighted by experimental observation that today’s NISQ devices are inherently unstable. Remote quantum cloud servers typically do not provide users with an ability to calibrate the device themselves. Using inaccurate characterization data for error mitigation can have devastating impact on reproducibility. In this study, we investigate if one can infer the critical channel parameters dynamically from the noisy binary output of the executed quantum circuit and use it to improve program stability. An open question however is how well does this methodology scale. We discuss the efficacy and efficiency of our adaptive algorithm using canonical quantum circuits such as the uniform superposition circuit. Our metric of performance is the Hellinger distance between the post-stabilization observations and the reference (ideal) distribution.

Dasgupta, Samudra↗

Byte-precision level of detail processing for variable precision analytics

I/O bottlenecks in HPC applications are becoming a more pressing problem as compute capabilities continue to outpace I/O capabilities. While double-precision simulation data often must be stored losslessly, the loss of some of the fractional component may introduce acceptably small errors to many types of scientific analyses. Given this observation, we develop a precision level of detail (APLOD) library, which partitions double-precision datasets along user-defined byte boundaries. APLOD parameterizes the analysis accuracy-I/O performance tradeoff, bounds maximum relative error, maintains I/O access patterns compared to full precision, and operates with low overhead. Using ADIOS as an I/O use-case, we show proportional reduction in disk access time to the degree of precision. Finally, we show the effects of partial precision analysis on accuracy for operations such as k-means and Fourier analysis, finding a strong applicability for the use of varying degrees of precision to reduce the cost of analyzing extreme-scale data.

Jenkins, John↗

Optimal Power Flow in DC Networks with Robust Feasibility and Stability Guarantees

With high penetrations of renewable generation and variable loads, there is significant uncertainty associated with power flows in DC networks such that stability and operational constraint satisfaction are of concern. Most existing DC network optimal power flow (DN-OPF) formulations assume exact knowledge of loading conditions and do not provide stability guarantees. Here, in contrast, this paper studies a DN-OPF formulation which considers both stability and operational constraint satisfaction under uncertainty. The need to account for a range of uncertainty realizations in this paper's robust optimization formulation results in a challenging semi-infinite program (SIP). The proposed solution algorithm reformulates this SIP into a computationally tractable problem by constructing a tight convex inner approximation of the stability set using sufficient conditions for the existence of a feasible and stable power flow solution. Optimal generator set-points are obtained by optimizing over the proposed convex stability set. The validity and effectiveness of the propose algorithm is demonstrated through various DC networks adapted from IEEE test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Coarse-to-fine Task-driven Inpainting for Geoscience Images

The processing and recognition of geoscience images have wide applications. Most of existing researches focus on understanding the high-quality geoscience images by assuming that all the images are clear. However, in many real-world cases, the geoscience images might contain occlusions during the image acquisition. This problem actually implies the image inpainting problem in computer vision and multimedia. As far as we know, all the existing image inpainting algorithms learn to repair the occluded regions for a better visualization quality, they are excellent for natural images but not good enough for geoscience images, and they never consider the following geoscience task when developing inpainting methods. Here, this paper aims to repair the occluded regions for a better geoscience task performance and advanced visualization quality simultaneously, without changing the current deployed deep learning based geoscience models. Because of the complex context of geoscience images, we propose a coarse-to-fine encoder-decoder network with the help of designed coarse-to-fine adversarial context discriminators to reconstruct the occluded image regions. Due to the limited data of geoscience images, we propose a MaskMix based data augmentation method, which augments inpainting masks instead of augmenting original images, to exploit the limited geoscience image data. The experimental results on three public geoscience datasets for remote sensing scene recognition, cross-view geolocation and semantic segmentation tasks respectively show the effectiveness and accuracy of the proposed method. The code is available at: https://github.com/HMS97/Task-driven-Inpainting.

97 MATHEMATICS AND COMPUTING↗

pGraph: Efficient Parallel Construction of Large-Scale Protein Sequence Homology Graphs

Detecting sequence homology between protein sequences is a fundamental problem in computational molecular biology, with a pervasive application in nearly all analyses that aim to structurally and functionally characterize protein molecules. While detecting the homology between two protein sequences is relatively inexpensive, detecting pairwise homology for a large number of protein sequences can become computationally prohibitive for modern inputs, often requiring millions of CPU hours. Yet, there is currently no robust support to parallelize this kernel. In this paper, we identify the key characteristics that make this problemparticularly hard to parallelize, and then propose a new parallel algorithm that is suited for detecting homology on large data sets using distributed memory parallel computers. Our method, called pGraph, is a novel hybrid between the hierarchical multiple-master/worker model and producer-consumer model, and is designed to break the irregularities imposed by alignment computation and work generation. Experimental results show that pGraph achieves linear scaling on a 2,048 processor distributed memory cluster for a wide range of inputs ranging from as small as 20,000 sequences to 2,560,000 sequences. In addition to demonstrating strong scaling, we present an extensive report on the performance of the various system components and related parametric studies.

Environmental Molecular Sciences Laboratory↗