Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Recursion”

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 415 records · Page 23

Enhancing Multi-Step Reservoir Inflow Forecasting: A Time-Variant Encoder–Decoder Approach

Accurate reservoir inflow forecasting is vital for effective water resource management. Reliable forecasts enable operators to optimize storage and release strategies to meet competing sectoral demands—such as water supply, irrigation, and hydropower scheduling—while also mitigating flood and drought risks. To address this need, in this study, we propose a novel time-variant encoder–decoder (ED) model designed specifically to improve multi-step reservoir inflow forecasting, enabling accurate predictions of reservoir inflows up to seven days ahead. Unlike conventional ED-LSTM and recursive ED-LSTM models, which use fixed encoder parameters or recursively propagate predictions, our model incorporates an adaptive encoder structure that dynamically adjusts to evolving conditions at each forecast horizon. Additionally, we introduce the Expected Baseline Integrated Gradients (EB-IGs) method for variable importance analysis, enhancing interpretability of inflow by incorporating multiple baselines to capture a broader range of hydrometeorological conditions. The proposed methods are demonstrated at several diverse reservoirs across the United States. Our results show that they outperform traditional methods, particularly at longer lead times, while also offering insights into the key drivers of inflow forecasting. These advancements contribute to enhanced reservoir management through improved forecasting accuracy and practical decision-making insights under complex hydroclimatic conditions.

58 GEOSCIENCES↗

Realized ecological forecast through an interactive Ecological Platform for Assimilating Data (EcoPAD, v1.0) into models

Abstract. Predicting future changes in ecosystem services is not only highly desirable but is also becoming feasible as several forces (e.g., available big data, developed data assimilation (DA) techniques, and advanced cyber-infrastructure) are converging to transform ecological research into quantitative forecasting. To realize ecological forecasting, we have developed an Ecological Platform for Assimilating Data (EcoPAD, v1.0) into models. EcoPAD (v1.0) is a web-based software system that automates data transfer and processing from sensor networks to ecological forecasting through data management, model simulation, data assimilation, forecasting, and visualization. It facilitates interactive data–model integration from which the model is recursively improved through updated data while data are systematically refined under the guidance of model. EcoPAD (v1.0) relies on data from observations, process-oriented models, DA techniques, and the web-based workflow. We applied EcoPAD (v1.0) to the Spruce and Peatland Responses Under Climatic and Environmental change (SPRUCE) experiment in northern Minnesota. The EcoPAD-SPRUCE realizes fully automated data transfer, feeds meteorological data to drive model simulations, assimilates both manually measured and automated sensor data into the Terrestrial ECOsystem (TECO) model, and recursively forecasts the responses of various biophysical and biogeochemical processes to five temperature and two CO 2 treatments in near-real time (weekly). Forecasting with EcoPAD-SPRUCE has revealed that mismatches in forecasting carbon pool dynamics are more related to model (e.g., model structure, parameter, and initial value) than forcing variables, opposite to forecasting flux variables. EcoPAD-SPRUCE quantified acclimations of methane production in response to warming treatments through shifted posterior distributions of the CH 4 :CO 2 ratio and the temperature sensitivity ( Q 10 ) of methane production towards lower values. Different case studies indicated that realistic forecasting of carbon dynamics relies on appropriate model structure, correct parameterization, and accurate external forcing. Moreover, EcoPAD-SPRUCE stimulated active feedbacks between experimenters and modelers to identify model components to be improved and additional measurements to be taken. It has become an interactive model–experiment (ModEx) system and opens a novel avenue for interactive dialogue between modelers and experimenters. Altogether, EcoPAD (v1.0) acts to integrate multiple sources of information and knowledge to best inform ecological forecasting.

54 ENVIRONMENTAL SCIENCES↗

Power series representation of partial derivatives required in orbit determination.

A program to integrate the equations of motion by series in powers of the time step can be easily modified to furnish the elements of the matrizant in power series of the time step. In particular, if the series representing the motion are obtained recursively, differentiation of the recurrence relations will provide immediately a recursive scheme for computing the coefficient in the power series for the elements of the matrizant.

Schanzle, A. F.↗

Estimation of correlation functions by stochastic approximation.

Consideration of the autocorrelation function of a zero-mean stationary random process. The techniques are applicable to processes with nonzero mean provided the mean is estimated first and subtracted. Two recursive techniques are proposed, both of which are based on the method of stochastic approximation and assume a functional form for the correlation function that depends on a number of parameters that are recursively estimated from successive records. One technique uses a standard point estimator of the correlation function to provide estimates of the parameters that minimize the mean-square error between the point estimates and the parametric function. The other technique provides estimates of the parameters that maximize a likelihood function relating the parameters of the function to the random process. Examples are presented.

Habibi, A.↗

Digital processing of radiographic images

Some techniques are presented and the software documentation for the digital enhancement of radiographs. Both image handling and image processing operations are considered. The image handling operations dealt with are: (1) conversion of format of data from packed to unpacked and vice versa; (2) automatic extraction of image data arrays; (3) transposition and 90 deg rotations of large data arrays; (4) translation of data arrays for registration; and (5) reduction of the dimensions of data arrays by integral factors. Both the frequency and the spatial domain approaches are presented for the design and implementation of the image processing operation. It is shown that spatial domain recursive implementation of filters is much faster than nonrecursive implementations using fast fourier transforms (FFT) for the cases of interest in this work. The recursive implementation of a class of matched filters for enhancing image signal to noise ratio is described. Test patterns are used to illustrate the filtering operations. The application of the techniques to radiographic images of metallic structures is demonstrated through several examples.

Bond, A. D.↗

Backlund transformation for solutions of the Korteweg-de Vries equation

We present a Backlund transformation operating on solutions of the Korteweg-de Vries equation. It provides a unifying approach to the theory of solitary waves (solutions). Recursive application of the transformation to any solution of the Korteweg-de Vries equation generates a hierarchy of solutions for which an algebraic recursion relation is obtained. Every such hierarchy (one of which is the known family of pure multisoliton solutions) thus admits a nonlinear superposition principle.

Wahlquist, H. D.↗

Programs for computing abscissas and weights for classical and nonclassical Gaussian quadrature formulas

Computer programs for computing Gaussian quadrature abscissas and weights are described. For the classical case the programs use Laguerre iteration to compute abscissas as zeros of orthogonal polynomials. The polynomials are evaluated from known recursion coefficients. The nonclassical case is handled similarly except that the recursion coefficients are computed by numerical integration. A sample problem, with input and output, is presented to illustrate the use of the programs. It computes the quadrature abscissas and weights associated with the weight function over the interval (0,1) for quadrature orders from 16 to 96 in increments of 8.

Desmarais, R. N.↗

Weight minimization of structures for fixed flutter speed via an optimality criterion

A rigorous optimality criterion is derived and a hybrid weight-reduction algorithm developed for the weight minimization of lifting surfaces with a constraint on flutter speed. The weight-reduction algorithm incorporates a simple recursion formula derived from the optimality criterion. Monotonic weight reduction is accomplished by dynamically adjusting a parameter in the recursion formula so as to achieve a predetermined weight decrease. The algorithm thus combines the simplicity of optimality-criterion methods with the convergence characteristics of mathematical-programming methods. The imposition of the flutter constraint is simplified by forcing to zero the imaginary part of the flutter eigenvalue, with the airspeed fixed. Four examples are discussed. The results suggest that significant improvements in efficiency are possible, in comparison with techniques based purely on mathematical programming.

Segenreich, S. A.↗

Computer simulation results of attitude estimation of earth orbiting satellites

Computer simulation results of attitude estimation of Earth-orbiting satellites (including Space Telescope) subjected to environmental disturbances and noises are presented. Decomposed linear recursive filter and Kalman filter were used as estimation tools. Six programs were developed for this simulation, and all were written in the basic language and were run on HP 9830A and HP 9866A computers. Simulation results show that a decomposed linear recursive filter is accurate in estimation and fast in response time. Furthermore, for higher order systems, this filter has computational advantages (i.e., less integration errors and roundoff errors) over a Kalman filter.

Kou, S. R.↗

Computation of transform domain covariance matrices

It is often of interest in applications to compute the covariance matrix of a random process transformed by a fast unitary transform. Here, the recursive definition of fast unitary transforms is used to derive recursive relations for the covariance matrices of the transformed process. These relations lead to fast methods of computation of covariance matrices and to substantial reductions of the number of arithmetic operations required.

Fino, B. J.↗

Command profile for Galileo scan platform control

A recursive command profile is developed for the control of a two-degree-of-freedom scan platform mounted on a flexible structure. Perfect sensors and actuators are assumed for development and testing, and structural vibrations are minimized by actuator torque commands following a smooth torque-time profile. The integral of the smooth torque profile, the rate profile, is recursively generated by a piecewise constant second derivation, and the torque applied by the closk actuator is divided into three components. Results show that the smooth platform motion in response to the command profiles is what the Galileo control systems needs to avoid stator structural vibrations. Position, rate and acceleration profiles are also presented, and the resulting motion of the scan platform in response to command profiles is illustrated.

Man, G. K.↗

Adaptive identification for the dynamics of large space structures

A new approach for identifying the dynamics of large space structures using noisy measurements is presented. In this approach, a modal system description is avoided and, hence, the a priori specification of model order. Instead, the system's order is recursively determined on-line, along with its parameters, using recursive lattice filters which are widely used in adaptive signal processing. The order determination is carried out based on statistical hypothesis testing theory. The approach is illustrated for the problem of identifying the structural dynamic characteristics of a free-free beam. Results on the effectiveness and accuracy of the identification scheme with respect to noise levels, sampling rates, and data window sizes are presented

Sundararajan, N.↗

Identification and stochastic control of helicopter dynamic modes

A general treatment of parameter identification and stochastic control for use on helicopter dynamic systems is presented. Rotor dynamic models, including specific applications to rotor blade flapping and the helicopter ground resonance problem are emphasized. Dynamic systems which are governed by periodic coefficients as well as constant coefficient models are addressed. The dynamic systems are modeled by linear state variable equations which are used in the identification and stochastic control formulation. The pure identification problem as well as the stochastic control problem which includes combined identification and control for dynamic systems is addressed. The stochastic control problem includes the effect of parameter uncertainty on the solution and the concept of learning and how this is affected by the control's duel effect. The identification formulation requires algorithms suitable for on line use and thus recursive identification algorithms are considered. The applications presented use the recursive extended kalman filter for parameter identification which has excellent convergence for systems without process noise.

Molusis, J. A.↗

Simplified Convolution Codes

Simple recursive algorithm efficiently calculates minimum-weight error vectors using Diophantine equations. Recursive algorithm uses general solution of polynomial linear Diophantine equation to determine minimum-weight error polynomial vector in equation in polynomial space.

Truong, T. K.↗

Multivariate Spline Algorithms for CAGD

Two special polyhedra present themselves for the definition of B-splines: a simplex S and a box or parallelepiped B, where the edges of S project into an irregular grid, while the edges of B project into the edges of a regular grid. More general splines may be found by forming linear combinations of these B-splines, where the three-dimensional coefficients are called the spline control points. Univariate splines are simplex splines, where s = 1, whereas splines over a regular triangular grid are box splines, where s = 2. Two simple facts render the development of the construction of B-splines: (1) any face of a simplex or a box is again a simplex or box but of lower dimension; and (2) any simplex or box can be easily subdivided into smaller simplices or boxes. The first fact gives a geometric approach to Mansfield-like recursion formulas that express a B-spline in B-splines of lower order, where the coefficients depend on x. By repeated recursion, the B-spline will be expressed as B-splines of order 1; i.e., piecewise constants. In the case of a simplex spline, the second fact gives a so-called insertion algorithm that constructs the new control points if an additional knot is inserted.

Boehm, W.↗

Fast frequency acquisition via adaptive least squares algorithm

A new least squares algorithm is proposed and investigated for fast frequency and phase acquisition of sinusoids in the presence of noise. This algorithm is a special case of more general, adaptive parameter-estimation techniques. The advantages of the algorithms are their conceptual simplicity, flexibility and applicability to general situations. For example, the frequency to be acquired can be time varying, and the noise can be nonGaussian, nonstationary and colored. As the proposed algorithm can be made recursive in the number of observations, it is not necessary to have a priori knowledge of the received signal-to-noise ratio or to specify the measurement time. This would be required for batch processing techniques, such as the fast Fourier transform (FFT). The proposed algorithm improves the frequency estimate on a recursive basis as more and more observations are obtained. When the algorithm is applied in real time, it has the extra advantage that the observations need not be stored. The algorithm also yields a real time confidence measure as to the accuracy of the estimator.

Kumar, R.↗

Method for the determination of the three-dimensional aerodynamic field of a rotor-stator combination to compressible flow

Using the lifting surface theory and the acceleration potential method for the flow field of an axial turbocompressor stage, a recursive and a direct method are presented that make use of the eigenfunction solutions of the isolated rotor and stator to solve for the rotor-stator interaction problem. The net pressure distribution on the rotor and stator blades is represented by modified Birnbaum series, whose coefficients are determined using a matrix procedure and satisfying the boundary conditions on the surface of the blades. The relation between the matrix operators of the recursive and the direct methods is also shown. Expressions have been given for the blade circulation, the axial and tangential forces on the blade, the rotor power required, and the induced upwash velocity of the stage.

Ramachandra, Sridhar M.↗

Fast frequency acquisition via adaptive least squares algorithm

A new least squares algorithm is proposed and investigated for fast frequency and phase acquisition of sinusoids in the presence of noise. This algorithm is a special case of more general, adaptive parameter-estimation techniques. The advantages of the algorithms are their conceptual simplicity, flexibility and applicability to general situations. For example, the frequency to be acquired can be time varying, and the noise can be non-Gaussian, nonstationary and colored. As the proposed algorithm can be made recursive in the number of observations, it is not necessary to have a priori knowledge of the received signal-to-noise ratio or to specify the measurement time. This would be required for batch processing techniques, such as the fast Fourier transform (FFT). The proposed algorithm improves the frequency estimate on a recursive basis as more and more observations are obtained. When the algorithm is applied in real time, it has the extra advantage that the observations need not be stored. The algorithm also yields a real time confidence measure as to the accuracy of the estimator.

Kumar, Rajendra↗