Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Taylor approximation”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Sensitivity analysis and approximation methods for general eigenvalue problems

Optimization of dynamic systems involving complex non-hermitian matrices is often computationally expensive. Major contributors to the computational expense are the sensitivity analysis and reanalysis of a modified design. The present work seeks to alleviate this computational burden by identifying efficient sensitivity analysis and approximate reanalysis methods. For the algebraic eigenvalue problem involving non-hermitian matrices, algorithms for sensitivity analysis and approximate reanalysis are classified, compared and evaluated for efficiency and accuracy. Proper eigenvector normalization is discussed. An improved method for calculating derivatives of eigenvectors is proposed based on a more rational normalization condition and taking advantage of matrix sparsity. Important numerical aspects of this method are also discussed. To alleviate the problem of reanalysis, various approximation methods for eigenvalues are proposed and evaluated. Linear and quadratic approximations are based directly on the Taylor series. Several approximation methods are developed based on the generalized Rayleigh quotient for the eigenvalue problem. Approximation methods based on trace theorem give high accuracy without needing any derivatives. Operation counts for the computation of the approximations are given. General recommendations are made for the selection of appropriate approximation technique as a function of the matrix size, number of design variables, number of eigenvalues of interest and the number of design points at which approximation is sought.

Murthy, D. V.↗
NASA NTRS1988

Minimum weight design of rotorcraft blades with multiple frequency and stress constraints

Minimum weight designs of helicopter rotor blades with constraints on multiple coupled flap-lag natural frequencies are studied. Constraints are imposed on the minimum value of the blade autorotational inertia to ensure sufficient rotary inertia to autorotate in case of engine failure and on stresses to guard against structural failure due to blade centrifugal forces. Design variables include blade taper ratio, dimensions of the box beam located inside the airfoil and magnitudes of nonstructural weights. The program CAMRAD is used for the blade modal analysis; the program CONMIN is used for the optimization. A linear approximation involving Taylor series expansion is used to reduce the analysis effort. The procedure contains a sensitivity analysis consisting of analytical derivatives for objective function and constraints on autorotational inertia and stresses. Central finite difference derivatives are used for frequency constraints. Optimal designs are obtained for both rectangular and tapered blades. Using this method, it is possible to design a rotor blade with reduced weight, when compared to a baseline blade, while satisfying all the imposed design requirements.

Chattopadhyay, Aditi↗
NASA NTRS1994

Distributed parameter modeling of repeated truss structures

A new approach to find homogeneous models for beam-like repeated flexible structures is proposed which conceptually involves two steps. The first step involves the approximation of 3-D non-homogeneous model by a 1-D periodic beam model. The structure is modeled as a 3-D non-homogeneous continuum. The displacement field is approximated by Taylor series expansion. Then, the cross sectional mass and stiffness matrices are obtained by energy equivalence using their additive properties. Due to the repeated nature of the flexible bodies, the mass, and stiffness matrices are also periodic. This procedure is systematic and requires less dynamics detail. The first step involves the homogenization from a 1-D periodic beam model to a 1-D homogeneous beam model. The periodic beam model is homogenized into an equivalent homogeneous beam model using the additive property of compliance along the generic axis. The major departure from previous approaches in literature is using compliance instead of stiffness in homogenization. An obvious justification is that the stiffness is additive at each cross section but not along the generic axis. The homogenized model preserves many properties of the original periodic model.

Wang, Han-Ching↗
DOE OSTI2026

Spatially Accelerated Winding Numbers for Curved Geometry

The generalized winding number (GWN) is a scalar field that supports robust containment queries on curved geometry, including non-watertight, overlapping, and nested boundary representations. While queries can be easily parallelized over samples, direct evaluation on parametric curves and surfaces remains costly for large and complex models. Fast, state-of-the-art GWN approaches leverage a spatial index to approximate the GWN, typically coupled with a Taylor expansion which approximates the GWN contribution for far clusters of geometric primitives. However, such methods operate only on discrete inputs such as triangle meshes and point clouds, and would introduce containment errors near boundaries if applied to curved input. We extend support for fast GWN evaluation over arbitrary collections of NURBS curves in 2D and trimmed NURBS patches in 3D via a Bounding Volume Hierarchy that stores efficiently precomputed moment data in the hierarchy nodes. When querying the hierarchy, approximations for far clusters are used alongside direct evaluation for nearby NURBS primitives, achieving sub-linear complexity while preserving the geometric features in the vicinity of the query point. Central to our performance improvements is an adaptive subdivision strategy for NURBS primitives during a preprocessing phase, creating better spatial partitions while retaining the same accuracy for containment decisions as a direct evaluation. We demonstrate the performance and accuracy of our approach across a large collection of 2D and 3D datasets.

Computer science↗
NASA NTRS1995

A hybrid neurocomputing/numerical strategy for nonlinear structural analysis

A hybrid neurocomputing/numerical strategy is presented for geometrically nonlinear analysis of structures. The strategy combines model-free data processing capabilities of computational neural networks with a Pade approximants-based perturbation technique to predict partial information about the nonlinear response of structures. In the hybrid strategy, multilayer feedforward neural networks are used to extend the validity of solutions by using training samples produced by Pade approximations to the Taylor series expansion of the response function. The range of validity of the training samples is taken to be the radius of convergence of Pade approximants and is estimated by setting a tolerance on the diverging approximants. The norm of residual vector of unbalanced forces in a given element is used as a measure to assess the quality of network predictions. To further increase the accuracy and the range of network predictions, additional training data are generated by either applying linear regression to weight matrices or expanding the training data by using predicted coefficients in a Taylor series. The effectiveness of the hybrid strategy is assessed by performing large-deflection analysis of a doubly-curved composite panel with a circular cutout, and postbuckling analyses of stiffened composite panels subjected to an in-plane edge shear load. In all the problems considered, the hybrid strategy is used to predict selective information about the structural response, namely the total strain energy and the maximum displacement components only.

Szewczyk, Z. Peter↗
NASA NTRS1973

Digital approximation of continuous-data control systems by point-by-point state comparison

This paper presents a point-by-point state comparison method of approximating a continuous-data system by a sampled-data system. The problem is to attempt the matching of the states of the two systems at the sampling instants. A partial matching has to be conducted if the systems have more states than controls. A weighting matrix is used to regulate the partial matching and weights placed on each state. The digital approximation is affected by use of forward gain E(T) and feedback gain G(T) in the sampled-data system. It is shown that, in general, these gains can be approximated by truncated Taylor series expansions. An illustrative example is given using the one-axis dynamics of the Skylab satellite.

Kuo, B. C.↗
NASA NTRS1979

An efficient algorithm for numerical airfoil optimization

A new optimization algorithm is presented. The method is based on sequential application of a second-order Taylor's series approximation to the airfoil characteristics. Compared to previous methods, design efficiency improvements of more than a factor of 2 are demonstrated. If multiple optimizations are performed, the efficiency improvements are more dramatic due to the ability of the technique to utilize existing data. The method is demonstrated by application to subsonic and transonic airfoil design but is a general optimization technique and is not limited to a particular application or aerodynamic analysis.

Vanderplaats, G. N.↗
NASA NTRS1988

Minimum weight design of rectangular and tapered helicopter rotor blades with frequency constraints

The minimum weight design of a helicopter rotor blade subject to constraints on coupled flap-lag natural frequencies has been studied. A constraint has also been imposed on the minimum value of the autorotational inertia of the blade in order to ensure that it has sufficient inertia to autorotate in the case of engine failure. The program CAMRAD is used for the blade modal analysis and CONMIN is used for the optimization. In addition, a linear approximation analysis involving Taylor series expansion has been used to reduce the analysis effort. The procedure contains a sensitivity analysis which consists of analytical derivatives of the objective function and the autorotational inertia constraint and central finite difference derivatives of the frequency constraints. Optimum designs have been obtained for both rectangular and tapered blades. Design variables include taper ratio, segment weights, and box beam dimensions. It is shown that even when starting with an acceptable baseline design, a significant amount of weight reduction is possible while satisfying all the constraints for both rectangular and tapered blades.

Chattopadhyay, Aditi↗
NASA NTRS1988

Minimum weight design of rectangular and tapered helicopter rotor blades with frequency constraints

The minimum weight design of a helicopter rotor blade subject to constraints on coupled flap-lag natural frequencies has been studied. A constraint has also been imposed on the minimum value of the autorotational inertia of the blade in order to ensure that it has sufficient inertia to aurorotate in the case of engine failure. The program CAMRAD is used for the blade modal analysis and CONMIN is used for the optimization. In addition, a linear approximation analysis involving Taylor series expansion has been used to reduce the analysis effort. The procedure contains a sensitivity analysis which consists of analytical derivatives of the objective function and the autorotational inertia constraint and central finite difference derivatives of the frequency constraints. Optimum designs have been obtained for both rectangular and tapered blades. Design variables include taper ratio, segment weights, and box beam dimensions. It is shown that even when starting with an acceptable baseline design, a significant amount of weight reduction is possible while satisfying all the constraints for both rectangular and tapered blades.

Chattopadhyay, Aditi↗
NASA NTRS1989

Minimum weight design of helicopter rotor blades with frequency constraints

The minimum weight design of helicopter rotor blades subject to constraints on fundamental coupled flap-lag natural frequencies has been studied in this paper. A constraint has also been imposed on the minimum value of the blade autorotational inertia to ensure that the blade has sufficient inertia to autorotate in case of an engine failure. The program CAMRAD has been used for the blade modal analysis and the program CONMIN has been used for the optimization. In addition, a linear approximation analysis involving Taylor series expansion has been used to reduce the analysis effort. The procedure contains a sensitivity analysis which consists of analytical derivatives of the objective function and the autorotational inertia constraint and central finite difference derivatives of the frequency constraints. Optimum designs have been obtained for blades in vacuum with both rectangular and tapered box beam structures. Design variables include taper ratio, nonstructural segment weights and box beam dimensions. The paper shows that even when starting with an acceptable baseline design, a significant amount of weight reduction is possible while satisfying all the constraints for blades with rectangular and tapered box beams.

Chattopadhyay, Aditi↗
NASA NTRS1991

Sensitivity analysis and optimization issues in NASTRAN

The purpose is to develop procedures to extract sensitivity analysis information from COSMIC/NASTRAN and to couple it with a mathematical optimization package. At present, the analysis will be limited to stress, displacement, and frequency constraints with structures modeled with membrane elements, rods, and bar elements. Two types of sensitivity analysis are discussed: an adjoint variable approach which is most effective when the number of active constraints is significantly less than the number of physical variables, and an approach based on a first order approximation of a Taylor series. The latter approach is more effective when the number of independent design variables is significantly less than the number of active constraints.

Tischler, V. A.↗
NASA NTRS1986

Approximate Cartesian state transition matrix

Based on a Taylor series expansion, an easily-computed approximation to the Cartesian state transition matrix is presented for a general velocity-independent force field. Suitable for the short time intervals encountered in onboard navigation applications of the extended Kalman filter, it provides approximately five decimal digits of accuracy for earth orbiting spacecraft with update intervals of one minute, and better accuracy for shorter intervals.

Markley, F. L.↗
NASA NTRS1990

The simultaneous integration of many trajectories using nilpotent normal forms

Taylor's formula shows how to approximate a certain class of functions by polynomials. The approximations are arbitrarily good in some neighborhood whenever the function is analytic and they are easy to compute. The main goal is to give an efficient algorithm to approximate a neighborhood of the configuration space of a dynamical system by a nilpotent, explicitly integrable dynamical system. The major areas covered include: an approximating map; the generalized Baker-Campbell-Hausdorff formula; the Picard-Taylor method; the main theorem; simultaneous integration of trajectories; and examples.

Grayson, Matthew A.↗
DOE OSTI2025

Integration of multiple coinflip devices for high-quality random sampling

Artificial intelligence, scientific computing, and probabilistic computing use random sampling to approximate solutions to various problems, with larger models requiring a substantial quantity of random numbers. To generate the required vast quantity of random numbers at high rates, we explore so-called “coinflip” devices, which are stochastic microelectronic devices ideally capable of independently generating random bits with a tunable weight at a high rate. However, coinflip devices are inherently analog and demonstrate nonidealities, like temperature dependence and drift, that can introduce determinism into the outputs. We present important considerations for building systems of multiple coinflip devices to produce high-quality bitstreams with low error and little dependency on previous bits. Using tunnel diodes as coinflip devices, we implement a control loop to adapt to temperature dependence and generate fair bitstreams with each device. While this can lead to dependencies between bits in a single bitstream, we demonstrate that combining results generated in parallel with individual tunnel diodes can produce fair and unpredictable bitstreams. The suitability of these bitstreams for use in probabilistic computing is then demonstrated through a Monte Carlo approximation of π.

Taylor, Brady Garland [Sandia National Laboratorie↗
DOE OSTI2024

Taylor-Expansion-Based Robust Power Flow in Unbalanced Distribution Systems: A Hybrid Data-Aided Method

Traditional power flow methods often adopt certain assumptions designed for passive balanced distribution systems, thus lacking practicality for unbalanced operation. moreover, their computation accuracy and efficiency are heavily subject to unknown errors and bad data in measurements or prediction data of distributed energy resources (ders). to address these issues, this paper proposes a hybrid data-aided robust power flow algorithm in unbalanced distribution systems, which combines taylor series expansion knowledge with a data-driven regression technique. the proposed method initiates a linearization power flow model to derive an explicitly analytical solution by modified taylor expansion. to mitigate the approximation loss that surges due to the der integration and bad data, we further develop a data-aided robust support vector regression approach to estimate the errors efficiently. comparative analysis in the 13-bus and 123-bus ieee unbalanced feeders shows that the proposed hybrid algorithm achieves superior computational efficiency, with guaranteed accuracy and robustness against outliers.

data-driven↗
NASA NTRS1989

Structural optimization of rotor blades with straight and swept tips subject to aeroelastic constraints

The main conclusions obtained in the present study are summarized. Their application to the structural optimization of a helicopter blade should be limited by the assumptions used in obtaining the numerical results presented here. The optimum design procedure described here is very efficient, and can produce improved designs with a very limited number of precise analyses. The method of constructing the approximate problem is such that previously conducted aeroelastic analyses can be reused in a new optimization problem. For example, if an optimization study is preceded by a parametric study in which the effect of various combinations of blade design parameters is examined, all the aeroelastic analyses performed for the parametric study can be reutilized in the optimization study. This is not possible when the approximate problem is built from Taylor series expansions. The results of the optimization are quite sensitive to the aeroelastic stability margins required of the blade. In the optimization of case 2, changing the aeroelastic stability constraints from simply requiring that the blade be stable in hover, to requiring that the stability margins be maintained during the course of the optimization, reduced the gains in n/rev vibration levels by more than 50 percent. The introduction of tip sweep can reduce the n/rev vertical hub shears beyond the level that can be obtained by just modifying the mass and stiffness distributions of the blade.

Friedmann, Peretz P.↗