{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:21:32Z","timestamp":1740169292087,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004054","name":"Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah","doi-asserted-by":"publisher","award":["D-326-611-1442"],"award-info":[{"award-number":["D-326-611-1442"]}],"id":[{"id":"10.13039\/501100004054","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DSR"},{"name":"Project"},{"name":"Shenzhen Scientific and Technological Fund for Research and Development, China","award":["2021Szvup152"],"award-info":[{"award-number":["2021Szvup152"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3157306","type":"journal-article","created":{"date-parts":[[2022,3,8]],"date-time":"2022-03-08T21:35:35Z","timestamp":1646775335000},"page":"28194-28205","source":"Crossref","is-referenced-by-count":4,"title":["An Interpretation of Long Short-Term Memory Recurrent Neural Network for Approximating Roots of Polynomials"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1398-8129","authenticated-orcid":false,"given":"Madiha","family":"Bukhsh","sequence":"first","affiliation":[{"name":"Department of Engineering Mechanics, Key Laboratory of Soft Machines and Smart Devices of Zhejiang Province, Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2065-6739","authenticated-orcid":false,"given":"Muhammad Saqib","family":"Ali","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, COMSATS University Islamabad (CUI), Islamabad, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7341-8625","authenticated-orcid":false,"given":"Muhammad Usman","family":"Ashraf","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Government College Women University, Sialkot, Sialkot, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5617-4198","authenticated-orcid":false,"given":"Khalid","family":"Alsubhi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, King Abdulaziz University, Jeddah, Saudi Arabia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0655-3303","authenticated-orcid":false,"given":"Weiqiu","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Engineering Mechanics, Key Laboratory of Soft Machines and Smart Devices of Zhejiang Province, Zhejiang University, Hangzhou, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1142\/6265"},{"volume-title":"Numerical Methods for Roots of Polynomials\u2013Part II","year":"2013","author":"McNamee","key":"ref2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICOSP.2000.893411"},{"key":"ref4","first-page":"1108","article-title":"Application of neural networks to finding real roots of polynomials in one element","volume-title":"Proc. ICONIP","volume":"2","author":"Huang"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/79.180705"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2001.1016718"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIE.1997.648928"},{"key":"ref8","first-page":"304","article-title":"Separation of two-dimensional polynomials via a neural net","volume-title":"Proc. Int. Conf. Modeling Simulation","author":"Hormis"},{"key":"ref9","first-page":"1565","article-title":"Finding roots of polynomials based on root moments","volume-title":"Proc. 8th Int. Conf. Neural Inf. Process. (ICONIP)","volume":"3","author":"Huang"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2004.824424"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/math9040317"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICACCS.2019.8728327"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.2000288"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11600-019-00330-1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/er.7055"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2020.3008988"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1029\/2018JD028375"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2995044"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2020.2975179"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1162\/089976604774201668"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3390\/informatics6010001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2993607"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICIEA48937.2020.9248376"},{"key":"ref25","article-title":"An overview of gradient descent optimization algorithms","author":"Ruder","year":"2016","journal-title":"arXiv:1609.04747"},{"key":"ref26","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. 3rd Int. Conf. Learn. Represent. (ICLR)","author":"Kingma"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01138"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/324\/1\/012049"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3354\/cr030079"},{"key":"ref30","article-title":"A gentle tutorial of recurrent neural network with error backpropagation","author":"Chen","year":"2016","journal-title":"arXiv:1610.02583"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46214-0_1"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.70740"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1177\/1536867x20909688"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09729726.pdf?arnumber=9729726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T23:53:50Z","timestamp":1705535630000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9729726\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3157306","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2022]]}}}