Search NASA⌕ Search

SEARCH · Search NASA

Results for “multiple solutions”

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 289 records · Page 16

Accuracy/Computation Performance of a New Trilateration Scheme for GPS-Style Localization

We recently introduced a new geometric trilateration (GT) method for GPS-style positioning. Preliminary singlepoint analysis using simplistic error assumptions indicates that the new scheme delivers almost indistinguishable localization accuracy as the traditional Newton-Raphson (NR) approach. Also, the same computation procedure can be used to perform high-accuracy relative positioning between a reference vehicle and an arbitrary number of target vehicles. This scheme has the potential to enable a) new mission concepts in collaborative science, b) in-situ navigation services for human Mars missions, and c) lower cost and faster acquisition of GPS signals for consumer-grade GPS products. The new GT scheme differs from the NR scheme as follows: 1. The new scheme is derived from Pythagoras Theorem, whereas the NR method is based on the principle of linear regression. 2. The NR method uses the absolute locations (xi, yi, zi)’s of the GPS satellites as input to each step of the localization computation. The GT method uses the Directional Cosines Ui’s from Earth’s center to the GPS satellite Si. 3. Both the NR method and the GT method iterate to converge to a localized solution. In each iteration step, multiple matrix operations are performed. The NR method constructs a different matrix in each iterative step, thus requires performing a new set of matrix operations in each step. The GT scheme uses the same matrix in each iteration, thus requiring computing the matrix operations only once for all subsequent iterations. In this paper, we perform an in-depth comparison between the GT scheme and the NR method in terms of a) GPS localization accuracy in the GPS operation environment, b) its sensitivity with respect to systematic errors and random errors, and c) computation load required to converge to a localization solution.

Lee, Charles↗

Considerations on solving problems with multiple scales

An overview is given on considerations involved in the computation of solution to problems involving several scales. Examples of problems with multiple scales are studied, showing that the presence of multiple scales in a physical system may be manifested in different ways which depend on the degree of interaction between the various scales. Numerical methods commonly used to solve problems with multiple scales discussed, and it is found that the effective methods are based on subspace projection.

Chin, R. C. Y.↗

Decision net, directed graph, and neural net processing of imaging spectrometer data

A decision-net solution involving a novel hierarchical classifier and a set of multiple directed graphs, as well as a neural-net solution, are respectively presented for large-class problem and mixture problem treatments of imaging spectrometer data. The clustering method for hierarchical classifier design, when used with multiple directed graphs, yields an efficient decision net. New directed-graph rules for reducing local maxima as well as the number of perturbations required, and the new starting-node rules for extending the reachability and reducing the search time of the graphs, are noted to yield superior results, as indicated by an illustrative 500-class imaging spectrometer problem.

Casasent, David↗

Unsteady Solution of Non-Linear Differential Equations Using Walsh Function Series

Walsh functions form an orthonormal basis set consisting of square waves. The discontinuous nature of square waves make the system well suited for representing functions with discontinuities. The product of any two Walsh functions is another Walsh function - a feature that can radically change an algorithm for solving non-linear partial differential equations (PDEs). The solution algorithm of non-linear differential equations using Walsh function series is unique in that integrals and derivatives may be computed using simple matrix multiplication of series representations of functions. Solutions to PDEs are derived as functions of wave component amplitude. Three sample problems are presented to illustrate the Walsh function series approach to solving unsteady PDEs. These include an advection equation, a Burgers equation, and a Riemann problem. The sample problems demonstrate the use of the Walsh function solution algorithms, exploiting Fast Walsh Transforms in multi-dimensions (O(Nlog(N))). Details of a Fast Walsh Reciprocal, defined here for the first time, enable inversion of aWalsh Symmetric Matrix in O(Nlog(N)) operations. Walsh functions have been derived using a fractal recursion algorithm and these fractal patterns are observed in the progression of pairs of wave number amplitudes in the solutions. These patterns are most easily observed in a remapping defined as a fractal fingerprint (FFP). A prolongation of existing solutions to the next highest order exploits these patterns. The algorithms presented here are considered a work in progress that provide new alternatives and new insights into the solution of non-linear PDEs.

Gnoffo, Peter A.↗

Dynamic Spectrum Allocation in Urban Air Transportation System via Deep Reinforcement Learning

The emerging concepts of Urban Air Mobility (UAM) and Advanced Air Mobility (AAM) open a new paradigm for urban air transportation. A big challenge is that these new aerial vehicles will quickly saturate the already crowded aviation spectrum, which is an essential resource to ensure reliable communications for safe operations. In this paper, we consider an air transportation system where multiple aerial vehicles are operated to transport passengers or cargo from different sources to destinations along their pre-defined paths. During the flight, the minimum communication Quality of Service (QoS) requirement must be achieved to ensure flight safety. Our objective is to minimize the average mission completion time by jointly optimizing the velocity selection and spectrum allocation for all aerial vehicles. We formulate the optimization problem as a multi-stage Markov Decision Process (MDP) where the optimization variables are coupled together. A multi-agent Deep Reinforcement Learning (DRL) based solution is proposed where Value Decomposition Networks (VDN) algorithm is utilized to take discrete actions. Additionally, we propose a heuristic greedy algorithm as a baseline solution. Simulation results show that our learning based solution outperforms the heuristic greedy algorithm and another Orthogonal Multiple Access (OMA) solution in minimizing the mission completion time.

Ruixuan Han↗

Dynamic Spectrum Allocation in Urban Air Transportation System via Deep Reinforcement Learning

The emerging concepts of Urban Air Mobility (UAM) and Advanced Air Mobility (AAM) open a new paradigm for urban air transportation. A big challenge is that these new aerial vehicles will quickly saturate the already crowded aviation spectrum, which is an essential resource to ensure reliable communications for safe operations. In this paper, we consider an air transportation system where multiple aerial vehicles are operated to transport passengers or cargo from different sources to destinations along their pre-defined paths. During the flight, the minimum communication Quality of Service (QoS) requirement must be achieved to ensure flight safety. Our objective is to minimize the average mission completion time by jointly optimizing the velocity selection and spectrum allocation for all aerial vehicles. We formulate the optimization problem as a multi-stage Markov Decision Process (MDP) where the optimization variables are coupled together. A multi-agent Deep Reinforcement Learning (DRL) based solution is proposed where Value Decomposition Networks (VDN) algorithm is utilized to take discrete actions. Additionally, we propose a heuristic greedy algorithm as a baseline solution. Simulation results show that our learning based solution outperforms the heuristic greedy algorithm and another Orthogonal Multiple Access (OMA) solution in minimizing the mission completion time.

Ruixuan Han↗

A globally sampled high-resolution hand-labeled validation dataset for evaluating surface water extent maps

Effective monitoring of global water resources is increasingly critical due to climate change and population growth. Advancements in remote sensing technology, specifically in spatial, spectral, and temporal resolutions, are revolutionizing water resource monitoring, leading to more frequent and high-quality surface water extent maps using various techniques such as traditional image processing and machine learning algorithms. However, satellite imagery datasets contain trade-offs that result in inconsistencies in performance, such as disparities in measurement principles between optical (e.g., Sentinel-2) and radar (e.g., Sentinel-1) sensors and differences in spatial and spectral resolutions among optical sensors. Therefore, developing accurate and robust surface water mapping solutions requires independent validations from multiple datasets to identify potential biases within the imagery and algorithms. However, high-quality validation datasets are expensive to build, and few contain information on water resources. For this purpose, we introduce a globally sampled, high-spatial-resolution dataset labeled using 3 m PlanetScope imagery. Our surface water extent dataset comprises 100 images, each with a size of 1024×1024 pixels, which were sampled using a stratified random sampling strategy covering all 14 biomes. We highlighted urban and rural regions, lakes, and rivers, including braided rivers and coastal regions. We evaluated two surface water extent mapping methods using our dataset – Dynamic World, based on Sentinel-2, and the NASA IMPACT model, based on Sentinel-1. Dynamic World achieved a mean intersection over union (IoU) of 72.16 % and F1 score of 79.70 %, while the NASA IMPACT model had a mean IoU of 57.61 % and F1 score of 65.79 %. Performance varied substantially across biomes, highlighting the importance of evaluating models on diverse landscapes to assess their generalizability and robustness. Our dataset can be used to analyze satellite products and methods, providing insights into their advantages and drawbacks. Our dataset offers a unique tool for analyzing satellite products, aiding the development of more accurate and robust surface water monitoring solutions. The dataset can be accessed via https://doi.org/10.25739/03nt-4f29.

54 ENVIRONMENTAL SCIENCES↗

Understanding and Improving Model Representation of Aerosol Optical Properties for a Chinese Haze Event Measured During KORUS-AQ

KORUS-AQ was an international cooperative air quality field study in South Korea that measured local and remote sources of air pollution affecting the Korean Peninsula during May–June 2016. Some of the largest aerosol mass concentrations were measured during a Chinese haze transport event (24 May). Air quality forecasts using the WRF-Chem model with aerosol optical depth (AOD) data assimilation captured AOD during this pollution episode but overpredicted surface particulate matter concentrations in South Korea, especially PM2.5, often by a factor of 2 or larger. Analysis revealed multiple sources of model deficiency related to the calculation of optical properties from aerosol mass that explain these discrepancies. Using in situ observations of aerosol size and composition as inputs to the optical properties calculations showed that using a low-resolution size bin representation (four bins) underestimates the efficiency with which aerosols scatter and absorb light (mass extinction efficiency). Besides using finer-resolution size bins (8–16 bins), it was also necessary to increase the refractive indices and hygroscopicity of select aerosol species within the range of values reported in the literature to achieve better consistency with measured values of the mass extinction efficiency (6.7 m2 g−1 observed average) and light-scattering enhancement factor (f(RH)) due to aerosol hygroscopic growth (2.2 observed average). Furthermore, an evaluation of the optical properties obtained using modeled aerosol properties revealed the inability of sectional and modal aerosol representations in WRF-Chem to properly reproduce the observed size distribution, with the models displaying a much wider accumulation mode. Other model deficiencies included an underestimate of organic aerosol density (1.0 g cm−3 in the model vs. observed average of 1.5 g cm−3) and an overprediction of the fractional contribution of submicron inorganic aerosols other than sulfate, ammonium, nitrate, chloride, and sodium corresponding to mostly dust (17 %–28 % modeled vs. 12 % estimated from observations). These results illustrate the complexity of achieving an accurate model representation of optical properties and provide potential solutions that are relevant to multiple disciplines and applications such as air quality forecasts, health impact assessments, climate projections, solar power forecasts, and aerosol data assimilation.

Pablo E. Saide↗

A Unified Design Theory for Multi-Port Polyphase Transformers Enabling Scalable Power-Multiplexed EV Fleet Charging Systems

This paper presents a unified analytical design theory for multi-port polyphase transformers, targeting scalable and isolated high-power Electric Vehicle (EV) fleet charging systems with power multiplexing capability. As fleet electrification accelerates, conventional one-to-one charger architectures face significant challenges in infrastructure cost, peak power demand, and low utilization of installed power electronics. Power-multiplexed charging architectures, which dynamically distribute power from a shared pool of converter modules across multiple vehicles, have emerged as a promising solution. However, such architectures require scalable, isolated multi-port power interfaces capable of routing energy among multiple inputs and outputs, whose design remains complex and dependent on iterative modeling. To address this gap, the proposed theory provides closed-form expressions for self-inductance, leakage inductance, and mutual coupling terms for arbitrary multi-phase, multi-port transformer structures. The formulation enables direct synthesis of isolated multi-input and multi-output resonant converter systems without reliance on geometry-specific finite-element analysis or extensive parameter extraction. This capability is particularly critical for power-multiplexed systems, where modular converter structures must interface with multiple vehicles while maintaining galvanic isolation and flexible power allocation. The effectiveness of the proposed framework is demonstrated through the design of a 360 kW multi-phase system operating over a 700–900 VDC input and 400–1250 VDC output range. PLECS simulation results confirm accurate prediction of system behavior and validate the applicability of the approach to multi-port, power-multiplexed charging scenarios. The proposed method significantly reduces design complexity while enabling scalable, cost-effective, and fully utilized EV fleet charging infrastructure.

Asa, Erdem [ORNL] (ORCID:0000000190884812)↗

L-PBF High-Throughput Data Pipeline Approach for Multi-modal Integration

Abstract Metal-based additive manufacturing requires active monitoring solutions for assessing part quality. Multiple sensors and data streams, however, generate large heterogeneous data sets that are impractical for manual assessment and characterization. In this work, an automated pipeline is developed that enables feature extraction from high-speed camera video and multi-modal data analysis. The framework removes the need for manual assessment through the utilization of deep learning techniques and training models in a weakly supervised paradigm. We demonstrate this pipeline’s capability over 700,000 high-speed camera frames. The pipeline successfully extracts melt pool and spatter geometries and links them to corresponding pyrometry, radiography, and processparameter information. 715 individual prints are examined to reveal melt pool areas that exceeds 0.07 mm 2 and pyrometry signal over a threshold (375 pyrometry units) were more likely to have defects. These automated processes enable massive throughput of characterization techniques.

36 MATERIALS SCIENCE↗

Nickel hydroxide–nickel carbonate competitive growth on carbonate surfaces

The thermodynamic and kinetic factors controlling the competitive heterogeneous nucleation and growth of ubiquitous metal carbonate and hydroxide phases are poorly understood. In this work, calcite (CaCO 3 ) and magnesite (MgCO 3 ) powders were reacted with NiCl 2 (0–600 μM) for 7 days at 22 °C and 5 °C. The reacted powders were analyzed with X-ray photoelectron spectroscopy (XPS), scanning electron microscopy, and energy-dispersive X-ray spectroscopy to characterize the Ni surface precipitates formed. Evidence from these techniques pointed to the formation of mixed Ni carbonate-Ni hydroxide amorphous surface precipitates. On calcite, XPS detected primarily Ni(OH) 2 despite the initial solutions being more supersaturated with respect to gaspéite (NiCO 3 ) than to theophrastite (Ni(OH) 2 ) by a factor of 17–18. In contrast, NiCO 3 was the dominant component detected by XPS on magnesite in the same conditions. Decreasing the temperature had the effect of increasing the proportion of NiCO 3 to the detriment of Ni(OH) 2 . The experimental observations were consistent with low lattice/cation size mismatch favoring NiCO 3 nucleation and temperature most influencing Ni(OH) 2 nucleation. Comparison to previous work on Co-reacted powders indicated the differences in lattice/cation size mismatch and/or water exchange rate impacted the composition of the surface precipitates more than the relative thermodynamic stabilities of the competing minerals. This work explored the heterogeneous growth regime of Ni carbonate and hydroxide phases on carbonate surfaces and shed light on the factors that control the competition between surface precipitates when mineral surfaces are in contact with aqueous solutions supersaturated with respect to multiple mineral phases. In conclusion, these results contribute to geochemists’ efforts toward interpreting data from geochemical systems with elevated Ni concentrations, improving Ni environmental remediation and recovery strategies, and predicting the fate and transport of Ni in geochemical systems.

Heterogeneous nucleation↗

Binding of Sulfates and Water to Monovalent Cations

The binding of the sulfate ligand group to monovalent cations in the presence of water is important for many systems. To understand the structure and energetics of sulfate complexes, we use density functional theory to study ethyl sulfate binding to the monovalent cations Li + , Na + , and K + , and to water. The free energies of binding and optimal structures are calculated for a range of the number of ethyl sulfates and waters. Without water, the most optimal structure for all the cations is bidentate binding by two ethyl sulfates, yielding a 4-fold coordination. With water, the lowest free energy structures also have two ethyl sulfates, but the coordination varies with cations. For complexes with water, the four oxygen atoms in the sulfate group enable multiple binding geometries for the cations and for hydrogen bonding with water. Many of these geometries differ in free energy by only a small amount (1–2 kcal/mol), meaning there will be multiple binding configurations in bulk solution. In comparison to the optimal structures for binding to the carboxylate group, there is more variation for binding to the sulfate group as a function of cation type and the number of waters. Further, the polarization of the atoms is significant and varies among the sulfate oxygen atoms. The water oxygen charge is often larger than that of sulfate oxygen, which plays a role in the preference for monodentate ligand binding to cations in the presence of water.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗

Predicting Radiation-Induced Plutonium Redox Chemistry using Multiscale Modeling Methods

Over the the last 70 years plutonium (Pu) has been integral in the development of several technologies that have changed the world, yet our fundamental understanding of its chemistry is still far from complete. This is a testament to this element?s unique and complex properties, such as its ability to coexist as multiple oxidation states in aqueous solution. Careful manipulation of plutonium oxidation states is essential in the study and utilization of its rich chemistry. To achieve this level of control, a comprehensive mechanistic understanding of radiation-induced plutonium redox chemistry is critical due to the unavoidable exposure of plutonium to ionizing radiation fields, both inherent and from in-process applications. For this reason, we have developed an experimentally evaluated multi-scale computer model for the prediction of gamma radiation-induced Pu(IV) redox chemistry in concentrated nitric acid solutions (1.0, 3.0, and 6.0 M).

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Designing FAIR Workflows at OLCF: Building Scalable and Reusable Ecosystems for HPC Science

High Performance Computing (HPC) centers, such as the Oak Ridge Leadership Computing Facility (OLCF), provide advanced infrastructure that enables scientific research at extreme scale. These centers operate with unique hardware configurations, specialized software environments, and elevated security re quirements that differ substantially from what most users encounter on their local systems. As a result, users often develop customized digital artifacts that are tightly coupled to the specific configuration of a given HPC center. Although necessary, this practice can lead to significant duplication of effort as multiple users independently create similar solutions to common problems.

97 MATHEMATICS AND COMPUTING↗

Review of NASTRAN development relative to efficiency of execution

This paper reviews the development of NASTRAN relative to the efficiency of execution, with particular emphasis on those items which have changed significantly since the original release of NASTRAN. Features discussed include main and secondary storage utilization, matrix packing, matrix assembly, matrix multiplication, matrix decomposition and equation solution. Also a brief look into the future discusses the questions of faster arithmetic units and more effective storage utilization. In some cases the improvements in NASTRAN efficiency have resulted from taking advantage of hardware developments, while in other cases increased efficiency has resulted from improvements in the state of the art for data processing or matrix operations. The modular design of NASTRAN has made it possible to improve the efficiency in many parts of NASTRAN without changing the basic design of the program.

Mccormick, C. W.↗

Magnetic attitude control system for dual-spin satellites

A closed-loop control law is developed for a dual-spin satellite control system which utilizes the interaction of the geomagnetic field with the satellite dipole parallel to the spin axis. The control law consists of the linear combination of the pitch axis component of the rate of change of the geomagnetic field and the product of the roll angle and roll axis component of the geomagnetic field. Application of the method of multiple time scales yields approximate solutions for the feedback gains in terms of the system parameters. Approximate solutions are also obtained for the response of the system to disturbance torques. A comparison of the approximate solutions and numerical solutions obtained by numerical integration of the exact equations of motion is then given.

Alfriend, K. T.↗