Three methods in common use for finding confidence regions for the parameters of a nonlinear regression model are studied. These are the lack of fit method, the linearization method, and the maximum likelihood method. The objective is to determine which of the three methods is the preferred choice in applications. The conclusion is that the linearization method has the best structural character...

Abstract The strongly nonlinear dynamics of taut strings, traveled by a force moving with uniform velocity, is analyzed. A change variable performed, which recasts the equations motion in terms linearized dynamic displacement, measured from quasi-static response. Under hypothesis load velocity far enough celerity string, system appears form linear PDEs whose coefficients are slowly time. Since ...

The quadratic assignment problem (QAP) is one of the great challenges in combinatorial optimization. Linearization for QAP is to transform the quadratic objective function into a linear one. Numerous QAP linearizations have been proposed, most of which yield mixed integer linear programs (MILP). Kauffmann and Broeckx’s linearization (KBL) is the current smallest one in terms of the number of va...

This paper presents an adaptive feedback linearization approach to derive helicopter. Ideal feedback linearization is defined for the cases when the system model is known. Adaptive feedback linearization is employed to get asymptotically exact cancellation for the inherent uncertainty in the knowledge of the given parameters of system. The control algorithm is implemented using the feedback lin...

In the article the problem of output setpoint tracking for affine non-linear system is considered. Presented approach combines state feedback linearization and homotopy numerical continuation in subspaces of phase space where feedback linearization fails. The method of numerical parameter continuation for solving systems of nonlinear equations is generalized to control affine non-linear dynamic...

We consider a branch-and-reduce approach for solving generalized linear multiplicative programming. First, a new lower approximate linearization method is proposed; then, by using this linearization method, the initial nonconvex problem is reduced to a sequence of linear programming problems. Some techniques at improving the overall performance of this algorithm are presented. The proposed algo...

The current article is concerned with a comprehensive investigation of achieving the simplest solution non-conservative coupled nonlinear forced oscillators. mainly depends on non-perturbative method. It yielding an equivalent linear system. advantage this system that its coefficients are easily computed and they include effects original coefficients. This linearization approach allows quasi-ex...