Perturbation, extraction and refinement of invariant pairs for matrix polynomials

Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of linear eigenvalue problems, leading to conceptually elegant and numerically stable formulations in applications that require the computation of several eigenvalues and/or eigenvectors. Similar benefits can be expected for polynomial eigenvalue problems, for which the concept of an invariant subspace needs to be replaced by the concept of an invariant pair. Little has been known so far about numerical aspects of such invariant pairs. The aim of this paper is to fill this gap. The behavior of invariant pairs under perturbations of the matrix polynomial is studied and a first-order perturbation expansion is given. From a computational point of view, we investigate how to best extract invariant pairs from a linearization of the matrix polynomial. Moreover, we describe efficient refinement procedures directly based on the polynomial formulation. Numerical experiments with matrix polynomials from a number of applications demonstrate the effectiveness of our extraction and refinement procedures.

Neurofuzzy network model construction using Bézier-Bernstein polynomial functions

Neurofuzzy modelling systems combine fuzzy logic with quantitative artificial neural networks via a concept of fuzzification by using a fuzzy membership function usually based on B-splines and algebraic operators for inference, etc. The paper introduces a neurofuzzy model construction algorithm using Bezier-Bernstein polynomial functions as basis functions. The new network maintains most of the properties of the B-spline expansion based neurofuzzy system, such as the non-negativity of the basis functions, and unity of support but with the additional advantages of structural parsimony and Delaunay input space partitioning, avoiding the inherent computational problems of lattice networks. This new modelling network is based on the idea that an input vector can be mapped into barycentric co-ordinates with respect to a set of predetermined knots as vertices of a polygon (a set of tiled Delaunay triangles) over the input space. The network is expressed as the Bezier-Bernstein polynomial function of barycentric co-ordinates of the input vector. An inverse de Casteljau procedure using backpropagation is developed to obtain the input vector's barycentric co-ordinates that form the basis functions. Extension of the Bezier-Bernstein neurofuzzy algorithm to n-dimensional inputs is discussed followed by numerical examples to demonstrate the effectiveness of this new data based modelling approach.

Optimal piecewise locally linear modeling

Associative memory networks such as Radial Basis Functions, Neurofuzzy and Fuzzy Logic used for modelling nonlinear processes suffer from the curse of dimensionality (COD), in that as the input dimension increases the parameterization, computation cost, training data requirements, etc. increase exponentially. Here a new algorithm is introduced for the construction of a Delaunay input space partitioned optimal piecewise locally linear models to overcome the COD as well as generate locally linear models directly amenable to linear control and estimation algorithms. The training of the model is configured as a new mixture of experts network with a new fast decision rule derived using convex set theory. A very fast simulated reannealing (VFSR) algorithm is utilized to search a global optimal solution of the Delaunay input space partition. A benchmark non-linear time series is used to demonstrate the new approach.

Data based constructive identification - overcoming the curse of dimensionality

The modelling of a nonlinear stochastic dynamical processes from data involves solving the problems of data gathering, preprocessing, model architecture selection, learning or adaptation, parametric evaluation and model validation. For a given model architecture such as associative memory networks, a common problem in non-linear modelling is the problem of "the curse of dimensionality". A series of complementary data based constructive identification schemes, mainly based on but not limited to an operating point dependent fuzzy models, are introduced in this paper with the aim to overcome the curse of dimensionality. These include (i) a mixture of experts algorithm based on a forward constrained regression algorithm; (ii) an inherent parsimonious delaunay input space partition based piecewise local lineal modelling concept; (iii) a neurofuzzy model constructive approach based on forward orthogonal least squares and optimal experimental design and finally (iv) the neurofuzzy model construction algorithm based on basis functions that are Bézier Bernstein polynomial functions and the additive decomposition. Illustrative examples demonstrate their applicability, showing that the final major hurdle in data based modelling has almost been removed.

Preparation of (–)-epigallocatechin gallate from commercial green tea by caffeine precipitation and solvent partition

A method has been developed which enables the easy and inexpensive preparation of gram quantities of (–)-epigallocatechin gallate from green tea (Camellia sinensis). A decaffeinated aqueous brew of commercial green tea is treated with caffeine (30 m ). The precipitate is redissolved after decaffeination with chloroform and further purified by solvent partition with ethyl hexanoate and propyl acetate. Commercial leaf (25 g) yields 400 mg (–)-epigallocatechin gallate at better than 80% purity, as judged by reversed phase HPLC.

An introduction to radial basis functions for system identification: a comparison with other neural network methods

A look is taken at the use of radial basis functions (RBFs), for nonlinear system identification. RBFs are firstly considered in detail themselves and are subsequently compared with a multi-layered perceptron (MLP), in terms of performance and usage.

Belowground biomass functions and expansion factors in high elevation Norway spruce

Biomass allocation to above- and belowground compartments in trees is thought to be affected by growth conditions. To assess the strength of such influences, we sampled six Norway spruce forest stands growing at higher altitudes. Within these stands, we randomly selected a total of 77 Norway spruce trees and measured volume and biomass of stem, above- and belowground stump and all roots over 0.5 cm diameter. A comparison of our observations with models parameterised for lower altitudes shows that models developed for specific conditions may be applicable to other locations. Using our observations, we developed biomass functions (BF) and biomass conversion and expansion factors (BCEF) linking belowground biomass to stem parameters. While both BF and BCEF are accurate in belowground biomass predictions, using BCEF appears more promising as such factors can be readily used with existing forest inventory data to obtain estimates of belowground biomass stock. As an example, we show how BF and BCEF developed for individual trees can be used to estimate belowground biomass at the stand level. In combination with existing aboveground models, our observations can be used to quantify total standing biomass of high altitude Norway spruce stands.

Wiener System identification using B-spline functions with De Boor recursion

A simple and effective algorithm is introduced for the system identification of Wiener system based on the observational input/output data. The B-spline neural network is used to approximate the nonlinear static function in the Wiener system. We incorporate the Gauss-Newton algorithm with De Boor algorithm (both curve and the first order derivatives) for the parameter estimation of the Wiener model, together with the use of a parameter initialization scheme. The efficacy of the proposed approach is demonstrated using an illustrative example.