Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical algorithm”

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 1,801 records · Page 100

A computational study of the use of an optimization-based method for simulating large multibody systems.

The present work aims at comparing the performance of several quadratic programming (QP) solvers for simulating large-scale frictional rigid-body systems. Traditional time-stepping schemes for simulation of multibody systems are formulated as linear complementarity problems (LCPs) with copositive matrices. Such LCPs are generally solved by means of Lemke-type algorithms and solvers such as the PATH solver proved to be robust. However, for large systems, the PATH solver or any other pivotal algorithm becomes unpractical from a computational point of view. The convex relaxation proposed by one of the authors allows the formulation of the integration step as a QPD, for which a wide variety of state-of-the-art solvers are available. In what follows we report the results obtained solving that subproblem when using the QP solvers MOSEK, OOQP, TRON, and BLMVM. OOQP is presented with both the symmetric indefinite solver MA27 and our Cholesky reformulation using the CHOLMOD package. We investigate computational performance and address the correctness of the results from a modeling point of view. We conclude that the OOQP solver, particularly with the CHOLMOD linear algebra solver, has predictable performance and memory use patterns and is far more competitive for these problems than are the other solvers.

97 MATHEMATICS AND COMPUTING↗

Combining the synergistic control capabilities of modeling and experiments: Illustration of finding a minimum-time quantum objective

A common way to manipulate a quantum system, for example spins or artificial atoms, is to use properly tailored control pulses. In order to accomplish quantum information tasks before coherence is lost, it is crucial to implement the control in the shortest possible time. Here we report the near time-optimal preparation of a Bell state with fidelity higher than 99% in an NMR experiment, which is feasible by combining the synergistic capabilities of modeling and experiments operating in tandem. In this work, the pulses preparing the Bell state are found by experiments that are recursively assisted with a gradient-based optimization algorithm working with a model. Thus, we exploit the interplay between model-based numerical optimal design and experimental-based learning control. Utilizing the balanced synergism between the dual approaches, as dictated by the case specific capabilities of each approach, should have broad applications for accelerating the search for optimal quantum controls.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spin-wave multiple excitations in nanoscale classical Heisenberg antiferromagnets

Monte Carlo and spin dynamics techniques have been used to perform large-scale simulations of the dynamic behavior of a nanoscale, classical, Heisenberg antiferromagnet on a simple-cubic lattice with linear sizes L≤ 40 at a temperature below the Neel temperature. In this study, nanoparticles are modeled with completely free boundary conditions, i.e., six free surfaces, and nanofilms are modeled with two free surfaces in the spatial z direction and periodic boundaries parallel to the surfaces in the xy direction, which are compared to the infinite system with periodic boundary conditions. The temporal evolutions of spin configurations were determined numerically from coupled equations of motion for individual spins using a fast spin dynamics algorithm with the fourth-order Suzuki-Trotter decomposition of exponential operators, with initial spin configurations generated by Monte Carlo simulations. The local dynamic structure factor S(q,ω) was calculated from the local space- and time-displaced spin-spin correlation function. Multiple excitation peaks for wave vectors within the first Brillouin zone appear in the spin-wave spectra of the transverse component of dynamic structure factor S T (q,ω) in the nanoscale classical Heisenberg antiferromagnet, which are lacking if periodic boundary conditions are used. With the assumption of q-space spin-wave reflections with broken momentum conservation due to free-surface confinements, we successfully explained those spectra quantitatively in the linear dispersion region. Meanwhile, we also observed two unexpected quantized spin-wave excitation modes in the spatial z direction in nanofilms for S T (q,ω) not expected in bulk systems. In conclusion, the results of this study indicate the presence of unexpected forms of spin-wave excitation behavior that have yet to be observed experimentally but could be directly tested through neutron scattering experiments on nanoscale RbMnF 3 particles or films.

36 MATERIALS SCIENCE↗

Dynamic Parameter Estimation with Physics-based Neural Ordinary Differential Equations

Accurate estimation of dynamic parameters of gen-erators is crucial to building a reliable model for dynamical studies and reliable operation of the power system. This paper develops a physics-based neural ordinary differential equations (ODE) approach to learn the parameters of generator dynamic model using phasor measurement units (PMU) data. We design a physics-based neural network to represent the swing equations of the power system dynamics. A loss function is defined as the difference between dynamic simulation results from the physics-based neural networks and pseudo PMU measurements. The parameters of generator dynamic model are iteratively updated using the neural ODEs and the adjoint method. By exploiting the mini-batch scheme in neural ODE training, the parameter estimation performance is significantly improved. Numerical study results on a 3-machine 9-bus system show that the proposed algorithm outperforms state-of-the-art baseline method in both computation time and dynamic parameter estimation accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Labeling sequential data from noisy annotations

Crowdsourcing algorithms often work under the assumption that the data samples are independent. Recent work has shown that data dependence, such as temporal correlations in sequential data, can be leveraged to improve the label quality. Existing methods that exploit this special structure rely on third-order statistics of the annotator outputs to ensure the identifiability of key latent parameters, which are costly to acquire. This work proposes an approach for integrating crowdsourced annotations under the Dawid-Skene/Hidden Markov Model (DS-HMM) for sequential data based on second-order statistics, which naturally enjoys a lower sample complexity. An effective algorithm is proposed to tackle the challenging optimization problem associated with the proposed estimator. Numerical experiments showcase the effectiveness of the data labeling paradigm.

Marrinan, Timothy P.↗

Distribution Grid Modeling Using Smart Meter Data

The knowledge of distribution grid models, including topologies and line impedances, is essential for grid monitoring, control and protection. However, such information is often unavailable, incomplete or outdated. The increasing deployment of smart meters (SMs) provides a unique opportunity to tackle this issue. This paper proposes a two-stage framework for distribution grid modeling using SM data. In the first stage, the network topology is identified by reconstructing a weighted Laplacian matrix of distribution networks. In the second stage, a least absolute deviations (LAD) regression model is developed for estimating line impedance of a single branch based on the nonlinear (inverse) power flow model, wherein a conductor library is leveraged to narrow down the solution space. The LAD regression model is originally a mixed-integer nonlinear program whose continuous relaxation is still non-convex. Furthermore, we specially address its convex relaxation and discuss the exactness. The modified regression model is then embedded within a bottom-up sweep algorithm to achieve the identification across the network in a branch-wise manner. Numerical results on the IEEE 13-bus, 37-bus and 69-bus test feeders validate the effectiveness of the proposed methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Nonrigid registration-based coronary artery motion correction for cardiac computed tomography

Purpose: X-ray computed tomography angiography (CTA) is the modality of choice to noninvasively monitor and diagnose heart disease with coronary artery health and stenosis detection being of particular interest. Reliable, clinically relevant coronary artery imaging mandates high spatiotemporal resolution. However, advances in intrinsic scanner spatial resolution (CT scanners are available which combine nearly 900 detector columns with focal spot oversampling) can be tempered by motion blurring, particularly in patients with unstable heartbeats. As a result, recently numerous methods have been devised to improve coronary CTA imaging. Solutions involving hardware, multisector algorithms, or {beta}-blockers are limited by cost, oversimplifying assumptions about cardiac motion, and populations showing contraindications to drugs, respectively. This work introduces an inexpensive algorithmic solution that retrospectively improves the temporal resolution of coronary CTA without significantly affecting spatial resolution. Methods: Given the goal of ruling out coronary stenosis, the method focuses on 'deblurring' the coronary arteries. The approach makes no assumptions about cardiac motion, can be used on exams acquired at high heart rates (even over 75 beats/min), and draws on a fast and accurate three-dimensional (3D) nonrigid bidirectional labeled point matching approach to estimate the trajectories of the coronary arteries during image acquisition. Motion compensation is achieved by employing a 3D warping of a series of partial reconstructions based on the estimated motion fields. Each of these partial reconstructions is created from data acquired over a short time interval. For brevity, the algorithm 'Subphasic Warp and Add' (SWA) reconstruction. Results: The performance of the new motion estimation-compensation approach was evaluated by a systematic observer study conducted using nine human cardiac CTA exams acquired over a range of average heart rates between 68 and 86 beats/min. Algorithm performance was based-lined against exams reconstructed using standard filtered-backprojection (FBP). The study was performed by three experienced reviewers using the American Heart Association's 15-segment model. All vessel segments were evaluated to quantify their viability to allow a clinical diagnosis before and after motion estimation-compensation using SWA. To the best of the authors' knowledge this is the first such observer study to show that an image processing-based software approach can improve the clinical diagnostic value of CTA for coronary artery evaluation. Conclusions: Results from the observer study show that the SWA method described here can dramatically reduce coronary artery motion and preserve real pathology, without affecting spatial resolution. In particular, the method successfully mitigated motion artifacts in 75% of all initially nondiagnostic coronary artery segments, and in over 45% of the cases this improvement was enough to make a previously nondiagnostic vessel segment clinically diagnostic.

60 APPLIED LIFE SCIENCES↗

Modular design of locally ordered tetrahedral structures of Si, SiO{sub 2}, and H{sub 2}O: I. investigation of the possible cooperative local crystallization in amorphous matrices of these compounds

The hypothesis is put forward that the structure of amorphous silicon and other amorphous compounds with a tetrahedral coordination of atoms consists of local regions characterized by an ordered but not crystalline structure and that, owing to the regularity inherent in this structure, solid-phase crystallization of the amorphous compounds under consideration can occur through the cooperative mechanism. The modular design is used to construct a possible structure of similar local regions and to describe the mechanism of its cooperative transformation into a diamond-like structure with the possible formation of numerous microtwins. The difficulties encountered in the course of the cooperative transformation are considered. Algorithms are proposed for constructing one more connected structure of local regions from the same modules (closed hollow loops of bonds), which undergoes a cooperative transformation into crystalline silicon without the aforementioned difficulties.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Long-term spatial distributions and trends of the latent heat fluxes over the global cropland ecosystem using multiple satellite-based models

Estimating cropland latent heat flux (LE) from continental to global scales is vital to modeling crop production and managing water resources. Over the past several decades, numerous LE models were developed, such as the moderate resolution imaging spectroradiometer LE (MOD16) algorithm, revised remote sensing-based Penman–Monteith LE algorithm (RRS), the Priestley–Taylor LE algorithm of the Jet Propulsion Laboratory (PT-JPL) and the modified satellite-based Priestley-Taylor LE algorithm (MS-PT). However, these LE models have not been directly compared over the global cropland ecosystem using various algorithms. In this study, we evaluated the performances of these four LE models using 34 eddy covariance (EC) sites. The results showed that mean annual LE for cropland varied from 33.49 to 58.97 W/m2 among the four models. The inter-annual LE slightly increased during 1982– 2009 across the global cropland ecosystem. All models had acceptable performances with the coefficient of determination (R2 ) ranging from 0.4 to 0.7 and a root mean squared error (RMSE) of approximately 35 W/m2 . MS-PT had good overall performance across the cropland ecosystem with the highest R2 , lowest RMSE and a relatively low bias. The reduced performances of MOD16 and RRS, with R2 ranging from 0.4 to 0.6 and RMSEs from 30 to 39 W/m2 , might be attributed to empirical parameters in the structure algorithms and calibrated coefficients.

54 ENVIRONMENTAL SCIENCES↗

Scalable Domain Decomposed Monte Carlo Particle Transport

In this dissertation, we present the parallel algorithms necessary to run domain decomposed Monte Carlo particle transport on large numbers of processors (millions of processors). Previous algorithms were not scalable, and the parallel overhead became more computationally costly than the numerical simulation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Pressure-Based Inversion and Data Assimilation System (PIDAS) for CO 2 Leakage Detection (Final Report)

This project aims to develop a Pressure-based Inversion and Data Assimilation System (PIDAS) for detecting CO 2 leakage from storage formations. Carbon capture, utilization, and sequestration (CCUS) has the potential to enable deep reductions in global carbon emissions if high storage efficiency can be achieved. A major hurdle to industrial-scale implementation of geological carbon sequestration (GCS) projects is the potential migration of fluids (either brine or injected CO 2 ) from the storage formations and the resulting legal and financial liabilities. The capability to accurately identify leakage pathways by which stored CO 2 could leak, has leaked, or is leaking from the targeted storage zone is thus of paramount importance to site licensees and regulators. Although many MVA techniques have been devised, pressure-based monitoring technology remains the most sensitive and reliable technique for early detection. Pressure-based monitoring has consistently received the highest score in terms of benefit/cost ratio and it provides the greatest potential for leakage detection with broad areal coverage. Under this project we have (a) demonstrated the utility of the proposed well testing technique for leakage detection through integrated theoretical and numerical analysis, laboratory experiments, and field tests; (b) developed effective data analysis and inversion algorithms for identifying leakage pathways by fusing data generated during well testing; (c) provided a designing tool for maximizing the utility of the developed PIDAS tool for early leakage detection.

02 PETROLEUM↗

Bilevel parameter optimization for learning nonlocal image denoising models

We propose a bilevel optimization approach for the estimation of parameters in nonlocal image denoising models. The parameters we consider are both the space-dependent fidelity weight and weights within the kernel of the nonlocal operator. In both cases we investigate the differentiability of the solution operator in function spaces and derive a first order optimality system that characterizes local minima. For the numerical solution of the problems, we propose a second-order trust-region algorithm in combination with a finite element discretization of the nonlocal denoising models and we introduce a computational strategy for the solution of the resulting dense linear systems. Several experiments illustrate the applicability and effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

Design of quantum optical experiments with logic artificial intelligence

Logic Artificial Intelligence (AI) is a subfield of AI where variables can take two defined arguments, True or False, and are arranged in clauses that follow the rules of formal logic. Several problems that span from physical systems to mathematical conjectures can be encoded into these clauses and solved by checking their satisfiability (SAT). In contrast to machine learning approaches where the results can be approximations or local minima, Logic AI delivers formal and mathematically exact solutions to those problems. In this work, we propose the use of logic AI for the design of optical quantum experiments. We show how to map into a SAT problem the experimental preparation of an arbitrary quantum state and propose a logic-based algorithm, called Klaus, to find an interpretable representation of the photonic setup that generates it. We compare the performance of Klaus with the state-of-the-art algorithm for this purpose based on continuous optimization. We also combine both logic and numeric strategies to find that the use of logic AI significantly improves the resolution of this problem, paving the path to developing more formal-based approaches in the context of quantum physics experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High-precision arithmetic in mathematical physics

For many scientific calculations, particularly those involving empirical data, IEEE 32-bit floating-point arithmetic produces results of sufficient accuracy, while for other applications IEEE 64-bit floating-point is more appropriate. But for some very demanding applications, even higher levels of precision are often required. Furthermore, this article discusses the challenge of high-precision computation, in the context of mathematical physics, and highlights what facilities are required to support future computation, in light of emerging developments in computer architecture.

97 MATHEMATICS AND COMPUTING↗

Automated Detection of Instability-Inducing Channel Geometry Transitions in Saint-Venant Simulation of Large-Scale River Networks

A new sweep-search algorithm (SSA) is developed and tested to identify the channel geometry transitions responsible for numerical convergence failure in a Saint-Venant equation (SVE) simulation of a large-scale open-channel network. Numerical instabilities are known to occur at “sharp” transitions in discrete geometry, but the identification of problem locations has been a matter of modeler’s art and a roadblock to implementing large-scale SVE simulations. The new method implements techniques from graph theory applied to a steady-state 1D shallow-water equation solver to recursively examine the numerical stability of each flowpath through the channel network. The SSA is validated with a short river reach and tested by the simulation of ten complete river systems of the Texas–Gulf Coast region by using the extreme hydrological conditions recorded during hurricane Harvey. The SSA successfully identified the problematic channel sections in all tested river systems. Subsequent modification of the problem sections allowed stable solution by an unsteady SVE numerical solver. The new SSA approach permits automated and consistent identification of problem channel geometry in large open-channel network data sets, which is necessary to effectively apply the fully dynamic Saint-Venant equations to large-scale river networks or for city-wide stormwater networks.

54 ENVIRONMENTAL SCIENCES↗

Hydrodynamic Modelling for Tidal Energy Kites: Cooperative Research and Development Final Report, CRADA Number CRD-24-30123

The primary goal of the work is to improve accuracy of hydrodynamic loads acting on the lifting surface of the kite turbine due to complex air-water-lifting body interaction in a low-order numerical model using high-fidelity numerical input. The result of this study will help the Participant better design control algorithms for the kite turbine so that the turbine can harvest more energy while maintaining stability of the platform as well as its reliability. The use of hydrodynamic coefficients/load components from computational fluid dynamic simulation will inform better inputs for a medium-fidelity dynamic model (specifically an OrcaFlex model) which is intended for use in rapid design iterations in the design process.

16 TIDAL AND WAVE POWER↗

Domain decomposition solvers for PDEs : some basics, practical tools, and new developments.

The first part of this talk provides a basic introduction to the building blocks of domain decomposition solvers. Specific details are given for both the classical overlapping Schwarz (OS) algorithm and a recent iterative substructuring (IS) approach called balancing domain decomposition by constraints (BDDC). A more recent hybrid OS-IS approach is also described. The success of domain decomposition solvers depends critically on the coarse space. Similarities and differences between the coarse spaces for OS and BDDC approaches are discussed, along with how they can be obtained from discrete harmonic extensions. Connections are also made between coarse spaces and multiscale modeling approaches from computational mechanics. As a specific example, details are provided on constructing coarse spaces for incompressible fluid problems. The next part of the talk deals with a variety of implementation details for domain decomposition solvers. These include mesh partitioning options, local and global solver options, reducing the coarse space dimension, dealing with constraint equations, residual weighting to accelerate the convergence of OS methods, and recycling of Krylov spaces to efficiently solve problems with multiple right hand sides. Some potential bottlenecks and remedies for domain decomposition solvers are also discussed. The final part of the talk concerns some recent theoretical advances, new algorithms, and open questions in the analysis of domain decomposition solvers. The focus will be primarily on the work of the speaker and his colleagues on elasticity, fluid mechanics, problems in H(curl), and the analysis of subdomains with irregular boundaries.

99 GENERAL AND MISCELLANEOUS↗

Microwave Cavity Simulation Using Ansys HFSS

The design of microwave cavity detectors for axion dark matter research is often accomplished using advanced full-wave electromagnetic simulation software tools. These tools provide a cost-effective approach to evaluate a wide variety of cavity configurations, frequency tuning mechanisms, and conductive or dielectric materials and coatings. One simulation software package used for this application is Ansys High Frequency Structure Simulator (HFSS), which is based upon the well-established finite element method. HFSS includes numerous features useful for microwave cavity design such as parametric geometry modeling, adaptive meshing algorithm, curvilinear mesh elements, driven modal and eigenmode matrix solvers, and optimization algorithms. This paper describes the use of the HFSS software to simulate microwave cavities for axion haloscope detectors, with an example tutorial for a cylindrical cavity. Excellent agreement between the simulated and analytical results is shown for the resonant frequency, quality factor, and form factor.

Ansys HFSS, Cavity simulation, finite element mode↗

Refine your search to explore more results.