Markus Hegland

Markus Hegland

Auto-generated profile, based on publicly available information

Markus Hegland

Australian National University, Canberra, Australia

Research Focus & Metrics

Academic Career Length

45Years (1982-Present)

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

Representative Publications

View All Publications
1 August 2007 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
MHMarkus Hegland
Markus Hegland
CBConrad Burden
Conrad Burden
LSLucia Santoso
Lucia Santoso
SMShev MacNamara
Shev MacNamara
HBHilary Booth
Hilary Booth

10 February 1999 in Mathematics of Computation
Verified
Journal Article
Open access
PDF file
RARobert Anderssen
Robert Anderssen
MHMarkus Hegland
Markus Hegland
Finite difference methods, such as the mid-point rule, have been applied successfully to the numerical solution of ordinary and partial differential equations. If such formulas are applied to observational data, in order to determine derivatives, the results can be disastrous. The reason for this is that measurement errors, and even rounding errors in computer approximations, are strongly amplified in the differentiation process, especially if small step-sizes are chosen and higher derivatives are required. A number of authors have examined the use of various forms of averaging which allows the stable computation of low order derivatives from observational data. The size of the averaging set acts like a regularization parameter and has to be chosen as a function of the grid size h h . In this paper, it is initially shown how first (and higher) order single-variate numerical differentiation of higher dimensional observational data can be stabilized with a reduced loss of accuracy than occurs for the corresponding differentiation of one-dimensional data. The result is then extended to the multivariate differentiation of higher dimensional data. The nature of the trade-off between convergence and stability is explicitly characterized, and the complexity of various implementations is examined.

1 January 2007 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
MHMarkus Hegland
Markus Hegland
JGJochen Garcke
Jochen Garcke
VCVivien J. Challis
Vivien J. Challis

1 January 2004
Verified
Book Chapter
Closed access
PDF file
PCPeter Christen
Peter Christen
TCTim Churches
Tim Churches
MHMarkus Hegland
Markus Hegland

1 December 1995 in Applicable Analysis
Verified
Journal Article
Closed access
MHMarkus Hegland
Markus Hegland
Variable Hilbert scales are constructed using the spectral theory of self-adjoint operators in Hilbert spaces. An embedding and an interpolation theorem (based on Jenssen's inequality) are proved. They generalize known results about “ordinary” Hilbert scales derived by Natterer [Applic. Anal., 18 (1984), pp.29-37]. Bounds on best possible and actual errors for regularization methods are obtained by applying the interpolation inequality. These bounds extend the standard ones, and, in particular, include exponential and logarithmic error laws. Similar results were established earlier by Hegland [SIAM J. Numer. Anal., 29 (1992), pp. 1446-14611 for compact operators only. Here, they are generalized to include unbounded operators. A detailed discussion of Tikhonov regularization by Nair et al. [Tech. Rep. MR8-94, CMA, Aust. Nat. Uni., 19941 indicates that parameter choice strategies, which were thought to be suboptimal, can give substantially higher convergence rates than the so-called optimal choices! This improvement depends on how the regularizor is chosen. In some particularly difficult situations, however, the choice of regularizor cannot improve the convergence.

1 May 2010 in Procedia Computer Science
Verified
Journal Article
Open access
VSVikram Sunkara
Vikram Sunkara
MHMarkus Hegland
Markus Hegland
It is well known that many realistic mathematical models of biological and chemical systems, such as enzyme cascades and gene regulatory networks, need to include stochasticity. These systems can be described as Markov processes and are modelled using the Chemical Master Equation (CME). The CME is a differential-difference equation (continuous in time and discrete in the state space) for the probability of certain state at a given time. The state space is the population count of species in the system. A successful method for computing the CME is the Finite State Projection Method (FSP). In this paper we will give the mathematical background of the FSP and propose a new addition to the FSP which guaranties our approximation to have optimal order.