## Search

Now showing items 11-20 of 379

#### Reconstructing minimal rooted trees

(University of Canterbury, 1999)

For a set T of rooted binary leaf-labelled trees, we present an
algorithm that finds all of the minor-minimal trees that are compatible with
T. The running time of this algorithm is polynomial up to the number of trees
with ...

#### Hybrid Chebyshev collocation-series methods for elliptic problems

(University of Canterbury. Dept. of Mathematics, 1990)

#### Infinite antichains of matroids with characteristic set {p}

(University of Canterbury, 1999)

For each prime p, we construct an infinite antichain of matroids in
which each matroid has characteristic set {p}. For p=2, each of the matroids
in our antichain is an excluded minor for the class of matroids representable ...

#### Grover's quantum algorithm applied to global optimisation

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

Grover's quantum computational search procedure can provide the basis for implementing
adaptive global optimisation algorithms. A brief overview of the procedure is given and a
framework called Grover Adaptive Search is ...

#### The application of regression trees to detecting multiple structural breaks in the mean of a time series

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

A non parametric approach is proposed for dating structural breaks whose number and dates of occurrence are a priori unknown. In particular, the case of
level shifts is considered. For the purpose of locating the breakdates ...

#### Two applications of the divide & conquer principle in the molecular sciences

(University of Canterbury. Dept. of Mathematics, 1997)

One of the most powerful principles for solving complex tasks algorithmically is the so-called Divide& Conquer Principle. It has been applied successfully for an amazingly
wide range of problems, from combinatorial ...

#### A CARTopt method for bound constrained global optimization

(University of Canterbury. Mathematics and Statistics, 2013)

A stochastic algorithm for bound-constrained global optimization is described. The
method can be applied to objective functions that are nonsmooth or even discontinuous.
The algorithm forms a partition on the search ...

#### Doubly-periodic progressive permanent waves in deep water

(University of Canterbury. Dept. of Mathematics, 1984)

The Stokes wave is generalized to progressive waves in deep water which are periodic in two orthogonal directions, and are steady relative
to a frame of reference moving in one of these directions. These doublyperiodic
...

#### Chaos from simplicity : an introduction to the double pendulum

(University of Canterbury, 2008)

The fusion of two pendulums give rise to a simple mechanical system that on contrary to its deceptively
simple appearances exhibit extremely unpredictable and complex behaviour. The equations of motion
for the simple ...

#### Existence and uniqueness of collocating algebraic function approximations

(University of Canterbury. Dept. of Mathematics, 1990)

The problem of approximating a real-valued function by an algebraic function, where the approximation is determined by collocation at a sufficient number of distinct nodes, is
considered. Results are obtained for the ...