## Search

Now showing items 1-10 of 13

#### RBF collocation

(University of Canterbury, 2002)

In recent years radial basis function collocation has become a useful alternative to finite
difference and finite element methods for solving elliptic partial differential equations. RBF
collocation methods have been ...

#### Replacing cliques by stars in quasi-media graphs

(University of Canterbury, 2002)

For a multi-set ∑ of splits (bipartitions) of a finite set X, we introduce the multi-split graph G(∑). This graph Is a natural extension of the Buneman graph. Indeed, it is shown that several results pertaining to the ...

#### Four characters suffice to convexly define a phylogenetic tree

(University of Canterbury, 2002)

It was recently shown that just five characters (functions on a finite set X) suffice to convexly define a trivalent tree with leaf set X. Here we show that four characters suffice which, since three characters is not ...

#### Cyclic permutations and evolutionary trees

(University of Canterbury, 2002)

Given a tree T with leaf set X, there are certain ways of arranging
the elements of X in a circular order so that T can be embedded in the plane
and 'preserve' this ordering. We investigate some new combinatorial ...

#### Signal restoration after transmission through an advective and diffusive medium

(University of Canterbury. Dept. of Mathematics and Statistics, 2002)

Inverse problem, regularisation, singular perturbation, wave splitting, wave propagators,
square root operator, inverse mass transport This paper considers an inverse problem associated
with mass transport in a pipe. It ...

#### A derivative-free frame-based conjugate gradients method

(University of Canterbury. Dept. of Mathematics and Statistics, 2002)

A derivative-free frame-based conjugate gradients algorithm is presented. Convergence
is shown for C1 functions, and this is verified in numerical trials. The algorithm
is tested on a variety of low dimensional problems, ...

#### A review of monitoring low density animal populations

(University of Canterbury, 2002)

One of the most important steps in designing a monitoring programme is to have very
clear objectives. The objectives should define what is the state of the environment
desired by managers, over what time frame, in what ...

#### Conjugate grids for unconstrained optimisation

(University of Canterbury. Department of Mathematics and Statistics, 2002)

Several recent papers have proposed the use of grids for solving unconstrained optimisation problems. Grid-based methods typically generate a sequence of grid local
minimisers which converge to stationary points under ...

#### A mathematical model for analysis of the cell cycle in human tumour

(University of Canterbury. Dept. of Mathematics and Statistics, 2002)

The growth of human cancers is characterised by long and variable cell cycle times that are controlled by
stochastic events prior to DNA replication and cell division. Treatment with radiotherapy or chemotherapy induces ...

#### Fork-decompositions of matroids

(University of Canterbury, 2002)

One of the central problems in matroid theory is Rota's conjecture
that, for all prime powers q, the class of GF(q)-representable matroids has a
finite set of excluded minors. This conjecture has been settled for q ≤ 4 ...