
S1 2024 Honours Conference
It is time to celebrate our Honours students and see what they have been up to!
Speakers
Event series
Content navigation
Description
We have three students who will present results of their Honours project. Each student will give a 30 minute talk followed by questions from the audience. The schedule for the talks can be found below. The titles and abstracts will be published next week.
Speakers:
Lachlan Huang
Sud Hardikar
Prashant Rao
Schedule:
Lachlan Huang | 13:00 |
Sud Hardikar | 13:45 |
Prashant Rao | 14:30 |
Schedule
13:00
Computational solutions of the Grad-Shafranov equation
- Speaker: Lachlan Huang
Toroidal magnetic confinement is the leading contender to tame a tokamak burning plasma for energy production. To leading order, all confinement, transport, and stability properties are determined by magnetic geometry. To a good approximation, the magnetic field in a toroidally symmetric tokamak is determined by solutions of the Grad-Shafranov equation (GSE). In this talk, a quick derivation of GSE will be presented. The uniqueness of the solution will be discussed. A direct method using Buneman's method will be presented. A Picard current field iteration numerical solver for the GSE is presented. Numerical results of its convergence, and computational costs will be presented. And a comparison to other kind of solver will be discussed.
13:45
A Representation-theoretic framework for Optimization
- Speaker: Sud Hardikar
In 2010, Risi Kondor constructed a branch & bound algorithm to find exact solutions to the Quadratic Assignment Problem (QAP) by using the representation theory of the symmetric group. Remarkably, despite requiring a very intricate implementation the algorithm performed competitively in comparison to others of its time. Kondor notes his method can generalise to many other optimisation problems. In my thesis, I have proven extended variations of the key theorems relevant to this approach. In this talk, I will discuss a framework for how the representation theory of finite groups can be applied to solve any discrete optimisation problem.
14:30
Discrete Approximations to 1-D Processes with Rough Generators
- Speaker: Prashant Rao
Location
Seminar room 1.33, Mathematical Sciences Institute, #145 Hannah Neumann Building, Science Road, The Australian National University