@misc{OPUS4-1851, title = {Jahresbericht 2012}, volume = {2012}, organization = {Konrad-Zuse-Zentrum f{\"u}r Informationstechnik Berlin}, issn = {0934-5892}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-18510}, year = {2013}, language = {de} } @misc{OPUS4-1586, title = {Jahresbericht 2011}, volume = {2011}, organization = {Konrad-Zuse-Zentrum f{\"u}r Informationstechnik Berlin}, issn = {0934-5892}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-15867}, pages = {73 S.}, year = {2012}, language = {de} } @article{ApprichDieterichHoelligetal.2017, author = {Apprich, Christian and Dieterich, Annegret and H{\"o}llig, Klaus and Nava-Yazdani, Esfandiar}, title = {Cubic spline approximation of a circle with maximal smoothness and accuracy}, volume = {56}, journal = {Computer Aided Geometric Design}, publisher = {Elsevier B.V.}, doi = {10.1016/j.cagd.2017.05.001}, pages = {1 -- 3}, year = {2017}, abstract = {We construct cubic spline approximations of a circle which are four times continuously differentiable and converge with order six.}, language = {en} } @article{ZschiedrichKloseSchaedleetal.2006, author = {Zschiedrich, Lin and Klose, Roland and Sch{\"a}dle, Achim and Schmidt, Frank}, title = {A new finite element realization of the Perfectly Matched Layer Method for Helmholtz scattering problems on polygonal domains in 2D}, volume = {188}, journal = {J. Comput. Appl. Math.}, doi = {10.1016/j.cam.2005.03.047}, pages = {12 -- 32}, year = {2006}, language = {en} } @misc{OPUS4-5974, title = {Annual Report 2015}, volume = {2015}, organization = {Konrad-Zuse-Zentrum f{\"u}r Informationstechnik Berlin}, issn = {0934-5892}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-59748}, pages = {114}, year = {2016}, language = {en} } @misc{OPUS4-7494, title = {Annual Report 2017}, volume = {2017}, organization = {Konrad-Zuse-Zentrum f{\"u}r Informationstechnik Berlin}, issn = {0934-5892}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-74948}, pages = {102}, year = {2019}, language = {en} } @misc{OPUS4-7497, title = {Annual Report 2018}, volume = {2018}, organization = {Konrad-Zuse-Zentrum f{\"u}r Informationstechnik Berlin}, issn = {0934-5892}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-74971}, pages = {102}, year = {2019}, language = {en} } @misc{BaumGiliardHasleretal.2019, author = {Baum, Daniel and Giliard, Nicole and Hasler, Tim and Peters-Kottig, Wolfgang}, title = {Leitlinien zum Umgang mit Forschungsdaten am Zuse-Institut Berlin}, address = {Berlin}, doi = {10.12752/7378}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-73781}, year = {2019}, abstract = {Die nachhaltige Sicherung und Bereitstellung von Forschungsdaten dienen nicht nur der Reproduzierbarkeit fr{\"u}herer Ergebnisse, sondern in hohem Maße auch der Erzielung k{\"u}nftiger Ergebnisse mit dem Ziel, die Qualit{\"a}t, Produktivit{\"a}t und Wettbewerbsf{\"a}higkeit der Wissenschaft zu f{\"o}rdern. Die folgenden Grunds{\"a}tze gelten als Leitlinien zur Handhabung von Forschungsdaten im ZIB.}, language = {de} } @misc{Steinbach1997, author = {Steinbach, Marc}, title = {Optimal Motion Design Using Inverse Dynamics.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2818}, number = {SC-97-12}, year = {1997}, abstract = {Increasing demands on industrial robot operation call for optimal motion planning based on dynamic models. The resulting mathematical problems can be handled efficiently by sparse direct boundary value problem methods. Within this framework we propose a new solution technique that is closely related to the conventional kinematic approach: it eliminates the need for numerical integration of differential equations. First optimization results on a real life transport maneuver demonstrate that the technique may save over 50\,\\%\ computation time.}, language = {en} } @misc{HenkWeismantel1997, author = {Henk, Martin and Weismantel, Robert}, title = {Test sets of the knapsack problem and simultaneous diophantine approximation}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2825}, number = {SC-97-13}, year = {1997}, abstract = {This paper deals with the study of test sets of the knapsack problem and simultaneous diophantine approximation. The Graver test set of the knapsack problem can be derived from minimal integral solutions of linear diophantine equations. We present best possible inequalities that must be satisfied by all minimal integral solutions of a linear diophantine equation and prove that for the corresponding cone the integer analogue of Caratheodory's theorem applies when the numbers are divisible. We show that the elements of the minimal Hilbert basis of the dual cone of all minimal integral solutions of a linear diophantine equation yield best approximations of a rational vector ``from above''. A recursive algorithm for computing this Hilbert basis is discussed. We also outline an algorithm for determining a Hilbert basis of a family of cones associated with the knapsack problem.}, language = {en} }