{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T17:18:14Z","timestamp":1771003094432,"version":"3.50.1"},"reference-count":16,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCM"],"published-print":{"date-parts":[[2019,11,11]]},"DOI":"10.3233\/jcm-190002","type":"journal-article","created":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T11:09:51Z","timestamp":1552043391000},"page":"943-953","source":"Crossref","is-referenced-by-count":1,"title":["High precision Taylor Expansion and Piecewise Calculation Square Root algorithm of microcomputer protection"],"prefix":"10.1177","volume":"19","author":[{"given":"Mei-Jie","family":"Song","sequence":"first","affiliation":[{"name":"College of Electronic Information and Automation of Guilin Institute of Aerospace Industry, Guilin, Guangxi 541004, China"}]},{"given":"Jie","family":"Dong","sequence":"additional","affiliation":[{"name":"Beijing Si Fang Automation Co., Ltd, Beijing 100085, China"}]},{"given":"Li","family":"Yun","sequence":"additional","affiliation":[{"name":"College of Electronic Information and Automation of Guilin Institute of Aerospace Industry, Guilin, Guangxi 541004, China"},{"name":"Guangxi Experiment Center of Information Science, Guilin, Guangxi 541004, China"}]}],"member":"179","reference":[{"issue":"23","key":"10.3233\/JCM-190002_ref1","first-page":"1","article-title":"Fast SQRT algorithm of microcomputer protection","volume":"38","author":"Tang","year":"2010","journal-title":"Power System Protection and Control"},{"key":"10.3233\/JCM-190002_ref2","unstructured":"M.D. Ercegovac and J.M. Muller, Digit-recurrence algorithms for division and square root with limited precision primitives, in: Conference on Signals, Systems and Computers, 2004."},{"issue":"19","key":"10.3233\/JCM-190002_ref3","first-page":"58","article-title":"A high-precision square root algorithm for microcomputer protection","volume":"39","author":"Wang","year":"2011","journal-title":"Power System Protection and Control"},{"issue":"3","key":"10.3233\/JCM-190002_ref4","first-page":"30","article-title":"The realization of the rapid extraction algorithm on the microcontroller","volume":"24","author":"Shi","year":"2007","journal-title":"Computer Technology and Development"},{"key":"10.3233\/JCM-190002_ref5","doi-asserted-by":"crossref","unstructured":"A. Nannarelli, in: IEEE 2011 IEEE 20th Symposium on Computer Arithmetic (ARITH)\u00a0\u2013 Radix-16 Combined Division and Square Root Unit, Tuebingen, Germany (2011.07.25\u20132011.07.27) 2011, pp.\u00a0169\u2013176.","DOI":"10.1109\/ARITH.2011.30"},{"key":"10.3233\/JCM-190002_ref6","first-page":"35","article-title":"The quick square root method of microprocessor","author":"Jiang","year":"2014","journal-title":"Electronic Science and Technology"},{"key":"10.3233\/JCM-190002_ref7","unstructured":"S. Wang and Y.-Y. Zhang, Analysis and Comparison of Microcomputer Protection Algorithms Technology Wind 2013\/14, pp.\u00a034\u201335."},{"key":"10.3233\/JCM-190002_ref8","unstructured":"J.R. Zhang, Review on the Simulation Algorithms of the Digital Relay ProtectionThe World of Inverters 2016\/11, pp.\u00a089\u20139194."},{"key":"10.3233\/JCM-190002_ref9","unstructured":"C.-X. Xue, Research on AC Sampling Algorithm for Relay Protection of Microcomputer Relay in Power System. Xi\u2019an University of Electronic Science and Technology, 2012.3."},{"key":"10.3233\/JCM-190002_ref10","unstructured":"X.-M. Zhang and Y.-X. Li, High precision and fast extraction algorithm based on the newton iteration method, Electric Power Automation Equipment (3) (2008)."},{"issue":"2\u20133","key":"10.3233\/JCM-190002_ref11","first-page":"205","article-title":"Based on Look-up table method of fast floating-point Number Square Root Method","volume":"25","author":"Chen","year":"2009","journal-title":"Microcomputer Information"},{"issue":"4","key":"10.3233\/JCM-190002_ref12","first-page":"444","article-title":"The iterative learning algorithm based on Taylor series","author":"Zhang","year":"2005","journal-title":"Control and Decision"},{"key":"10.3233\/JCM-190002_ref13","doi-asserted-by":"crossref","unstructured":"M. Abrate, S. Barbero, U. Cerruti and N. Murru, Periodic representations and rational approximations of square roots, Journal of Approximation Theory 175 (2013).","DOI":"10.1016\/j.jat.2013.07.004"},{"key":"10.3233\/JCM-190002_ref14","unstructured":"M.D. Ercegovac and T. Lang, Division and Square Root: Digit Recurrence Algorithms and Implementations, Kluwer: Boston; 1994."},{"key":"10.3233\/JCM-190002_ref15","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1016\/j.mejo.2009.03.004","article-title":"Floating-point division and square root using a Taylor-series expansion algorithm","volume":"40","author":"Kwon","year":"2009","journal-title":"Microelectronics Journal"},{"key":"10.3233\/JCM-190002_ref16","unstructured":"C.J. Walczyk, L.V. Moroz and J.L. Cieslinski, Improving the accuracy of the fast inverse square root algorithm, arXiv:1802.06302 [cs.NA], 2018."}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JCM-190002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T16:31:26Z","timestamp":1771000286000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JCM-190002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":16,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/jcm-190002","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,11]]}}}