Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear 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 19 records

Linear Approximation Line Pack Model for Integrated Electricity and Natural Gas Systems OPF

With the increasing installation of renewable energy electricity generation capacity, the penetration of natural gas fired generation is also substantailly increasing in power systems due to their fast response capability to mitigate system variability and uncertainty. The dependencies between the electricity system and the natural gas system are becoming more important to maintain the reliability of both systems. In integrated electricity and natural gas systems (IEGSs) operations, the nonlinearity of the natural gas system brings challenges to the system operators. In this paper, the IEGSs optimal power flow (OPF) model is proposed that includes the line pack of the gas system via linear approximation. The simulation results demonstrate that the proposed model can obtain optimal solutions efficiently that are comparable in accuracy as the nonlinear line pack model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Piecewise linear approximation for hereditary control problems

This paper presents finite-dimensional approximations for linear retarded functional differential equations by use of discontinuous piecewise linear functions. The approximation scheme is applied to optimal control problems, when a quadratic cost integral must be minimized subject to the controlled retarded system. It is shown that the approximate optimal feedback operators converge to the true ones both in the case where the cost integral ranges over a finite time interval, as well as in the case where it ranges over an infinite time interval. The arguments in the last case rely on the fact that the piecewise linear approximations to stable systems are stable in a uniform sense.

Propst, Georg↗

Linear Approximation SAR Azimuth Processing Study

A segmented linear approximation of the quadratic phase function that is used to focus the synthetic antenna of a SAR was studied. Ideal focusing, using a quadratic varying phase focusing function during the time radar target histories are gathered, requires a large number of complex multiplications. These can be largely eliminated by using linear approximation techniques. The result is a reduced processor size and chip count relative to ideally focussed processing and a correspondingly increased feasibility for spaceworthy implementation. A preliminary design and sizing for a spaceworthy linear approximation SAR azimuth processor meeting requirements similar to those of the SEASAT-A SAR was developed. The study resulted in a design with approximately 1500 IC's, 1.2 cubic feet of volume, and 350 watts of power for a single look, 4000 range cell azimuth processor with 25 meters resolution.

Lindquist, R. B.↗

Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation

In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate nonlinear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.

97 MATHEMATICS AND COMPUTING↗

A piecewise linear approximation scheme for hereditary optimal control problems

An approximation scheme based on 'piecewise linear' approximations of L2 spaces is employed to formulate a numerical method for solving quadratic optimal control problems governed by linear retarded functional differential equations. This piecewise linear method is an extension of the so called averaging technique. It is shown that the Riccati equation for the linear approximation is solved by simple transformation of the averaging solution. Thus, the computational requirements are essentially the same. Numerical results are given.

Cliff, E. M.↗

Piecewise linear approximation for hereditary control problems

Finite dimensional approximations are presented for linear retarded functional differential equations by use of discontinuous piecewise linear functions. The approximation scheme is applied to optimal control problems when a quadratic cost integral has to be minimized subject to the controlled retarded system. It is shown that the approximate optimal feedback operators converge to the true ones both in case the cost integral ranges over a finite time interval as well as in the case it ranges over an infinite time interval. The arguments in the latter case rely on the fact that the piecewise linear approximations to stable systems are stable in a uniform sense. This feature is established using a vector-component stability criterion in the state space R(n) x L(2) and the favorable eigenvalue behavior of the piecewise linear approximations.

Propst, Georg↗

Mechanical System Reliability and Cost Integration Using a Sequential Linear Approximation Method

The development of new products is dependent on product designs that incorporate high levels of reliability along with a design that meets predetermined levels of system cost. Additional constraints on the product include explicit and implicit performance requirements. Existing reliability and cost prediction methods result in no direct linkage between variables affecting these two dominant product attributes. A methodology to integrate reliability and cost estimates using a sequential linear approximation method is proposed. The sequential linear approximation method utilizes probability of failure sensitivities determined from probabilistic reliability methods as well a manufacturing cost sensitivities. The application of the sequential linear approximation method to a mechanical system is demonstrated.

Kowal, Michael T.↗

Simplifying activations with linear approximations in neural networks

A key step in Neural Networks is activation. Among the different types of activation functions, sigmoid, tanh, and others involve the usage of exponents for calculation. From a hardware perspective, exponential implementation implies the usage of Taylor series or repeated methods involving many addition, multiplication, and division steps, and as a result are power-hungry and consume many clock cycles. We implement a piecewise linear approximation of the sigmoid function as a replacement for standard sigmoid activation libraries. This approach provides a practical alternative by leveraging piecewise segmentation, which simplifies hardware implementation and improves computational efficiency. In this paper, we detail piecewise functions that can be implemented using linear approximations and their implications for overall model accuracy and performance gain. Our results show that for the DenseNet, ResNet, and GoogLeNet architectures, the piecewise linear approximation of the sigmoid function provides faster execution times compared to the standard TensorFlow sigmoid implementation while maintaining comparable accuracy. Specifically, for MNIST with DenseNet, accuracy reaches 99.91% (Piecewise) vs. 99.97% (Base) with up to 1.31x speedup in execution time. For CIFAR-10 with DenseNet, accuracy improves to 98.97% (Piecewise) vs. 99.40% (Base) while achieving 1.24x faster execution. Similarly, for CIFAR-100 with DenseNet, the accuracy is 97.93% (Piecewise) vs. 98.39% (Base), with a 1.18x execution time reduction. These results confirm the proposed method’s capability to efficiently process large-scale datasets and computationally demanding tasks, offering a practical means to accelerate deep learning models, including LSTMs, without compromising accuracy.

Activation function↗

Systems and methods for convex relaxations and linear approximations for optimal power flow in multiphase radial networks

Centralized node controllers in accordance with embodiments of the invention enable linear approximation of optimal power flow. One embodiment includes a centralized node controller including: a network interface, a processor, and a memory containing: a centralized power control application a network topology, where the network is multiphase unbalanced and comprises a plurality of connected nodes; wherein the processor is configured by the centralized controller application to: request node operating parameters from the plurality of connected nodes; calculate network operating parameters using a linear approximation of optimal power flow and the node operating parameters from the plurality of connected nodes; send network operating parameters to the plurality of connected nodes.

97 MATHEMATICS AND COMPUTING↗

Approximating linearizations for nonlinear systems

The following problem is examined: given a nonlinear control system dot-x(t) = f(x/t/) + the sum to m terms (i = 1) u sub i (t)g sub i (x/t/) on R(n) and a point x(0) in R(n), approximate the system near x(0) by a linear system. One approach is to use the usual Taylor series linearization. However, the controllability properties of both the nonlinear and linear systems depend on certain Lie brackets of the vector field under consideration. This suggests that a linear approximation based on Lie bracket matching should be constructed at x(0). In general, the linearizations based on the Taylor method and the Lie bracket approach are different. However, under certain mild assumptions, it is shown that there is a coordinate system for R(n) near x(0) in which these two types of linearizations agree. The importance of this agreement is indicated by examining the time responses of the nonlinear system and its linear approximation and comparing the lower order kernels in Volterra expansions of each.

Hunt, L. R.↗

Approximating linearizations for nonlinear systems

The following problem is examined: given a nonlinear control system dot-x(t) = f(x(t)) + the sum to m terms(i=1) u sub i (t)g sub i (x(t)) on R(n) and a point x(0) in R(n), approximate the system near x(0) by a linear system. One approach is to use the usual Taylor series linearization. However, the controllability properties of both the nonlinear and linear systems depend on certain Lie brackets of the vector field under consideration. This suggests that a linear approximation based on Lie bracket matching should be constructed at x(0). In general, the linearizations based on the Taylor method and the Lie bracket approach are different. However, under certain mild assumptions, it is shown that there is a coordinate system for R(n) near x(0) in which these two types of linearizations agree. The importance of this agreement is indicated by examining the time responses of the nonlinear system and its linear approximation and comparing the lower order kernels in Volterra expansions of each.

Hunt, L. R.↗

Identifying approximate linear models for simple nonlinear systems

This paper addresses the identification (realization) of approximate linear models from response data for certain nonlinear dynamic systems. Response characteristics for several typical nonlinear joints are analyzed mathematically and represented by series expansions. The parameters of the series expansion are then compared with the modal parameters of a linear model identified by the Eigensystem Realization Algorithm. The agreement of the identified model and the analytically derived representation is excellent for the cases studied. Also laboratory data from a model which exhibited stiffening behavior was analyzed using the Eigensystem Realization algorithm and Fast Fourier Transform. The laboratory experiment demonstrated the ability of the technique to recover the model characteristics using real data.

Horta, L. G.↗

Linear approximations of nonlinear systems

A method for designing an automatic flight controller for short and vertical takeoff aircraft is presently being developed at NASA Ames Research Center. This technique involves transformations of nonlinear systems to controllable linear systems and takes into account the nonlinearities of the aircraft. In general, the transformations cannot always be given in closed form. Using partial differential equations, an approximate linear system, called the modified tangent model, was recently introduced. A linear transformation of this tangent model to Brunovsky canonical form can be constructed, and from this an approximation of an exact transformation for the nonlinear system can be found. It is shown that a canonical expansion in Lie brackets about the point x(0) yields the same modified tangent model.

Hunt, L. R.↗

Linear approximations of nonlinear systems

The development of a method for designing an automatic flight controller for short and vertical take off aircraft is discussed. This technique involves transformations of nonlinear systems to controllable linear systems and takes into account the nonlinearities of the aircraft. In general, the transformations cannot always be given in closed form. Using partial differential equations, an approximate linear system called the modified tangent model was introduced. A linear transformation of this tangent model to Brunovsky canonical form can be constructed, and from this the linear part (about a state space point x sub 0) of an exact transformation for the nonlinear system can be found. It is shown that a canonical expansion in Lie brackets about the point x sub 0 yields the same modified tangent model.

Hunt, L. R.↗