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,549 records · Page 86

Spectral Mesh-Free Quadrature for Planar Regions Bounded by Rational Parametric Curves

This article presents spectral, mesh-free, Green’s theorem-based numerical quadrature schemes for integrating functions over planar regions bounded by rational parametric curves. Our algorithm proceeds in two steps: (1) We first find intermediate quadrature rules for line integrals along the region’s boundary curves corresponding to Green’s theorem. (2) We then use a high-order quadrature rule to compute the numerical antiderivative of the integrand along a coordinate axis, which is used to evaluate the Green’s theorem line integral. We present two methods to compute the intermediate quadrature rule. The first is spectrally accurate (it converges faster than any algebraic order with respect to number of quadrature points) and is relatively easy to implement, but has no guarantee of polynomial exactness. The second guarantees exactness for polynomial integrands up to a pre-specified degree with an a priori-known number of quadrature points and retains the convergence properties of the first, but is slightly more complicated. The quadrature schemes have applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order meshes, and initialization of multi-material simulations with rational geometry. We compare the quadrature schemes produced using our method to other methods in the literature and show that they are much more efficient both in terms of number of quadrature points and computational time. We provide an open-source implementation of the algorithm in MATLAB.

97 MATHEMATICS AND COMPUTING↗

Automated Operational Forecasting of Monsoon Low Pressure Systems

Monsoon low pressure systems (LPSs) are the dominant rain-bearing weather system of South Asia, often producing extreme precipitation and hydrological disasters in a region inhabited by nearly two billion people. Despite the importance of these storms, no operational system has automatically identified and tracked LPS in real time in numerical weather prediction model output; many commonly used vortex-tracking algorithms are ill suited for monsoon LPS because of the weak winds and cold cores of these systems. Here, we describe a new system that uses optimized algorithms to identify monsoon LPS in short- to medium-range forecasts from the U.S. Global Ensemble Forecast System (GEFS) and a version of the deterministic Global Forecast System (GFS) adapted and used operationally by the Indian Institute of Tropical Meteorology (IITM). We also assess the historical performance of these models in forecasting South Asian monsoon LPS, comparing this with the performance of the Integrated Forecasting System of the ECMWF. We assess the accuracy of model predictions of LPS genesis, position, intensity, and precipitation rates for forecast lead times of 1–5 days, yielding quantitative information on model biases to guide operational forecasters and disaster managers. The system we introduce here could be extended to other low-latitude regions affected by dynamically weak, heavily precipitating atmospheric vortices that are often not included in tropical cyclone inventories.

54 ENVIRONMENTAL SCIENCES↗

MO-FG-204-06: A New Algorithm for Gold Nano-Particle Concentration Identification in Dual Energy CT

Purpose: Gold nano-particle (GNP) has recently attracted a lot of attentions due to its potential as an imaging contrast agent and radiotherapy sensitiser. Imaging the GNP at its low contraction is a challenging problem. We propose a new algorithm to improve the identification of GNP based on dual energy CT (DECT). Methods: We consider three base materials: water, bone, and gold. Determining three density images from two images in DECT is an under-determined problem. We propose to solve this problem by exploring image domain sparsity via an optimization approach. The objective function contains four terms. A data-fidelity term ensures the fidelity between the identified material densities and the DECT images, while the other three terms enforces the sparsity in the gradient domain of the three images corresponding to the density of the base materials by using total variation (TV) regularization. A primal-dual algorithm is applied to solve the proposed optimization problem. We have performed simulation studies to test this model. Results: Our digital phantom in the tests contains water, bone regions and gold inserts of different sizes and densities. The gold inserts contain mixed material consisting of water with 1g/cm3 and gold at a certain density. At a low gold density of 0.0008 g/cm3, the insert is hardly visible in DECT images, especially for those with small sizes. Our algorithm is able to decompose the DECT into three density images. Those gold inserts at a low density can be clearly visualized in the density image. Conclusion: We have developed a new algorithm to decompose DECT images into three different material density images, in particular, to retrieve density of gold. Numerical studies showed promising results.

60 APPLIED LIFE SCIENCES↗

Initial position optimization in molecular dynamics simulations for a Coulomb system

A new algorithm for molecular dynamics (MD) simulations is developed to optimize plasma particle distributions at given initial temperatures. By combining velocity scaling and reassignment, the method effectively eliminates the initial rise and oscillation in temperatures observed with randomly distributed positions. These rises and oscillations are undesired numerical artifacts observed in conventional plasma MD simulations, arising from unoptimized particle positions. The algorithm demonstrates temperature relaxation without initial rises or oscillations, as well as precise flow velocity relaxation, enabling accurate measurement of relaxation times. The code is accelerated using graphics processing units for parallel processing, enhancing the study of plasma dynamics. The proposed method for distributing physically valid particles in MD simulations enables accurate studies of intrinsic collision processes in plasmas, including the dynamics of strongly coupled plasmas, plasma–wave interactions, and transport phenomena in magnetized plasmas. The paper concludes with a discussion of potential applications and future enhancements to the algorithm.

Jo, Jawon (ORCID:0009000924193285)↗

Subspace-based Inverse Uncertainty Quantification for Nuclear Data Assessment

Safety analysis and design optimization depend on the accurate prediction of various reactor attributes. Predictions can be enhanced by reducing the uncertainty associated with the attributes of interest. An inverse problem can be defined and solved to assess the sources of uncertainty, and experimental effort can be subsequently directed to further improve the uncertainty associated with these sources. In this work a subspace-based algorithm for inverse sensitivity/uncertainty quantification (IS/UQ) has been developed to enable analysts account for all sources of nuclear data uncertainties in support of target accuracy assessment-type analysis. An approximate analytical solution of the optimization problem is used to guide the search for the dominant uncertainty subspace. By limiting the search to a subspace, the degrees of freedom available for the optimization search are significantly reduced. A quarter PWR fuel assembly is modeled and the accuracy of the multiplication factor and the fission reaction rate are used as reactor attributes whose uncertainties are to be reduced. Numerical experiments are used to demonstrate the computational efficiency of the proposed algorithm. Our ongoing work is focusing on extending the proposed algorithm to account for various forms of feedback, e.g., thermal-hydraulics and depletion effects.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Large Scale Tensor Factorization via Parallel Sketches

Tensor factorization methods have recently gained increased popularity. A key feature that renders tensors attractive is the ability to directly model multi-relational data. In this work, we propose ParaSketch, a parallel tensor factorization algorithm that enables massive parallelism, to deal with large tensors. The idea is to compress the large tensor into multiple small tensors, decompose each small tensor in parallel, and combine the results to reconstruct the desired latent factors. Prior art in this direction entails potentially very high complexity in the (Gaussian) compression and final combining stages. Adopting sketching matrices for compression, the proposed method enjoys a dramatic reduction in compression complexity, and features a much lighter combining step. Moreover, theoretical analysis shows that the compressed tensors inherit latent identifiability under mild conditions, hence establishing correctness of the overall approach. Numerical experiments corroborate the theory and demonstrate the effectiveness of the proposed algorithm.

block term decomposition↗

A cell-centered AMR-ALE framework for 3D multi-material hydrodynamics. Part II: linesweep ALE rezoning for nonconformal block-structured AMR meshes

The simulation of flows presenting contact discontinuities, vorticity, and large variations in spatial scales can be performed in a framework coupling Arbitrary Lagrangian Eulerian (ALE) algorithms and Adaptive Mesh Refinement (AMR). This coupling requires adaptation of ALE rezoning techniques to meshes containing nonconformal nodes arising from both the AMR topology and the junction of mesh blocks. Here, in this paper, we present an ALE rezoning strategy that is compatible with such meshes, and that can also act as a disentangling algorithm. Emphasis is put on an algorithm that respects intrinsic Lagrangian mesh properties in order to preserve accuracy around discontinuities. To that end, we adapt the weighted linesweep algorithm to nonconformal block-structured AMR meshes. Then, we present control parameters introduced in the method for it to be applicable in practical situations. Notably, the method is coupled to a specific metric optimization in order to palliate some shortcomings of the linesweep method. Finally, numerical test cases are presented that feature the capabilities of the ALE-AMR algorithm for flows that present discontinuities, vorticity, and a variety of scales. Notably, we show that our ALE-AMR algorithm gives results at least similar to Euler-AMR, but provides better accuracy in cases where discontinuities are involved, thanks to a method that respects the Lagrangian features of the mesh. Additionally, it enables Euler-AMR-like computations on domains with temporally varying domain boundaries.

Adaptive mesh refinement↗

Numerical Solutions for the Orbital Motion of the Solar System over the Past 100 Myr: Limits and New Results

I report results from accurate numerical integrations of solar system orbits over the past 100 Myr with the integrator package HNBody. The simulations used different integrator algorithms, step sizes, and initial conditions, and included effects from general relativity, different models of the Moon, the Sun’s quadrupole moment, and up to 16 asteroids. I also probed the potential effect of a hypothetical Planet 9, using one set of possible orbital elements. The most expensive integration (Bulirsch–Stoer) required 4 months of wall-clock time with a maximum relative energy error ≲3×10{sup −13}. The difference in Earth’s eccentricity (Δe{sub E}) was used to track the difference between two solutions, considered to diverge at time τ when max |Δe{sub E}| irreversibly crossed ∼10% of mean e{sub E} (∼0.028×0.1). The results indicate that finding a unique orbital solution is limited by initial conditions from current ephemerides and asteroid perturbations to ∼54 Myr. Bizarrely, the 4-month Bulirsch–Stoer integration and a symplectic integration that required only 5 hr of wall-clock time (12-day time step, with the Moon as a simple quadrupole perturbation), agree to ∼63 Myr. Internally, such symplectic integrations are remarkably consistent even for large time steps, suggesting that the relationship between time step and τ is not a robust indicator of the absolute accuracy of symplectic integrations. The effect of a hypothetical Planet 9 on Δe{sub E} becomes discernible at ∼65 Myr. Using τ as a criterion, the current state-of-the-art solutions all differ from previously published results beyond ∼50 Myr. I also conducted an eigenmode analysis, which provides some insight into the chaotic nature of the inner solar system. The current study provides new orbital solutions for applications in geological studies.

79 ASTRONOMY AND ASTROPHYSICS↗

Numerical Experiments with a Continuous L{sub 2}-exponential Merit Function for Semi-Infinite Programming

Here, we present some numerical experiments with a reduction method for solving nonlinear semi-infinite programming (SIP) problems. The method relies on a line search technique to ensure a sufficient decrease of a L{sub 2}-exponential merit function. The proposed merit function is continuous for SIP and improves the algorithm efficiency when compared with other previously tested merit functions. A comparison with other reduction methods is also included.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quasioptical modeling of wave beams with and without mode conversion: II. Numerical simulations of single-mode beams

This work continues a series of papers where we propose an algorithm for quasioptical modeling of electromagnetic beams with and without mode conversion. The general theory was reported in the first paper of this series, where a parabolic partial differential equation was derived for the field envelope that may contain one or multiple modes with close group velocities. Here, we present a corresponding code PARADE (PAraxial RAy DEscription) and its test applications to single-mode beams in vacuum and also in inhomogeneous magnetized plasma. The numerical results are compared, respectively, with analytic formulas from Gaussian-beam optics and also with cold-plasma ray tracing. Quasioptical simulations of mode-converting beams are reported in the next, third paper of this series.

ECRH↗

Quasioptical modeling of wave beams with and without mode conversion. II. Numerical simulations of single-mode beams

This work continues a series of papers where we propose an algorithm for the quasi-optical modeling of electromagnetic beams with and without mode conversion. The general theory was reported in the first paper of this series, where a parabolic partial differential equation was derived for the field envelope that may contain one or multiple modes with close group velocities. Here, we present a corresponding code paraxial ray description and its test applications to single-mode beams in vacuum and also in inhomogeneous magnetized plasma. Here, the numerical results are compared with analytic formulas from Gaussian-beam optics and also with cold-plasma ray tracing, respectively. The quasi-optical simulations of mode-converting beams are reported in the third paper of this series.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Risk-Averse Bi-Level Stochastic Network Interdiction Model for Cyber-Security Risk Management

Security of cyber networks is crucial; recent severe cyber-attacks have had a devastating effect on many large organizations. The attack graph, which maps the potential attack paths of a cyber network, is a popular tool for analyzing cyber system vulnerability. In this study, we propose a bi-level stochastic network interdiction model on an attack graph to enable a risk-averse, resource constrained cyber network defender to optimally deploy security countermeasures that protect against attackers with an uncertain budget. This risk- averse conditional-value-at-risk (CVaR) model minimizes a weighted sum of the expected maximum loss over all scenarios and the expected maximum loss from the most damaging attack scenarios. We develop a customized constraint and column generation algorithm to solve our model as well as several acceleration techniques to improve the computational efficiency. Numerical experiments demonstrate that the acceleration techniques enable the solution of relatively large problems within a reasonable amount of time: applying all the acceleration techniques also reduces the average computation time of the basic algorithm by 71% for 100-node graphs. Using metrics called mean-risk value of stochastic solution and value of risk-aversion, computational results suggest that our stochastic risk-averse model significantly outperforms deterministic and risk-neutral models when 1) the distribution of attacker budget is heavy-right-tailed and 2) the defender is highly risk-averse.

Bhuiyan, Tanveer H.↗

Structure-aware Initialization via Numerical Continuation and Informed Priors

Scientific machine learning (SciML) often operates in ill-conditioned, weakly identifiable regimes due to limited data or indirect observations. In such settings, optimization and inference are highly sensitive to the starting point, making initialization--often under-reported--a consequential degree of freedom. Random initialization is not a neutral default as it induces an implicit prior over candidate solutions and can systematically bias the result, producing large run-to-run variability. Here, we formalize this view by treating initialization as a hidden confounder in SciML and develop a unifying theory for structure-aware initialization via numerical continuation, constructing warm starts from related problem instances. Across representative tasks, including physics-informed neural networks, maximum likelihood estimation, and variational inference, warm starts have been shown to consistently reduce optimization effort and improve reliability.

Data integrity↗

Structural algorithm to reservoir reconstruction using passive seismic data (synthetic example)

Using of passive seismic observations to detect a reservoir is a new direction of prospecting and exploration of hydrocarbons. In order to identify thin reservoir model we applied the modification of Gaussian elimination method in conditions of incomplete synthetic data. Because of the singularity of a matrix conventional method does not work. Therefore structural algorithm has been developed by analyzing the given model as a complex model. Numerical results demonstrate of its advantage compared with usual way of solution. We conclude that the gas reservoir is reconstructed by retrieving of the image of encasing shale beneath it.

58 GEOSCIENCES↗

Inner Approximation of Minkowski Sums: A Union-Based Approach and Applications to Aggregated Energy Resources: Preprint

This paper develops and compares algorithms to compute the inner approximation of Minkowski sum of convex polytopes. We consider flexibility from distributed re- sources, such as solar photovoltaic (PV) inverters, demand side resources, etc. A polytopic representation of a single inverter's feasible operating region is proposed first. The aggregate flexibility can be computed using the Minkowski sum. Homothet and Zonotope-based approaches have been explored in literature. We show that as heterogeneity increases, such approaches lead to conservative estimates. Hence, we show how to exploit union-based Minkowski sum computation through successive homothetic decomposition of polytopes. While the union-based approach can lead to dimensionality issues, we show how to limit the complexity by predefining a candidate set. Efficiency, accuracy and trade-offs have been analyzed. Numerical examples have been presented to illustrate the effectiveness of the proposed algorithm.

14 SOLAR ENERGY↗

A multiscale hp-FEM for 2D photonic crystal bands

A multiscale generalised hp-finite element method (MSFEM) for time harmonic wave propagation in bands of locally periodic media of large, but finite extent, e.g., photonic crystal (PhC) bands, is presented. The method distinguishes itself by its size robustness, i.e., to achieve a prescribed error its computational effort does not depend on the number of periods. The proposed method shows this property for general incident fields, including plane waves incident at a certain angle to the infinite crystal surface, and at frequencies in and outside of the bandgap of the PhC. The proposed MSFEM is based on a precomputed problem adapted multiscale basis. This basis incorporates a set of complex Bloch modes, the eigenfunctions of the infinite PhC, which are modulated by macroscopic piecewise polynomials on a macroscopic FE mesh. The multiscale basis is shown to be efficient for finite PhC bands of any size, provided that boundary effects are resolved with a simple macroscopic boundary layer mesh. The MSFEM, constructed by combing the multiscale basis inside the crystal with some exterior discretisation, is a special case of the generalised finite element method (g-FEM). For the rapid evaluation of the matrix entries we introduce a size robust algorithm for integrals of quasi-periodic micro functions and polynomial macro functions. Size robustness of the present MSFEM in both, the number of basis functions and the computation time, is verified in extensive numerical experiments.

97 MATHEMATICS AND COMPUTING↗

A general framework of noise suppression in material decomposition for dual-energy CT

Purpose: As a general problem of dual-energy CT (DECT), noise amplification in material decomposition severely reduces the signal-to-noise ratio on the decomposed images compared to that on the original CT images. In this work, the authors propose a general framework of noise suppression in material decomposition for DECT. The method is based on an iterative algorithm recently developed in their group for image-domain decomposition of DECT, with an extension to include nonlinear decomposition models. The generalized framework of iterative DECT decomposition enables beam-hardening correction with simultaneous noise suppression, which improves the clinical benefits of DECT. Methods: The authors propose to suppress noise on the decomposed images of DECT using convex optimization, which is formulated in the form of least-squares estimation with smoothness regularization. Based on the design principles of a best linear unbiased estimator, the authors include the inverse of the estimated variance–covariance matrix of the decomposed images as the penalty weight in the least-squares term. Analytical formulas are derived to compute the variance–covariance matrix for decomposed images with general-form numerical or analytical decomposition. As a demonstration, the authors implement the proposed algorithm on phantom data using an empirical polynomial function of decomposition measured on a calibration scan. The polynomial coefficients are determined from the projection data acquired on a wedge phantom, and the signal decomposition is performed in the projection domain. Results: On the Catphan{sup ®}600 phantom, the proposed noise suppression method reduces the average noise standard deviation of basis material images by one to two orders of magnitude, with a superior performance on spatial resolution as shown in comparisons of line-pair images and modulation transfer function measurements. On the synthesized monoenergetic CT images, the noise standard deviation is reduced by a factor of 2–3. By using nonlinear decomposition on projections, the authors’ method effectively suppresses the streaking artifacts of beam hardening and obtains more uniform images than their previous approach based on a linear model. Similar performance of noise suppression is observed in the results of an anthropomorphic head phantom and a pediatric chest phantom generated by the proposed method. With beam-hardening correction enabled by their approach, the image spatial nonuniformity on the head phantom is reduced from around 10% on the original CT images to 4.9% on the synthesized monoenergetic CT image. On the pediatric chest phantom, their method suppresses image noise standard deviation by a factor of around 7.5, and compared with linear decomposition, it reduces the estimation error of electron densities from 33.3% to 8.6%. Conclusions: The authors propose a general framework of noise suppression in material decomposition for DECT. Phantom studies have shown the proposed method improves the image uniformity and the accuracy of electron density measurements by effective beam-hardening correction and reduces noise level without noticeable resolution loss.

60 APPLIED LIFE SCIENCES↗

Formation Conditions and Stability Criteria for Small-Size Cluster Systems

The formation conditions and stability criteria for small-size cluster systems consisting of several particles interacting via an arbitrary isotropic pair potential are considered. Analytical criteria for instability development in horizontal (quasi-two-dimensional) and vertical (chain) structures consisting of three, four, and five charged particles are obtained for the first time. A simple algorithm to search for similar criteria in systems consisting of a larger number of particles is proposed. The obtained relations are verified by numerically solving the problem for Yukawa systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗