Personal tools

Univ.-Prof. Dr. Thomas Huckle

From Sccswiki

(Difference between revisions)
Jump to: navigation, search
Line 23: Line 23:
== Rätsel 2018 ==
== Rätsel 2018 ==
* [ Einschulung in Hogwarts]
* [ Einschulung in Hogwarts]
* [ Einschulung in Hogwarts 2]
== Vorkurs ==
== Vorkurs ==

Revision as of 09:03, 12 October 2018

Huckle official.jpg
Institut für Informatik
Boltzmannstr. 3
85748 Garching
MI 2.5.44
(089) 2 89 18 609
(089) 2 89 18 607
Office Hours
Tuesday, 10-11 am, room MI 2.5.44


Rätsel 2018


Research Area

Collection of Software Bugs

Mathematicians during the Third Reich and World War II

Music and Computer

  • Webpage with talk and further references on "Music and Computer"

Fraud and error in Science

Paintings from Roman history in "Il Palazzone", Cortona

  • Webpage with the paintings and links to stories explaining the paintings

Publications and more

Recent Publications

Data based regularization matrices for Tikhonov-Phillips regularization, joint work with M. Sedlacek, in PAMM.
A Blocked QR-decomposition for the Parallel Symmetric Eigenvalue Problem, joint work with T. Auckenthaler and R. Wittmann, submitted to PARCO.
Subspace iteration methods in terms of Matrix Product States, joint work with K. Waldherr, in PAMM.
Exploiting Matrix Symmetries and Physical Symmetries in Matrix Product States and Tensor Trains, joint work with K. Waldherr and T. Schulte-Herbrüggen.
Tikhonov-Phillips regularization with operator dependent seminorms, joint work with M. Sedlacek.
Data based regularization for discrete deconvolution problems, joint work with M. Sedlacek.
Computations in Quantum Tensor Networks, joint work with K. Waldherr and T. Schulte-Herbrüggen.
Compact Fourier Analysis for Multigrid Methods based on Block Symbols, joint work with Chr. Kravvaritis.
Smoothing and Regularization with Modified Sparse Approximate Inverses, joint work with M. Sedlacek. In "Journal of Electrical and Computer Engineering", Vol. 2010, Hindawi Press.
Matrix exponentials and parallel prefix computation in a quantum control problem, In "Parallel Computing, Volume 36(5-6), p. 359–369, June 2010. Special issue (PMAA08)". joint work with T. Auckenthaler, M. Bader, K. Waldherr and A. Spörl
An Efficient Parallel Implementation of the MSPAI Preconditioner, Parallel Computing 36, 273-284, joint work with A. Kallischko, A. Roy, M. Sedlacek, T. Weinzierl.
Compact Fourier Analysis for Designing Multigrid Methods, SISC 31(1), 2008.
Using the HLRB-II Cluster as a Quantum CISC-Compiler, in "High Performance Computing in Science and Engineering", Garching 2007, Springer, March 2008 (Proceedings of the HLRB-Workshop Dec. 2007), with T. Schulte-Herbrüggen, A. Spörl, K. Waldherr, S.J. Glaser.
Frobenius-Norm Minimization and Probing for Preconditioning, in IJCM 84(8), 1225-1248, 2007, joint work with A. Kallischko
Preconditioning Block Toeplitz matrices, in ETNA 29, 31-45, 2007, joint work with D. Noutsos.

Some old Publications

Multigrid Methods for Strongly Ill-Conditioned Structured Matrices, joint work with R. Fischer, Proceedings of the 8th European Multigrid Conference EMG, ECOMAS TUDelft, 2005.
Structured Matrices, Multigrid Methods, and the Helmholtz Equation, joint work with R. Fischer, Copper Mountain Conference on Iterative Methods, 2006, Student Paper Competition.
Circulant/Skewcirculant Matrices as Preconditioners for Hermitian Toeplitz Systems, in "Iterative Methods in Linear Algebra", Proceedings of the IMACS Conference in Brusselles, 1991.
Iterative Methods for Toeplitz-like Matrices, SCCM Preprint 94-5, 1994.
Using omega-circulant matrices for the preconditioning of Toeplitz systems, joint work with R. Fischer, in Selcuk J. Appl. Math. 4(2), 2003.
Sparse Approximate Inverses for Preconditioning of Linear Equations, in Conferentie van Numerik Wiskunden, Woudschoten, Zeist, 1996.
A Look-ahead Algorithm for solving Nonsymmetric Linear Toeplitz Equations, in Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, Snowbird 1994.

Folien: Lange Nacht der Universitäten

Mathe-Rätsel 2017 "Zahlenfolge"

Mathe-Rätsel 2016: "Code knacken"

Mathe-Rätsel 2015 "Star Wars"

Mathe-Rätsel 2014 "Piraten"

Mathe-Rätsel "Die Hüte von Hogwarts" 2013

Mathe-Rätsel "Das Duell der Zauberer" 2012

Mathe-Rätsel "Die drei Ringe" 2011

Wichtig: jede Art von Kommunikation der Gefährten nach dem Aufbruch von Legolas und Aragorn ist verboten, da Sauron das merken würde!

Mathe-Rätsel "Die geheime Kammer von Askaban" 2010

Wissenschaftlicher Werdegang (CV)

  • 1973 Abitur am Musikgymnasium der Regensburger Domspatzen
  • 1980 Erste Staatsprüfung für das Lehramt an Gymnasium in Mathematik/Physik an der Universität Würzburg
  • 1982 Mathematik Diplom an der Universität Würzburg
  • 1982/83 Wissenschaftliche Hilfskraft in Informatik an der Universität Würzburg
  • 1983-85 Wissenschaftliche Hilfskraft in Mathematik an der Universität Würzburg
  • 1985 Promotion zum Dr. rer. nat. an der Universität Würzburg
  • 1985-91 Akademischer Rat a.Z. in Mathematik an der Universität Würzburg
  • 1991 Habilitation zum Dr. rer. nat. habil. an der Universität Würzburg
  • 1991-93 Privatdozent in Mathematik an der Universität Würzburg
  • 1993/94 Visitor am Computer Science Department in Stanford im SCCM-Programm, DFG-Stipendium
  • 1994/95 Vertretung einer C3-Professur an der Universität Chemnitz
  • 1995 Berufung auf eine C3-Professur für Ingenieursanwendungen in der Informatik an der TU München
  • 1997 Aufnahme in die Fakultät für Mathematik an der TU München
  • 2000/01 Im Rahmen eines Forschungsfreisemesters Gast am Math. Dep. der UCLA
  • 2006 Im Rahmen eines Forschungsfreisemesters Gast an der School of Computing der University of Leeds

Zu vergebende Bachelor/Master-arbeiten, IDP's, PSE's

  • Iterative Gleichungslöser mit Drei-Term-Rekursion und Präkonditionierung
  • Untersuchung/Implementierung von dünnbesetzten approximativen Inversen auf Parallelrechnern
  • Softwareentwicklung zur Bestimmung von Eigenwerten auf Parallelrechnern
  • Softwareentwicklung zur parallel Präkonditionierung linearer Gleichungssysteme