Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algebraic derivative estimation”

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 19 records

APSO-enhanced algebraic derivative estimation approach for real-time traffic flow prediction on critical road sections during wildfire evacuation

In rapid-onset disaster scenarios such as wildfires, evacuation traffic often significantly deviates from historical patterns, rendering conventional data-driven forecasting methods less effective. To address this challenge, we propose an improved algebraic derivative estimation (ADE) incorporating particle swarm optimization (PSO) for real-time traffic flow prediction. Our approach dynamically adjusts the ADE prediction time window at each step by minimizing a cost function based on the mean and variance of accumulated forecasting errors within the window, thereby balancing bias and variability. We evaluate the method using traffic data from the January 2025 California wildfires, focusing on key road segments critical for large-scale evacuations. The results demonstrate that our approach surpasses established machine learning and deep learning models—XGBoost, LSTM, and GRU—in predictive accuracy and maintains high computational efficiency. Notably, the proposed method eliminates the need for offline model training. Moreover, rapid PSO-based tuning enables real-time deployment, which provides a crucial advantage in scenarios where evacuation timings and road closures change dynamically. In conclusion, these findings highlight the benefits of the PSO-enhanced ADE framework for emergency traffic management, where rapid, data-sparse forecasts are essential for effective evacuation planning.

Algebraic derivative estimation↗

Adaptive Algebraic Derivative Estimation for Battery Electric Buses Energy Consumption Forecasting

The limited service life of onboard batteries for EVs is a challenge, underscoring the need for real-time battery usage prediction. This paper proposes an adaptive Algebraic Derivative Estimation (ADE) approach for forecasting the energy consumption of battery electric buses. By dynamically adjusting the sliding window length, the adaptive ADE retains the fixed-length ADE’s key advantage—namely, operating online without reliance on extensive historical datasets—while substantially bolstering forecast accuracy by actively trading estimation bias off estimation variance. Comparative experiments against both the conventional ADE with a fixed length and a representative machine learning algorithm, XGBoost, were conducted, with performance evaluated via root mean square error, mean absolute error, and the coefficient of determination. The results demonstrate that the proposed approach significantly outperforms baseline methods.

Cui, Tianyang [The University of Texas at Dallas]↗

Ground vehicle lane-keeping assistance system via differential flatness output feedback control and algebraic derivative estimation

Vehicle run-off-road is one of the most frequent and fatal traffic accidents in the United States. Various lane-keeping assistance (LKA) systems have been developed in the last decade to help drivers stay on the road. Most of them are built upon linear driver–vehicle–road (DVR) models and treat road curvature as a disturbance. Albeit effective, their control performance would degrade if road curvature varies rapidly. Here, this paper proposes a novel nonlinear DVR model by integrating a driver steering model into vehicle–road kinematics, which explicitly considers road curvature. Particularly, this nonlinear DVR system has been proven to be differentially flat, and a flatness-based LKA system is designed. Additionally, Model-Free Control is introduced to compensate for system modeling errors. Hardware-in-the-loop simulations and diver-in-the-loop experiments validate the proposed control framework and demonstrate the performance enhancement with respect to a representative linear robust LKA system.

42 ENGINEERING↗

Online energy consumption forecast for battery electric buses using a learning-free algebraic method

Accurately predicting the energy consumption plays a vital role in battery electric buses (BEBs) route planning and deployment. Based on the algebraic derivative estimation, we present a novel method to forecast the energy consumption in real time. In contrast to the mainstream machine-learning-based methods, the proposed method does not require access to the historical energy consumption data. It eliminates the time-consuming and computationally expensive offline training. Consequently, its prediction performance is not constrained by the quantity and quality of the training data. Moreover, the method can swiftly adapt to new situations not included in the previous driving cycles, which makes it especially suitable for emerging transport modes, e.g., on-demand transit services. In addition, its online execution only involves algebraic calculations, yielding superior calculation efficiency. Using real-world data, we comprehensively compare the performance of the proposed learning-free algebraic method with multiple representative machine-learning-based methods. Finally, the advantages and limitations of the proposed method are discussed in detail.

33 ADVANCED PROPULSION SYSTEMS↗

Determination of longitudinal aerodynamic derivatives from steady-state measurement of an aircraft

A method for the estimation of aerodynamic derivatives from steady-state symmetric flight data is developed. The derivatives considered are the longitudinal static stability and control derivatives, damping derivatives due to tail, and the derivatives expressing the speed effect on the lift and pitching moment coefficients. The method is an extension of the well known theory of longitudinal static stability and control, and corresponding flight data interpretation. Measured data is assumed in the form of trim curves and lift vs angle of attack. The expressions for the derivative estimates are in the form of algebraic relationships containing known constants, and directly or indirectly measured quantities.

Klein, V.↗

Scalable computations for nonstationary Gaussian processes

Nonstationary Gaussian process models can capture complex spatially varying dependence structures in spatial datasets. However, the large number of observations in modern datasets makes fitting such models computationally intractable with conventional dense linear algebra. In addition, derivative-free or even first-order optimization methods can be very slow to converge when estimating many spatially varying parameters. In this paper, we present a computational framework which couples an algebraic block diagonal plus low-rank covariance matrix approximation with stochastic trace estimation to facilitate the efficient use of second-order solvers for maximum likelihood estimation of Gaussian process models with many parameters. We demonstrate the effectiveness of these methods by simultaneously fitting 192 parameters in the popular nonstationary model of Paciorek and Schervish using 107,600 sea surface temperature anomaly measurements.

97 MATHEMATICS AND COMPUTING↗

Connected Traffic Signal Coordination Optimization Framework through Network-Wide Adaptive Linear Quadratic Regulator–Based Control Strategy

Traffic congestion in metropolitan areas causes several significant challenges, such as longer travel times, decreased productivity, increased fuel consumption and vehicle emissions, and even severe injuries during crashes. Traffic signal control is a management approach to reduce traffic congestion and allocate the appropriate right of way for safety and mobility efficiency, both in temporal and spatial domains. Here, this study proposes a network-wide adaptive signal control coordination optimization framework based on the linear quadratic regulator algorithm. The traffic flow conditions driven by signal control inputs are formulated based on their network-wide state-space representation. After modeling traffic control regulation constraints, an adaptive linear quadratic regulator algorithm is designed to maximize the network-wide total throughput under the current conditions. Optimal signal control split time durations for multiple intersections in the network are derived by solving the algebraic Riccati equation. Furthermore, the recursive least square parameter estimation method is employed to quantify dynamic traffic condition changes. To verify the effectiveness of this proposed signal control framework, both simulation and real-world experimental tests are conducted for multiple intersections in downtown Chattanooga, Tennessee, United States. In preparation for real-world experimental tests, pipelines for real-time data processing implementation and historical traffic flow data analysis are conducted. The test results demonstrate that the proposed control framework achieves a decrease in travel time by up to 19.4%, total time spent (TTS) by up to 11.9%, and relative queue balance (RQB) by up to 15.6%. The research findings indicate that the proposed signal control framework can be generalized to handle large scale signal control optimization network-wide.

97 MATHEMATICS AND COMPUTING↗

Algebraic expressions for estimating the impact depths of a surface barrier over a homogeneous soil

Engineered surface barriers are used to isolate subsurface contaminants for effective long-term containment of municipal solid waste, other nonhazardous solid and liquid waste, hazardous and toxic wastes, and radioactive waste. The impact depths of a surface barrier are affected by the pre-barrier recharge rate and the properties of the soil beneath the barrier. In this paper, the pore-size-specific (PSS) water velocity is defined and an algebraic expression of PSS velocity is derived based on the stream tube concept and the Brooks and Corey hydraulic retention model. Algebraic expressions are developed to estimate drainage velocities and barrier impact depths after the emplacement of a surface barrier. Four impact depth terms are used to convey the protective effect: drainage front, average drainage, the location with 50% impact, and drainage tail. The drainage front depth is the deepest point at which the barrier has a detectable impact at a specific time (also called the near zero-impact depth). The average-impact depth is the depth at which average drainage occurs. At the 50% impact depth, the water flux rate is reduced by half because of the surface barrier. Lastly, the drainage tail depth (also called the full-impact depth) is the deepest depth at which the water conditions above it are in equilibrium with the barrier. The algebraic expressions show that the average-impact depth is no more than 1/3 of near zero-impact depth, while the 50% impact depth is slightly larger than 1/2 of the near zero-impact depth. The full-impact depth, depending on the final recharge rate from the surface barrier, is usually much smaller than the other impact depths. These differences lead to a very large transition zone beneath a surface barrier. Numerical simulations were conducted to replicate the same conditions. The numerical results corroborated the analytical models by predicting very similar water content profiles and near zero-, average-, 50%, and full-impact depths. The algebraic expressions provided in this paper are useful for quickly identifying sites where the depth of the existing contaminants could be beyond the protection of a surface barrier.

54 ENVIRONMENTAL SCIENCES↗

GaussFit - A system for least squares and robust estimation

GaussFit is a new computer program for solving least-squares and robust estimation problems. It has a number of unique features, including a complete programming language designed especially to formulate estimation problems, a built-in compiler and interpreter to support the programming language, and a built-in algebraic manipulator for calculating the required partial derivatives analytically. These features make GaussFit very easy to use, so that even complex problems can be set up and solved with minimal effort. GaussFit can correctly handle many cases of practical interest: nonlinear models, exact constraints, correlated observations, and models where the equations of condition contain more than one observed quantity. An experimental robust estimation capability is built into GaussFit so that data sets contaminated by outliers can be handled simply and efficiently.

Jefferys, W. H.↗

Multi-window spectrum estimation - A linear algebraic approach

The purpose of this paper is to elucidate the multi-window method for spectral estimation and sinusoid detection. The multi-window method, devised by D.J. Thomson, has many features that distinguish it from other spectrum estimation techniques. It has an elegant derivation, starting from first principles and using optimality arguments. It lends itself to performance analysis and provides a built-in measure of its reliability. In contrast to Thomson's integral equation derivation, we use linear algebraic methods both to treat the problem and to develop the solution. In addition to the tutorial, we present an overview of published generalizations and analyses of the method.

Onn, Ruth↗

Optimal function estimation with photonic quantum sensor networks

The problem of optimally measuring an analytic function of unknown local parameters each linearly coupled to a qubit sensor is well understood, with applications ranging from field interpolation to noise characterization. Here we resolve a number of open questions that arise when extending this framework to Mach-Zehnder interferometers and quadrature displacement sensing. In particular, we derive lower bounds on the achievable mean square error in estimating a linear function of either local phase shifts or quadrature displacements. In the case of local phase shifts, these results prove, and somewhat generalize, a conjecture by Proctor []. For quadrature displacements, we extend proofs of lower bounds to the case of arbitrary linear functions. We provide optimal protocols achieving these bounds up to small (multiplicative) constants and describe an algebraic approach to deriving new optimal protocols, possibly subject to additional constraints. Using this approach, we prove necessary conditions for the amount of entanglement needed for any optimal protocol for both local phase and displacement sensing. Published by the American Physical Society 2024

Bringewatt, Jacob↗

Universal time scalings of sensitivity in Markovian quantum metrology

Assuming Markovian time evolution of a quantum sensing system, we study the general characterization of the optimal sensitivity scalings with time, under most general quantum control protocols. We allow the estimated parameter to influence both the Hamiltonian as well as the dissipative part of the quantum master equation and focus on the asymptotic-time along with the short-time sensitivity scalings. We find that via simple algebraic conditions (in terms of the Hamiltonian, the jump operators as well as their parameter derivatives), one can characterize the four classes of metrological models that represent: quadratic-linear, quadratic-quadratic, linear-linear, and linear-quadratic time scalings. We also investigate the relevant time scales on which the transition between the two regimes appears. Additionally, we provide universal numerical methods to obtain quantitative bounds on sensitivity that are the tightest that exist in the literature. Simplicity and universality of our results make it suitable for diverse applications in quantum metrology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic control of infinite dimensional systems in Hilbert space: A factorization perspective

A factorization perspective on problems of optimal causal estimation and optimal causal control of linear stochastic systems defined on an infinite-dimensional Hilbert space is presented. A separation principle is derived for the case in which the system input/output map is generated by an abstract evolution operator. The factorization formalism allows for an essentially algebraic approach to these problems.

Milman, Mark M.↗

Luneburg lens and optical matrix algebra research

Planar, as opposed to channelized, integrated optical circuits (IOCs) were stressed as the basis for computational devices. Both fully-parallel and systolic architectures are considered and the tradeoffs between the two device types are discussed. The Kalman filter approach is a most important computational method for many NASA problems. This approach to deriving a best-fit estimate for the state vector describing a large system leads to matrix sizes which are beyond the predicted capacities of planar IOCs. This problem is overcome by matrix partitioning, and several architectures for accomplishing this are described. The Luneburg lens work has involved development of lens design techniques, design of mask arrangements for producing lenses of desired shape, investigation of optical and chemical properties of arsenic trisulfide films, deposition of lenses both by thermal evaporation and by RF sputtering, optical testing of these lenses, modification of lens properties through ultraviolet irradiation, and comparison of measured lens properties with those expected from ray trace analyses.

Wood, V. E.↗

Solving Upwind-Biased Discretizations: Multigrid Solver Using Semicoarsening - 2

This paper studies a novel multigrid approach to the solution for a second order upwind biased discretization of the convection equation in two dimensions. This approach is based on semi-coarsening and well balanced explicit correction terms added to coarse-grid operators to maintain on coarse-grid the same cross-characteristic interaction as on the target (fine) grid. Colored relaxation schemes are used on all the levels allowing a very efficient parallel implementation. The results of the numerical tests can be summarized as follows: 1) The residual asymptotic convergence rate of the proposed V(0, 2) multigrid cycle is about 3 per cycle. This convergence rate far surpasses the theoretical limit (4/3) predicted for standard multigrid algorithms using full coarsening. The reported efficiency does not deteriorate with increasing the cycle, depth (number of levels) and/or refining the target-grid mesh spacing. 2) The full multi-grid algorithm (FMG) with two V(0, 2) cycles on the target grid and just one V(0, 2) cycle on all the coarse grids always provides an approximate solution with the algebraic error less than the discretization error. Estimates of the total work in the FMG algorithm are ranged between 18 and 30 minimal work units (depending on the target (discretizatioin). Thus, the overall efficiency of the FMG solver closely approaches (if does not achieve) the goal of the textbook multigrid efficiency. 3) A novel approach to deriving a discrete solution approximating the true continuous solution with a relative accuracy given in advance is developed. An adaptive multigrid algorithm (AMA) using comparison of the solutions on two successive target grids to estimate the accuracy of the current target-grid solution is defined. A desired relative accuracy is accepted as an input parameter. The final target grid on which this accuracy can be achieved is chosen automatically in the solution process. the actual relative accuracy of the discrete solution approximation obtained by AMA is always better than the required accuracy; the computational complexity of the AMA algorithm is (nearly) optimal (comparable with the complexity of the FMG algorithm applied to solve the problem on the optimally spaced target grid).

Diskin, Boris↗

Accuracy of least-squares methods for the Navier-Stokes equations

Recently there has been substantial interest in least-squares finite element methods for velocity-vorticity-pressure formulations of the incompressible Navier-Stokes equations. The main cause for this interest is the fact that algorithms for the resulting discrete equations can be devised which require the solution of only symmetric, positive definite systems of algebraic equations. On the other hand, it is well-documented that methods using the vorticity as a primary variable often yield very poor approximations. Thus, here we study the accuracy of these methods through a series of computational experiments, and also comment on theoretical error estimates. It is found, despite the failure of standard methods for deriving error estimates, that computational evidence suggests that these methods are, at the least, nearly optimally accurate. Thus, in addition to the desirable matrix properties yielded by least-squares methods, one also obtains accurate approximations.

Bochev, Pavel B.↗

Accuracy of least-squares methods for the Navier-Stokes equations

Recently there has been substantial interest in least-squares finite element methods for velocity-vorticity-pressure formulations of the incompressible Navier-Stokes equations. The main cause for this interest is the fact that algorithms for the resulting discrete equations can be devised which require the solution of only symmetric, positive definite systems of algebraic equations. On the other hand, it is well-documented that methods using the vorticity as a primary variable often yield very poor approximations. Thus, here we study the accuracy of these methods through a series of computational experiments, and also comment on theoretical error estimates. It is found, despite the failure of standard methods for deriving error estimates, that computational evidence suggests that these methods are, at the least, nearly optimally accurate. Thus, in addition to the desirable matrix properties yielded by least-squares methods, one also obtains accurate approximations.

Bochev, Pavel B.↗

An Algebra of Machine Learners with Applications

Machine learning (ML) methods are increasingly being applied to solve complex, data-driven problems in diverse areas, by exploiting the physical laws derived from first principles such as thermal hydraulics and the abstract laws developed recently for data and computing infrastructures. These physical and abstract laws encapsulate, typically in compact algebraic forms, the critical knowledge that complements data-driven ML models. We present a unified perspective of these laws and ML methods using an abstract algebra (A;⊕,Ⓧ), wherein the performance estimation and classification tasks are characterized by the additive ⊕ operations, and the diagnosis, reconstruction, and optimization tasks are characterized by the difference Ⓧ operations. This abstraction provides ML codes and their performance characterizations that are transferable across different areas. We describe practical applications of these abstract operations using examples of throughput profile estimation tasks in data transport infrastructures, and power-level and sensor error estimation tasks in nuclear reactor systems.

Rao, Nageswara↗