% Encoding: UTF-8
@COMMENT{BibTeX export based on data in FAU CRIS: https://cris.fau.de/}
@COMMENT{For any questions please write to cris-support@fau.de}
@article{faucris.107996284,
abstract = {The hierarchical hybrid grid (HHG) framework supports the parallel implementation of multigrid solvers for finite element problems. The HHG framework attempts to combine some of the flexibility of unstructured grid representations with the performance and efficiency of structured grid data structures. HHG uses a combination of regular refinement and grid decomposition that lets the solver treat structured regions of the refined grid hierarchy with stencil-based data structures. These data structures allow for the efficient implementation of standard multigrid component algorithms, in terms of both performance and memory usage. The grid is distributed among the available message-passing interface (MPI) processes to parallelize the computation. Regular refinement, applied in HHG framework, results in a nested grid hierarchy, which makes geometric multigrid methods easier to adapt to this approach.},
author = {Hülsemann, Frank and Bergen, Benjamin and Gradl, Tobias and Rüde, Ulrich},
doi = {10.1109/MCSE.2006.102},
faupublication = {yes},
journal = {Computing in Science & Engineering},
note = {UnivIS-Import:2015-03-09:Pub.2006.tech.IMMD.lsinfs.amassi},
pages = {56-62},
peerreviewed = {Yes},
title = {{A} {Massively} {Parallel} {Multigrid} {Method} for {Finite} {Elements}},
url = {http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1717316},
volume = {8},
year = {2006}
}
@misc{faucris.112679864,
author = {Gmeiner, Björn and Gradl, Tobias and Köstler, Harald and Rüde, Ulrich},
faupublication = {yes},
note = {UnivIS-Import:2016-06-30:Pub.2011.tech.IMMD.lsinfs.analys},
peerreviewed = {automatic},
title = {{Analysis} of a flat {Highly} {Parallel} {Geometric} {Multigrid} {Algorithm} for {Hierarchical} {Hybrid} {Grids}},
url = {https://www10.cs.fau.de/publications/reports/TechRep{\_}2011-03.pdf},
year = {2011}
}
@phdthesis{faucris.201214590,
author = {Gradl, Tobias},
faupublication = {yes},
peerreviewed = {automatic},
school = {Friedrich-Alexander-Universität Erlangen-Nürnberg},
title = {{Data} {Structures} and {Algorithms} for the {Optimization} of {Hierarchical} {Hybrid} {Multigrid} {Methods}},
year = {2015}
}
@inproceedings{faucris.118255104,
abstract = {Generating and analyzing the dynamics of molecular systems is a true challenge tomolecular simulation. It includes processes that happen on the femtosecond scale,such as photoinduced nonadiabatic (bio)chemical reactions, and touches the range ofseconds, being e.g. relevant in biophysics to cellular processes or in material sciencesto crack propagation. Thus, many orders of magnitude in time need to be covered eitherconcurrently or hierarchically. In the latest edition of this series of Winter Schools in 2009we addressed the topic of Multiscale Simulation Methods in Molecular Sciences with astrong focus on methods which cover diversities of length scales. The key issue of thepresent school is to dwell on hierarchical methods for dynamics having primarily in mindsystems described in terms of many atoms or molecules. One extreme end of relevant timescales is found in the sub-femtosecond range but which influence dynamical events whichare orders of magnitude slower. Examples for such phenomena might be photo-inducedswitching of individual molecules, which results in large-amplitude relaxation in liquidsor photodriven phase transitions of liquid crystals, phenomena for which nonadiabaticquantum dynamics methods were developed. The other end of relevant time scales isfound in a broad range of microseconds, seconds or beyond and which governs e.g.non-equilibrium dynamics in polymer flows or blood cells in complex geometries likemicrovessels. Special mesoscopic techniques are applied for these time- and length-scalesto couple the atomistic nature of particles to the hydrodynamics of flows....},
address = {Jülich},
author = {Gmeiner, Björn and Gradl, Tobias and Köstler, Harald and Rüde, Ulrich},
booktitle = {NIC Symposium 2012 - Proceedings},
date = {2012-03-05/2012-03-09},
faupublication = {yes},
isbn = {978-3-89336-758-0},
note = {UnivIS-Import:2015-04-16:Pub.2012.tech.IMMD.lsinfs.highly{\_}0},
pages = {323-330},
peerreviewed = {unknown},
publisher = {FZ Jülich},
series = {NIC Series},
title = {{Highly} {Parallel} {Geometric} {Multigrid} {Algorithm} for {Hierarchical} {Hybrid} {Grids}},
url = {http://hdl.handle.net/2128/4538},
venue = {Jülich},
volume = {45},
year = {2012}
}
@inproceedings{faucris.116663624,
address = {Bonn},
author = {Gradl, Tobias and Rüde, Ulrich},
booktitle = {9th Workshop on Parallel Systems and Algorithms (PASA)},
faupublication = {yes},
isbn = {978-3-88579-218-5},
note = {UnivIS-Import:2015-04-16:Pub.2008.tech.IMMD.lsinfs.highpe{\_}4},
pages = {37-45},
peerreviewed = {Yes},
publisher = {Gesellschaft für Informatik},
series = {GI Edition: Lecture Notes in Informatics},
title = {{High} {Performance} {Multigrid} on {Current} {Large} {Scale} {Parallel} {Computers}},
url = {https://www10.informatik.uni-erlangen.de/Publications/Papers/2008/Gradl{\_}PASA08.pdf},
venue = {Dresden},
volume = {124},
year = {2008}
}
@article{faucris.110317064,
author = {Gradl, Tobias and Rüde, Ulrich},
faupublication = {yes},
journal = {Innovatives Supercomputing in Deutschland : inSiDE},
note = {UnivIS-Import:2015-03-09:Pub.2007.tech.IMMD.lsinfs.massiv{\_}0},
pages = {24-29},
peerreviewed = {No},
title = {{Massively} {Parallel} {Multilevel} {Finite} {Element} {Solvers} on the {Altix} 4700},
volume = {5},
year = {2007}
}
@misc{faucris.111968384,
author = {Gradl, Tobias and Rüde, Ulrich},
faupublication = {yes},
note = {UnivIS-Import:2016-06-30:Pub.2007.tech.IMMD.lsinfs.massiv{\_}7},
peerreviewed = {automatic},
title = {{Massively} {Parallel} {Multilevel} {Finite} {Element} {Solvers} on the {Altix} 4700},
url = {https://www10.cs.fau.de/publications/reports/TechRep{\_}2007-12.pdf},
year = {2007}
}
@article{faucris.114286084,
author = {Gmeiner, Björn and Gradl, Tobias and Gaspar, Francisco and Rüde, Ulrich},
doi = {10.1016/j.camwa.2012.12.006},
faupublication = {yes},
journal = {Computers & Mathematics with Applications},
note = {UnivIS-Import:2015-03-09:Pub.2012.tech.IMMD.lsinfs.optimi{\_}5},
pages = {694-711},
peerreviewed = {unknown},
title = {{Optimization} of the multigrid-convergence rate on semi-structured meshes by local {Fourier} analysis},
url = {http://www.sciencedirect.com/science/article/pii/S089812211200702X},
volume = {65},
year = {2012}
}
@article{faucris.212633688,
abstract = {Multigrid (MG) methods are among the most efficient and widespread methods for solving large linear systems of equations that arise, for example, from the discretization of partial differential equations. In this paper we introduce a new approach for optimizing the computational cost of the full MG method to achieve a given accuracy by determining the number of MG cycles on each level. To achieve this, a very efficient and flexible Branch and Bound algorithm is developed. The implementation in the parallel finite element solver Hierarchical Hybrid Grids leads to a significant reduction in CPU time.},
author = {Thekale, A. and Gradl, Tobias and Klamroth, K. and Rüde, Ulrich},
doi = {10.1002/nla.697},
faupublication = {yes},
journal = {Numerical Linear Algebra With Applications},
note = {EAM Import::2019-03-07},
pages = {199-210},
peerreviewed = {Yes},
title = {{Optimizing} the number of multigrid cycles in the full multigrid algorithm},
volume = {17},
year = {2010}
}
@misc{faucris.214440691,
author = {Thekale, A. and Gradl, Tobias and Rüde, Ulrich and et al.},
author_hint = {Thekale Alexander, Gradl Tobias, Klamroth K., Rüde Ulrich},
faupublication = {yes},
note = {UnivIS-Import:2019-03-25:Pub.2009.tech.IMMD.lsinfs.optimi},
peerreviewed = {automatic},
support_note = {Author relations incomplete. You may find additional data in field 'author{\_}hint'},
title = {{Optimizing} the number of multigrid cycles in the full multigrid algorithm},
url = {https://www10.cs.fau.de/publications/reports/TechRep{\_}2009-05.pdf},
year = {2009}
}
@inproceedings{faucris.107335624,
abstract = {Quantum control plays a key role in quantum technology, e.g. for steering quantum hardware systems, spectrometers or superconducting solid-state devices. In terms of computation, quantum systems provide a unique potential for coherent parallelisation that may exponentially speed up algorithms as in Shor's prime factorisation. Translating quantum software into a sequence of classical controls steering the quantum hardware, viz. the quantum compilation task, lends itself to be tackled by optimal control. It is computationally demanding since the classical resources needed grow exponentially with the size of the quantum system. Here we show concepts of parallelisation tailored to run on high-end computer clusters speeding up matrix multiplication, exponentials, and trace evaluations used in numerical quantum control. In systems of 10 spin qubits, the time gain is beyond a factor of 500 on a 128-CPU cluster as compared to standard techniques on a single CPU. © Springer-Verlag Berlin Heidelberg 2006.},
address = {Berlin/Heidelberg/New York},
author = {Gradl, Tobias and Spoerl, Andreas and Huckle, Thomas and Glaser, Steffen J. and Schulte-Herbrueggen, Thomas},
booktitle = {Euro-Par 2006 - Parallel Processing},
date = {2006-08-28/2006-09-01},
faupublication = {yes},
isbn = {3-540-37783-2},
note = {UnivIS-Import:2015-04-16:Pub.2006.tech.IMMD.lsinfs.parall{\_}2},
pages = {751--762},
peerreviewed = {Yes},
publisher = {Springer-verlag},
series = {Lecture Notes in Computer Science},
title = {{Parallelising} {Matrix} {Operations} on clusters for an {Optimal}-{Control} based {Quantum} {Compiler}},
url = {http://www.springer.com/east/home/computer/communications?SGWID=5-148-22-173673509-0},
venue = {Dresden},
volume = {4128},
year = {2006}
}
@misc{faucris.110033704,
author = {Gradl, Tobias and Freundl, Christoph and Rüde, Ulrich},
faupublication = {yes},
note = {UnivIS-Import:2016-06-30:Pub.2007.tech.IMMD.lsinfs.scalab},
peerreviewed = {automatic},
title = {{Scalability} on {All} {Levels} for {Ultra}-{Large} {Scale} {Finite} {Element} {Calculations}},
url = {https://www10.cs.fau.de/publications/reports/TechRep{\_}2007-05.pdf},
year = {2007}
}
@inproceedings{faucris.115364304,
address = {Berlin Heidelberg},
author = {Gradl, Tobias and Freundl, Christoph and Köstler, Harald and Rüde, Ulrich},
booktitle = {High Performance Computing in Science and Engineering Garching-Munich 2007},
faupublication = {yes},
isbn = {978-3-540-69181-5},
note = {UnivIS-Import:2015-04-16:Pub.2008.tech.IMMD.lsinfs.scalab},
pages = {475-483},
peerreviewed = {Yes},
publisher = {Springer},
title = {{Scalable} {Multigrid}},
url = {http://link.springer.com/chapter/10.1007/978-3-540-69182-2{\_}38},
venue = {Garching},
year = {2008}
}
@incollection{faucris.112903384,
address = {Boca Raton / London / New York},
author = {Freundl, Christoph and Gradl, Tobias and Rüde, Ulrich},
booktitle = {Petascale Computing. Algorithms and Applications},
faupublication = {yes},
isbn = {978-1-58488-909-0},
note = {UnivIS-Import:2015-04-20:Pub.2008.tech.IMMD.lsinfs.toward},
pages = {375-389},
peerreviewed = {Yes},
publisher = {Chapman & Hall/CRC},
title = {{Towards} {Petascale} {Multilevel} {Finite}-{Element} {Solvers}},
year = {2008}
}