Jonathan Gillard

Prof. Jonathan Gillard


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 August 2012 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
JGJonathan Gillard
Jonathan Gillard
AZAnatoly Zhigljavsky
Anatoly Zhigljavsky

1 January 2023 in Statistics and Its Interface
Verified
Journal Article
Closed access
PDF file
JGJonathan Gillard
Jonathan Gillard
KUKonstantin Usevich
Konstantin Usevich
International Press of Boston - publishers of scholarly mathematical and scientific journals and books

17 April 2020 in Journal of Open Source Software
Verified
Journal Article
Open access
PDF file
HWHenry Wilde
Henry Wilde
VKVincent Knight
Vincent Knight
JGJonathan Gillard
Jonathan Gillard
Matching games allow for the allocation of resources and partnerships in a fair way. Typically, a matching game is defined by two sets of players that each have preferences over at least some of the elements of the other set. The objective of the game is then to find a mapping between the sets of players in which everyone is happy enough with their match.

15 August 2016 in Numerical Linear Algebra with Applications
Verified
Journal Article
Closed access
PDF file
JGJonathan Gillard
Jonathan Gillard
AZA. A. Zhigljavsky
A. A. Zhigljavsky

1 January 2011 in Informatica
Verified
Journal Article
Closed access
PDF file
JGJonathan Gillard
Jonathan Gillard
AZAnatoly Zhigljavsky
Anatoly Zhigljavsky
In this paper, we consider the so-called structured low rank approximation (SLRA) problem as a problem of optimization on the set of either matrices or vectors. Briefly, SLRA is defined as follows. Given an initial matrix with a certain structure (for example, Hankel), the aim is to find a matrix of specified lower rank that approximates this initial matrix, whilst maintaining the initial structure. We demonstrate that the optimization problem arising is typically very difficult; in particular, the objective function is multiextremal even in simple cases. We also look at different methods of solving the SLRA problem. We show that some traditional methods do not even converge to a locally optimal matrix.

16 July 2012 in Journal of Applied Statistics
Verified
Journal Article
Closed access
JGJonathan Gillard
Jonathan Gillard
Parametric methods for the calculation of reference intervals in clinical studies often rely on the identification of a suitable transformation so that the transformed data can be assumed to be drawn from a Gaussian distribution. In this paper, the two-stage transformation recommended by the International Federation for Clinical Chemistry is compared with a novel generalised Box–Cox family of transformations. Investigation is also made of sample sizes needed to achieve certain criteria of reliability in the calculated reference interval. Simulations are used to show that the generalised Box–Cox family achieves a lower bias than the two-stage transformation. It was found that there is a possibility that the two-stage transformation will result in percentile estimates that cannot be back-transformed to obtain the required reference intervals, a difficulty not observed when using the generalised Box–Cox family introduced in this paper.