Joanne A. Foster

Learn More
An algorithm for computing the eigenvalue decomposition of a para-Hermitian polynomial matrix is described. This amounts to diagonalizing the polynomial matrix by means of a paraunitary "similarity" transformation. The algorithm makes use of "elementary paraunitary transformations" and constitutes a generalization of the classical Jacobi algorithm for(More)
The phenomenon of growth in program size in genetic programming populations has been widely reported. In a variety of experiments and static analysis we test the standard protective code explanation and find it to be incomplete. We suggest bloat is primarily due to distribution of fitness in the space of possible programs and because of this, in the absence(More)
To provide a definitive assessment of prediction of in vivo CL int from human liver in vitro systems for assessment of typical underprediction. A database of published predictions of clearance from human hepatocytes and liver microsomes was compiled, including only intravenous CL b. The influence of liver model (well-stirred (WS) or parallel tube (PT)),(More)
Intrinsic clearance (CL(int)) of seven probe cytochrome P450 substrates, across a wide range of clearance, was compared in microsomes and cryopreserved hepatocytes from the same four livers. Previous comparisons have shown system dependence, but using preparations from different donor livers. Four-fold average underprediction of microsomal CL(int) by(More)
In this paper, a new algorithm for calculating the QR decomposition (QRD) of a polynomial matrix is introduced. This algorithm amounts to transforming a polynomial matrix to upper triangular form by application of a series of paraunitary matrices such as elementary delay and rotation matrices. It is shown that this algorithm can also be used to formulate(More)
For a frequency flat multi-input multi-output (MIMO) system the QR decomposition can be applied to reduce the MIMO channel equalization problem to a set of decision feedback based single channel problems. Using a novel technique for polynomial matrix QR decomposition (PMQRD) based on Givens rotations, we show the PMQRD can do likewise for a frequency(More)
A novel algorithm for calculating the QR decomposition (QRD) of polynomial matrix is proposed. The algorithm operates by applying a series of polynomial Givens rotations to transform a polynomial matrix into an upper-triangular polynomial matrix and, therefore, amounts to a generalisation of the conventional Givens method for formulating the QRD of a scalar(More)
In the case of a frequency flat multiple-input multiple-output (MIMO) system, QR decomposition can be applied to reduce the MIMO channel equalization problem to a set of decision feedback based single channel equalization problems. Using a novel technique for polynomial matrix QR decomposition (PMQRD) based on Givens rotations, we extend this work to(More)
An algorithm has been recently proposed by the authors for calculating a polynomial matrix singular value decomposition (SVD) based upon polynomial matrix QR decomposition. In this work we examine how this method compares to a previously proposed method of formulating this decomposition. In particular, the performance of the two methods is examined when(More)
A novel algorithm for calculating the singular value decomposition (SVD) of a polynomial matrix is proposed. The algorithm operates by iteratively calculating the QR decomposition (QRD) of the matrix to transform it to a diagonal polynomial matrix. Alternatively, this decomposition can be calculated using the polynomial matrix eigenvalue decomposition (EVD)(More)