Contents

MSI Home People News Research Study CMA Dept of Mathematics Seminars MSI Colloquia Events Jobs MSI IT Unit MSI Intranet Internal pages Quick Links Search MSI Contact us ANU Staff page	Michael Robert Osborne   The night too quickly passes And we are growing old, So let us fill our glasses And toast the Days of Gold; When finds of wondrous treasure Set all the South ablaze, And you and I were faithful mates all through the Roaring Days. Henry Lawson, "The Roaring Days"

Work Information	Research Activities	Christmas Letter
Contact Information	Some publications	Biographical Information
Computation Hot List	Slides for talks	Personal Interests

http://mngo.veritel.com.au//public

1. Use of wrap-around partitioning to vectorize the solution of block bidiagonal matrices
2. Inverse iteration for the solution of eigenvalue problems
3. Parallel numerical libraries
4. V-invariant methods for generalised least squares problems

1. Collocation methods for the discretization of boundary value problems
2. Factorisation of operators, dichotomy, and the stability of computations
3. Cyclic reduction and its relation to representation theorems
4. Estimation of ODE's, variable selection, and the suitability of bases
5. Kalman filters, stochastic ODE's, and smoothing problems
6. ODE eigenvalue problems, stability, and bifurcation

1. Fisher's method of scoring for maximising likelihoods
2. Scoring under constraints
3. Rank regression and l₁ estimation
4. Robust methods
5. Methods of variable selection
6. Trust region methods

1. Structure functional representation
2. Simplicial methods for minimization
3. Resolution of degeneracy
4. Problems with polyhedral constraints

1. Event oriented model descriptions
2. Object oriented programming implementation

• Fisher's method of scoring

• Wrap-around partitioning for block bidiagonal systems

• Cyclic reduction, dichotomy, and the estimation of differential equations

• A new approach to variable selection in least squares problems

• On the LASSO and its dual

• Variable selection and control in least squares problems

• Inverse iteration and deflation in the solution of generalised eigenvalue problems

• Computing eigenvalues of ordinary differential equations

• Notes on least squares and maximum likelihood

• Scoring with constraints

• An approach to parameter estimation and model selection in differential equations

• When LP is not a good idea - using structure in polyhedral optimization problems

• Least squares methods in maximum likelihood problems

• Parameter estimation of ordinary differential equations

• Stability Problems in ODE Estimation

• Numerical Questions in ODE Boundary Value Problems

• Separable least squares, variable projection, and the Gauss-Newton algorithm

• On perturbations of linear least squares problems

• The Bock iteration for the ODE estimation problem

• Anderssen70

Back to top

• The estimation problem in ordinary differential equations

• Effective vectorized solvers for narrow band systems by wrap-around partitioning

• Variable selection and control in least squares problems

• When LP is not a good idea - structure in polyhedral optimization problems

• Parameter estimation and model selection in differential equations

• V-invariant methods for generalised least squares, Kalman filter application

• Polyhedral function constrained optimisation problems

• Least squares methods in maximum likelihood problems

• Ryan60

• CTAC04

• Multiple shooting revisited

• Stability problems in ODE estimation

• Numerical questions in ODE boundary value problems

• ODE estimation - statistical properties and numerical problems

• The Bock iteration

• On ODE estimation algorithms (CTAC08)

Back to top

 

 

accesses since Friday 6 February 2009