[{"citation":{"bibtex":"@article{Mahnken_Westermann_2024, title={Construction of A-stable explicit last-stage diagonal implicit Runge–Kutta (ELDIRK) methods}, DOI={<a href=\"https://doi.org/10.1007/s00466-024-02442-y\">10.1007/s00466-024-02442-y</a>}, journal={Computational Mechanics}, publisher={Springer Science and Business Media LLC}, author={Mahnken, Rolf and Westermann, Hendrik}, year={2024} }","mla":"Mahnken, Rolf, and Hendrik Westermann. “Construction of A-Stable Explicit Last-Stage Diagonal Implicit Runge–Kutta (ELDIRK) Methods.” <i>Computational Mechanics</i>, Springer Science and Business Media LLC, 2024, doi:<a href=\"https://doi.org/10.1007/s00466-024-02442-y\">10.1007/s00466-024-02442-y</a>.","short":"R. Mahnken, H. Westermann, Computational Mechanics (2024).","apa":"Mahnken, R., &#38; Westermann, H. (2024). Construction of A-stable explicit last-stage diagonal implicit Runge–Kutta (ELDIRK) methods. <i>Computational Mechanics</i>. <a href=\"https://doi.org/10.1007/s00466-024-02442-y\">https://doi.org/10.1007/s00466-024-02442-y</a>","ama":"Mahnken R, Westermann H. Construction of A-stable explicit last-stage diagonal implicit Runge–Kutta (ELDIRK) methods. <i>Computational Mechanics</i>. Published online 2024. doi:<a href=\"https://doi.org/10.1007/s00466-024-02442-y\">10.1007/s00466-024-02442-y</a>","ieee":"R. Mahnken and H. Westermann, “Construction of A-stable explicit last-stage diagonal implicit Runge–Kutta (ELDIRK) methods,” <i>Computational Mechanics</i>, 2024, doi: <a href=\"https://doi.org/10.1007/s00466-024-02442-y\">10.1007/s00466-024-02442-y</a>.","chicago":"Mahnken, Rolf, and Hendrik Westermann. “Construction of A-Stable Explicit Last-Stage Diagonal Implicit Runge–Kutta (ELDIRK) Methods.” <i>Computational Mechanics</i>, 2024. <a href=\"https://doi.org/10.1007/s00466-024-02442-y\">https://doi.org/10.1007/s00466-024-02442-y</a>."},"keyword":["Applied Mathematics","Computational Mathematics","Computational Theory and Mathematics","Mechanical Engineering","Ocean Engineering","Computational Mechanics"],"publication_status":"published","user_id":"335","department":[{"_id":"154"},{"_id":"321"}],"title":"Construction of A-stable explicit last-stage diagonal implicit Runge–Kutta (ELDIRK) methods","author":[{"full_name":"Mahnken, Rolf","first_name":"Rolf","last_name":"Mahnken","id":"335"},{"orcid":"0000-0002-5034-9708","full_name":"Westermann, Hendrik","first_name":"Hendrik","id":"60816","last_name":"Westermann"}],"abstract":[{"text":"ELDIRK methods are defined to have an <jats:italic>Explicit Last</jats:italic> stage in the general Butcher array of <jats:italic>Diagonal Implicit Runge-Kutta</jats:italic> methods, with the consequence, that no additional system of equations must be solved, compared to the embedded RK method. Two general formulations for second- and third-order ELDIRK methods have been obtained recently in Mahnken [21] with specific schemes,  e.g. for the embedded implicit Euler method, the embedded trapezoidal-rule and the embedded Ellsiepen method. In the first part of this paper, we investigate some general stability characteristics of ELDIRK methods, and it will be shown that the above specific RK schemes are not A-stable. Therefore, in the second part, the above-mentioned general formulations are used for further stability investigations, with the aim to construct new second- and third-order ELDIRK methods which simultaneously are A-stable. Two numerical examples are concerned with the curing for a thermosetting material and phase-field RVE modeling for crystallinity and orientation. The numerical results confirm the theoretical results on convergence order and stability.","lang":"eng"}],"doi":"10.1007/s00466-024-02442-y","_id":"52233","date_updated":"2024-03-19T12:14:07Z","date_created":"2024-03-03T13:23:28Z","publication":"Computational Mechanics","quality_controlled":"1","publisher":"Springer Science and Business Media LLC","language":[{"iso":"eng"}],"year":"2024","type":"journal_article","publication_identifier":{"issn":["0178-7675","1432-0924"]},"status":"public"},{"issue":"2","page":"460-474","volume":31,"type":"journal_article","publication":"IEEE Transactions on Fuzzy Systems","user_id":"51811","keyword":["Applied Mathematics","Artificial Intelligence","Computational Theory and Mathematics","Control and Systems Engineering"],"doi":"10.1109/tfuzz.2022.3188875","title":"A Credibility and Strategic Behavior Approach in Hesitant Multiple Criteria Decision-Making With Application to Sustainable Transportation","date_updated":"2024-04-15T13:15:07Z","_id":"53229","publication_identifier":{"issn":["1063-6706","1941-0034"]},"year":"2023","language":[{"iso":"eng"}],"status":"public","date_created":"2024-04-04T14:00:53Z","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","department":[{"_id":"277"}],"citation":{"ama":"Santos-Arteaga FJ, Di Caprio D, Tavana M, Tena EC. A Credibility and Strategic Behavior Approach in Hesitant Multiple Criteria Decision-Making With Application to Sustainable Transportation. <i>IEEE Transactions on Fuzzy Systems</i>. 2023;31(2):460-474. doi:<a href=\"https://doi.org/10.1109/tfuzz.2022.3188875\">10.1109/tfuzz.2022.3188875</a>","apa":"Santos-Arteaga, F. J., Di Caprio, D., Tavana, M., &#38; Tena, E. C. (2023). A Credibility and Strategic Behavior Approach in Hesitant Multiple Criteria Decision-Making With Application to Sustainable Transportation. <i>IEEE Transactions on Fuzzy Systems</i>, <i>31</i>(2), 460–474. <a href=\"https://doi.org/10.1109/tfuzz.2022.3188875\">https://doi.org/10.1109/tfuzz.2022.3188875</a>","ieee":"F. J. Santos-Arteaga, D. Di Caprio, M. Tavana, and E. C. Tena, “A Credibility and Strategic Behavior Approach in Hesitant Multiple Criteria Decision-Making With Application to Sustainable Transportation,” <i>IEEE Transactions on Fuzzy Systems</i>, vol. 31, no. 2, pp. 460–474, 2023, doi: <a href=\"https://doi.org/10.1109/tfuzz.2022.3188875\">10.1109/tfuzz.2022.3188875</a>.","chicago":"Santos-Arteaga, Francisco J., Debora Di Caprio, Madjid Tavana, and Emilio Cerda Tena. “A Credibility and Strategic Behavior Approach in Hesitant Multiple Criteria Decision-Making With Application to Sustainable Transportation.” <i>IEEE Transactions on Fuzzy Systems</i> 31, no. 2 (2023): 460–74. <a href=\"https://doi.org/10.1109/tfuzz.2022.3188875\">https://doi.org/10.1109/tfuzz.2022.3188875</a>.","bibtex":"@article{Santos-Arteaga_Di Caprio_Tavana_Tena_2023, title={A Credibility and Strategic Behavior Approach in Hesitant Multiple Criteria Decision-Making With Application to Sustainable Transportation}, volume={31}, DOI={<a href=\"https://doi.org/10.1109/tfuzz.2022.3188875\">10.1109/tfuzz.2022.3188875</a>}, number={2}, journal={IEEE Transactions on Fuzzy Systems}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Santos-Arteaga, Francisco J. and Di Caprio, Debora and Tavana, Madjid and Tena, Emilio Cerda}, year={2023}, pages={460–474} }","mla":"Santos-Arteaga, Francisco J., et al. “A Credibility and Strategic Behavior Approach in Hesitant Multiple Criteria Decision-Making With Application to Sustainable Transportation.” <i>IEEE Transactions on Fuzzy Systems</i>, vol. 31, no. 2, Institute of Electrical and Electronics Engineers (IEEE), 2023, pp. 460–74, doi:<a href=\"https://doi.org/10.1109/tfuzz.2022.3188875\">10.1109/tfuzz.2022.3188875</a>.","short":"F.J. Santos-Arteaga, D. Di Caprio, M. Tavana, E.C. Tena, IEEE Transactions on Fuzzy Systems 31 (2023) 460–474."},"publication_status":"published","intvolume":"        31","author":[{"first_name":"Francisco J.","full_name":"Santos-Arteaga, Francisco J.","last_name":"Santos-Arteaga"},{"first_name":"Debora","full_name":"Di Caprio, Debora","last_name":"Di Caprio"},{"first_name":"Madjid","full_name":"Tavana, Madjid","last_name":"Tavana","id":"31858"},{"last_name":"Tena","first_name":"Emilio Cerda","full_name":"Tena, Emilio Cerda"}]},{"status":"public","language":[{"iso":"eng"}],"type":"journal_article","year":"2023","publication_identifier":{"issn":["0178-7675","1432-0924"]},"publisher":"Springer Science and Business Media LLC","date_created":"2023-06-23T06:47:36Z","quality_controlled":"1","publication":"Computational Mechanics","date_updated":"2023-06-23T06:48:42Z","_id":"45757","doi":"10.1007/s00466-023-02347-2","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Three prominent low order implicit time integration schemes are the first order implicit Euler-method, the second order trapezoidal rule and the second order Ellsiepen method. Its advantages are stability and comparatively low computational cost, however, they require the solution of a nonlinear system of equations. This paper presents a general approach for the construction of third order Runge–Kutta methods by embedding the above mentioned implicit schemes into the class of ELDIRK-methods. These will be defined to have an <jats:italic>Explicit Last</jats:italic> stage in the general Butcher array of <jats:italic>Diagonal Implicit Runge–Kutta</jats:italic> (DIRK) methods, with the consequence, that no additional system of equations must be solved. The main results—valid also for non-linear ordinary differential equations—are as follows: Two extra function calculations are required in order to embed the implicit Euler-method and one extra function calculation is required for the trapezoidal-rule and the Ellsiepen method, in order to obtain the third order properties, respectively. Two numerical examples are concerned with a parachute with viscous damping and a two-dimensional laser beam simulation. Here, we verify the higher order convergence behaviours of the proposed new ELDIRK-methods, and its successful performances for asymptotically exact global error estimation of so-called reversed embedded RK-method are shown.\r\n</jats:p>","lang":"eng"}],"author":[{"last_name":"Mahnken","id":"335","first_name":"Rolf","full_name":"Mahnken, Rolf"}],"title":"Derivation of third order Runge–Kutta methods (ELDIRK) by embedding of lower order implicit time integration schemes for local and global error estimation","department":[{"_id":"9"},{"_id":"154"},{"_id":"321"}],"keyword":["Applied Mathematics","Computational Mathematics","Computational Theory and Mathematics","Mechanical Engineering","Ocean Engineering","Computational Mechanics"],"publication_status":"published","user_id":"335","citation":{"mla":"Mahnken, Rolf. “Derivation of Third Order Runge–Kutta Methods (ELDIRK) by Embedding of Lower Order Implicit Time Integration Schemes for Local and Global Error Estimation.” <i>Computational Mechanics</i>, Springer Science and Business Media LLC, 2023, doi:<a href=\"https://doi.org/10.1007/s00466-023-02347-2\">10.1007/s00466-023-02347-2</a>.","apa":"Mahnken, R. (2023). Derivation of third order Runge–Kutta methods (ELDIRK) by embedding of lower order implicit time integration schemes for local and global error estimation. <i>Computational Mechanics</i>. <a href=\"https://doi.org/10.1007/s00466-023-02347-2\">https://doi.org/10.1007/s00466-023-02347-2</a>","ama":"Mahnken R. Derivation of third order Runge–Kutta methods (ELDIRK) by embedding of lower order implicit time integration schemes for local and global error estimation. <i>Computational Mechanics</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1007/s00466-023-02347-2\">10.1007/s00466-023-02347-2</a>","bibtex":"@article{Mahnken_2023, title={Derivation of third order Runge–Kutta methods (ELDIRK) by embedding of lower order implicit time integration schemes for local and global error estimation}, DOI={<a href=\"https://doi.org/10.1007/s00466-023-02347-2\">10.1007/s00466-023-02347-2</a>}, journal={Computational Mechanics}, publisher={Springer Science and Business Media LLC}, author={Mahnken, Rolf}, year={2023} }","short":"R. Mahnken, Computational Mechanics (2023).","chicago":"Mahnken, Rolf. “Derivation of Third Order Runge–Kutta Methods (ELDIRK) by Embedding of Lower Order Implicit Time Integration Schemes for Local and Global Error Estimation.” <i>Computational Mechanics</i>, 2023. <a href=\"https://doi.org/10.1007/s00466-023-02347-2\">https://doi.org/10.1007/s00466-023-02347-2</a>.","ieee":"R. Mahnken, “Derivation of third order Runge–Kutta methods (ELDIRK) by embedding of lower order implicit time integration schemes for local and global error estimation,” <i>Computational Mechanics</i>, 2023, doi: <a href=\"https://doi.org/10.1007/s00466-023-02347-2\">10.1007/s00466-023-02347-2</a>."}},{"user_id":"38705","publication_status":"published","keyword":["Computational Theory and Mathematics","Computer Science Applications","Information Systems","Theoretical Computer Science"],"citation":{"mla":"Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” <i>Information and Computation</i>, 104877, Elsevier BV, 2022, doi:<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>.","bibtex":"@article{Castenow_Kling_Knollmann_Meyer auf der Heide_2022, title={A Discrete and Continuous Study of the Max-Chain-Formation Problem}, DOI={<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>}, number={104877}, journal={Information and Computation}, publisher={Elsevier BV}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2022} }","short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022).","apa":"Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2022). A Discrete and Continuous Study of the Max-Chain-Formation Problem. <i>Information and Computation</i>, Article 104877. <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">https://doi.org/10.1016/j.ic.2022.104877</a>","ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem. <i>Information and Computation</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” <i>Information and Computation</i>, 2022. <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">https://doi.org/10.1016/j.ic.2022.104877</a>.","ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem,” <i>Information and Computation</i>, Art. no. 104877, 2022, doi: <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>."},"department":[{"_id":"63"}],"author":[{"id":"38705","last_name":"Castenow","first_name":"Jannik","full_name":"Castenow, Jannik"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","first_name":"Till","id":"39241","last_name":"Knollmann"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"title":"A Discrete and Continuous Study of the Max-Chain-Formation Problem","doi":"10.1016/j.ic.2022.104877","project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106"}],"_id":"29843","date_updated":"2022-02-15T07:41:00Z","article_number":"104877","publisher":"Elsevier BV","publication":"Information and Computation","date_created":"2022-02-15T07:38:28Z","status":"public","year":"2022","publication_identifier":{"issn":["0890-5401"]},"type":"journal_article","language":[{"iso":"eng"}]},{"doi":"10.1002/qute.202200049","author":[{"full_name":"Bopp, Frederik","first_name":"Frederik","last_name":"Bopp"},{"last_name":"Rojas","full_name":"Rojas, Jonathan","first_name":"Jonathan"},{"last_name":"Revenga","full_name":"Revenga, Natalia","first_name":"Natalia"},{"last_name":"Riedl","full_name":"Riedl, Hubert","first_name":"Hubert"},{"last_name":"Sbresny","first_name":"Friedrich","full_name":"Sbresny, Friedrich"},{"full_name":"Boos, Katarina","first_name":"Katarina","last_name":"Boos"},{"full_name":"Simmet, Tobias","first_name":"Tobias","last_name":"Simmet"},{"last_name":"Ahmadi","full_name":"Ahmadi, Arash","first_name":"Arash"},{"last_name":"Gershoni","full_name":"Gershoni, David","first_name":"David"},{"last_name":"Kasprzak","full_name":"Kasprzak, Jacek","first_name":"Jacek"},{"last_name":"Ludwig","full_name":"Ludwig, Arne","first_name":"Arne"},{"last_name":"Reitzenstein","first_name":"Stephan","full_name":"Reitzenstein, Stephan"},{"first_name":"Andreas","full_name":"Wieck, Andreas","last_name":"Wieck"},{"last_name":"Reuter","id":"37763","full_name":"Reuter, Dirk","first_name":"Dirk"},{"last_name":"Müller","full_name":"Müller, Kai","first_name":"Kai"},{"last_name":"Finley","first_name":"Jonathan J.","full_name":"Finley, Jonathan J."}],"title":"Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling","department":[{"_id":"15"},{"_id":"230"}],"user_id":"42514","keyword":["Electrical and Electronic Engineering","Computational Theory and Mathematics","Condensed Matter Physics","Mathematical Physics","Nuclear and High Energy Physics","Electronic","Optical and Magnetic Materials","Statistical and Nonlinear Physics"],"publication_status":"published","citation":{"short":"F. Bopp, J. Rojas, N. Revenga, H. Riedl, F. Sbresny, K. Boos, T. Simmet, A. Ahmadi, D. Gershoni, J. Kasprzak, A. Ludwig, S. Reitzenstein, A. Wieck, D. Reuter, K. Müller, J.J. Finley, Advanced Quantum Technologies (2022).","bibtex":"@article{Bopp_Rojas_Revenga_Riedl_Sbresny_Boos_Simmet_Ahmadi_Gershoni_Kasprzak_et al._2022, title={Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling}, DOI={<a href=\"https://doi.org/10.1002/qute.202200049\">10.1002/qute.202200049</a>}, number={2200049}, journal={Advanced Quantum Technologies}, publisher={Wiley}, author={Bopp, Frederik and Rojas, Jonathan and Revenga, Natalia and Riedl, Hubert and Sbresny, Friedrich and Boos, Katarina and Simmet, Tobias and Ahmadi, Arash and Gershoni, David and Kasprzak, Jacek and et al.}, year={2022} }","mla":"Bopp, Frederik, et al. “Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling.” <i>Advanced Quantum Technologies</i>, 2200049, Wiley, 2022, doi:<a href=\"https://doi.org/10.1002/qute.202200049\">10.1002/qute.202200049</a>.","ieee":"F. Bopp <i>et al.</i>, “Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling,” <i>Advanced Quantum Technologies</i>, Art. no. 2200049, 2022, doi: <a href=\"https://doi.org/10.1002/qute.202200049\">10.1002/qute.202200049</a>.","chicago":"Bopp, Frederik, Jonathan Rojas, Natalia Revenga, Hubert Riedl, Friedrich Sbresny, Katarina Boos, Tobias Simmet, et al. “Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling.” <i>Advanced Quantum Technologies</i>, 2022. <a href=\"https://doi.org/10.1002/qute.202200049\">https://doi.org/10.1002/qute.202200049</a>.","apa":"Bopp, F., Rojas, J., Revenga, N., Riedl, H., Sbresny, F., Boos, K., Simmet, T., Ahmadi, A., Gershoni, D., Kasprzak, J., Ludwig, A., Reitzenstein, S., Wieck, A., Reuter, D., Müller, K., &#38; Finley, J. J. (2022). Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling. <i>Advanced Quantum Technologies</i>, Article 2200049. <a href=\"https://doi.org/10.1002/qute.202200049\">https://doi.org/10.1002/qute.202200049</a>","ama":"Bopp F, Rojas J, Revenga N, et al. Quantum Dot Molecule Devices with Optical Control of Charge Status and Electronic Control of Coupling. <i>Advanced Quantum Technologies</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1002/qute.202200049\">10.1002/qute.202200049</a>"},"status":"public","year":"2022","type":"journal_article","publication_identifier":{"issn":["2511-9044","2511-9044"]},"language":[{"iso":"eng"}],"publisher":"Wiley","publication":"Advanced Quantum Technologies","date_created":"2022-09-12T07:17:26Z","date_updated":"2022-09-12T07:18:06Z","article_number":"2200049","_id":"33332"},{"citation":{"short":"X. Ju, R. Mahnken, Y. Xu, L. Liang, Computational Mechanics 69 (2022) 847–863.","mla":"Ju, Xiaozhe, et al. “Goal-Oriented Error Estimation and h-Adaptive Finite Elements for Hyperelastic Micromorphic Continua.” <i>Computational Mechanics</i>, vol. 69, no. 3, Springer Science and Business Media LLC, 2022, pp. 847–63, doi:<a href=\"https://doi.org/10.1007/s00466-021-02117-y\">10.1007/s00466-021-02117-y</a>.","bibtex":"@article{Ju_Mahnken_Xu_Liang_2022, title={Goal-oriented error estimation and h-adaptive finite elements for hyperelastic micromorphic continua}, volume={69}, DOI={<a href=\"https://doi.org/10.1007/s00466-021-02117-y\">10.1007/s00466-021-02117-y</a>}, number={3}, journal={Computational Mechanics}, publisher={Springer Science and Business Media LLC}, author={Ju, Xiaozhe and Mahnken, Rolf and Xu, Yangjian and Liang, Lihua}, year={2022}, pages={847–863} }","chicago":"Ju, Xiaozhe, Rolf Mahnken, Yangjian Xu, and Lihua Liang. “Goal-Oriented Error Estimation and h-Adaptive Finite Elements for Hyperelastic Micromorphic Continua.” <i>Computational Mechanics</i> 69, no. 3 (2022): 847–63. <a href=\"https://doi.org/10.1007/s00466-021-02117-y\">https://doi.org/10.1007/s00466-021-02117-y</a>.","ieee":"X. Ju, R. Mahnken, Y. Xu, and L. Liang, “Goal-oriented error estimation and h-adaptive finite elements for hyperelastic micromorphic continua,” <i>Computational Mechanics</i>, vol. 69, no. 3, pp. 847–863, 2022, doi: <a href=\"https://doi.org/10.1007/s00466-021-02117-y\">10.1007/s00466-021-02117-y</a>.","ama":"Ju X, Mahnken R, Xu Y, Liang L. Goal-oriented error estimation and h-adaptive finite elements for hyperelastic micromorphic continua. <i>Computational Mechanics</i>. 2022;69(3):847-863. doi:<a href=\"https://doi.org/10.1007/s00466-021-02117-y\">10.1007/s00466-021-02117-y</a>","apa":"Ju, X., Mahnken, R., Xu, Y., &#38; Liang, L. (2022). Goal-oriented error estimation and h-adaptive finite elements for hyperelastic micromorphic continua. <i>Computational Mechanics</i>, <i>69</i>(3), 847–863. <a href=\"https://doi.org/10.1007/s00466-021-02117-y\">https://doi.org/10.1007/s00466-021-02117-y</a>"},"publication_status":"published","department":[{"_id":"9"},{"_id":"154"},{"_id":"321"}],"author":[{"last_name":"Ju","full_name":"Ju, Xiaozhe","first_name":"Xiaozhe"},{"full_name":"Mahnken, Rolf","first_name":"Rolf","last_name":"Mahnken","id":"335"},{"first_name":"Yangjian","full_name":"Xu, Yangjian","last_name":"Xu"},{"last_name":"Liang","first_name":"Lihua","full_name":"Liang, Lihua"}],"intvolume":"        69","_id":"30655","date_updated":"2023-01-24T13:10:56Z","date_created":"2022-03-28T13:23:17Z","publisher":"Springer Science and Business Media LLC","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0178-7675","1432-0924"]},"year":"2022","status":"public","keyword":["Applied Mathematics","Computational Mathematics","Computational Theory and Mathematics","Mechanical Engineering","Ocean Engineering","Computational Mechanics"],"user_id":"335","title":"Goal-oriented error estimation and h-adaptive finite elements for hyperelastic micromorphic continua","doi":"10.1007/s00466-021-02117-y","page":"847-863","volume":69,"issue":"3","publication":"Computational Mechanics","quality_controlled":"1","type":"journal_article"},{"date_updated":"2023-02-28T11:07:02Z","issue":"2","article_number":"13","volume":31,"_id":"34700","status":"public","publication_identifier":{"issn":["1016-3328","1420-8954"]},"year":"2022","type":"journal_article","language":[{"iso":"eng"}],"publisher":"Springer Science and Business Media LLC","publication":"Computational Complexity","date_created":"2022-12-21T10:53:52Z","department":[{"_id":"623"},{"_id":"7"}],"user_id":"71541","publication_status":"published","keyword":["Computational Mathematics","Computational Theory and Mathematics","General Mathematics","Theoretical Computer Science"],"citation":{"apa":"Gharibian, S., Santha, M., Sikora, J., Sundaram, A., &#38; Yirka, J. (2022). Quantum generalizations of the polynomial hierarchy with applications to QMA(2). <i>Computational Complexity</i>, <i>31</i>(2), Article 13. <a href=\"https://doi.org/10.1007/s00037-022-00231-8\">https://doi.org/10.1007/s00037-022-00231-8</a>","ama":"Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum generalizations of the polynomial hierarchy with applications to QMA(2). <i>Computational Complexity</i>. 2022;31(2). doi:<a href=\"https://doi.org/10.1007/s00037-022-00231-8\">10.1007/s00037-022-00231-8</a>","ieee":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum generalizations of the polynomial hierarchy with applications to QMA(2),” <i>Computational Complexity</i>, vol. 31, no. 2, Art. no. 13, 2022, doi: <a href=\"https://doi.org/10.1007/s00037-022-00231-8\">10.1007/s00037-022-00231-8</a>.","chicago":"Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” <i>Computational Complexity</i> 31, no. 2 (2022). <a href=\"https://doi.org/10.1007/s00037-022-00231-8\">https://doi.org/10.1007/s00037-022-00231-8</a>.","bibtex":"@article{Gharibian_Santha_Sikora_Sundaram_Yirka_2022, title={Quantum generalizations of the polynomial hierarchy with applications to QMA(2)}, volume={31}, DOI={<a href=\"https://doi.org/10.1007/s00037-022-00231-8\">10.1007/s00037-022-00231-8</a>}, number={213}, journal={Computational Complexity}, publisher={Springer Science and Business Media LLC}, author={Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}, year={2022} }","mla":"Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” <i>Computational Complexity</i>, vol. 31, no. 2, 13, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00037-022-00231-8\">10.1007/s00037-022-00231-8</a>.","short":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, Computational Complexity 31 (2022)."},"intvolume":"        31","doi":"10.1007/s00037-022-00231-8","author":[{"full_name":"Gharibian, Sevag","first_name":"Sevag","last_name":"Gharibian","id":"71541","orcid":"0000-0002-9992-3379"},{"first_name":"Miklos","full_name":"Santha, Miklos","last_name":"Santha"},{"last_name":"Sikora","first_name":"Jamie","full_name":"Sikora, Jamie"},{"full_name":"Sundaram, Aarthi","first_name":"Aarthi","last_name":"Sundaram"},{"last_name":"Yirka","full_name":"Yirka, Justin","first_name":"Justin"}],"title":"Quantum generalizations of the polynomial hierarchy with applications to QMA(2)"},{"title":"Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs","author":[{"full_name":"Rodriguez, Alfonso","first_name":"Alfonso","last_name":"Rodriguez"},{"full_name":"Otero, Andres","first_name":"Andres","last_name":"Otero"},{"full_name":"Platzner, Marco","first_name":"Marco","id":"398","last_name":"Platzner"},{"last_name":"De la Torre","first_name":"Eduardo","full_name":"De la Torre, Eduardo"}],"doi":"10.1109/tc.2021.3107196","citation":{"apa":"Rodriguez, A., Otero, A., Platzner, M., &#38; De la Torre, E. (2021). Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs. <i>IEEE Transactions on Computers</i>, 1–1. <a href=\"https://doi.org/10.1109/tc.2021.3107196\">https://doi.org/10.1109/tc.2021.3107196</a>","ama":"Rodriguez A, Otero A, Platzner M, De la Torre E. Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs. <i>IEEE Transactions on Computers</i>. Published online 2021:1-1. doi:<a href=\"https://doi.org/10.1109/tc.2021.3107196\">10.1109/tc.2021.3107196</a>","chicago":"Rodriguez, Alfonso, Andres Otero, Marco Platzner, and Eduardo De la Torre. “Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs.” <i>IEEE Transactions on Computers</i>, 2021, 1–1. <a href=\"https://doi.org/10.1109/tc.2021.3107196\">https://doi.org/10.1109/tc.2021.3107196</a>.","ieee":"A. Rodriguez, A. Otero, M. Platzner, and E. De la Torre, “Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs,” <i>IEEE Transactions on Computers</i>, pp. 1–1, 2021, doi: <a href=\"https://doi.org/10.1109/tc.2021.3107196\">10.1109/tc.2021.3107196</a>.","mla":"Rodriguez, Alfonso, et al. “Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs.” <i>IEEE Transactions on Computers</i>, Institute of Electrical and Electronics Engineers (IEEE), 2021, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/tc.2021.3107196\">10.1109/tc.2021.3107196</a>.","bibtex":"@article{Rodriguez_Otero_Platzner_De la Torre_2021, title={Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs}, DOI={<a href=\"https://doi.org/10.1109/tc.2021.3107196\">10.1109/tc.2021.3107196</a>}, journal={IEEE Transactions on Computers}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Rodriguez, Alfonso and Otero, Andres and Platzner, Marco and De la Torre, Eduardo}, year={2021}, pages={1–1} }","short":"A. Rodriguez, A. Otero, M. Platzner, E. De la Torre, IEEE Transactions on Computers (2021) 1–1."},"user_id":"398","keyword":["Computational Theory and Mathematics","Hardware and Architecture","Theoretical Computer Science","Software"],"publication_status":"published","department":[{"_id":"78"}],"publication":"IEEE Transactions on Computers","date_created":"2022-04-18T10:03:16Z","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","publication_identifier":{"issn":["0018-9340","1557-9956","2326-3814"]},"type":"journal_article","year":"2021","language":[{"iso":"eng"}],"status":"public","_id":"30907","page":"1-1","date_updated":"2022-04-18T10:04:21Z"},{"author":[{"last_name":"Li","first_name":"Jiaao","full_name":"Li, Jiaao"},{"last_name":"Ma","id":"92748","full_name":"Ma, Yulai","first_name":"Yulai"},{"last_name":"Miao","full_name":"Miao, Zhengke","first_name":"Zhengke"},{"full_name":"Shi, Yongtang","first_name":"Yongtang","last_name":"Shi"},{"last_name":"Wang","first_name":"Weifan","full_name":"Wang, Weifan"},{"first_name":"Cun-Quan","full_name":"Zhang, Cun-Quan","last_name":"Zhang"}],"intvolume":"       153","citation":{"ama":"Li J, Ma Y, Miao Z, Shi Y, Wang W, Zhang C-Q. Nowhere-zero 3-flows in toroidal graphs. <i>Journal of Combinatorial Theory, Series B</i>. 2021;153:61-80. doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>","apa":"Li, J., Ma, Y., Miao, Z., Shi, Y., Wang, W., &#38; Zhang, C.-Q. (2021). Nowhere-zero 3-flows in toroidal graphs. <i>Journal of Combinatorial Theory, Series B</i>, <i>153</i>, 61–80. <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">https://doi.org/10.1016/j.jctb.2021.11.001</a>","ieee":"J. Li, Y. Ma, Z. Miao, Y. Shi, W. Wang, and C.-Q. Zhang, “Nowhere-zero 3-flows in toroidal graphs,” <i>Journal of Combinatorial Theory, Series B</i>, vol. 153, pp. 61–80, 2021, doi: <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>.","chicago":"Li, Jiaao, Yulai Ma, Zhengke Miao, Yongtang Shi, Weifan Wang, and Cun-Quan Zhang. “Nowhere-Zero 3-Flows in Toroidal Graphs.” <i>Journal of Combinatorial Theory, Series B</i> 153 (2021): 61–80. <a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">https://doi.org/10.1016/j.jctb.2021.11.001</a>.","bibtex":"@article{Li_Ma_Miao_Shi_Wang_Zhang_2021, title={Nowhere-zero 3-flows in toroidal graphs}, volume={153}, DOI={<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>}, journal={Journal of Combinatorial Theory, Series B}, publisher={Elsevier BV}, author={Li, Jiaao and Ma, Yulai and Miao, Zhengke and Shi, Yongtang and Wang, Weifan and Zhang, Cun-Quan}, year={2021}, pages={61–80} }","mla":"Li, Jiaao, et al. “Nowhere-Zero 3-Flows in Toroidal Graphs.” <i>Journal of Combinatorial Theory, Series B</i>, vol. 153, Elsevier BV, 2021, pp. 61–80, doi:<a href=\"https://doi.org/10.1016/j.jctb.2021.11.001\">10.1016/j.jctb.2021.11.001</a>.","short":"J. Li, Y. Ma, Z. Miao, Y. Shi, W. Wang, C.-Q. Zhang, Journal of Combinatorial Theory, Series B 153 (2021) 61–80."},"publication_status":"published","department":[{"_id":"542"}],"date_created":"2022-11-09T08:43:55Z","publisher":"Elsevier BV","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0095-8956"]},"year":"2021","status":"public","_id":"34042","date_updated":"2022-11-09T08:44:37Z","title":"Nowhere-zero 3-flows in toroidal graphs","doi":"10.1016/j.jctb.2021.11.001","keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Theoretical Computer Science"],"user_id":"15540","publication":"Journal of Combinatorial Theory, Series B","type":"journal_article","page":"61-80","volume":153},{"issue":"6","article_number":"2100002","volume":4,"type":"journal_article","publication":"Advanced Quantum Technologies","keyword":["Electrical and Electronic Engineering","Computational Theory and Mathematics","Condensed Matter Physics","Mathematical Physics","Nuclear and High Energy Physics","Electronic","Optical and Magnetic Materials","Statistical and Nonlinear Physics"],"user_id":"42514","doi":"10.1002/qute.202100002","title":"Bright Electrically Controllable Quantum‐Dot‐Molecule Devices Fabricated by In Situ Electron‐Beam Lithography","date_updated":"2023-07-25T08:46:47Z","_id":"46135","status":"public","language":[{"iso":"eng"}],"year":"2021","publication_identifier":{"issn":["2511-9044","2511-9044"]},"publisher":"Wiley","date_created":"2023-07-25T08:45:57Z","department":[{"_id":"15"},{"_id":"230"}],"publication_status":"published","citation":{"short":"J. Schall, M. Deconinck, N. Bart, M. Florian, M. Helversen, C. Dangel, R. Schmidt, L. Bremer, F. Bopp, I. Hüllen, C. Gies, D. Reuter, A.D. Wieck, S. Rodt, J.J. Finley, F. Jahnke, A. Ludwig, S. Reitzenstein, Advanced Quantum Technologies 4 (2021).","mla":"Schall, Johannes, et al. “Bright Electrically Controllable Quantum‐Dot‐Molecule Devices Fabricated by In Situ Electron‐Beam Lithography.” <i>Advanced Quantum Technologies</i>, vol. 4, no. 6, 2100002, Wiley, 2021, doi:<a href=\"https://doi.org/10.1002/qute.202100002\">10.1002/qute.202100002</a>.","bibtex":"@article{Schall_Deconinck_Bart_Florian_Helversen_Dangel_Schmidt_Bremer_Bopp_Hüllen_et al._2021, title={Bright Electrically Controllable Quantum‐Dot‐Molecule Devices Fabricated by In Situ Electron‐Beam Lithography}, volume={4}, DOI={<a href=\"https://doi.org/10.1002/qute.202100002\">10.1002/qute.202100002</a>}, number={62100002}, journal={Advanced Quantum Technologies}, publisher={Wiley}, author={Schall, Johannes and Deconinck, Marielle and Bart, Nikolai and Florian, Matthias and Helversen, Martin and Dangel, Christian and Schmidt, Ronny and Bremer, Lucas and Bopp, Frederik and Hüllen, Isabell and et al.}, year={2021} }","chicago":"Schall, Johannes, Marielle Deconinck, Nikolai Bart, Matthias Florian, Martin Helversen, Christian Dangel, Ronny Schmidt, et al. “Bright Electrically Controllable Quantum‐Dot‐Molecule Devices Fabricated by In Situ Electron‐Beam Lithography.” <i>Advanced Quantum Technologies</i> 4, no. 6 (2021). <a href=\"https://doi.org/10.1002/qute.202100002\">https://doi.org/10.1002/qute.202100002</a>.","ieee":"J. Schall <i>et al.</i>, “Bright Electrically Controllable Quantum‐Dot‐Molecule Devices Fabricated by In Situ Electron‐Beam Lithography,” <i>Advanced Quantum Technologies</i>, vol. 4, no. 6, Art. no. 2100002, 2021, doi: <a href=\"https://doi.org/10.1002/qute.202100002\">10.1002/qute.202100002</a>.","ama":"Schall J, Deconinck M, Bart N, et al. Bright Electrically Controllable Quantum‐Dot‐Molecule Devices Fabricated by In Situ Electron‐Beam Lithography. <i>Advanced Quantum Technologies</i>. 2021;4(6). doi:<a href=\"https://doi.org/10.1002/qute.202100002\">10.1002/qute.202100002</a>","apa":"Schall, J., Deconinck, M., Bart, N., Florian, M., Helversen, M., Dangel, C., Schmidt, R., Bremer, L., Bopp, F., Hüllen, I., Gies, C., Reuter, D., Wieck, A. D., Rodt, S., Finley, J. J., Jahnke, F., Ludwig, A., &#38; Reitzenstein, S. (2021). Bright Electrically Controllable Quantum‐Dot‐Molecule Devices Fabricated by In Situ Electron‐Beam Lithography. <i>Advanced Quantum Technologies</i>, <i>4</i>(6), Article 2100002. <a href=\"https://doi.org/10.1002/qute.202100002\">https://doi.org/10.1002/qute.202100002</a>"},"intvolume":"         4","author":[{"first_name":"Johannes","full_name":"Schall, Johannes","last_name":"Schall"},{"last_name":"Deconinck","first_name":"Marielle","full_name":"Deconinck, Marielle"},{"full_name":"Bart, Nikolai","first_name":"Nikolai","last_name":"Bart"},{"full_name":"Florian, Matthias","first_name":"Matthias","last_name":"Florian"},{"first_name":"Martin","full_name":"Helversen, Martin","last_name":"Helversen"},{"last_name":"Dangel","full_name":"Dangel, Christian","first_name":"Christian"},{"first_name":"Ronny","full_name":"Schmidt, Ronny","last_name":"Schmidt"},{"full_name":"Bremer, Lucas","first_name":"Lucas","last_name":"Bremer"},{"last_name":"Bopp","first_name":"Frederik","full_name":"Bopp, Frederik"},{"last_name":"Hüllen","first_name":"Isabell","full_name":"Hüllen, Isabell"},{"last_name":"Gies","full_name":"Gies, Christopher","first_name":"Christopher"},{"full_name":"Reuter, Dirk","first_name":"Dirk","last_name":"Reuter","id":"37763"},{"first_name":"Andreas D.","full_name":"Wieck, Andreas D.","last_name":"Wieck"},{"last_name":"Rodt","first_name":"Sven","full_name":"Rodt, Sven"},{"first_name":"Jonathan J.","full_name":"Finley, Jonathan J.","last_name":"Finley"},{"first_name":"Frank","full_name":"Jahnke, Frank","last_name":"Jahnke"},{"first_name":"Arne","full_name":"Ludwig, Arne","last_name":"Ludwig"},{"last_name":"Reitzenstein","full_name":"Reitzenstein, Stephan","first_name":"Stephan"}]},{"status":"public","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1461-1570"]},"year":"2014","publisher":"Wiley","date_created":"2022-12-22T10:53:44Z","date_updated":"2023-03-06T09:43:56Z","_id":"34845","intvolume":"        17","author":[{"last_name":"Fieker","full_name":"Fieker, Claus","first_name":"Claus"},{"id":"21202","last_name":"Klüners","first_name":"Jürgen","full_name":"Klüners, Jürgen"}],"department":[{"_id":"102"}],"publication_status":"published","citation":{"ieee":"C. Fieker and J. Klüners, “Computation of Galois groups of rational polynomials,” <i>LMS Journal of Computation and Mathematics</i>, vol. 17, no. 1, pp. 141–158, 2014, doi: <a href=\"https://doi.org/10.1112/s1461157013000302\">10.1112/s1461157013000302</a>.","chicago":"Fieker, Claus, and Jürgen Klüners. “Computation of Galois Groups of Rational Polynomials.” <i>LMS Journal of Computation and Mathematics</i> 17, no. 1 (2014): 141–58. <a href=\"https://doi.org/10.1112/s1461157013000302\">https://doi.org/10.1112/s1461157013000302</a>.","short":"C. Fieker, J. Klüners, LMS Journal of Computation and Mathematics 17 (2014) 141–158.","bibtex":"@article{Fieker_Klüners_2014, title={Computation of Galois groups of rational polynomials}, volume={17}, DOI={<a href=\"https://doi.org/10.1112/s1461157013000302\">10.1112/s1461157013000302</a>}, number={1}, journal={LMS Journal of Computation and Mathematics}, publisher={Wiley}, author={Fieker, Claus and Klüners, Jürgen}, year={2014}, pages={141–158} }","ama":"Fieker C, Klüners J. Computation of Galois groups of rational polynomials. <i>LMS Journal of Computation and Mathematics</i>. 2014;17(1):141-158. doi:<a href=\"https://doi.org/10.1112/s1461157013000302\">10.1112/s1461157013000302</a>","apa":"Fieker, C., &#38; Klüners, J. (2014). Computation of Galois groups of rational polynomials. <i>LMS Journal of Computation and Mathematics</i>, <i>17</i>(1), 141–158. <a href=\"https://doi.org/10.1112/s1461157013000302\">https://doi.org/10.1112/s1461157013000302</a>","mla":"Fieker, Claus, and Jürgen Klüners. “Computation of Galois Groups of Rational Polynomials.” <i>LMS Journal of Computation and Mathematics</i>, vol. 17, no. 1, Wiley, 2014, pp. 141–58, doi:<a href=\"https://doi.org/10.1112/s1461157013000302\">10.1112/s1461157013000302</a>."},"type":"journal_article","publication":"LMS Journal of Computation and Mathematics","issue":"1","volume":17,"page":"141-158","abstract":[{"lang":"eng","text":"Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial, is a very old problem. Currently, the best algorithmic solution is Stauduhar’s method. Computationally, one of the key challenges in the application of Stauduhar’s method is to find, for a given pair of groups H<G, a G-relative H-invariant, that is a multivariate polynomial F that is H-invariant, but not G-invariant. While generic, theoretical methods are known to find such F, in general they yield impractical answers. We give a general method for computing invariants of large degree which improves on previous known methods, as well as various special invariants that are derived from the structure of the groups. We then apply our new invariants to the task of computing the Galois groups of polynomials over the rational numbers, resulting in the first practical degree independent algorithm."}],"doi":"10.1112/s1461157013000302","title":"Computation of Galois groups of rational polynomials","external_id":{"arxiv":["1211.3588"]},"keyword":["Computational Theory and Mathematics","General Mathematics"],"user_id":"93826"},{"volume":17,"page":"345-359","issue":"1","publication":"LMS Journal of Computation and Mathematics","type":"journal_article","keyword":["Computational Theory and Mathematics","General Mathematics"],"user_id":"93826","extern":"1","title":"The constructive membership problem for discrete free subgroups of rank 2 of SL₂(R)","abstract":[{"text":"We exhibit a practical algorithm for solving the constructive membership problem for discrete free subgroups of rank 2 in PSL₂(R) or SL₂(R). This algorithm, together with methods for checking whether a two-generator subgroup of PSL₂(R) or SL₂(R) is discrete and free, have been implemented in Magma for groups defined over real algebraic number fields.","lang":"eng"}],"doi":"10.1112/s1461157014000047","_id":"42794","date_updated":"2023-04-04T09:31:17Z","publisher":"Wiley","date_created":"2023-03-07T08:30:15Z","status":"public","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1461-1570"]},"year":"2014","publication_status":"published","citation":{"short":"B. Eick, M. Kirschmer, C. Leedham-Green, LMS Journal of Computation and Mathematics 17 (2014) 345–359.","mla":"Eick, B., et al. “The Constructive Membership Problem for Discrete Free Subgroups of Rank 2 of SL₂(R).” <i>LMS Journal of Computation and Mathematics</i>, vol. 17, no. 1, Wiley, 2014, pp. 345–59, doi:<a href=\"https://doi.org/10.1112/s1461157014000047\">10.1112/s1461157014000047</a>.","bibtex":"@article{Eick_Kirschmer_Leedham-Green_2014, title={The constructive membership problem for discrete free subgroups of rank 2 of SL₂(R)}, volume={17}, DOI={<a href=\"https://doi.org/10.1112/s1461157014000047\">10.1112/s1461157014000047</a>}, number={1}, journal={LMS Journal of Computation and Mathematics}, publisher={Wiley}, author={Eick, B. and Kirschmer, Markus and Leedham-Green, C.}, year={2014}, pages={345–359} }","chicago":"Eick, B., Markus Kirschmer, and C. Leedham-Green. “The Constructive Membership Problem for Discrete Free Subgroups of Rank 2 of SL₂(R).” <i>LMS Journal of Computation and Mathematics</i> 17, no. 1 (2014): 345–59. <a href=\"https://doi.org/10.1112/s1461157014000047\">https://doi.org/10.1112/s1461157014000047</a>.","ieee":"B. Eick, M. Kirschmer, and C. Leedham-Green, “The constructive membership problem for discrete free subgroups of rank 2 of SL₂(R),” <i>LMS Journal of Computation and Mathematics</i>, vol. 17, no. 1, pp. 345–359, 2014, doi: <a href=\"https://doi.org/10.1112/s1461157014000047\">10.1112/s1461157014000047</a>.","apa":"Eick, B., Kirschmer, M., &#38; Leedham-Green, C. (2014). The constructive membership problem for discrete free subgroups of rank 2 of SL₂(R). <i>LMS Journal of Computation and Mathematics</i>, <i>17</i>(1), 345–359. <a href=\"https://doi.org/10.1112/s1461157014000047\">https://doi.org/10.1112/s1461157014000047</a>","ama":"Eick B, Kirschmer M, Leedham-Green C. The constructive membership problem for discrete free subgroups of rank 2 of SL₂(R). <i>LMS Journal of Computation and Mathematics</i>. 2014;17(1):345-359. doi:<a href=\"https://doi.org/10.1112/s1461157014000047\">10.1112/s1461157014000047</a>"},"department":[{"_id":"102"}],"author":[{"first_name":"B.","full_name":"Eick, B.","last_name":"Eick"},{"last_name":"Kirschmer","id":"82258","full_name":"Kirschmer, Markus","first_name":"Markus"},{"full_name":"Leedham-Green, C.","first_name":"C.","last_name":"Leedham-Green"}],"intvolume":"        17"},{"user_id":"78614","publication_status":"published","keyword":["Computational Theory and Mathematics","Hardware and Architecture","Theoretical Computer Science","Software"],"citation":{"apa":"Alizadeh, B., Behnam, P., &#38; Sadeghi-Kohan, S. (2014). A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs. <i>IEEE Transactions on Computers</i>, 1–1. <a href=\"https://doi.org/10.1109/tc.2014.2329687\">https://doi.org/10.1109/tc.2014.2329687</a>","ama":"Alizadeh B, Behnam P, Sadeghi-Kohan S. A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs. <i>IEEE Transactions on Computers</i>. Published online 2014:1-1. doi:<a href=\"https://doi.org/10.1109/tc.2014.2329687\">10.1109/tc.2014.2329687</a>","chicago":"Alizadeh, Bijan, Payman Behnam, and Somayeh Sadeghi-Kohan. “A Scalable Formal Debugging Approach with Auto-Correction Capability Based on Static Slicing and Dynamic Ranking for RTL Datapath Designs.” <i>IEEE Transactions on Computers</i>, 2014, 1–1. <a href=\"https://doi.org/10.1109/tc.2014.2329687\">https://doi.org/10.1109/tc.2014.2329687</a>.","ieee":"B. Alizadeh, P. Behnam, and S. Sadeghi-Kohan, “A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs,” <i>IEEE Transactions on Computers</i>, pp. 1–1, 2014, doi: <a href=\"https://doi.org/10.1109/tc.2014.2329687\">10.1109/tc.2014.2329687</a>.","mla":"Alizadeh, Bijan, et al. “A Scalable Formal Debugging Approach with Auto-Correction Capability Based on Static Slicing and Dynamic Ranking for RTL Datapath Designs.” <i>IEEE Transactions on Computers</i>, Institute of Electrical and Electronics Engineers (IEEE), 2014, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/tc.2014.2329687\">10.1109/tc.2014.2329687</a>.","bibtex":"@article{Alizadeh_Behnam_Sadeghi-Kohan_2014, title={A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs}, DOI={<a href=\"https://doi.org/10.1109/tc.2014.2329687\">10.1109/tc.2014.2329687</a>}, journal={IEEE Transactions on Computers}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Alizadeh, Bijan and Behnam, Payman and Sadeghi-Kohan, Somayeh}, year={2014}, pages={1–1} }","short":"B. Alizadeh, P. Behnam, S. Sadeghi-Kohan, IEEE Transactions on Computers (2014) 1–1."},"department":[{"_id":"48"}],"author":[{"first_name":"Bijan","full_name":"Alizadeh, Bijan","last_name":"Alizadeh"},{"last_name":"Behnam","full_name":"Behnam, Payman","first_name":"Payman"},{"orcid":"https://orcid.org/0000-0001-7246-0610","last_name":"Sadeghi-Kohan","id":"78614","first_name":"Somayeh","full_name":"Sadeghi-Kohan, Somayeh"}],"extern":"1","title":"A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs","doi":"10.1109/tc.2014.2329687","_id":"46266","page":"1-1","date_updated":"2023-08-02T11:32:37Z","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","publication":"IEEE Transactions on Computers","date_created":"2023-08-02T11:15:22Z","status":"public","year":"2014","type":"journal_article","publication_identifier":{"issn":["0018-9340"]},"language":[{"iso":"eng"}]},{"type":"journal_article","publication":"LMS Journal of Computation and Mathematics","page":"172-186","volume":16,"abstract":[{"text":"We give an enumeration of all positive definite primitive Z-lattices in dimension n ≥ 3 whose genus consists of a single isometry class. This is achieved by using bounds obtained from the Smith–Minkowski–Siegel mass formula to computationally construct the square-free determinant lattices with this property, and then repeatedly calculating pre-images under a mapping first introduced by G. L. Watson.\r\n\r\nWe hereby complete the classification of single-class genera in dimensions 4 and 5 and correct some mistakes in Watson’s classifications in other dimensions. A list of all single-class primitive Z-lattices has been compiled and incorporated into the Catalogue of Lattices.","lang":"eng"}],"doi":"10.1112/s1461157013000107","title":"Single-class genera of positive integral lattices","extern":"1","user_id":"93826","keyword":["Computational Theory and Mathematics","General Mathematics"],"year":"2013","publication_identifier":{"issn":["1461-1570"]},"language":[{"iso":"eng"}],"status":"public","date_created":"2023-03-07T08:34:28Z","publisher":"Wiley","date_updated":"2023-04-04T07:57:04Z","_id":"42796","intvolume":"        16","author":[{"full_name":"Lorch, David","first_name":"David","last_name":"Lorch"},{"id":"82258","last_name":"Kirschmer","first_name":"Markus","full_name":"Kirschmer, Markus"}],"department":[{"_id":"102"}],"citation":{"mla":"Lorch, David, and Markus Kirschmer. “Single-Class Genera of Positive Integral Lattices.” <i>LMS Journal of Computation and Mathematics</i>, vol. 16, Wiley, 2013, pp. 172–86, doi:<a href=\"https://doi.org/10.1112/s1461157013000107\">10.1112/s1461157013000107</a>.","ama":"Lorch D, Kirschmer M. Single-class genera of positive integral lattices. <i>LMS Journal of Computation and Mathematics</i>. 2013;16:172-186. doi:<a href=\"https://doi.org/10.1112/s1461157013000107\">10.1112/s1461157013000107</a>","bibtex":"@article{Lorch_Kirschmer_2013, title={Single-class genera of positive integral lattices}, volume={16}, DOI={<a href=\"https://doi.org/10.1112/s1461157013000107\">10.1112/s1461157013000107</a>}, journal={LMS Journal of Computation and Mathematics}, publisher={Wiley}, author={Lorch, David and Kirschmer, Markus}, year={2013}, pages={172–186} }","apa":"Lorch, D., &#38; Kirschmer, M. (2013). Single-class genera of positive integral lattices. <i>LMS Journal of Computation and Mathematics</i>, <i>16</i>, 172–186. <a href=\"https://doi.org/10.1112/s1461157013000107\">https://doi.org/10.1112/s1461157013000107</a>","short":"D. Lorch, M. Kirschmer, LMS Journal of Computation and Mathematics 16 (2013) 172–186.","chicago":"Lorch, David, and Markus Kirschmer. “Single-Class Genera of Positive Integral Lattices.” <i>LMS Journal of Computation and Mathematics</i> 16 (2013): 172–86. <a href=\"https://doi.org/10.1112/s1461157013000107\">https://doi.org/10.1112/s1461157013000107</a>.","ieee":"D. Lorch and M. Kirschmer, “Single-class genera of positive integral lattices,” <i>LMS Journal of Computation and Mathematics</i>, vol. 16, pp. 172–186, 2013, doi: <a href=\"https://doi.org/10.1112/s1461157013000107\">10.1112/s1461157013000107</a>."},"publication_status":"published"},{"type":"journal_article","publication":"Computers &amp; Mathematics with Applications","issue":"3","page":"449-459","volume":65,"doi":"10.1016/j.camwa.2012.04.021","title":"Variable preconditioning in complex Hilbert space and its application to the nonlinear Schrödinger equation","user_id":"100441","keyword":["Computational Mathematics","Computational Theory and Mathematics","Modeling and Simulation"],"publication_identifier":{"issn":["0898-1221"]},"year":"2012","language":[{"iso":"eng"}],"status":"public","date_created":"2023-07-10T11:33:50Z","publisher":"Elsevier BV","date_updated":"2024-04-03T09:23:54Z","_id":"45933","intvolume":"        65","author":[{"full_name":"Karátson, J.","first_name":"J.","last_name":"Karátson"},{"full_name":"Kovács, Balázs","first_name":"Balázs","last_name":"Kovács","id":"100441","orcid":"0000-0001-9872-3474"}],"department":[{"_id":"841"}],"citation":{"ama":"Karátson J, Kovács B. Variable preconditioning in complex Hilbert space and its application to the nonlinear Schrödinger equation. <i>Computers &#38;amp; Mathematics with Applications</i>. 2012;65(3):449-459. doi:<a href=\"https://doi.org/10.1016/j.camwa.2012.04.021\">10.1016/j.camwa.2012.04.021</a>","apa":"Karátson, J., &#38; Kovács, B. (2012). Variable preconditioning in complex Hilbert space and its application to the nonlinear Schrödinger equation. <i>Computers &#38;amp; Mathematics with Applications</i>, <i>65</i>(3), 449–459. <a href=\"https://doi.org/10.1016/j.camwa.2012.04.021\">https://doi.org/10.1016/j.camwa.2012.04.021</a>","ieee":"J. Karátson and B. Kovács, “Variable preconditioning in complex Hilbert space and its application to the nonlinear Schrödinger equation,” <i>Computers &#38;amp; Mathematics with Applications</i>, vol. 65, no. 3, pp. 449–459, 2012, doi: <a href=\"https://doi.org/10.1016/j.camwa.2012.04.021\">10.1016/j.camwa.2012.04.021</a>.","chicago":"Karátson, J., and Balázs Kovács. “Variable Preconditioning in Complex Hilbert Space and Its Application to the Nonlinear Schrödinger Equation.” <i>Computers &#38;amp; Mathematics with Applications</i> 65, no. 3 (2012): 449–59. <a href=\"https://doi.org/10.1016/j.camwa.2012.04.021\">https://doi.org/10.1016/j.camwa.2012.04.021</a>.","bibtex":"@article{Karátson_Kovács_2012, title={Variable preconditioning in complex Hilbert space and its application to the nonlinear Schrödinger equation}, volume={65}, DOI={<a href=\"https://doi.org/10.1016/j.camwa.2012.04.021\">10.1016/j.camwa.2012.04.021</a>}, number={3}, journal={Computers &#38;amp; Mathematics with Applications}, publisher={Elsevier BV}, author={Karátson, J. and Kovács, Balázs}, year={2012}, pages={449–459} }","mla":"Karátson, J., and Balázs Kovács. “Variable Preconditioning in Complex Hilbert Space and Its Application to the Nonlinear Schrödinger Equation.” <i>Computers &#38;amp; Mathematics with Applications</i>, vol. 65, no. 3, Elsevier BV, 2012, pp. 449–59, doi:<a href=\"https://doi.org/10.1016/j.camwa.2012.04.021\">10.1016/j.camwa.2012.04.021</a>.","short":"J. Karátson, B. Kovács, Computers &#38;amp; Mathematics with Applications 65 (2012) 449–459."},"publication_status":"published"},{"date_created":"2023-05-31T12:26:42Z","publisher":"Springer Science and Business Media LLC","language":[{"iso":"eng"}],"year":"2008","publication_identifier":{"issn":["0178-7675","1432-0924"]},"status":"public","_id":"45431","date_updated":"2023-05-31T12:27:11Z","author":[{"full_name":"Mahnken, Rolf","first_name":"Rolf","id":"335","last_name":"Mahnken"}],"intvolume":"        15","citation":{"short":"R. Mahnken, Computational Mechanics 15 (2008) 408–425.","bibtex":"@article{Mahnken_2008, title={A Newton-Multigrid algrithm for elasto-plastic/viscoplastic problems}, volume={15}, DOI={<a href=\"https://doi.org/10.1007/bf00350355\">10.1007/bf00350355</a>}, number={5}, journal={Computational Mechanics}, publisher={Springer Science and Business Media LLC}, author={Mahnken, Rolf}, year={2008}, pages={408–425} }","mla":"Mahnken, Rolf. “A Newton-Multigrid Algrithm for Elasto-Plastic/Viscoplastic Problems.” <i>Computational Mechanics</i>, vol. 15, no. 5, Springer Science and Business Media LLC, 2008, pp. 408–25, doi:<a href=\"https://doi.org/10.1007/bf00350355\">10.1007/bf00350355</a>.","ieee":"R. Mahnken, “A Newton-Multigrid algrithm for elasto-plastic/viscoplastic problems,” <i>Computational Mechanics</i>, vol. 15, no. 5, pp. 408–425, 2008, doi: <a href=\"https://doi.org/10.1007/bf00350355\">10.1007/bf00350355</a>.","chicago":"Mahnken, Rolf. “A Newton-Multigrid Algrithm for Elasto-Plastic/Viscoplastic Problems.” <i>Computational Mechanics</i> 15, no. 5 (2008): 408–25. <a href=\"https://doi.org/10.1007/bf00350355\">https://doi.org/10.1007/bf00350355</a>.","ama":"Mahnken R. A Newton-Multigrid algrithm for elasto-plastic/viscoplastic problems. <i>Computational Mechanics</i>. 2008;15(5):408-425. doi:<a href=\"https://doi.org/10.1007/bf00350355\">10.1007/bf00350355</a>","apa":"Mahnken, R. (2008). A Newton-Multigrid algrithm for elasto-plastic/viscoplastic problems. <i>Computational Mechanics</i>, <i>15</i>(5), 408–425. <a href=\"https://doi.org/10.1007/bf00350355\">https://doi.org/10.1007/bf00350355</a>"},"publication_status":"published","department":[{"_id":"9"},{"_id":"154"}],"publication":"Computational Mechanics","quality_controlled":"1","type":"journal_article","page":"408-425","volume":15,"issue":"5","title":"A Newton-Multigrid algrithm for elasto-plastic/viscoplastic problems","doi":"10.1007/bf00350355","keyword":["Applied Mathematics","Computational Mathematics","Computational Theory and Mathematics","Mechanical Engineering","Ocean Engineering","Computational Mechanics"],"user_id":"335"},{"author":[{"last_name":"Mahnken","id":"335","first_name":"Rolf","full_name":"Mahnken, Rolf"}],"intvolume":"        15","citation":{"mla":"Mahnken, Rolf. “Improved Implementation of an Algorithm for Non-Linear Isotropic/Kinematic Hardening in Elastoplasticity.” <i>Communications in Numerical Methods in Engineering</i>, vol. 15, no. 10, Wiley, 2002, pp. 745–54, doi:<a href=\"https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r\">10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>.","bibtex":"@article{Mahnken_2002, title={Improved implementation of an algorithm for non-linear isotropic/kinematic hardening in elastoplasticity}, volume={15}, DOI={<a href=\"https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r\">10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>}, number={10}, journal={Communications in Numerical Methods in Engineering}, publisher={Wiley}, author={Mahnken, Rolf}, year={2002}, pages={745–754} }","short":"R. Mahnken, Communications in Numerical Methods in Engineering 15 (2002) 745–754.","apa":"Mahnken, R. (2002). Improved implementation of an algorithm for non-linear isotropic/kinematic hardening in elastoplasticity. <i>Communications in Numerical Methods in Engineering</i>, <i>15</i>(10), 745–754. <a href=\"https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r\">https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>","ama":"Mahnken R. Improved implementation of an algorithm for non-linear isotropic/kinematic hardening in elastoplasticity. <i>Communications in Numerical Methods in Engineering</i>. 2002;15(10):745-754. doi:<a href=\"https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r\">10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>","chicago":"Mahnken, Rolf. “Improved Implementation of an Algorithm for Non-Linear Isotropic/Kinematic Hardening in Elastoplasticity.” <i>Communications in Numerical Methods in Engineering</i> 15, no. 10 (2002): 745–54. <a href=\"https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r\">https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>.","ieee":"R. Mahnken, “Improved implementation of an algorithm for non-linear isotropic/kinematic hardening in elastoplasticity,” <i>Communications in Numerical Methods in Engineering</i>, vol. 15, no. 10, pp. 745–754, 2002, doi: <a href=\"https://doi.org/10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r\">10.1002/(sici)1099-0887(199910)15:10&#60;745::aid-cnm288&#62;3.0.co;2-r</a>."},"publication_status":"published","department":[{"_id":"9"},{"_id":"154"}],"date_created":"2023-05-31T12:14:42Z","publisher":"Wiley","language":[{"iso":"eng"}],"year":"2002","publication_identifier":{"issn":["1069-8299","1099-0887"]},"status":"public","_id":"45423","date_updated":"2023-05-31T12:15:12Z","title":"Improved implementation of an algorithm for non-linear isotropic/kinematic hardening in elastoplasticity","doi":"10.1002/(sici)1099-0887(199910)15:10<745::aid-cnm288>3.0.co;2-r","keyword":["Applied Mathematics","Computational Theory and Mathematics","General Engineering","Modeling and Simulation","Software"],"user_id":"335","publication":"Communications in Numerical Methods in Engineering","quality_controlled":"1","type":"journal_article","page":"745-754","volume":15,"issue":"10"},{"user_id":"335","keyword":["Applied Mathematics","Computational Mathematics","Computational Theory and Mathematics","Mechanical Engineering","Ocean Engineering","Computational Mechanics"],"title":"Numerical simulation of interface debonding with a combined damage/friction constitutive model","doi":"10.1007/s004660050493","volume":25,"page":"456-467","issue":"5","publication":"Computational Mechanics","quality_controlled":"1","type":"journal_article","publication_status":"published","citation":{"ama":"Döbert C, Mahnken R, Stein E. Numerical simulation of interface debonding with a combined damage/friction constitutive model. <i>Computational Mechanics</i>. 2002;25(5):456-467. doi:<a href=\"https://doi.org/10.1007/s004660050493\">10.1007/s004660050493</a>","apa":"Döbert, C., Mahnken, R., &#38; Stein, E. (2002). Numerical simulation of interface debonding with a combined damage/friction constitutive model. <i>Computational Mechanics</i>, <i>25</i>(5), 456–467. <a href=\"https://doi.org/10.1007/s004660050493\">https://doi.org/10.1007/s004660050493</a>","ieee":"C. Döbert, R. Mahnken, and E. Stein, “Numerical simulation of interface debonding with a combined damage/friction constitutive model,” <i>Computational Mechanics</i>, vol. 25, no. 5, pp. 456–467, 2002, doi: <a href=\"https://doi.org/10.1007/s004660050493\">10.1007/s004660050493</a>.","chicago":"Döbert, C., Rolf Mahnken, and E. Stein. “Numerical Simulation of Interface Debonding with a Combined Damage/Friction Constitutive Model.” <i>Computational Mechanics</i> 25, no. 5 (2002): 456–67. <a href=\"https://doi.org/10.1007/s004660050493\">https://doi.org/10.1007/s004660050493</a>.","bibtex":"@article{Döbert_Mahnken_Stein_2002, title={Numerical simulation of interface debonding with a combined damage/friction constitutive model}, volume={25}, DOI={<a href=\"https://doi.org/10.1007/s004660050493\">10.1007/s004660050493</a>}, number={5}, journal={Computational Mechanics}, publisher={Springer Science and Business Media LLC}, author={Döbert, C. and Mahnken, Rolf and Stein, E.}, year={2002}, pages={456–467} }","mla":"Döbert, C., et al. “Numerical Simulation of Interface Debonding with a Combined Damage/Friction Constitutive Model.” <i>Computational Mechanics</i>, vol. 25, no. 5, Springer Science and Business Media LLC, 2002, pp. 456–67, doi:<a href=\"https://doi.org/10.1007/s004660050493\">10.1007/s004660050493</a>.","short":"C. Döbert, R. Mahnken, E. Stein, Computational Mechanics 25 (2002) 456–467."},"department":[{"_id":"9"},{"_id":"154"}],"author":[{"last_name":"Döbert","first_name":"C.","full_name":"Döbert, C."},{"full_name":"Mahnken, Rolf","first_name":"Rolf","id":"335","last_name":"Mahnken"},{"last_name":"Stein","full_name":"Stein, E.","first_name":"E."}],"intvolume":"        25","_id":"45417","date_updated":"2023-05-31T12:04:35Z","publisher":"Springer Science and Business Media LLC","date_created":"2023-05-31T12:04:03Z","status":"public","year":"2002","publication_identifier":{"issn":["0178-7675","1432-0924"]},"language":[{"iso":"eng"}]},{"date_updated":"2023-05-31T12:21:15Z","_id":"45427","status":"public","publication_identifier":{"issn":["0264-4401"]},"year":"2002","language":[{"iso":"eng"}],"publisher":"Emerald","date_created":"2023-05-31T12:20:54Z","department":[{"_id":"9"},{"_id":"154"}],"publication_status":"published","citation":{"short":"R. Mahnken, M. Johansson, K. Runesson, Engineering Computations 15 (2002) 925–955.","mla":"Mahnken, Rolf, et al. “Parameter Estimation for a Viscoplastic Damage Model Using a Gradient‐based Optimization Algorithm.” <i>Engineering Computations</i>, vol. 15, no. 7, Emerald, 2002, pp. 925–55, doi:<a href=\"https://doi.org/10.1108/02644409810236920\">10.1108/02644409810236920</a>.","bibtex":"@article{Mahnken_Johansson_Runesson_2002, title={Parameter estimation for a viscoplastic damage model using a gradient‐based optimization algorithm}, volume={15}, DOI={<a href=\"https://doi.org/10.1108/02644409810236920\">10.1108/02644409810236920</a>}, number={7}, journal={Engineering Computations}, publisher={Emerald}, author={Mahnken, Rolf and Johansson, Magnus and Runesson, Kenneth}, year={2002}, pages={925–955} }","chicago":"Mahnken, Rolf, Magnus Johansson, and Kenneth Runesson. “Parameter Estimation for a Viscoplastic Damage Model Using a Gradient‐based Optimization Algorithm.” <i>Engineering Computations</i> 15, no. 7 (2002): 925–55. <a href=\"https://doi.org/10.1108/02644409810236920\">https://doi.org/10.1108/02644409810236920</a>.","ieee":"R. Mahnken, M. Johansson, and K. Runesson, “Parameter estimation for a viscoplastic damage model using a gradient‐based optimization algorithm,” <i>Engineering Computations</i>, vol. 15, no. 7, pp. 925–955, 2002, doi: <a href=\"https://doi.org/10.1108/02644409810236920\">10.1108/02644409810236920</a>.","ama":"Mahnken R, Johansson M, Runesson K. Parameter estimation for a viscoplastic damage model using a gradient‐based optimization algorithm. <i>Engineering Computations</i>. 2002;15(7):925-955. doi:<a href=\"https://doi.org/10.1108/02644409810236920\">10.1108/02644409810236920</a>","apa":"Mahnken, R., Johansson, M., &#38; Runesson, K. (2002). Parameter estimation for a viscoplastic damage model using a gradient‐based optimization algorithm. <i>Engineering Computations</i>, <i>15</i>(7), 925–955. <a href=\"https://doi.org/10.1108/02644409810236920\">https://doi.org/10.1108/02644409810236920</a>"},"intvolume":"        15","author":[{"first_name":"Rolf","full_name":"Mahnken, Rolf","id":"335","last_name":"Mahnken"},{"full_name":"Johansson, Magnus","first_name":"Magnus","last_name":"Johansson"},{"last_name":"Runesson","full_name":"Runesson, Kenneth","first_name":"Kenneth"}],"issue":"7","volume":15,"page":"925-955","type":"journal_article","quality_controlled":"1","publication":"Engineering Computations","user_id":"335","keyword":["Computational Theory and Mathematics","Computer Science Applications","General Engineering","Software"],"abstract":[{"text":"<jats:p>In this work a gradient‐based optimization method is applied in order to determine material parameters for a viscoplastic model with dynamic yield surface coupled to damage as presented in 1997. To this end a sensitivity analysis consistent with the integration scheme presented previously is performed in a systematic manner, both for strain and stress controlled experiments. The algorithm is tested in two numerical examples: first, simulated data are used, in order to re‐obtain parameters for the case of damage under monotonic loading. In the second example material parameters are obtained based on experimental data for lcf‐testing of an austenetic stainless steel, thus showing a very good agreement with respect to hardening, rate and damage effects.</jats:p>","lang":"eng"}],"doi":"10.1108/02644409810236920","title":"Parameter estimation for a viscoplastic damage model using a gradient‐based optimization algorithm"},{"intvolume":"         4","author":[{"first_name":"Jürgen","full_name":"Klüners, Jürgen","id":"21202","last_name":"Klüners"},{"first_name":"Gunter","full_name":"Malle, Gunter","last_name":"Malle"}],"department":[{"_id":"102"}],"citation":{"bibtex":"@article{Klüners_Malle_2001, title={A Database for Field Extensions of the Rationals}, volume={4}, DOI={<a href=\"https://doi.org/10.1112/s1461157000000851\">10.1112/s1461157000000851</a>}, journal={LMS Journal of Computation and Mathematics}, publisher={Wiley}, author={Klüners, Jürgen and Malle, Gunter}, year={2001}, pages={182–196} }","mla":"Klüners, Jürgen, and Gunter Malle. “A Database for Field Extensions of the Rationals.” <i>LMS Journal of Computation and Mathematics</i>, vol. 4, Wiley, 2001, pp. 182–96, doi:<a href=\"https://doi.org/10.1112/s1461157000000851\">10.1112/s1461157000000851</a>.","short":"J. Klüners, G. Malle, LMS Journal of Computation and Mathematics 4 (2001) 182–196.","ama":"Klüners J, Malle G. A Database for Field Extensions of the Rationals. <i>LMS Journal of Computation and Mathematics</i>. 2001;4:182-196. doi:<a href=\"https://doi.org/10.1112/s1461157000000851\">10.1112/s1461157000000851</a>","apa":"Klüners, J., &#38; Malle, G. (2001). A Database for Field Extensions of the Rationals. <i>LMS Journal of Computation and Mathematics</i>, <i>4</i>, 182–196. <a href=\"https://doi.org/10.1112/s1461157000000851\">https://doi.org/10.1112/s1461157000000851</a>","ieee":"J. Klüners and G. Malle, “A Database for Field Extensions of the Rationals,” <i>LMS Journal of Computation and Mathematics</i>, vol. 4, pp. 182–196, 2001, doi: <a href=\"https://doi.org/10.1112/s1461157000000851\">10.1112/s1461157000000851</a>.","chicago":"Klüners, Jürgen, and Gunter Malle. “A Database for Field Extensions of the Rationals.” <i>LMS Journal of Computation and Mathematics</i> 4 (2001): 182–96. <a href=\"https://doi.org/10.1112/s1461157000000851\">https://doi.org/10.1112/s1461157000000851</a>."},"publication_status":"published","year":"2001","publication_identifier":{"issn":["1461-1570"]},"language":[{"iso":"eng"}],"status":"public","date_created":"2022-12-23T09:56:22Z","publisher":"Wiley","date_updated":"2023-03-02T09:53:08Z","_id":"34897","abstract":[{"lang":"eng","text":"This paper announces the creation of a database for number fields. It describes the contents and the methods of access, indicates the origin of the polynomials, and formulates the aims of this collection of fields."}],"doi":"10.1112/s1461157000000851","title":"A Database for Field Extensions of the Rationals","external_id":{"arxiv":["math/0102232"]},"user_id":"93826","keyword":["Computational Theory and Mathematics","General Mathematics"],"type":"journal_article","publication":"LMS Journal of Computation and Mathematics","page":"182-196","volume":4}]