Use of Interval Arithmetic and GRID Computing in Computational Molecular Science: Bounding Errors and Locating Global Minima. Catastrophic failure of the Ariane 5 rocket in 1996 and the inability of Patriot missile systems to reach their targets during the 1991 Gulf war were both attributed to numerical computing errors. Less dramatic, but in a similar vein, this project aims to study the numerical stability of contemporary computational molecular science applications. The focus will be on linea ....Use of Interval Arithmetic and GRID Computing in Computational Molecular Science: Bounding Errors and Locating Global Minima. Catastrophic failure of the Ariane 5 rocket in 1996 and the inability of Patriot missile systems to reach their targets during the 1991 Gulf war were both attributed to numerical computing errors. Less dramatic, but in a similar vein, this project aims to study the numerical stability of contemporary computational molecular science applications. The focus will be on linear scaling electronic structure codes, methods that are critical to the study of nano- and bio-materials, and are therefore of great importance to our economic future and medical well being. The project will build expertise within Australia in the area of interval arithmetic, an area that is currently poorly represented.Read moreRead less
Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is ....Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is relevant to public-key cryptography, where breaking an encryption scheme should be infeasible, and to many real-life situations where NP-complete problems need to be solved, either exactly or approximately.Read moreRead less
A new generation of fractals: theory, computation, and applications particularly to digital imaging. The project develops the mathematical and algorithmic foundations of superfractals and applies these results to a number of different areas, including in particular, digital imaging. For example, the ``third generation'' of mobile communications (3G), combines wireless mobile technology with high data transmission capacities. Currently the requirement for extensive bandwidth is a problem for e ....A new generation of fractals: theory, computation, and applications particularly to digital imaging. The project develops the mathematical and algorithmic foundations of superfractals and applies these results to a number of different areas, including in particular, digital imaging. For example, the ``third generation'' of mobile communications (3G), combines wireless mobile technology with high data transmission capacities. Currently the requirement for extensive bandwidth is a problem for efficient use. Superfractals and the associated colouring algorithm could be used to develop a new system to produce synthetic content for wireless devices that would require only low bandwidth.Read moreRead less