@article{BoegeFritzeGoergenetal., author = {Boege, Tobias and Fritze, Ren{\´e} and G{\"o}rgen, Christiane and Hanselmann, Jeroen and Iglezakis, Dorothea and Kastner, Lars and Koprucki, Thomas and Krause, Tabea and Lehrenfeld, Christoph and Polla, Silvia and Reidelbach, Marco and Riedel, Christian and Saak, Jens and Schembera, Bj{\"o}rn and Tabelow, Karsten and Weber, Marcus}, title = {Research-Data Management Planning in the German Mathematical Community}, series = {Eur. Math. Soc. Mag.}, volume = {130}, journal = {Eur. Math. Soc. Mag.}, doi = {10.4171/mag/152}, pages = {40 -- 47}, abstract = {In this paper we discuss the notion of research data for the field of mathematics and report on the status quo of research-data management and planning. A number of decentralized approaches are presented and compared to needs and challenges faced in three use cases from different mathematical subdisciplines. We highlight the importance of tailoring research-data management plans to mathematicians' research processes and discuss their usage all along the data life cycle.}, language = {en} } @article{BremerJimenezThieleetal., author = {Bremer, Lucas and Jimenez, Carlos and Thiele, Simon and Weber, Ksenia and Huber, Tobias and Rodt, Sven and Herkommer, Alois and Burger, Sven and H{\"o}fling, Sven and Giessen, Harald and Reitzenstein, Stephan}, title = {Numerical optimization of single-mode fiber- coupled single-photon sources based on semiconductor quantum dots}, series = {Opt. Express}, volume = {30}, journal = {Opt. Express}, doi = {10.1364/OE.456777}, pages = {15913}, language = {en} } @article{WeberSagerGleixner, author = {Weber, Tobias and Sager, Sebastian and Gleixner, Ambros}, title = {Solving Quadratic Programs to High Precision using Scaled Iterative Refinement}, series = {Mathematical Programming Computation}, volume = {11}, journal = {Mathematical Programming Computation}, publisher = {Springer Berlin Heidelberg}, doi = {10.1007/s12532-019-00154-6}, pages = {421 -- 455}, abstract = {Quadratic optimization problems (QPs) are ubiquitous, and solution algorithms have matured to a reliable technology. However, the precision of solutions is usually limited due to the underlying floating-point operations. This may cause inconveniences when solutions are used for rigorous reasoning. We contribute on three levels to overcome this issue. First, we present a novel refinement algorithm to solve QPs to arbitrary precision. It iteratively solves refined QPs, assuming a floating-point QP solver oracle. We prove linear convergence of residuals and primal errors. Second, we provide an efficient implementation, based on SoPlex and qpOASES that is publicly available in source code. Third, we give precise reference solutions for the Maros and M{\´e}sz{\´a}ros benchmark library.}, language = {en} } @misc{WeberSagerGleixner, author = {Weber, Tobias and Sager, Sebastian and Gleixner, Ambros}, title = {Solving Quadratic Programs to High Precision using Scaled Iterative Refinement}, issn = {1438-0064}, doi = {10.1007/s12532-019-00154-6}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-68152}, abstract = {Quadratic optimization problems (QPs) are ubiquitous, and solution algorithms have matured to a reliable technology. However, the precision of solutions is usually limited due to the underlying floating-point operations. This may cause inconveniences when solutions are used for rigorous reasoning. We contribute on three levels to overcome this issue. First, we present a novel refinement algorithm to solve QPs to arbitrary precision. It iteratively solves refined QPs, assuming a floating-point QP solver oracle. We prove linear convergence of residuals and primal errors. Second, we provide an efficient implementation, based on SoPlex and qpOASES that is publicly available in source code. Third, we give precise reference solutions for the Maros and M{\´e}sz{\´a}ros benchmark library.}, language = {en} } @misc{WeberGalliat, author = {Weber, Marcus and Galliat, Tobias}, title = {Characterization of Transition States in Conformational Dynamics using Fuzzy Sets}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6791}, number = {02-12}, abstract = {Recently, a novel approach for the analysis of molecular dynamics on the basis of a transfer operator has been introduced. Therein conformations are considered to be disjoint metastable clusters within position space of a molecule. These clusters are defined by almost invariant characteristic functions that can be computed via {\em Perron Cluster} analysis. The present paper suggests to replace crisp clusters with {\em fuzzy} clusters, i.e. to replace characteristic functions with membership functions. This allows a more sufficient characterization of transiton states between different confor conformations and therefore leads to a better understanding of molecular dynamics. Fur thermore, an indicator for the uniqueness of metastable fuzzy clusters and a fast algorithm for the computation of these clusters are described. Numerical examples are included.}, language = {en} }