SEARCH · Search NASA

Results for “Computational Complexity”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 199 records · Page 11

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Hydrological connectivity: a review and emerging strategies for integrating measurement, modeling, and management

This review synthesizes methods for measuring, modeling, and managing hydrologic connectivity, offering pathways to improve practices and address environmental challenges (e.g., climate change) and sustainability. As a key driver of water movement and nutrient cycling, hydrologic connectivity influences flood mitigation, water quality regulation, and biodiversity conservation. However, traditional field-based methods (e.g., dye tracing), indirect measurements (e.g., runoff analysis), and remote sensing techniques (e.g., InSAR) often struggle to capture the complexity of catchment-scale interactions. Similarly, modeling approaches—including process-based and percolation theory-based models, graph theory, and entropy-based metrics—face limitations in fully representing these interconnected processes. Both modeling and measurement techniques are constrained by inadequate spatial and temporal coverage, high data demands, computational complexity, and difficulties in representing subsurface connectivity. Subsequently, we critique current management practices that prioritize isolated variables (e.g., streamflow, sediment transport) over system-wide strategies and emphasize the need for adaptive, connectivity-based approaches in water resource planning and restoration. Moving forward, we highlight the importance of interdisciplinary collaboration, technological innovations (e.g., AI-driven modeling, real-time monitoring), and integrated frameworks to improve connectivity measurement, modeling, and adaptive management to restore fragmented hydrologic networks. This integrated approach sets the stage for transformative water resource management, fostering proactive policy development and stakeholder engagement.

Dwivedi, Dipankar↗

NASA NTRS2001

Computationally efficient control allocation

A computationally efficient method for calculating near-optimal solutions to the three-objective, linear control allocation problem is disclosed. The control allocation problem is that of distributing the effort of redundant control effectors to achieve some desired set of objectives. The problem is deemed linear if control effectiveness is affine with respect to the individual control effectors. The optimal solution is that which exploits the collective maximum capability of the effectors within their individual physical limits. Computational efficiency is measured by the number of floating-point operations required for solution. The method presented returned optimal solutions in more than 90% of the cases examined; non-optimal solutions returned by the method were typically much less than 1% different from optimal and the errors tended to become smaller than 0.01% as the number of controls was increased. The magnitude of the errors returned by the present method was much smaller than those that resulted from either pseudo inverse or cascaded generalized inverse solutions. The computational complexity of the method presented varied linearly with increasing numbers of controls; the number of required floating point operations increased from 5.5 i, to seven times faster than did the minimum-norm solution (the pseudoinverse), and at about the same rate as did the cascaded generalized inverse solution. The computational requirements of the method presented were much better than that of previously described facet-searching methods which increase in proportion to the square of the number of controls.

Durham, Wayne↗

NASA NTRS1996

The incremental unknowns-a multilevel scheme for the simulation of turbulent channel flows

In numerical simulation of complex flows, it is important to identify different length scales of the flow and treat them differently. In this report, we introduce a new multilevel scheme for simulating turbulent channel flows. Two different versions of the scheme, namely the spectral and finite difference versions, are presented. The spectral version of the scheme is based on a spectral-Galerkin formulation which provides a natural decomposition of the flow into small and large wavelength parts, and which leads to linear systems that can be solved with quasi-optimal computational complexity. In the finite difference version, the Incremental Unknown (IU) is used to separate the length scales. Preliminary numerical results indicate that the scheme is well suited for turbulence computations and provides results which are comparable to that by Direct Numerical Simulation (DNS) but with significantly less CPU time.

Chen, M.↗

DOE OSTI2025

Spectral Clustering-Based Partitioning of Large-Scale Power Electronics-Based Power Systems for Small-Signal Stability Analysis

The nodal admittance matrix (NAM)-based approach is well-suited for small-signal stability analysis of large-scale power electronics-based power systems (PEPSs), as it preserves the system structure through its admittance matrix. Previous studies have explored partitioning such systems into subareas and interconnections to reduce computational burden; however, they lacked a formal algorithmic procedure for determining feasible partitions. While several grid partitioning methods, such as those based on graph theory or machine learning, exist in the literature, they cannot be directly applied to NAM-based analysis due to differing objectives and constraints. Here, this paper addresses this gap by presenting a systematic, step-by-step procedure for applying a spectral partitioning algorithm that yields a division of the system into subareas suitable for NAM-based analysis. The computational complexity of the proposed method is also derived to demonstrate its efficiency and justify the practicality of the resulting subarea decomposition. The performance of the partitioning method is evaluated by applying the spectral clustering-derived subareas and interconnections to the NAM-based partitioning approach on a 140-bus system. Computational times for the full-system and partitioned NAM analyses are compared using MATLAB. Additionally, PSCAD simulations of the complete system and partitioned subareas are carried out to verify the effectiveness of the proposed method.

Nupur [Univ. of Tennessee, Knoxville, TN (United S↗

NASA NTRS1983

Recent developments in thermal analysis of large space structures

A numerical procedure for analysis of shadowed space heating of sparse structures, SSQ, is discussed. The SSQ program avoids inordinate computational complexity by confining attention to a single elemental location on a structural member of interest throughout an entire orbital period, proceeding then to similar treatment of individual alternate locations. The procedure considers a spacecraft in circular orbit and assumes fixed-Earth orientation of the spacecraft. Shadow orientation and interval duration, merged shadows, and computation of solar heat flux and thermal response are addressed. The output options of the SSQ FORTRAN 5 program and its efficiency are discussed. Application of the system to the analysis of a parabolic expandable truss antenna is considered.

Oneill, R. F.↗

NASA NTRS1993

The methodology of multi-viewpoint clustering analysis

One of the greatest challenges facing the software engineering community is the ability to produce large and complex computer systems, such as ground support systems for unmanned scientific missions, that are reliable and cost effective. In order to build and maintain these systems, it is important that the knowledge in the system be suitably abstracted, structured, and otherwise clustered in a manner which facilitates its understanding, manipulation, testing, and utilization. Development of complex mission-critical systems will require the ability to abstract overall concepts in the system at various levels of detail and to consider the system from different points of view. Multi-ViewPoint - Clustering Analysis MVP-CA methodology has been developed to provide multiple views of large, complicated systems. MVP-CA provides an ability to discover significant structures by providing an automated mechanism to structure both hierarchically (from detail to abstract) and orthogonally (from different perspectives). We propose to integrate MVP/CA into an overall software engineering life cycle to support the development and evolution of complex mission critical systems.

Mehrotra, Mala↗

DOE OSTI2025

ν-point energy correletors with F AST EEC: Small-x physics from LHC jets

In recent years, energy correlators have emerged as a powerful tool for studying jet substructure, with promising applications such as probing the hadronization transition, analyzing the quark-gluon plasma, and improving the precision of top quark mass measurements. The projected N-point correlator measures correlations between N final-state particles by tracking the largest separation between them, showing a scaling behavior related to DGLAP splitting functions. These correlators can be analytically continued in N, commonly referred to as ν-correlators, allowing access to non-integer moments of the splitting functions. Of particular interest is the ν → 0 limit, where the small momentum fraction behavior of the splitting functions requires resummation. Originally, the computational complexity of evaluating ν-correlators for M particles scaled as 2 2M , making it impractical for real-world analyses. However, by using recursion, we reduce this to M 2M , and through the FastEEC method of dynamically resolving subjets, M is replaced by the number of subjets. This breakthrough enables, for the first time, the computation of ν-correlators for LHC data. In practice, limiting the number of subjets to 16 is sufficient to achieve percent-level precision, which we validate using known integer-ν results and convergence tests for non-integer ν. We have implemented this in an update to FastEEC and conducted an initial study of power-law scaling in the perturbative regime as a function of ν, using CMS Open Data on jets. The results agree with DGLAP evolution, except at small ν, where the anomalous dimension saturates to a value that matches the BFKL anomalous dimension.

Energy correlators↗

NASA NTRS2021

Near-Optimum Real-Time Range Estimation Algorithms for Proximity Links

The renewed interest in space exploration and cis-lunar situational awareness demands accurate ranging algorithms to enable navigation solutions for a multitude of spacecraft, rovers, and human explorers on the Moon and even on Mars, in the near future. Current state-of-the-art in ground-based ranging accuracy is on the order of 30 cm, however complicated equipment calibration and significant post-processing is required to achieve this level of ranging accuracy. This article examines ad-hoc approaches that achieve near-optimum real-time ranging performance with reduced complexity by utilizing a DPLL (digital phase-locked loop) to track the phase of the residual carrier for both direct and subcarrier modulated PN sequences, and a DCL (digital Costas loop) to obtain independent estimates of carrier phase and optimal combinations of these implementations to achieve near-optimum real-time performance with reduced computational complexity.

Cheung, Kar-Ming↗

DOE OSTI2025

DG2DAG: Learning Directed Acyclic Graphs from Functional Priors

Physics-based systems-of-systems models are computationally expensive. Reduced graphical models can decrease computational complexity, but may not proffer an end-to-end model from upstream inputs to downstream outputs. We consequently are interested in reducing models on directed graphs to models on a directed acyclic subgraph such that preserves accurate reconstruction of nodes. The consequence is a model with a topological ordering, providing a one-way flow of computation, and a causal interpr

Voronin, Alexey [Sandia National Laboratories (SNL↗

DOE OSTI2025

Reduced basis approximations of parameterized dynamical partial differential equations via neural networks

Projection-based reduced order models are effective at approximating parameter-dependent differential equations that are parametrically separable. When parametric separability is not satisfied, which occurs in both linear and nonlinear problems, projection-based methods fail to adequately reduce the computational complexity. Devising alternative reduced order models is crucial for obtaining efficient and accurate approximations to expensive high-fidelity models. In this work, we develop a timestepping procedure for dynamical parameter-dependent problems, in which a neural-network is trained to propagate the coefficients of a reduced basis expansion. This results in an online stage with a computational cost independent of the size of the underlying problem. Here, we demonstrate our method on several parabolic partial differential equations, including a problem that is not parametrically separable.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Dendritic Computing with Multigate Ferroelectric Field-Effect Transistors

Although inspired by neuronal systems in the brain, artificial neural networks generally employ point-neurons, which offer computational complexity far less than that of their biological counterparts. Neurons have dendritic arbors that connect to different sets of synapses and offer local nonlinear accumulation – playing a pivotal role in processing and learning. Inspired by this, we propose a novel neuron design based on a multigate ferroelectric field-effect transistor that mimics dendrites. It leverages ferroelectric nonlinearity for local computations within dendritic branches while utilizing the transistor action to generate the neuronal output. The branched architecture enables smaller crossbar arrays in hardware integration, improving efficiency. Using an experimentally calibrated device-circuit-algorithm cosimulation framework, we demonstrate that networks incorporating our dendritic neurons achieve superior performance compared to much larger networks without dendrites (∼ 17× fewer trainable weight parameters). These findings suggest that dendritic hardware can significantly improve computational efficiency and learning capacity of neuromorphic systems optimized for edge applications.

36 MATERIALS SCIENCE↗

NASA NTRS1981

Closed form evaluation of symmetric two-sided complex integrals

Evaluation of two-sided complex integrals is often required when analyzing linear systems to determine signal variances resulting from stochastic inputs and system noise bandwidths. Algebraic solutions of integrals in a closed matrix equation form, using coefficients of the numerator and denominator polynomials, are presented. The closed forms provide the possibility of obtaining some insight into parameter sensitivity in addition to greatly reducing the computational complexity required by the normal method of evaluation by residues.

Winkelstein, R.↗

DOE OSTI2025

Analytical Identification Method of Generalized Short‐Circuit Ratio Using Phasor Measurement Units

This paper introduces a novel analytical approach for the identification of the admittance matrix and the generalized short-circuit ratio (gSCR) in power systems integrated with renewable energy sources. The proposed method leverages voltage and current measurements from phasor measurement units (PMUs) to construct a least squares objective function, which is then solved using matrix calculus and partial derivatives. Unlike conventional optimization algorithms, this approach provides an analytical solution that substantially reduces data requirements, enabling the efficient and accurate identification of the gSCR with smaller datasets. Additionally, its fixed computational complexity allows for real-time updates as new data are collected, ensuring continuous refinement of the system of equations and enabling rapid, precise gSCR calculations. The method also exhibits strong robustness against measurement noise, making it well-suited for practical applications in dynamic power systems. The combination of reduced data requirements, real-time adaptability, noise robustness and fixed computational load establishes this method as a highly efficient and reliable tool for real-time power system stability analysis. Case studies on an EPRI 36-bus system demonstrate the method's effectiveness, highlighting its accuracy in closely matching true gSCR values, even under diverse disturbances and noisy conditions.

Han, Zelei [Hohai University, Nanjing (China)] (OR↗

DOE OSTI2024

Partitioning of Large-Scale Power Electronics-Based Power Systems for Small-Signal Stability Analysis

The nodal admittance matrix (NAM)-based approach is suitable for analyzing the small-signal stability of large-scale power electronics-based power systems (PEPSs) as it preserves the system structure by utilizing the admittance matrix. Previously, NAM-based area partition has been proposed, which divides the system into various subareas and interconnections for easier analysis of the low-dimension matrix compared to the entire system-based high-dimension matrix. However, no partition algorithm has been presented for the NAM-based area partition method. This paper focuses on implementing the spectral partitioning algorithm for partitioning large-scale PEPSs into a low-dimension matrix to reduce the computation complexity of the analysis. These spectral components facilitate data transformation into a new space, enabling the application of traditional clustering methods like k-means. To evaluate the performance of the partitioning method, the subareas and interconnections obtained from the spectral clustering algorithm are incorporated into the NAM-based area partition method for a large system with 140 buses. The computational times of the original method, where the NAM-based criterion is directly applied to the entire system, are compared with those of the NAM-based partition method in MATLAB. PSCAD simulations of the whole system and the obtained subareas are conducted to validate the effectiveness of the proposed algorithm.

Nupur, Nupur↗

NASA NTRS1993

Design and control of a macro-micro robot for precise force applications

Creating a robot which can delicately interact with its environment has been the goal of much research. Primarily two difficulties have made this goal hard to attain. The execution of control strategies which enable precise force manipulations are difficult to implement in real time because such algorithms have been too computationally complex for available controllers. Also, a robot mechanism which can quickly and precisely execute a force command is difficult to design. Actuation joints must be sufficiently stiff, frictionless, and lightweight so that desired torques can be accurately applied. This paper describes a robotic system which is capable of delicate manipulations. A modular high-performance multiprocessor control system was designed to provide sufficient compute power for executing advanced control methods. An 8 degree of freedom macro-micro mechanism was constructed to enable accurate tip forces. Control algorithms based on the impedance control method were derived, coded, and load balanced for maximum execution speed on the multiprocessor system. Delicate force tasks such as polishing, finishing, cleaning, and deburring, are the target applications of the robot.

Wang, Yulun↗

NASA NTRS2019

Deep Learning Emulation of Atmospheric Correction for Geostationary Sensors

New generation geostationary satellites make reflectance observations available at a continental scale with unprecedented spatiotemporal resolution and spectral range. Generating Earth monitoring products from these observations requires retrieval of the basic parameter, surface reflectance (SR), by atmospheric correction (AC). Algorithms for atmospheric correction, including Multi-Angle Implementation of Atmospheric Correction (MAIAC), are adapted for each sensor and are too computationally complex to be run in real time, relying instead on look-up tables with precomputed values. Machine learning methods, including convolutional neural networks, have demonstrated performance in learning complex, nonlinear mappings and extracting insight from high-dimensional remote sensing data. In this work, we present a deep learning emulator of MAIAC to retrieve both SR and cloud products. Using this adaptation of deep learning-based emulation to remote sensing, we demonstrate stable SR retrieval over a variety of land covers and viewing conditions and accurate cloud detection. Further, a comparison of computation time suggests emulation as a compelling alternative for expensive physical simulation, especially for applications benefited by near-real time data, such as agricultural management and disaster response.

Duffy, Kate↗

NASA NTRS1986

Efficient numerical techniques for complex fluid flows

The central feature in any flow prediction method is the treatment of the coupling between the momentum and continuity equations. In natural-convection flows, the energy equation also becomes strongly coupled with the momentum equations. Because of the nonlinear nature of the coupling, these equations are solved iteratively. Iterative methods are often prone to slow convergence, divergence, and extreme sensitivity to underrelaxation factors. The aim of the present research is to develop more efficient and reliable solution schemes for the coupled flow equations. Such schemes will significantly reduce the expense of computing complex flows encountered in combustion chambers, gas turbines, heat exchangers, and other practical equipment. In the work completed so far, a technique employing norm reduction in conjunction with the successive-substitution and Newton-Raphson techniques was developed. Also, a block-correction procedure for the flow equations is currently being formulated and tested.

Patankar, Suhas V.↗

NASA NTRS1990

Visualization of fluid dynamics at NASA Ames

Some of the hardware and software tools and techniques in use at NASA's numerical aerodynamic simulation facility for the analysis of computational fluid dynamics are described. The visualization process can be illustrated by video tapes and stereo pictures. Although these visualization tools have dramatically improved the ability to conduct research in fluid dynamics, a comparison of the current environment for analysis with an 'ideal' environment illustrates that there are still major improvements that should be made. The most time-consuming task in future analyses of the increasingly complex computer simulations will be the extraction and clear display of the key features. In addition, the interface between the workstation and the scientist should be improved significantly. Current research on techniques for creating these improvements is described.

Watson, V.↗