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 379 records · Page 21

An initial exploration of Bayesian model calibration for estimating the composition of rocks and soils on Mars

The Mars Curiosity rover carries an instrument, ChemCam, designed to measure the composition of surface rocks and soil using laser-induced breakdown spectroscopy (LIBS). The measured spectra from this instrument must be analyzed to identify the component elements in the target sample, as well as their relative proportions. This process, which we call disaggregation, is complicated by so-called matrix effects, which describe nonlinear changes in the relative heights of emission lines as an unknown function of composition due to atomic interactions within the LIBS plasma. In this work, we explore the use of the plasma physics code ATOMIC, developed at Los Alamos National Laboratory, for the disaggregation task. ATOMIC has recently been used to model LIBS spectra and can robustly reproduce matrix effects from first principles. The ability of ATOMIC to predict LIBS spectra presents an exciting opportunity to perform disaggregation in a manner not yet tried in the LIBS community, namely via Bayesian model calibration. However, using it directly to solve our inverse problem is computationally intractable due to the large parameter space and the computation time required to produce a single output. Therefore, we also explore the use of emulators as a fast solution for this analysis. We discuss a proof of concept Gaussian process emulator for disaggregating two-element compounds of sodium and copper. The training and test datasets were simulated with ATOMIC using a Latin hypercube design. After testing the performance of the emulator, we successfully recover the composition of 25 test spectra with Bayesian model calibration.

97 MATHEMATICS AND COMPUTING↗

Cutting planes for the multistage stochastic unit commitment problem

As renewable energy penetration rates continue to increase in power systems worldwide, new challenges arise for system operators in both regulated and deregulated electricity markets to solve the security-constrained coal-fired unit commitment problem with intermittent generation (due to renewables) and uncertain load, in order to ensure system reliability and maintain cost effectiveness. In this paper, we study a security-constrained coal-fired stochastic unit commitment model, which we use to enhance the reliability unit commitment process for day-ahead power system operations. In our approach, we first develop a deterministic equivalent formulation for the problem, which leads to a large-scale mixed-integer linear program. Then, we verify that the turn on/off inequalities provide a convex hull representation of the minimum-up/down time polytope under the stochastic setting. Next, we develop several families of strong valid inequalities mainly through lifting schemes. In particular, by exploring sequence independent lifting and subadditive approximation lifting properties for the lifting schemes, we obtain strong valid inequalities for the ramping and general load balance polytopes. Lastly, branch-and-cut algorithms are developed to employ these valid inequalities as cutting planes to solve the problem. Our computational results verify the effectiveness of the proposed approach.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Note on two formulations of Crank-Nicolson method for Navier-Stokes equations

Here, we consider two formulations of the Crank-Nicolson (CN) method for the Navier-Stokes equations (NSE). The “natural” way of implementing CN for NSE is formally second order accurate in time for both velocity and pressure, whereas another formulation approximates pressure with only first order accuracy in time. Both versions of the method are applied to the benchmark problem of computing drag and lift in the flow around a cylinder. We show that the presumably more accurate version of the CN can create a solution with nonphysical oscillations and give incorrect predictions for the maximal drag coefficient, whereas the other formulation of the method predicts the drag and lift coefficients more accurately and does not introduce nonphysical oscillations. We locate the source of the issue and suggest several remedies.

Crank-Nicolson↗

Depinning of a discrete elastic string from a two-dimensional random array of weak pinning points

The present work is essentially concerned with the development of statistical theory for the low temperature dislocation glide in concentrated solid solutions where atom-sized obstacles impede plastic flow. In connection with such a problem, we compute analytically the external force required to drag an elastic string along a discrete two-dimensional square lattice, where some obstacles have been randomly distributed. Some numerical simulations allow us to demonstrate the remarkable agreement between simulations and theory for an obstacle density ranging from 1% to 50% and for lattices with different aspect ratios. The theory proves efficient on the condition that the obstacle-chain interaction remains sufficiently weak compared to the string stiffness.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Pairwise alignment for very long nucleic acid sequences

Highlights: • The PAAVLS algorithm can be employed for alignment of very long sequences. • The PAAVLS algorithm largely reduces memory demand as the Smith–Waterman algorithm. • The running times of the PAAVLS and Smith–Waterman algorithms are comparable. Sequence alignment is one of the fundamental problems in computational biology and has numerous applications. The Smith–Waterman algorithm generates optimal local alignment for pairwise alignment task and has become a standard algorithm in its field. However, the current version of the Smith–Waterman algorithm demands a significant amount of memory and is not suitable for alignment of very long sequences. On the hand, the recent DNA sequencing technologies have produced vast amounts of biological sequences. Some nucleic acid sequences are very long and cannot employ the Smith–Waterman algorithm. To this end, this study proposes the PAAVLS algorithm that follows the dynamic programming technique employed by the Smith–Waterman algorithm and largely reduces the demand of memory. The proposed PAAVLS algorithm can be employed for alignment of very long sequences, i.e., sequences contain more than 100,000,000 nucleotides, on a personal computer. Additionally, the running time of the proposed PAAVLS algorithm is comparable with the running time of the standard Smith–Waterman algorithm.

60 APPLIED LIFE SCIENCES↗

A set of parallel, implicit methods for a reconstructed discontinuous Galerkin method for compressible flows on 3D hybrid grids

A set of implicit methods are proposed for a third-order hierarchical WENO reconstructed discontinuous Galerkin method for compressible flows on 3D hybrid grids. An attractive feature in these methods are the application of the Jacobian matrix based on the P1 element approximation, resulting in a huge reduction of memory requirement compared with DG (P2). Also, three approaches -- analytical derivation, divided differencing, and automatic differentiation (AD) are presented to construct the Jacobian matrix respectively, where the AD approach shows the best robustness. A variety of compressible flow problems are computed to demonstrate the fast convergence property of the implemented flow solver. Furthermore, an SPMD (single program, multiple data) programming paradigm based on MPI is proposed to achieve parallelism. The numerical results on complex geometries indicate that this low-storage implicit method can provide a viable and attractive DG solution for complicated flows of practical importance.

97 MATHEMATICS AND COMPUTING↗

Evaluation of low-exergy heating and cooling systems and topology optimization for deep energy savings at the urban district level

District energy systems have the potential to achieve deep energy savings by leveraging the density and diversity of loads in urban districts. However, planning and adoption of district thermal energy systems is hindered by the analytical burden and high infrastructure costs. It is hypothesized that network topology optimization would enable wider adoption of advanced (ambient temperature) district thermal energy systems, resulting in energy savings. In this study, energy modeling is used to compare the energy performance of “conventional” and “advanced” district thermal energy systems at the urban district level, and a partial exhaustive search is used to evaluate a heuristic for the topology optimization problem. For the prototypical district considered, advanced district thermal energy systems mated with low-exergy building heating and cooling systems achieved a source energy use intensity that was 49% lower than that of conventional systems. The minimal spanning tree heuristic was demonstrated to be effective for the network topology optimization problem in the context of a prototypical district, and contributes to mitigating the problem’s computational complexity. The work presented in this paper demonstrates the potential of advanced district thermal energy systems to achieve deep energy savings, and advances to addressing barriers to their adoption through topology optimization.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Second order finite volume scheme for Maxwell's equations with discontinuous electromagnetic properties on unstructured meshes

This paper presents a second order finite volume scheme for numerical solution of Maxwell's equations with discontinuous dielectric permittivity and magnetic permeability on unstructured meshes. The scheme is based on Godunov scheme and employs approaches of Van Leer and Lax–Wendroff to increase the order of approximation. To keep the second order of approximation near dielectric permittivity and magnetic permeability discontinuities a novel technique for gradient calculation and limitation is applied near discontinuities. Results of test computations for problems with linear and curvilinear discontinuities confirm second order of approximation. The scheme was applied to modelling propagation of electromagnetic waves inside photonic crystal waveguides with a bend.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Data-driven causal model discovery and personalized prediction in Alzheimer's disease

Abstract With the explosive growth of biomarker data in Alzheimer’s disease (AD) clinical trials, numerous mathematical models have been developed to characterize disease-relevant biomarker trajectories over time. While some of these models are purely empiric, others are causal, built upon various hypotheses of AD pathophysiology, a complex and incompletely understood area of research. One of the most challenging problems in computational causal modeling is using a purely data-driven approach to derive the model’s parameters and the mathematical model itself, without any prior hypothesis bias. In this paper, we develop an innovative data-driven modeling approach to build and parameterize a causal model to characterize the trajectories of AD biomarkers. This approach integrates causal model learning, population parameterization, parameter sensitivity analysis, and personalized prediction. By applying this integrated approach to a large multicenter database of AD biomarkers, the Alzheimer’s Disease Neuroimaging Initiative, several causal models for different AD stages are revealed. In addition, personalized models for each subject are calibrated and provide accurate predictions of future cognitive status.

Zheng, Haoyang (ORCID:0000000168358242)↗

Alignment-free Visualization of Metagenomic Data by Nonlinear Dimension Reduction

The visualization of metagenomic data, especially without prior taxonomic identification of reconstructed genomic fragments, is a challenging problem in computational biology. An ideal visualization method should, among others, enable clear distinction of congruent groups of sequences of closely related taxa, be applicable to fragments of lengths typically achievable following assembly, and allow the efficient analysis of the growing amounts of community genomic sequence data. Here, we report a scalable approach for the visualization of metagenomic data that is based on nonlinear dimension reduction via Barnes-Hut Stochastic Neighbor Embedding of centered log-ratio transformed oligonucleotide signatures extracted from assembled genomic sequence fragments. The approach allows for alignment-free assessment of the data-inherent taxonomic structure, and it can potentially facilitate the downstream binning of genomic fragments into uniform clusters reflecting organismal origin. We demonstrate the performance of our approach by visualizing community genomic sequence data from simulated as well as groundwater, human-derived and marine microbial communities.

59 BASIC BIOLOGICAL SCIENCES↗

Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on Many-Core Processors and GPUs

For over a decade now, physical and energy constraints have limited clock speed improvements in commodity microprocessors. Instead, chipmakers have been pushed into producing lower-power, multi-core processors such as Graphical Processing Units (GPU), ARM CPUs, and Intel MICs. Broad-based efforts from manufacturers and developers have been devoted to making these processors user-friendly enough to perform general computations. However, extracting performance from a larger number of cores, as well as specialized vector or SIMD units, requires special care in algorithm design and code optimization. One of the most computationally challenging problems in high-energy particle experiments is finding and fitting the charged-particle tracks during event reconstruction. This is expected to become by far the dominant problem at the High-Luminosity Large Hadron Collider (HL-LHC), for example. Today the most common track finding methods are those based on the Kalman filter. Experience with Kalman techniques on real tracking detector systems has shown that they are robust and provide high physics performance. This is why they are currently in use at the LHC, both in the trigger and offine. Previously we reported on the significant parallel speedups that resulted from our investigations to adapt Kalman filters to track fitting and track building on Intel Xeon and Xeon Phi. Here, we discuss our progresses toward the understanding of these processors and the new developments to port the Kalman filter to NVIDIA GPUs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Monge-Ampere grids and the multidimensional mapped Fourier method

The efficiency of a numerical method can be greatly improved by combining it with coordinate transformations tailored to a given problem. This is the basis for the mapped Fourier methods. However, obtaining ''good'' coordinate transformations is a major obstacle for this approach in multidimensions. Here, we calculate coordinate transformations based on solving the Monge-Ampere equation. These transformations are combined in the mapped Fourier method and applied to Schroedinger's equation in multidimensions. Dramatic improvements in accuracy compared to the standard Fourier method were observed in eigenvalue calculations for two-dimensional systems. This work indicates that the Monge-Ampere equation may serve as a useful tool for constructing efficient representations for problems in computational quantum mechanics and other fields.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Travelling fronts of the CO oxidation on Pd(111) with coverage-dependent diffusion

In this work, we study a surface reaction on Pd(111) crystals under ultra-high-vacuum conditions that can be modeled by two coupled reaction-diffusion equations. In the bistable regime, the reaction exhibits travelling fronts that can be observed experimentally using photo electron emission microscopy. The spatial profile of the fronts reveals a coverage-dependent diffusivity for one of the species. We propose a method to solve the nonlinear eigenvalue problem and compute the direction and the speed of the fronts based on a geometrical construction in phase-space. This method successfully captures the dependence of the speed on control parameters and diffusivities.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mathematical and computational modeling of the diffraction problems by discrete singularities method

The main objective of this study is reduced the boundary-value problems of scattering and diffraction waves on plane-parallel structures to the singular or hypersingular integral equations. For these cases we use a method of the parametric representations of the integral and pseudo-differential operators. Numerical results of the model scattering problems on periodic and boundary gratings and also on the gratings above a flat screen reflector are presented in this paper.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Toward DMRG-tailored coupled cluster method in the 4c-relativistic domain

There are three essential problems in computational relativistic chemistry: Electrons moving at relativistic speeds, close lying states, and dynamical correlation. Currently available quantum-chemical methods are capable of solving systems with one or two of these issues. However, there is a significant class of molecules in which all the three effects are present. These are the heavier transition metal compounds, lanthanides, and actinides with open d or f shells. For such systems, sufficiently accurate numerical methods are not available, which hinders the application of theoretical chemistry in this field. In this paper, we combine two numerical methods in order to address this challenging class of molecules. These are the relativistic versions of coupled cluster methods and the density matrix renormalization group (DMRG) method. To the best of our knowledge, this is the first relativistic implementation of the coupled cluster method externally corrected by DMRG. The method brings a significant reduction of computational costs as we demonstrate on the system of TlH, AsH, and SbH.

Brandejs, Jan (ORCID:0000000221073095)↗

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↗