Linearization method

We now discuss the most important theoretical methods developed thus far the augmented plane wave (APW) and the Korringa-Kolm-Rostoker (KKR) methods, as well as the linear methods (linear APW (LAPW), the linear miiflfm-tin orbital [LMTO] and the projector-augmented wave [PAW]) methods. 

Andersen O K 1975 Linear methods in band theory Phys. Rev. B 12 3060... 

Goresky CA. A linear method for determining liver sinusoidal and extravascular volumes. Am J Physiol 1963 204 626-40. 

In order to reduce the complexity of the problem, several approximation schemes have been developed. In the BGK model, the collision integral is replaced by a simple local term ensuring that the well-known Maxwell distribution is reached at thermal equilibrium [16]. The linearization method assumes that the phase space distribution is given by a small perturbation h on top of a (local) Maxwell distribu-tion/o (see, e.g., [17, 18]) ... 

Additionally, Breiman et al. [23] developed a methodology known as classification and regression trees (CART), in which the data set is split repeatedly and a binary tree is grown. The way the tree is built, leads to the selection of boundaries parallel to certain variable axes. With highly correlated data, this is not necessarily the best solution and non-linear methods or methods based on latent variables have been proposed to perform the splitting. A combination between PLS (as a feature reduction method — see Sections 33.2.8 and 33.3) and CART was described by... 

As an extension of perceptron-like networks MLF networks can be used for non-linear classification tasks. They can however also be used to model complex non-linear relationships between two related series of data, descriptor or independent variables (X matrix) and their associated predictor or dependent variables (Y matrix). Used as such they are an alternative for other numerical non-linear methods. Each row of the X-data table corresponds to an input or descriptor pattern. The corresponding row in the Y matrix is the associated desired output or solution pattern. A detailed description can be found in Refs. [9,10,12-18]. 

A significant development in pipeline network computation in the last few years was the introduction of the so-called linearization method first by Wood and Charles (Wll) and later, independently, by Bending and Hutchi-... 

For the special case for which n = 2, it can be shown that the linearization method defined above becomes identical to the Newton-Raphson method. The result may be generalized to apply to any homogeneous function of degree n. 

While it is technically erroneous to claim that the linearization method does not require any initialization (J2), it is true that the initialization procedure used appear to be quite effective. A more comprehensive discussion of initialization procedure will be given in Section III,A,5. With this initialization procedure, the linearization method appears to converge very rapidly, usually in less than 10 iterations for formulations A and B. Since the evaluation of f(x) and its partial derivatives is not required, the method is also simpler and easier to implement than the Newton-Raphson method. 

On the debit side, the linearization method is quite sensitive to the form of the network element model. Jeppson and Tavallaee (J2) reported that convergence rate was slow when the usual pump and reservoir models were incorporated, but they obtained significant improvements after the models had been suitably transformed. Although the number of iterations required is small using formulations A and B, the dimension of the matrix equation is substantial. Hence, it becomes essential to use sparse computation techniques if the method is to retain its competitive edge in larger problems. 

For formulations A and B, one general procedure is to solve the laminar flow equations which are linear and use the solution as the initial guesses for the nonlinear equations. Variations of this procedure have been used by Bending and Hutchison (B5), Wood and Charles (Wll), and Jeppson and Tavallaee (J2) in conjunction with the linearization method. 

The methodology takes the form of an MINLP, which must be linearised to find a solution. The linearization method used was the relaxation-linearization technique proposed by Quesada and Grossman (1995). During the application of the formulation to the illustrative examples it was found that only one term required linearization for a solution to be found. 

Unfortunately, even the planning of green biotechnology has now evolved into a wicked problem with complex structures and no obvious causal chains. This applies also to the PA. These problems cannot be determined completely in a quantitative and scientific manner, and there are no existing solutions in the sense of definitive and objective answers alone. Wicked problems have been addressed mainly through formalized (linear) methods that are suitable only for the solution of tame problems. 

A final consideration about PCA is concerned with its use as a preprocessor of non-linear methods such as neural networks [22], The assumption of a normal distribution of the data requires all following analysis steps to adhere to this hypothesis. If positive results are sometimes achieved they have to be considered as serendipitous events. 

---