[{"abstract":[{"lang":"eng","text":"We build upon a recently proposed multi-objective view onto performance measurement of single-objective stochastic solvers. The trade-off between the fraction of failed runs and the mean runtime of successful runs \\textendash both to be minimized \\textendash is directly analyzed based on a study on algorithm selection of inexact state-of-the-art solvers for the famous Traveling Salesperson Problem (TSP). Moreover, we adopt the hypervolume indicator (HV) commonly used in multi-objective optimization for simultaneously assessing both conflicting objectives and investigate relations to commonly used performance indicators, both theoretically and empirically. Next to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV measure is used as a core concept within the construction of per-instance algorithm selection models offering interesting insights into complementary behavior of inexact TSP solvers. \\textbullet The multi-objective perspective is naturally generalizable to multiple objectives. \\textbullet Proof of relationship between HV and the PAR in the considered bi-objective space. \\textbullet New insights into complementary behavior of stochastic optimization algorithms."}],"citation":{"ieee":"J. Bossek, P. Kerschke, and H. Trautmann, “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms,” <i>Applied Soft Computing</i>, vol. 88, no. C, 2020, doi: <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>.","mla":"Bossek, Jakob, et al. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” <i>Applied Soft Computing</i>, vol. 88, no. C, 2020, doi:<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>.","apa":"Bossek, J., Kerschke, P., &#38; Trautmann, H. (2020). A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms. <i>Applied Soft Computing</i>, <i>88</i>(C). <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>","bibtex":"@article{Bossek_Kerschke_Trautmann_2020, title={A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms}, volume={88}, DOI={<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>}, number={C}, journal={Applied Soft Computing}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020} }","short":"J. Bossek, P. Kerschke, H. Trautmann, Applied Soft Computing 88 (2020).","ama":"Bossek J, Kerschke P, Trautmann H. A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms. <i>Applied Soft Computing</i>. 2020;88(C). doi:<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>","chicago":"Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” <i>Applied Soft Computing</i> 88, no. C (2020). <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>."},"issue":"C","publication":"Applied Soft Computing","department":[{"_id":"819"}],"keyword":["Algorithm selection","Combinatorial optimization","Multi-objective optimization","Performance measurement","Traveling Salesperson Problem"],"type":"journal_article","date_created":"2023-11-14T15:58:53Z","intvolume":"        88","date_updated":"2023-12-13T10:52:17Z","author":[{"id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob"},{"last_name":"Kerschke","first_name":"Pascal","full_name":"Kerschke, Pascal"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"}],"publication_identifier":{"issn":["1568-4946"]},"title":"A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms","status":"public","year":"2020","volume":88,"user_id":"102979","doi":"10.1016/j.asoc.2019.105901","_id":"48848","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"_id":"48836","user_id":"102979","author":[{"first_name":"Thomas","last_name":"Bartz-Beielstein","full_name":"Bartz-Beielstein, Thomas"},{"last_name":"Doerr","first_name":"Carola","full_name":"Doerr, Carola"},{"first_name":"Daan","last_name":"van den Berg","full_name":"van den Berg, Daan"},{"id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668"},{"last_name":"Chandrasekaran","first_name":"Sowmya","full_name":"Chandrasekaran, Sowmya"},{"full_name":"Eftimov, Tome","last_name":"Eftimov","first_name":"Tome"},{"last_name":"Fischbach","first_name":"Andreas","full_name":"Fischbach, Andreas"},{"full_name":"Kerschke, Pascal","first_name":"Pascal","last_name":"Kerschke"},{"full_name":"Cava, William La","first_name":"William La","last_name":"Cava"},{"full_name":"Lopez-Ibanez, Manuel","last_name":"Lopez-Ibanez","first_name":"Manuel"},{"full_name":"Malan, Katherine M.","first_name":"Katherine M.","last_name":"Malan"},{"first_name":"Jason H.","last_name":"Moore","full_name":"Moore, Jason H."},{"full_name":"Naujoks, Boris","last_name":"Naujoks","first_name":"Boris"},{"full_name":"Orzechowski, Patryk","first_name":"Patryk","last_name":"Orzechowski"},{"last_name":"Volz","first_name":"Vanessa","full_name":"Volz, Vanessa"},{"last_name":"Wagner","first_name":"Markus","full_name":"Wagner, Markus"},{"full_name":"Weise, Thomas","last_name":"Weise","first_name":"Thomas"}],"status":"public","title":"Benchmarking in Optimization: Best Practice and Open Issues","year":"2020","date_updated":"2023-12-13T10:52:24Z","date_created":"2023-11-14T15:58:51Z","department":[{"_id":"819"}],"type":"journal_article","citation":{"bibtex":"@article{Bartz-Beielstein_Doerr_van den Berg_Bossek_Chandrasekaran_Eftimov_Fischbach_Kerschke_Cava_Lopez-Ibanez_et al._2020, title={Benchmarking in Optimization: Best Practice and Open Issues}, journal={Corr}, author={Bartz-Beielstein, Thomas and Doerr, Carola and van den Berg, Daan and Bossek, Jakob and Chandrasekaran, Sowmya and Eftimov, Tome and Fischbach, Andreas and Kerschke, Pascal and Cava, William La and Lopez-Ibanez, Manuel and et al.}, year={2020} }","ama":"Bartz-Beielstein T, Doerr C, van den Berg D, et al. Benchmarking in Optimization: Best Practice and Open Issues. <i>Corr</i>. Published online 2020.","mla":"Bartz-Beielstein, Thomas, et al. “Benchmarking in Optimization: Best Practice and Open Issues.” <i>Corr</i>, 2020.","chicago":"Bartz-Beielstein, Thomas, Carola Doerr, Daan van den Berg, Jakob Bossek, Sowmya Chandrasekaran, Tome Eftimov, Andreas Fischbach, et al. “Benchmarking in Optimization: Best Practice and Open Issues.” <i>Corr</i>, 2020.","short":"T. Bartz-Beielstein, C. Doerr, D. van den Berg, J. Bossek, S. Chandrasekaran, T. Eftimov, A. Fischbach, P. Kerschke, W.L. Cava, M. Lopez-Ibanez, K.M. Malan, J.H. Moore, B. Naujoks, P. Orzechowski, V. Volz, M. Wagner, T. Weise, Corr (2020).","ieee":"T. Bartz-Beielstein <i>et al.</i>, “Benchmarking in Optimization: Best Practice and Open Issues,” <i>Corr</i>, 2020.","apa":"Bartz-Beielstein, T., Doerr, C., van den Berg, D., Bossek, J., Chandrasekaran, S., Eftimov, T., Fischbach, A., Kerschke, P., Cava, W. L., Lopez-Ibanez, M., Malan, K. M., Moore, J. H., Naujoks, B., Orzechowski, P., Volz, V., Wagner, M., &#38; Weise, T. (2020). Benchmarking in Optimization: Best Practice and Open Issues. <i>Corr</i>."},"publication":"Corr"},{"conference":{"name":"IEEE Vehicular Networking Conference ","location":"Los Angeles, CA"},"author":[{"full_name":"Amjad, Muhammad Sohaib","last_name":"Amjad","first_name":"Muhammad Sohaib"},{"first_name":"Tobias","last_name":"Hardes","full_name":"Hardes, Tobias","id":"35441"},{"last_name":"Schettler","first_name":"Max","full_name":"Schettler, Max"},{"last_name":"Sommer","orcid":"0000-0002-4336-7350","first_name":"Christoph","full_name":"Sommer, Christoph","id":"49154"},{"full_name":"Dressler, Falko","first_name":"Falko","orcid":"0000-0002-1989-1750","last_name":"Dressler","id":"48097"}],"publication_identifier":{"isbn":["9781728145716"]},"title":"Using Full Duplex Relaying to Reduce Physical Layer Latency in Platooning","year":"2020","status":"public","date_updated":"2024-02-08T07:58:35Z","publication_status":"published","_id":"17397","language":[{"iso":"eng"}],"doi":"10.1109/vnc48660.2019.9062784","user_id":"35441","citation":{"bibtex":"@inproceedings{Amjad_Hardes_Schettler_Sommer_Dressler_2020, title={Using Full Duplex Relaying to Reduce Physical Layer Latency in Platooning}, DOI={<a href=\"https://doi.org/10.1109/vnc48660.2019.9062784\">10.1109/vnc48660.2019.9062784</a>}, booktitle={2019 IEEE Vehicular Networking Conference (VNC)}, author={Amjad, Muhammad Sohaib and Hardes, Tobias and Schettler, Max and Sommer, Christoph and Dressler, Falko}, year={2020} }","ama":"Amjad MS, Hardes T, Schettler M, Sommer C, Dressler F. Using Full Duplex Relaying to Reduce Physical Layer Latency in Platooning. In: <i>2019 IEEE Vehicular Networking Conference (VNC)</i>. ; 2020. doi:<a href=\"https://doi.org/10.1109/vnc48660.2019.9062784\">10.1109/vnc48660.2019.9062784</a>","short":"M.S. Amjad, T. Hardes, M. Schettler, C. Sommer, F. Dressler, in: 2019 IEEE Vehicular Networking Conference (VNC), 2020.","chicago":"Amjad, Muhammad Sohaib, Tobias Hardes, Max Schettler, Christoph Sommer, and Falko Dressler. “Using Full Duplex Relaying to Reduce Physical Layer Latency in Platooning.” In <i>2019 IEEE Vehicular Networking Conference (VNC)</i>, 2020. <a href=\"https://doi.org/10.1109/vnc48660.2019.9062784\">https://doi.org/10.1109/vnc48660.2019.9062784</a>.","ieee":"M. S. Amjad, T. Hardes, M. Schettler, C. Sommer, and F. Dressler, “Using Full Duplex Relaying to Reduce Physical Layer Latency in Platooning,” presented at the IEEE Vehicular Networking Conference , Los Angeles, CA, 2020, doi: <a href=\"https://doi.org/10.1109/vnc48660.2019.9062784\">10.1109/vnc48660.2019.9062784</a>.","mla":"Amjad, Muhammad Sohaib, et al. “Using Full Duplex Relaying to Reduce Physical Layer Latency in Platooning.” <i>2019 IEEE Vehicular Networking Conference (VNC)</i>, 2020, doi:<a href=\"https://doi.org/10.1109/vnc48660.2019.9062784\">10.1109/vnc48660.2019.9062784</a>.","apa":"Amjad, M. S., Hardes, T., Schettler, M., Sommer, C., &#38; Dressler, F. (2020). Using Full Duplex Relaying to Reduce Physical Layer Latency in Platooning. <i>2019 IEEE Vehicular Networking Conference (VNC)</i>. IEEE Vehicular Networking Conference , Los Angeles, CA. <a href=\"https://doi.org/10.1109/vnc48660.2019.9062784\">https://doi.org/10.1109/vnc48660.2019.9062784</a>"},"publication":"2019 IEEE Vehicular Networking Conference (VNC)","date_created":"2020-07-17T12:22:33Z","department":[{"_id":"589"}],"type":"conference"},{"date_created":"2020-07-17T12:22:39Z","department":[{"_id":"589"}],"type":"conference","citation":{"ama":"Hardes T, Sommer C. Towards Heterogeneous Communication Strategies for Urban Platooning at Intersections. In: <i>2019 IEEE Vehicular Networking Conference (VNC)</i>. ; 2020. doi:<a href=\"https://doi.org/10.1109/vnc48660.2019.9062835\">10.1109/vnc48660.2019.9062835</a>","bibtex":"@inproceedings{Hardes_Sommer_2020, title={Towards Heterogeneous Communication Strategies for Urban Platooning at Intersections}, DOI={<a href=\"https://doi.org/10.1109/vnc48660.2019.9062835\">10.1109/vnc48660.2019.9062835</a>}, booktitle={2019 IEEE Vehicular Networking Conference (VNC)}, author={Hardes, Tobias and Sommer, Christoph}, year={2020} }","mla":"Hardes, Tobias, and Christoph Sommer. “Towards Heterogeneous Communication Strategies for Urban Platooning at Intersections.” <i>2019 IEEE Vehicular Networking Conference (VNC)</i>, 2020, doi:<a href=\"https://doi.org/10.1109/vnc48660.2019.9062835\">10.1109/vnc48660.2019.9062835</a>.","chicago":"Hardes, Tobias, and Christoph Sommer. “Towards Heterogeneous Communication Strategies for Urban Platooning at Intersections.” In <i>2019 IEEE Vehicular Networking Conference (VNC)</i>, 2020. <a href=\"https://doi.org/10.1109/vnc48660.2019.9062835\">https://doi.org/10.1109/vnc48660.2019.9062835</a>.","short":"T. Hardes, C. Sommer, in: 2019 IEEE Vehicular Networking Conference (VNC), 2020.","apa":"Hardes, T., &#38; Sommer, C. (2020). Towards Heterogeneous Communication Strategies for Urban Platooning at Intersections. <i>2019 IEEE Vehicular Networking Conference (VNC)</i>.  IEEE Vehicular Networking Conference , Los Angeles, CA. <a href=\"https://doi.org/10.1109/vnc48660.2019.9062835\">https://doi.org/10.1109/vnc48660.2019.9062835</a>","ieee":"T. Hardes and C. Sommer, “Towards Heterogeneous Communication Strategies for Urban Platooning at Intersections,” presented at the  IEEE Vehicular Networking Conference , Los Angeles, CA, 2020, doi: <a href=\"https://doi.org/10.1109/vnc48660.2019.9062835\">10.1109/vnc48660.2019.9062835</a>."},"publication":"2019 IEEE Vehicular Networking Conference (VNC)","abstract":[{"text":"Platooning promises to solve worldwide traffic problems by using wireless communication for tight control of convoys of vehicles to reduce their inter-vehicle gaps. To date, however, most research on platooning has focused on freeway scenarios. In this paper, we provide a realistic exploration of platooning in urban environments: We consider traffic lights and buildings, realistic vehicle dynamics, platooning controllers, and network communication. We highlight the challenges that urban platooning faces because of the particularities of the Radio Frequency (RF) channel, specifically near the centers of intersections. We demonstrate that using Visible Light Communication (VLC) as an alternative can alleviate some problems, but causes others. Using extensive simulations, we show how a situation-aware combination of VLC and RF communication can be used as a solution: It reduces the overall amount of lost information by approx. 85% compared to traditional approaches.","lang":"eng"}],"language":[{"iso":"eng"}],"_id":"17399","doi":"10.1109/vnc48660.2019.9062835","user_id":"35441","conference":{"location":"Los Angeles, CA","name":" IEEE Vehicular Networking Conference "},"publication_identifier":{"isbn":["9781728145716"]},"author":[{"last_name":"Hardes","first_name":"Tobias","full_name":"Hardes, Tobias","id":"35441"},{"orcid":"0000-0002-4336-7350","last_name":"Sommer","first_name":"Christoph","full_name":"Sommer, Christoph","id":"49154"}],"title":"Towards Heterogeneous Communication Strategies for Urban Platooning at Intersections","year":"2020","status":"public","date_updated":"2024-02-08T07:59:21Z","publication_status":"published"},{"title":"Spectral Properties of Convex Bodies","year":"2020","status":"public","author":[{"id":"220","last_name":"Hilgert","first_name":"Joachim","full_name":"Hilgert, Joachim"},{"full_name":"Barnum, H.","first_name":"H.","last_name":"Barnum"}],"publication_status":"published","date_updated":"2024-02-19T06:39:48Z","intvolume":"        30","page":"315-344","language":[{"iso":"eng"}],"_id":"51386","user_id":"49063","volume":30,"publication":"J. of Lie Theory","citation":{"mla":"Hilgert, Joachim, and H. Barnum. “Spectral Properties of Convex Bodies.” <i>J. of Lie Theory</i>, vol. 30, 2020, pp. 315–44.","ama":"Hilgert J, Barnum H. Spectral Properties of Convex Bodies. <i>J of Lie Theory</i>. 2020;30:315-344.","bibtex":"@article{Hilgert_Barnum_2020, title={Spectral Properties of Convex Bodies}, volume={30}, journal={J. of Lie Theory}, author={Hilgert, Joachim and Barnum, H.}, year={2020}, pages={315–344} }","apa":"Hilgert, J., &#38; Barnum, H. (2020). Spectral Properties of Convex Bodies. <i>J. of Lie Theory</i>, <i>30</i>, 315–344.","ieee":"J. Hilgert and H. Barnum, “Spectral Properties of Convex Bodies,” <i>J. of Lie Theory</i>, vol. 30, pp. 315–344, 2020.","short":"J. Hilgert, H. Barnum, J. of Lie Theory 30 (2020) 315–344.","chicago":"Hilgert, Joachim, and H. Barnum. “Spectral Properties of Convex Bodies.” <i>J. of Lie Theory</i> 30 (2020): 315–44."},"date_created":"2024-02-19T06:37:21Z","type":"journal_article","department":[{"_id":"91"}]},{"user_id":"49063","doi":"10.1007/s00591-020-00282-4","volume":67,"page":"301–305","_id":"51559","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2024-02-20T10:03:50Z","intvolume":"        67","year":"2020","status":"public","title":"Titu Andreescu und Vlad Crisan: Mathematical Induction – A powerful and elegant method of proof. XYZ Press 2017 und Florian André Dalwigk: Vollständige Induktion – Beispiele und Aufgaben bis zum Umfallen. Springer Spektrum 2019","author":[{"full_name":"Hilgert, Joachim","last_name":"Hilgert","first_name":"Joachim","id":"220"}],"type":"review","department":[{"_id":"91"}],"date_created":"2024-02-20T10:01:02Z","publication":"Mathematische Semesterberichte","citation":{"bibtex":"@article{Hilgert_2020, title={Titu Andreescu und Vlad Crisan: Mathematical Induction – A powerful and elegant method of proof. XYZ Press 2017 und Florian André Dalwigk: Vollständige Induktion – Beispiele und Aufgaben bis zum Umfallen. Springer Spektrum 2019}, volume={67}, DOI={<a href=\"https://doi.org/10.1007/s00591-020-00282-4\">10.1007/s00591-020-00282-4</a>}, journal={Mathematische Semesterberichte}, author={Hilgert, Joachim}, year={2020}, pages={301–305} }","chicago":"Hilgert, Joachim. “Titu Andreescu Und Vlad Crisan: Mathematical Induction – A Powerful and Elegant Method of Proof. XYZ Press 2017 Und Florian André Dalwigk: Vollständige Induktion – Beispiele Und Aufgaben Bis Zum Umfallen. Springer Spektrum 2019.” <i>Mathematische Semesterberichte</i>, 2020. <a href=\"https://doi.org/10.1007/s00591-020-00282-4\">https://doi.org/10.1007/s00591-020-00282-4</a>.","short":"J. Hilgert, Mathematische Semesterberichte 67 (2020) 301–305.","ama":"Hilgert J. Titu Andreescu und Vlad Crisan: Mathematical Induction – A powerful and elegant method of proof. XYZ Press 2017 und Florian André Dalwigk: Vollständige Induktion – Beispiele und Aufgaben bis zum Umfallen. Springer Spektrum 2019. <i>Mathematische Semesterberichte</i>. 2020;67:301–305. doi:<a href=\"https://doi.org/10.1007/s00591-020-00282-4\">10.1007/s00591-020-00282-4</a>","ieee":"J. Hilgert, “Titu Andreescu und Vlad Crisan: Mathematical Induction – A powerful and elegant method of proof. XYZ Press 2017 und Florian André Dalwigk: Vollständige Induktion – Beispiele und Aufgaben bis zum Umfallen. Springer Spektrum 2019,” <i>Mathematische Semesterberichte</i>, vol. 67. pp. 301–305, 2020, doi: <a href=\"https://doi.org/10.1007/s00591-020-00282-4\">10.1007/s00591-020-00282-4</a>.","apa":"Hilgert, J. (2020). Titu Andreescu und Vlad Crisan: Mathematical Induction – A powerful and elegant method of proof. XYZ Press 2017 und Florian André Dalwigk: Vollständige Induktion – Beispiele und Aufgaben bis zum Umfallen. Springer Spektrum 2019. In <i>Mathematische Semesterberichte</i> (Vol. 67, pp. 301–305). <a href=\"https://doi.org/10.1007/s00591-020-00282-4\">https://doi.org/10.1007/s00591-020-00282-4</a>","mla":"Hilgert, Joachim. “Titu Andreescu Und Vlad Crisan: Mathematical Induction – A Powerful and Elegant Method of Proof. XYZ Press 2017 Und Florian André Dalwigk: Vollständige Induktion – Beispiele Und Aufgaben Bis Zum Umfallen. Springer Spektrum 2019.” <i>Mathematische Semesterberichte</i>, vol. 67, 2020, pp. 301–305, doi:<a href=\"https://doi.org/10.1007/s00591-020-00282-4\">10.1007/s00591-020-00282-4</a>."}},{"citation":{"short":"J. Hilgert, Mathematische Semesterberichte 67 (2020) 307–309.","chicago":"Hilgert, Joachim. “Fabio Toscano: The Secret Formula – How a Mathematical Duel Inflamed Renaissance Italy and Uncovered the Cubic Equation. Princeton University Press 2020.” <i>Mathematische Semesterberichte</i>, 2020. <a href=\"https://doi.org/10.1007/s00591-020-00283-3\">https://doi.org/10.1007/s00591-020-00283-3</a>.","ieee":"J. Hilgert, “Fabio Toscano: The Secret Formula – How a Mathematical Duel Inflamed Renaissance Italy and Uncovered the Cubic Equation. Princeton University Press 2020,” <i>Mathematische Semesterberichte</i>, vol. 67. pp. 307–309, 2020, doi: <a href=\"https://doi.org/10.1007/s00591-020-00283-3\">10.1007/s00591-020-00283-3</a>.","apa":"Hilgert, J. (2020). Fabio Toscano: The Secret Formula – How a Mathematical Duel Inflamed Renaissance Italy and Uncovered the Cubic Equation. Princeton University Press 2020. In <i>Mathematische Semesterberichte</i> (Vol. 67, pp. 307–309). <a href=\"https://doi.org/10.1007/s00591-020-00283-3\">https://doi.org/10.1007/s00591-020-00283-3</a>","bibtex":"@article{Hilgert_2020, title={Fabio Toscano: The Secret Formula – How a Mathematical Duel Inflamed Renaissance Italy and Uncovered the Cubic Equation. Princeton University Press 2020}, volume={67}, DOI={<a href=\"https://doi.org/10.1007/s00591-020-00283-3\">10.1007/s00591-020-00283-3</a>}, journal={Mathematische Semesterberichte}, author={Hilgert, Joachim}, year={2020}, pages={307–309} }","ama":"Hilgert J. Fabio Toscano: The Secret Formula – How a Mathematical Duel Inflamed Renaissance Italy and Uncovered the Cubic Equation. Princeton University Press 2020. <i>Mathematische Semesterberichte</i>. 2020;67:307–309. doi:<a href=\"https://doi.org/10.1007/s00591-020-00283-3\">10.1007/s00591-020-00283-3</a>","mla":"Hilgert, Joachim. “Fabio Toscano: The Secret Formula – How a Mathematical Duel Inflamed Renaissance Italy and Uncovered the Cubic Equation. Princeton University Press 2020.” <i>Mathematische Semesterberichte</i>, vol. 67, 2020, pp. 307–309, doi:<a href=\"https://doi.org/10.1007/s00591-020-00283-3\">10.1007/s00591-020-00283-3</a>."},"publication":"Mathematische Semesterberichte","department":[{"_id":"91"}],"type":"review","date_created":"2024-02-20T09:53:55Z","intvolume":"        67","date_updated":"2024-02-20T10:03:46Z","publication_status":"published","author":[{"last_name":"Hilgert","first_name":"Joachim","full_name":"Hilgert, Joachim","id":"220"}],"year":"2020","status":"public","title":"Fabio Toscano: The Secret Formula – How a Mathematical Duel Inflamed Renaissance Italy and Uncovered the Cubic Equation. Princeton University Press 2020","volume":67,"doi":"10.1007/s00591-020-00283-3","user_id":"49063","language":[{"iso":"eng"}],"_id":"51557","page":"307–309"},{"date_updated":"2024-02-20T10:04:02Z","publication_status":"published","intvolume":"        67","title":"Robert Bosch: OPT ART – From Mathematical Optimization to Visual Design. Princeton University Press 2019","year":"2020","status":"public","author":[{"full_name":"Hilgert, Joachim","first_name":"Joachim","last_name":"Hilgert","id":"220"}],"doi":"10.1007/s00591-020-00272-6","user_id":"49063","volume":67,"page":"123–124","_id":"51561","language":[{"iso":"eng"}],"publication":"Mathematische Semesterberichte","citation":{"bibtex":"@article{Hilgert_2020, title={Robert Bosch: OPT ART – From Mathematical Optimization to Visual Design. Princeton University Press 2019}, volume={67}, DOI={<a href=\"https://doi.org/10.1007/s00591-020-00272-6\">10.1007/s00591-020-00272-6</a>}, journal={Mathematische Semesterberichte}, author={Hilgert, Joachim}, year={2020}, pages={123–124} }","ama":"Hilgert J. Robert Bosch: OPT ART – From Mathematical Optimization to Visual Design. Princeton University Press 2019. <i>Mathematische Semesterberichte</i>. 2020;67:123–124. doi:<a href=\"https://doi.org/10.1007/s00591-020-00272-6\">10.1007/s00591-020-00272-6</a>","mla":"Hilgert, Joachim. “Robert Bosch: OPT ART – From Mathematical Optimization to Visual Design. Princeton University Press 2019.” <i>Mathematische Semesterberichte</i>, vol. 67, 2020, pp. 123–124, doi:<a href=\"https://doi.org/10.1007/s00591-020-00272-6\">10.1007/s00591-020-00272-6</a>.","short":"J. Hilgert, Mathematische Semesterberichte 67 (2020) 123–124.","chicago":"Hilgert, Joachim. “Robert Bosch: OPT ART – From Mathematical Optimization to Visual Design. Princeton University Press 2019.” <i>Mathematische Semesterberichte</i>, 2020. <a href=\"https://doi.org/10.1007/s00591-020-00272-6\">https://doi.org/10.1007/s00591-020-00272-6</a>.","ieee":"J. Hilgert, “Robert Bosch: OPT ART – From Mathematical Optimization to Visual Design. Princeton University Press 2019,” <i>Mathematische Semesterberichte</i>, vol. 67. pp. 123–124, 2020, doi: <a href=\"https://doi.org/10.1007/s00591-020-00272-6\">10.1007/s00591-020-00272-6</a>.","apa":"Hilgert, J. (2020). Robert Bosch: OPT ART – From Mathematical Optimization to Visual Design. Princeton University Press 2019. In <i>Mathematische Semesterberichte</i> (Vol. 67, pp. 123–124). <a href=\"https://doi.org/10.1007/s00591-020-00272-6\">https://doi.org/10.1007/s00591-020-00272-6</a>"},"type":"review","department":[{"_id":"91"}],"date_created":"2024-02-20T10:03:14Z"},{"intvolume":"        67","date_updated":"2024-02-20T10:03:56Z","publication_status":"published","author":[{"last_name":"Hilgert","first_name":"Joachim","full_name":"Hilgert, Joachim","id":"220"}],"title":"David M. Bressoud: Calculus Reordered -- A History of the Big Ideas. Princeton University Press 2019","year":"2020","status":"public","volume":67,"doi":"10.1007/s00591-020-00280-6","user_id":"49063","language":[{"iso":"eng"}],"_id":"51560","page":"297–299","citation":{"ama":"Hilgert J. David M. Bressoud: Calculus Reordered -- A History of the Big Ideas. Princeton University Press 2019. <i>Mathematische Semesterberichte</i>. 2020;67:297–299. doi:<a href=\"https://doi.org/10.1007/s00591-020-00280-6\">10.1007/s00591-020-00280-6</a>","bibtex":"@article{Hilgert_2020, title={David M. Bressoud: Calculus Reordered -- A History of the Big Ideas. Princeton University Press 2019}, volume={67}, DOI={<a href=\"https://doi.org/10.1007/s00591-020-00280-6\">10.1007/s00591-020-00280-6</a>}, journal={Mathematische Semesterberichte}, author={Hilgert, Joachim}, year={2020}, pages={297–299} }","mla":"Hilgert, Joachim. “David M. Bressoud: Calculus Reordered -- A History of the Big Ideas. Princeton University Press 2019.” <i>Mathematische Semesterberichte</i>, vol. 67, 2020, pp. 297–299, doi:<a href=\"https://doi.org/10.1007/s00591-020-00280-6\">10.1007/s00591-020-00280-6</a>.","chicago":"Hilgert, Joachim. “David M. Bressoud: Calculus Reordered -- A History of the Big Ideas. Princeton University Press 2019.” <i>Mathematische Semesterberichte</i>, 2020. <a href=\"https://doi.org/10.1007/s00591-020-00280-6\">https://doi.org/10.1007/s00591-020-00280-6</a>.","short":"J. Hilgert, Mathematische Semesterberichte 67 (2020) 297–299.","apa":"Hilgert, J. (2020). David M. Bressoud: Calculus Reordered -- A History of the Big Ideas. Princeton University Press 2019. In <i>Mathematische Semesterberichte</i> (Vol. 67, pp. 297–299). <a href=\"https://doi.org/10.1007/s00591-020-00280-6\">https://doi.org/10.1007/s00591-020-00280-6</a>","ieee":"J. Hilgert, “David M. Bressoud: Calculus Reordered -- A History of the Big Ideas. Princeton University Press 2019,” <i>Mathematische Semesterberichte</i>, vol. 67. pp. 297–299, 2020, doi: <a href=\"https://doi.org/10.1007/s00591-020-00280-6\">10.1007/s00591-020-00280-6</a>."},"publication":"Mathematische Semesterberichte","department":[{"_id":"91"}],"type":"review","date_created":"2024-02-20T10:02:16Z"},{"intvolume":"        67","publication_status":"published","date_updated":"2024-02-20T10:10:24Z","author":[{"first_name":"Joachim","last_name":"Hilgert","full_name":"Hilgert, Joachim","id":"220"}],"status":"public","year":"2020","title":"Daniel Grieser: Mathematisches Problemlösen und Beweisen – Eine Entdeckungsreise in die Mathematik. 2. Auflage (Springer 2017)","volume":67,"user_id":"49063","doi":"10.1007/s00591-019-00254-3","language":[{"iso":"ger"}],"_id":"51564","page":"97–98","citation":{"mla":"Hilgert, Joachim. “Daniel Grieser: Mathematisches Problemlösen und Beweisen – Eine Entdeckungsreise in die Mathematik. 2. Auflage (Springer 2017).” <i>Mathematische Semesterberichte</i>, vol. 67, 2020, pp. 97–98, doi:<a href=\"https://doi.org/10.1007/s00591-019-00254-3\">10.1007/s00591-019-00254-3</a>.","bibtex":"@article{Hilgert_2020, title={Daniel Grieser: Mathematisches Problemlösen und Beweisen – Eine Entdeckungsreise in die Mathematik. 2. Auflage (Springer 2017)}, volume={67}, DOI={<a href=\"https://doi.org/10.1007/s00591-019-00254-3\">10.1007/s00591-019-00254-3</a>}, journal={Mathematische Semesterberichte}, author={Hilgert, Joachim}, year={2020}, pages={97–98} }","ama":"Hilgert J. Daniel Grieser: Mathematisches Problemlösen und Beweisen – Eine Entdeckungsreise in die Mathematik. 2. Auflage (Springer 2017). <i>Mathematische Semesterberichte</i>. 2020;67:97–98. doi:<a href=\"https://doi.org/10.1007/s00591-019-00254-3\">10.1007/s00591-019-00254-3</a>","ieee":"J. Hilgert, “Daniel Grieser: Mathematisches Problemlösen und Beweisen – Eine Entdeckungsreise in die Mathematik. 2. Auflage (Springer 2017),” <i>Mathematische Semesterberichte</i>, vol. 67. pp. 97–98, 2020, doi: <a href=\"https://doi.org/10.1007/s00591-019-00254-3\">10.1007/s00591-019-00254-3</a>.","apa":"Hilgert, J. (2020). Daniel Grieser: Mathematisches Problemlösen und Beweisen – Eine Entdeckungsreise in die Mathematik. 2. Auflage (Springer 2017). In <i>Mathematische Semesterberichte</i> (Vol. 67, pp. 97–98). <a href=\"https://doi.org/10.1007/s00591-019-00254-3\">https://doi.org/10.1007/s00591-019-00254-3</a>","chicago":"Hilgert, Joachim. “Daniel Grieser: Mathematisches Problemlösen und Beweisen – Eine Entdeckungsreise in die Mathematik. 2. Auflage (Springer 2017).” <i>Mathematische Semesterberichte</i>, 2020. <a href=\"https://doi.org/10.1007/s00591-019-00254-3\">https://doi.org/10.1007/s00591-019-00254-3</a>.","short":"J. Hilgert, Mathematische Semesterberichte 67 (2020) 97–98."},"publication":"Mathematische Semesterberichte","department":[{"_id":"91"}],"type":"review","date_created":"2024-02-20T10:06:36Z"},{"date_created":"2024-02-20T10:05:17Z","type":"review","department":[{"_id":"91"}],"publication":"Mathematische Semesterberichte","citation":{"mla":"Hilgert, Joachim. “Claas Lattmann: Mathematische Modellierung bai Platon zwischen Thales und Euklid (De Gruyter 2019).” <i>Mathematische Semesterberichte</i>, vol. 67, 2020, pp. 109–111, doi:<a href=\"https://doi.org/10.1007/s00591-019-00254-3\">10.1007/s00591-019-00254-3</a>.","ama":"Hilgert J. Claas Lattmann: Mathematische Modellierung bai Platon zwischen Thales und Euklid (De Gruyter 2019). <i>Mathematische Semesterberichte</i>. 2020;67:109–111. doi:<a href=\"https://doi.org/10.1007/s00591-019-00254-3\">10.1007/s00591-019-00254-3</a>","bibtex":"@article{Hilgert_2020, title={Claas Lattmann: Mathematische Modellierung bai Platon zwischen Thales und Euklid (De Gruyter 2019)}, volume={67}, DOI={<a href=\"https://doi.org/10.1007/s00591-019-00254-3\">10.1007/s00591-019-00254-3</a>}, journal={Mathematische Semesterberichte}, author={Hilgert, Joachim}, year={2020}, pages={109–111} }","apa":"Hilgert, J. (2020). Claas Lattmann: Mathematische Modellierung bai Platon zwischen Thales und Euklid (De Gruyter 2019). In <i>Mathematische Semesterberichte</i> (Vol. 67, pp. 109–111). <a href=\"https://doi.org/10.1007/s00591-019-00254-3\">https://doi.org/10.1007/s00591-019-00254-3</a>","ieee":"J. Hilgert, “Claas Lattmann: Mathematische Modellierung bai Platon zwischen Thales und Euklid (De Gruyter 2019),” <i>Mathematische Semesterberichte</i>, vol. 67. pp. 109–111, 2020, doi: <a href=\"https://doi.org/10.1007/s00591-019-00254-3\">10.1007/s00591-019-00254-3</a>.","chicago":"Hilgert, Joachim. “Claas Lattmann: Mathematische Modellierung bai Platon zwischen Thales und Euklid (De Gruyter 2019).” <i>Mathematische Semesterberichte</i>, 2020. <a href=\"https://doi.org/10.1007/s00591-019-00254-3\">https://doi.org/10.1007/s00591-019-00254-3</a>.","short":"J. Hilgert, Mathematische Semesterberichte 67 (2020) 109–111."},"page":"109–111","language":[{"iso":"ger"}],"_id":"51563","user_id":"49063","doi":"10.1007/s00591-019-00254-3","volume":67,"year":"2020","title":"Claas Lattmann: Mathematische Modellierung bai Platon zwischen Thales und Euklid (De Gruyter 2019)","status":"public","author":[{"full_name":"Hilgert, Joachim","first_name":"Joachim","last_name":"Hilgert"}],"publication_status":"published","date_updated":"2024-02-20T10:10:28Z","intvolume":"        67"},{"citation":{"ama":"Poeplau M, Ester S, Henning B, Wagner T. Zinkoxid als photostabiler Luminophor zur optischen Sauerstoffdetektion. In: AMA Service GmbH, Von-Münchhausen-Str. 49, 31515 Wunstorf; 2020. doi:<a href=\"https://doi.org/10.5162/sensoren2019/5.2.3\">10.5162/sensoren2019/5.2.3</a>","bibtex":"@inproceedings{Poeplau_Ester_Henning_Wagner_2020, title={Zinkoxid als photostabiler Luminophor zur optischen Sauerstoffdetektion}, DOI={<a href=\"https://doi.org/10.5162/sensoren2019/5.2.3\">10.5162/sensoren2019/5.2.3</a>}, publisher={AMA Service GmbH, Von-Münchhausen-Str. 49, 31515 Wunstorf}, author={Poeplau, Michael and Ester, Stephan and Henning, Bernd and Wagner, Thorsten}, year={2020} }","mla":"Poeplau, Michael, et al. <i>Zinkoxid Als Photostabiler Luminophor Zur Optischen Sauerstoffdetektion</i>. AMA Service GmbH, Von-Münchhausen-Str. 49, 31515 Wunstorf, 2020, doi:<a href=\"https://doi.org/10.5162/sensoren2019/5.2.3\">10.5162/sensoren2019/5.2.3</a>.","short":"M. Poeplau, S. Ester, B. Henning, T. Wagner, in: AMA Service GmbH, Von-Münchhausen-Str. 49, 31515 Wunstorf, 2020.","chicago":"Poeplau, Michael, Stephan Ester, Bernd Henning, and Thorsten Wagner. “Zinkoxid Als Photostabiler Luminophor Zur Optischen Sauerstoffdetektion.” AMA Service GmbH, Von-Münchhausen-Str. 49, 31515 Wunstorf, 2020. <a href=\"https://doi.org/10.5162/sensoren2019/5.2.3\">https://doi.org/10.5162/sensoren2019/5.2.3</a>.","apa":"Poeplau, M., Ester, S., Henning, B., &#38; Wagner, T. (2020). <i>Zinkoxid als photostabiler Luminophor zur optischen Sauerstoffdetektion</i>. <a href=\"https://doi.org/10.5162/sensoren2019/5.2.3\">https://doi.org/10.5162/sensoren2019/5.2.3</a>","ieee":"M. Poeplau, S. Ester, B. Henning, and T. Wagner, “Zinkoxid als photostabiler Luminophor zur optischen Sauerstoffdetektion,” 2020, doi: <a href=\"https://doi.org/10.5162/sensoren2019/5.2.3\">10.5162/sensoren2019/5.2.3</a>."},"date_created":"2024-02-26T12:13:04Z","type":"conference","department":[{"_id":"49"}],"status":"public","year":"2020","title":"Zinkoxid als photostabiler Luminophor zur optischen Sauerstoffdetektion","author":[{"full_name":"Poeplau, Michael","last_name":"Poeplau","first_name":"Michael"},{"last_name":"Ester","first_name":"Stephan","full_name":"Ester, Stephan"},{"first_name":"Bernd","last_name":"Henning","full_name":"Henning, Bernd","id":"213"},{"last_name":"Wagner","first_name":"Thorsten","full_name":"Wagner, Thorsten"}],"publication_status":"published","date_updated":"2024-02-26T12:17:27Z","language":[{"iso":"eng"}],"_id":"51879","publisher":"AMA Service GmbH, Von-Münchhausen-Str. 49, 31515 Wunstorf","user_id":"15911","doi":"10.5162/sensoren2019/5.2.3"},{"citation":{"chicago":"Baader, Franz, Stefan Borgwardt, Patrick Koopmann, Veronika Thost, and Anni-Yasmin Turhan. “Semantic Technologies for Situation Awareness.” <i>Künstliche Intell.</i> 34, no. 4 (2020): 543–550. <a href=\"https://doi.org/10.1007/S13218-020-00694-3\">https://doi.org/10.1007/S13218-020-00694-3</a>.","short":"F. Baader, S. Borgwardt, P. Koopmann, V. Thost, A.-Y. Turhan, Künstliche Intell. 34 (2020) 543–550.","ieee":"F. Baader, S. Borgwardt, P. Koopmann, V. Thost, and A.-Y. Turhan, “Semantic Technologies for Situation Awareness,” <i>Künstliche Intell.</i>, vol. 34, no. 4, pp. 543–550, 2020, doi: <a href=\"https://doi.org/10.1007/S13218-020-00694-3\">10.1007/S13218-020-00694-3</a>.","apa":"Baader, F., Borgwardt, S., Koopmann, P., Thost, V., &#38; Turhan, A.-Y. (2020). Semantic Technologies for Situation Awareness. <i>Künstliche Intell.</i>, <i>34</i>(4), 543–550. <a href=\"https://doi.org/10.1007/S13218-020-00694-3\">https://doi.org/10.1007/S13218-020-00694-3</a>","bibtex":"@article{Baader_Borgwardt_Koopmann_Thost_Turhan_2020, title={Semantic Technologies for Situation Awareness}, volume={34}, DOI={<a href=\"https://doi.org/10.1007/S13218-020-00694-3\">10.1007/S13218-020-00694-3</a>}, number={4}, journal={Künstliche Intell.}, author={Baader, Franz and Borgwardt, Stefan and Koopmann, Patrick and Thost, Veronika and Turhan, Anni-Yasmin}, year={2020}, pages={543–550} }","ama":"Baader F, Borgwardt S, Koopmann P, Thost V, Turhan A-Y. Semantic Technologies for Situation Awareness. <i>Künstliche Intell</i>. 2020;34(4):543–550. doi:<a href=\"https://doi.org/10.1007/S13218-020-00694-3\">10.1007/S13218-020-00694-3</a>","mla":"Baader, Franz, et al. “Semantic Technologies for Situation Awareness.” <i>Künstliche Intell.</i>, vol. 34, no. 4, 2020, pp. 543–550, doi:<a href=\"https://doi.org/10.1007/S13218-020-00694-3\">10.1007/S13218-020-00694-3</a>."},"publication":"Künstliche Intell.","issue":"4","date_created":"2024-03-26T10:55:50Z","department":[{"_id":"888"}],"type":"journal_article","author":[{"last_name":"Baader","first_name":"Franz","full_name":"Baader, Franz"},{"last_name":"Borgwardt","first_name":"Stefan","full_name":"Borgwardt, Stefan"},{"first_name":"Patrick","last_name":"Koopmann","full_name":"Koopmann, Patrick"},{"last_name":"Thost","first_name":"Veronika","full_name":"Thost, Veronika"},{"id":"104470","full_name":"Turhan, Anni-Yasmin","first_name":"Anni-Yasmin","last_name":"Turhan"}],"year":"2020","title":"Semantic Technologies for Situation Awareness","status":"public","intvolume":"        34","date_updated":"2024-03-26T10:56:01Z","language":[{"iso":"eng"}],"_id":"52930","page":"543–550","volume":34,"doi":"10.1007/S13218-020-00694-3","user_id":"9503"},{"citation":{"chicago":"Hipp, David, and Balázs Kovács. “Finite Element Error Analysis of Wave Equations with Dynamic Boundary Conditions: <i>L</i>2 Estimates.” <i>IMA Journal of Numerical Analysis</i> 41, no. 1 (2020): 638–728. <a href=\"https://doi.org/10.1093/imanum/drz073\">https://doi.org/10.1093/imanum/drz073</a>.","short":"D. Hipp, B. Kovács, IMA Journal of Numerical Analysis 41 (2020) 638–728.","apa":"Hipp, D., &#38; Kovács, B. (2020). Finite element error analysis of wave equations with dynamic boundary conditions: <i>L</i>2 estimates. <i>IMA Journal of Numerical Analysis</i>, <i>41</i>(1), 638–728. <a href=\"https://doi.org/10.1093/imanum/drz073\">https://doi.org/10.1093/imanum/drz073</a>","ieee":"D. Hipp and B. Kovács, “Finite element error analysis of wave equations with dynamic boundary conditions: <i>L</i>2 estimates,” <i>IMA Journal of Numerical Analysis</i>, vol. 41, no. 1, pp. 638–728, 2020, doi: <a href=\"https://doi.org/10.1093/imanum/drz073\">10.1093/imanum/drz073</a>.","ama":"Hipp D, Kovács B. Finite element error analysis of wave equations with dynamic boundary conditions: <i>L</i>2 estimates. <i>IMA Journal of Numerical Analysis</i>. 2020;41(1):638-728. doi:<a href=\"https://doi.org/10.1093/imanum/drz073\">10.1093/imanum/drz073</a>","bibtex":"@article{Hipp_Kovács_2020, title={Finite element error analysis of wave equations with dynamic boundary conditions: <i>L</i>2 estimates}, volume={41}, DOI={<a href=\"https://doi.org/10.1093/imanum/drz073\">10.1093/imanum/drz073</a>}, number={1}, journal={IMA Journal of Numerical Analysis}, publisher={Oxford University Press (OUP)}, author={Hipp, David and Kovács, Balázs}, year={2020}, pages={638–728} }","mla":"Hipp, David, and Balázs Kovács. “Finite Element Error Analysis of Wave Equations with Dynamic Boundary Conditions: <i>L</i>2 Estimates.” <i>IMA Journal of Numerical Analysis</i>, vol. 41, no. 1, Oxford University Press (OUP), 2020, pp. 638–728, doi:<a href=\"https://doi.org/10.1093/imanum/drz073\">10.1093/imanum/drz073</a>."},"status":"public","user_id":"100441","volume":41,"page":"638-728","publisher":"Oxford University Press (OUP)","_id":"45954","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>$L^2$ norm error estimates of semi- and full discretizations of wave equations with dynamic boundary conditions, using bulk–surface finite elements and Runge–Kutta methods, are studied. The analysis rests on an abstract formulation and error estimates, via energy techniques, within this abstract setting. Four prototypical linear wave equations with dynamic boundary conditions are analysed, which fit into the abstract framework. For problems with velocity terms or with acoustic boundary conditions we prove surprising results: for such problems the spatial convergence order is shown to be less than 2. These can also be observed in the presented numerical experiments.</jats:p>"}],"issue":"1","publication":"IMA Journal of Numerical Analysis","type":"journal_article","keyword":["Applied Mathematics","Computational Mathematics","General Mathematics"],"department":[{"_id":"841"}],"date_created":"2023-07-10T11:42:43Z","date_updated":"2024-04-03T09:14:14Z","publication_status":"published","intvolume":"        41","year":"2020","title":"Finite element error analysis of wave equations with dynamic boundary conditions: <i>L</i>2 estimates","author":[{"full_name":"Hipp, David","last_name":"Hipp","first_name":"David"},{"full_name":"Kovács, Balázs","last_name":"Kovács","first_name":"Balázs"}],"publication_identifier":{"issn":["0272-4979","1464-3642"]},"doi":"10.1093/imanum/drz073","language":[{"iso":"eng"}]},{"publication":"IMA Journal of Numerical Analysis","issue":"1","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>$L^2$ norm error estimates of semi- and full discretizations of wave equations with dynamic boundary conditions, using bulk–surface finite elements and Runge–Kutta methods, are studied. The analysis rests on an abstract formulation and error estimates, via energy techniques, within this abstract setting. Four prototypical linear wave equations with dynamic boundary conditions are analysed, which fit into the abstract framework. For problems with velocity terms or with acoustic boundary conditions we prove surprising results: for such problems the spatial convergence order is shown to be less than 2. These can also be observed in the presented numerical experiments.</jats:p>"}],"date_created":"2023-07-10T11:42:31Z","keyword":["Applied Mathematics","Computational Mathematics","General Mathematics"],"type":"journal_article","department":[{"_id":"841"}],"year":"2020","title":"Finite element error analysis of wave equations with dynamic boundary conditions: <i>L</i>2 estimates","author":[{"first_name":"David","last_name":"Hipp","full_name":"Hipp, David"},{"first_name":"Balázs","last_name":"Kovács","orcid":"0000-0001-9872-3474","full_name":"Kovács, Balázs","id":"100441"}],"publication_identifier":{"issn":["0272-4979","1464-3642"]},"publication_status":"published","date_updated":"2024-04-03T09:20:44Z","intvolume":"        41","language":[{"iso":"eng"}],"doi":"10.1093/imanum/drz073","citation":{"mla":"Hipp, David, and Balázs Kovács. “Finite Element Error Analysis of Wave Equations with Dynamic Boundary Conditions: <i>L</i>2 Estimates.” <i>IMA Journal of Numerical Analysis</i>, vol. 41, no. 1, Oxford University Press (OUP), 2020, pp. 638–728, doi:<a href=\"https://doi.org/10.1093/imanum/drz073\">10.1093/imanum/drz073</a>.","ama":"Hipp D, Kovács B. Finite element error analysis of wave equations with dynamic boundary conditions: <i>L</i>2 estimates. <i>IMA Journal of Numerical Analysis</i>. 2020;41(1):638-728. doi:<a href=\"https://doi.org/10.1093/imanum/drz073\">10.1093/imanum/drz073</a>","bibtex":"@article{Hipp_Kovács_2020, title={Finite element error analysis of wave equations with dynamic boundary conditions: <i>L</i>2 estimates}, volume={41}, DOI={<a href=\"https://doi.org/10.1093/imanum/drz073\">10.1093/imanum/drz073</a>}, number={1}, journal={IMA Journal of Numerical Analysis}, publisher={Oxford University Press (OUP)}, author={Hipp, David and Kovács, Balázs}, year={2020}, pages={638–728} }","apa":"Hipp, D., &#38; Kovács, B. (2020). Finite element error analysis of wave equations with dynamic boundary conditions: <i>L</i>2 estimates. <i>IMA Journal of Numerical Analysis</i>, <i>41</i>(1), 638–728. <a href=\"https://doi.org/10.1093/imanum/drz073\">https://doi.org/10.1093/imanum/drz073</a>","ieee":"D. Hipp and B. Kovács, “Finite element error analysis of wave equations with dynamic boundary conditions: <i>L</i>2 estimates,” <i>IMA Journal of Numerical Analysis</i>, vol. 41, no. 1, pp. 638–728, 2020, doi: <a href=\"https://doi.org/10.1093/imanum/drz073\">10.1093/imanum/drz073</a>.","short":"D. Hipp, B. Kovács, IMA Journal of Numerical Analysis 41 (2020) 638–728.","chicago":"Hipp, David, and Balázs Kovács. “Finite Element Error Analysis of Wave Equations with Dynamic Boundary Conditions: <i>L</i>2 Estimates.” <i>IMA Journal of Numerical Analysis</i> 41, no. 1 (2020): 638–728. <a href=\"https://doi.org/10.1093/imanum/drz073\">https://doi.org/10.1093/imanum/drz073</a>."},"status":"public","page":"638-728","_id":"45953","publisher":"Oxford University Press (OUP)","user_id":"100441","volume":41},{"volume":90,"user_id":"100441","_id":"45955","publisher":"American Mathematical Society (AMS)","page":"995-1038","status":"public","citation":{"mla":"Akrivis, Georgios, et al. “Higher-Order Linearly Implicit Full Discretization of the Landau–Lifshitz–Gilbert Equation.” <i>Mathematics of Computation</i>, vol. 90, no. 329, American Mathematical Society (AMS), 2020, pp. 995–1038, doi:<a href=\"https://doi.org/10.1090/mcom/3597\">10.1090/mcom/3597</a>.","bibtex":"@article{Akrivis_Feischl_Kovács_Lubich_2020, title={Higher-order linearly implicit full discretization of the Landau–Lifshitz–Gilbert equation}, volume={90}, DOI={<a href=\"https://doi.org/10.1090/mcom/3597\">10.1090/mcom/3597</a>}, number={329}, journal={Mathematics of Computation}, publisher={American Mathematical Society (AMS)}, author={Akrivis, Georgios and Feischl, Michael and Kovács, Balázs and Lubich, Christian}, year={2020}, pages={995–1038} }","ama":"Akrivis G, Feischl M, Kovács B, Lubich C. Higher-order linearly implicit full discretization of the Landau–Lifshitz–Gilbert equation. <i>Mathematics of Computation</i>. 2020;90(329):995-1038. doi:<a href=\"https://doi.org/10.1090/mcom/3597\">10.1090/mcom/3597</a>","ieee":"G. Akrivis, M. Feischl, B. Kovács, and C. Lubich, “Higher-order linearly implicit full discretization of the Landau–Lifshitz–Gilbert equation,” <i>Mathematics of Computation</i>, vol. 90, no. 329, pp. 995–1038, 2020, doi: <a href=\"https://doi.org/10.1090/mcom/3597\">10.1090/mcom/3597</a>.","apa":"Akrivis, G., Feischl, M., Kovács, B., &#38; Lubich, C. (2020). Higher-order linearly implicit full discretization of the Landau–Lifshitz–Gilbert equation. <i>Mathematics of Computation</i>, <i>90</i>(329), 995–1038. <a href=\"https://doi.org/10.1090/mcom/3597\">https://doi.org/10.1090/mcom/3597</a>","chicago":"Akrivis, Georgios, Michael Feischl, Balázs Kovács, and Christian Lubich. “Higher-Order Linearly Implicit Full Discretization of the Landau–Lifshitz–Gilbert Equation.” <i>Mathematics of Computation</i> 90, no. 329 (2020): 995–1038. <a href=\"https://doi.org/10.1090/mcom/3597\">https://doi.org/10.1090/mcom/3597</a>.","short":"G. Akrivis, M. Feischl, B. Kovács, C. Lubich, Mathematics of Computation 90 (2020) 995–1038."},"doi":"10.1090/mcom/3597","language":[{"iso":"eng"}],"intvolume":"        90","publication_status":"published","date_updated":"2024-04-03T09:20:36Z","author":[{"full_name":"Akrivis, Georgios","last_name":"Akrivis","first_name":"Georgios"},{"full_name":"Feischl, Michael","last_name":"Feischl","first_name":"Michael"},{"last_name":"Kovács","orcid":"0000-0001-9872-3474","first_name":"Balázs","full_name":"Kovács, Balázs","id":"100441"},{"full_name":"Lubich, Christian","last_name":"Lubich","first_name":"Christian"}],"publication_identifier":{"issn":["0025-5718","1088-6842"]},"year":"2020","title":"Higher-order linearly implicit full discretization of the Landau–Lifshitz–Gilbert equation","department":[{"_id":"841"}],"keyword":["Applied Mathematics","Computational Mathematics","Algebra and Number Theory"],"type":"journal_article","date_created":"2023-07-10T11:42:57Z","publication":"Mathematics of Computation","issue":"329"},{"publication":"Interfaces and Free Boundaries","issue":"4","date_created":"2023-07-10T11:42:14Z","department":[{"_id":"841"}],"type":"journal_article","keyword":["Applied Mathematics"],"author":[{"full_name":"Kovács, Balázs","orcid":"0000-0001-9872-3474","first_name":"Balázs","last_name":"Kovács","id":"100441"},{"first_name":"Buyang","last_name":"Li","full_name":"Li, Buyang"},{"full_name":"Lubich, Christian","last_name":"Lubich","first_name":"Christian"}],"publication_identifier":{"issn":["1463-9963"]},"year":"2020","title":"A convergent algorithm for forced mean curvature flow driven by diffusion on the surface","intvolume":"        22","publication_status":"published","date_updated":"2024-04-03T09:21:02Z","language":[{"iso":"eng"}],"doi":"10.4171/ifb/446","citation":{"short":"B. Kovács, B. Li, C. Lubich, Interfaces and Free Boundaries 22 (2020) 443–464.","chicago":"Kovács, Balázs, Buyang Li, and Christian Lubich. “A Convergent Algorithm for Forced Mean Curvature Flow Driven by Diffusion on the Surface.” <i>Interfaces and Free Boundaries</i> 22, no. 4 (2020): 443–64. <a href=\"https://doi.org/10.4171/ifb/446\">https://doi.org/10.4171/ifb/446</a>.","ieee":"B. Kovács, B. Li, and C. Lubich, “A convergent algorithm for forced mean curvature flow driven by diffusion on the surface,” <i>Interfaces and Free Boundaries</i>, vol. 22, no. 4, pp. 443–464, 2020, doi: <a href=\"https://doi.org/10.4171/ifb/446\">10.4171/ifb/446</a>.","apa":"Kovács, B., Li, B., &#38; Lubich, C. (2020). A convergent algorithm for forced mean curvature flow driven by diffusion on the surface. <i>Interfaces and Free Boundaries</i>, <i>22</i>(4), 443–464. <a href=\"https://doi.org/10.4171/ifb/446\">https://doi.org/10.4171/ifb/446</a>","bibtex":"@article{Kovács_Li_Lubich_2020, title={A convergent algorithm for forced mean curvature flow driven by diffusion on the surface}, volume={22}, DOI={<a href=\"https://doi.org/10.4171/ifb/446\">10.4171/ifb/446</a>}, number={4}, journal={Interfaces and Free Boundaries}, publisher={European Mathematical Society - EMS - Publishing House GmbH}, author={Kovács, Balázs and Li, Buyang and Lubich, Christian}, year={2020}, pages={443–464} }","ama":"Kovács B, Li B, Lubich C. A convergent algorithm for forced mean curvature flow driven by diffusion on the surface. <i>Interfaces and Free Boundaries</i>. 2020;22(4):443-464. doi:<a href=\"https://doi.org/10.4171/ifb/446\">10.4171/ifb/446</a>","mla":"Kovács, Balázs, et al. “A Convergent Algorithm for Forced Mean Curvature Flow Driven by Diffusion on the Surface.” <i>Interfaces and Free Boundaries</i>, vol. 22, no. 4, European Mathematical Society - EMS - Publishing House GmbH, 2020, pp. 443–64, doi:<a href=\"https://doi.org/10.4171/ifb/446\">10.4171/ifb/446</a>."},"status":"public","_id":"45952","publisher":"European Mathematical Society - EMS - Publishing House GmbH","page":"443-464","volume":22,"user_id":"100441"},{"page":"33-42 ","publisher":"De Gruyter","_id":"34632","language":[{"iso":"eng"}],"user_id":"49063","editor":[{"first_name":"Fred J.","last_name":"Hickernell","full_name":"Hickernell, Fred J."},{"full_name":"Kritzer, Peter","last_name":"Kritzer","first_name":"Peter"}],"year":"2020","title":"RBF-based penalized least-squares approximation of noisy scattered data on the sphere","status":"public","author":[{"id":"42608","full_name":"Hesse, Kerstin","orcid":"0000-0003-4125-1941","last_name":"Hesse","first_name":"Kerstin"}],"publication_identifier":{"isbn":["9783110633115"]},"date_updated":"2024-04-03T11:03:30Z","place":"Berlin/Boston","date_created":"2022-12-20T17:34:38Z","type":"book_chapter","department":[{"_id":"10"}],"publication":"Multivariate Algorithms and Information-Based Complexity","citation":{"mla":"Hesse, Kerstin. “RBF-Based Penalized Least-Squares Approximation of Noisy Scattered Data on the Sphere.” <i>Multivariate Algorithms and Information-Based Complexity</i>, edited by Fred J. Hickernell and Peter Kritzer, De Gruyter, 2020, pp. 33–42.","ama":"Hesse K. RBF-based penalized least-squares approximation of noisy scattered data on the sphere. In: Hickernell FJ, Kritzer P, eds. <i>Multivariate Algorithms and Information-Based Complexity</i>. De Gruyter; 2020:33-42.","bibtex":"@inbook{Hesse_2020, place={Berlin/Boston}, title={RBF-based penalized least-squares approximation of noisy scattered data on the sphere}, booktitle={Multivariate Algorithms and Information-Based Complexity}, publisher={De Gruyter}, author={Hesse, Kerstin}, editor={Hickernell, Fred J. and Kritzer, Peter}, year={2020}, pages={33–42} }","apa":"Hesse, K. (2020). RBF-based penalized least-squares approximation of noisy scattered data on the sphere. In F. J. Hickernell &#38; P. Kritzer (Eds.), <i>Multivariate Algorithms and Information-Based Complexity</i> (pp. 33–42). De Gruyter.","ieee":"K. Hesse, “RBF-based penalized least-squares approximation of noisy scattered data on the sphere,” in <i>Multivariate Algorithms and Information-Based Complexity</i>, F. J. Hickernell and P. Kritzer, Eds. Berlin/Boston: De Gruyter, 2020, pp. 33–42.","chicago":"Hesse, Kerstin. “RBF-Based Penalized Least-Squares Approximation of Noisy Scattered Data on the Sphere.” In <i>Multivariate Algorithms and Information-Based Complexity</i>, edited by Fred J. Hickernell and Peter Kritzer, 33–42. Berlin/Boston: De Gruyter, 2020.","short":"K. Hesse, in: F.J. Hickernell, P. Kritzer (Eds.), Multivariate Algorithms and Information-Based Complexity, De Gruyter, Berlin/Boston, 2020, pp. 33–42."}},{"issue":"10","publication":"IEEE Transactions on Vehicular Technology","date_created":"2024-04-05T09:05:11Z","department":[{"_id":"263"}],"type":"journal_article","keyword":["Electrical and Electronic Engineering","Computer Networks and Communications","Aerospace Engineering","Automotive Engineering"],"publication_identifier":{"issn":["0018-9545","1939-9359"]},"author":[{"first_name":"Mohammad","last_name":"Soleymani","full_name":"Soleymani, Mohammad"},{"full_name":"Santamaria, Ignacio","first_name":"Ignacio","last_name":"Santamaria"},{"first_name":"Peter J.","last_name":"Schreier","full_name":"Schreier, Peter J."}],"year":"2020","title":"Improper Gaussian Signaling for the $K$-User MIMO Interference Channels With Hardware Impairments","intvolume":"        69","date_updated":"2024-04-05T13:22:19Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1109/tvt.2020.3015558","citation":{"mla":"Soleymani, Mohammad, et al. “Improper Gaussian Signaling for the $K$-User MIMO Interference Channels With Hardware Impairments.” <i>IEEE Transactions on Vehicular Technology</i>, vol. 69, no. 10, Institute of Electrical and Electronics Engineers (IEEE), 2020, pp. 11632–45, doi:<a href=\"https://doi.org/10.1109/tvt.2020.3015558\">10.1109/tvt.2020.3015558</a>.","bibtex":"@article{Soleymani_Santamaria_Schreier_2020, title={Improper Gaussian Signaling for the $K$-User MIMO Interference Channels With Hardware Impairments}, volume={69}, DOI={<a href=\"https://doi.org/10.1109/tvt.2020.3015558\">10.1109/tvt.2020.3015558</a>}, number={10}, journal={IEEE Transactions on Vehicular Technology}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Soleymani, Mohammad and Santamaria, Ignacio and Schreier, Peter J.}, year={2020}, pages={11632–11645} }","ama":"Soleymani M, Santamaria I, Schreier PJ. Improper Gaussian Signaling for the $K$-User MIMO Interference Channels With Hardware Impairments. <i>IEEE Transactions on Vehicular Technology</i>. 2020;69(10):11632-11645. doi:<a href=\"https://doi.org/10.1109/tvt.2020.3015558\">10.1109/tvt.2020.3015558</a>","ieee":"M. Soleymani, I. Santamaria, and P. J. Schreier, “Improper Gaussian Signaling for the $K$-User MIMO Interference Channels With Hardware Impairments,” <i>IEEE Transactions on Vehicular Technology</i>, vol. 69, no. 10, pp. 11632–11645, 2020, doi: <a href=\"https://doi.org/10.1109/tvt.2020.3015558\">10.1109/tvt.2020.3015558</a>.","apa":"Soleymani, M., Santamaria, I., &#38; Schreier, P. J. (2020). Improper Gaussian Signaling for the $K$-User MIMO Interference Channels With Hardware Impairments. <i>IEEE Transactions on Vehicular Technology</i>, <i>69</i>(10), 11632–11645. <a href=\"https://doi.org/10.1109/tvt.2020.3015558\">https://doi.org/10.1109/tvt.2020.3015558</a>","short":"M. Soleymani, I. Santamaria, P.J. Schreier, IEEE Transactions on Vehicular Technology 69 (2020) 11632–11645.","chicago":"Soleymani, Mohammad, Ignacio Santamaria, and Peter J. Schreier. “Improper Gaussian Signaling for the $K$-User MIMO Interference Channels With Hardware Impairments.” <i>IEEE Transactions on Vehicular Technology</i> 69, no. 10 (2020): 11632–45. <a href=\"https://doi.org/10.1109/tvt.2020.3015558\">https://doi.org/10.1109/tvt.2020.3015558</a>."},"status":"public","_id":"53270","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","page":"11632-11645","volume":69,"user_id":"67076"},{"doi":"10.23919/eusipco47968.2020.9287450","user_id":"67076","publisher":"IEEE","_id":"53269","language":[{"iso":"eng"}],"date_updated":"2024-04-05T13:21:59Z","publication_status":"published","year":"2020","status":"public","title":"Rate Region of the K-user MIMO Interference Channel with Imperfect Transmitters","author":[{"first_name":"Mohammad","last_name":"Soleymani","full_name":"Soleymani, Mohammad"},{"full_name":"Santamaria, Ignacio","last_name":"Santamaria","first_name":"Ignacio"},{"first_name":"Behrouz","last_name":"Maham","full_name":"Maham, Behrouz"},{"first_name":"Peter J.","last_name":"Schreier","full_name":"Schreier, Peter J."}],"type":"conference","department":[{"_id":"263"}],"date_created":"2024-04-05T09:05:01Z","publication":"2020 28th European Signal Processing Conference (EUSIPCO)","citation":{"chicago":"Soleymani, Mohammad, Ignacio Santamaria, Behrouz Maham, and Peter J. Schreier. “Rate Region of the K-User MIMO Interference Channel with Imperfect Transmitters.” In <i>2020 28th European Signal Processing Conference (EUSIPCO)</i>. IEEE, 2020. <a href=\"https://doi.org/10.23919/eusipco47968.2020.9287450\">https://doi.org/10.23919/eusipco47968.2020.9287450</a>.","short":"M. Soleymani, I. Santamaria, B. Maham, P.J. Schreier, in: 2020 28th European Signal Processing Conference (EUSIPCO), IEEE, 2020.","apa":"Soleymani, M., Santamaria, I., Maham, B., &#38; Schreier, P. J. (2020). Rate Region of the K-user MIMO Interference Channel with Imperfect Transmitters. <i>2020 28th European Signal Processing Conference (EUSIPCO)</i>. <a href=\"https://doi.org/10.23919/eusipco47968.2020.9287450\">https://doi.org/10.23919/eusipco47968.2020.9287450</a>","ieee":"M. Soleymani, I. Santamaria, B. Maham, and P. J. Schreier, “Rate Region of the K-user MIMO Interference Channel with Imperfect Transmitters,” 2020, doi: <a href=\"https://doi.org/10.23919/eusipco47968.2020.9287450\">10.23919/eusipco47968.2020.9287450</a>.","ama":"Soleymani M, Santamaria I, Maham B, Schreier PJ. Rate Region of the K-user MIMO Interference Channel with Imperfect Transmitters. In: <i>2020 28th European Signal Processing Conference (EUSIPCO)</i>. IEEE; 2020. doi:<a href=\"https://doi.org/10.23919/eusipco47968.2020.9287450\">10.23919/eusipco47968.2020.9287450</a>","bibtex":"@inproceedings{Soleymani_Santamaria_Maham_Schreier_2020, title={Rate Region of the K-user MIMO Interference Channel with Imperfect Transmitters}, DOI={<a href=\"https://doi.org/10.23919/eusipco47968.2020.9287450\">10.23919/eusipco47968.2020.9287450</a>}, booktitle={2020 28th European Signal Processing Conference (EUSIPCO)}, publisher={IEEE}, author={Soleymani, Mohammad and Santamaria, Ignacio and Maham, Behrouz and Schreier, Peter J.}, year={2020} }","mla":"Soleymani, Mohammad, et al. “Rate Region of the K-User MIMO Interference Channel with Imperfect Transmitters.” <i>2020 28th European Signal Processing Conference (EUSIPCO)</i>, IEEE, 2020, doi:<a href=\"https://doi.org/10.23919/eusipco47968.2020.9287450\">10.23919/eusipco47968.2020.9287450</a>."}}]