{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:09Z","timestamp":1740107829579,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2021,7,16]],"date-time":"2021-07-16T00:00:00Z","timestamp":1626393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,16]],"date-time":"2021-07-16T00:00:00Z","timestamp":1626393600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100009038","name":"University of Guilan","doi-asserted-by":"crossref","award":["191600"],"award-info":[{"award-number":["191600"]}],"id":[{"id":"10.13039\/100009038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s00500-021-05977-x","type":"journal-article","created":{"date-parts":[[2021,7,16]],"date-time":"2021-07-16T14:02:51Z","timestamp":1626444171000},"page":"11865-11876","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A novel algorithm for computing interior eigenpairs of large non-symmetric matrices"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6237-3118","authenticated-orcid":false,"given":"Ali","family":"Jamalian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Aminikhah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,16]]},"reference":[{"issue":"1\u20132","key":"5977_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.mcm.2011.01.043","volume":"54","author":"H Aminikhah","year":"2011","unstructured":"Aminikhah H, Jamalian A (2011) A new algorithm for computing eigenpairs of matrices. Mathematical and computer modelling 54(1\u20132):119\u2013130. https:\/\/doi.org\/10.1016\/j.mcm.2011.01.043","journal-title":"Mathematical and computer modelling"},{"issue":"3","key":"5977_CR2","first-page":"183","volume":"4","author":"H Aminikhah","year":"2009","unstructured":"Aminikhah H, Moosaei H (2009) Weighted harmonic projection method for computing the eigenvalues of nonsymmetric matrix. Journal of Information and Computing Science 4(3):183\u2013190","journal-title":"Journal of Information and Computing Science"},{"issue":"4","key":"5977_CR3","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/bf01932736","volume":"29","author":"SF Ashby","year":"1989","unstructured":"Ashby SF, Manteuffel TA, Saylor PE (1989) Adaptive polynomial preconditioning for hermitian indefinite linear systems. BIT Numerical Mathematics 29(4):583\u2013609. https:\/\/doi.org\/10.1007\/bf01932736","journal-title":"BIT Numerical Mathematics"},{"key":"5977_CR4","unstructured":"Bai Z (1998) Test matrix collection for non-hermitian eigenvalue problems, matrix market. http:\/\/math nist gov\/MatrixMarket"},{"issue":"1","key":"5977_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/bf02141745","volume":"12","author":"D Calvetti","year":"1996","unstructured":"Calvetti D, Reichel L (1996) An adaptive richardson iteration method for indefinite linear systems. Numerical Algorithms 12(1):125\u2013149. https:\/\/doi.org\/10.1007\/bf02141745","journal-title":"Numerical Algorithms"},{"key":"5977_CR6","doi-asserted-by":"publisher","unstructured":"Cline AK, Golub GH, Platzman GW (1976) Calculation of normal modes of oceans using a lanczos method. In: Sparse Matrix Computations, Elsevier, pp 409\u2013426, https:\/\/doi.org\/10.1016\/b978-0-12-141050-6.50029-5","DOI":"10.1016\/b978-0-12-141050-6.50029-5"},{"key":"5977_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0024-3795(91)90380-f","volume":"154","author":"R Freund","year":"1991","unstructured":"Freund R (1991) On polynomial preconditioning and asymptotic convergence factors for indefinite hermitian matrices. Linear algebra and its applications 154:259\u2013288. https:\/\/doi.org\/10.1016\/0024-3795(91)90380-f","journal-title":"Linear algebra and its applications"},{"key":"5977_CR8","first-page":"89","volume":"1","author":"M Hanke","year":"1993","unstructured":"Hanke M, Hochbruck M (1993) A chebyshev-like semi iteration for inconsistent linear systems. Electronic Transactions on Numerical Analysis 1:89\u2013103","journal-title":"Electronic Transactions on Numerical Analysis"},{"key":"5977_CR9","unstructured":"Jamalian A, Aminikhah H (2021) An efficient iterative method for solving large linear systems. Journal of Hyperstructures 9(1):49\u201361"},{"issue":"4","key":"5977_CR10","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/s0168-9274(01)00132-5","volume":"42","author":"Z Jia","year":"2002","unstructured":"Jia Z (2002) The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices. Applied numerical mathematics 42(4):489\u2013512. https:\/\/doi.org\/10.1016\/s0168-9274(01)00132-5","journal-title":"Applied numerical mathematics"},{"key":"5977_CR11","doi-asserted-by":"publisher","unstructured":"Manteuffel TA, Starke G (1996) On hybrid iterative methods for nonsymmetric systems of linear equations. Numerische Mathematik 73(4):489\u2013506. https:\/\/doi.org\/10.1007\/s002110050202","DOI":"10.1007\/s002110050202"},{"issue":"1","key":"5977_CR12","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0913022","volume":"13","author":"HD Mittelmann","year":"1992","unstructured":"Mittelmann HD, Law CC, Jankowski DF, Neitzel GP (1992) A large, sparse, and indefinite generalized eigenvalue problem from fluid mechanics. SIAM Journal on Scientific and Statistical Computing 13(1):411\u2013424. https:\/\/doi.org\/10.1137\/0913022","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"5977_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0024-3795(91)90381-6","volume":"154","author":"RB Morgan","year":"1991","unstructured":"Morgan RB (1991) Computing interior eigenvalues of large matrices. Linear Algebra and its Applications 154:289\u2013309. https:\/\/doi.org\/10.1016\/0024-3795(91)90381-6","journal-title":"Linear Algebra and its Applications"},{"issue":"4","key":"5977_CR14","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1137\/s0895479893253975","volume":"16","author":"RB Morgan","year":"1995","unstructured":"Morgan RB (1995) A restarted gmres method augmented with eigenvectors. SIAM Journal on Matrix Analysis and Applications 16(4):1154\u20131171. https:\/\/doi.org\/10.1137\/s0895479893253975","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"5977_CR15","doi-asserted-by":"crossref","unstructured":"Morgan RB, Zeng M (1998) Harmonic projection methods for large non-symmetric eigenvalue problems. Numer Linear Algebra Appl 5(1):33\u201355. https:\/\/doi.org\/10.1002\/(SICI)1099-1506(199801\/02)5:1%3C33::AID-NLA125%3E3.0.CO;2-1","DOI":"10.1002\/(SICI)1099-1506(199801\/02)5:1<33::AID-NLA125>3.0.CO;2-1"},{"issue":"1","key":"5977_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.amc.2007.08.069","volume":"198","author":"HS Najafi","year":"2008","unstructured":"Najafi HS, Moosaei H (2008) A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix. Applied mathematics and computation 198(1):143\u2013149. https:\/\/doi.org\/10.1016\/j.amc.2007.08.069","journal-title":"Applied mathematics and computation"},{"key":"5977_CR17","doi-asserted-by":"publisher","unstructured":"Nandy S, Sharma R, Bhattacharyya S (2011) Solving symmetric eigenvalue problem via genetic algorithms: Serial versus parallel implementation. Applied Soft Computing 11(5):3946\u20133961. https:\/\/doi.org\/10.1016\/j.asoc.2011.02.024","DOI":"10.1016\/j.asoc.2011.02.024"},{"issue":"7\u20138","key":"5977_CR18","doi-asserted-by":"publisher","first-page":"4935","DOI":"10.1016\/j.apm.2015.12.015","volume":"40","author":"FJ Navarro-Gonz\u00e1lez","year":"2016","unstructured":"Navarro-Gonz\u00e1lez FJ, Compa\u00f1 P, Satorre R, Villacampa Y (2016) Numerical determination for solving the symmetric eigenvector problem using genetic algorithm. Applied Mathematical Modelling 40(7\u20138):4935\u20134947. https:\/\/doi.org\/10.1016\/j.apm.2015.12.015","journal-title":"Applied Mathematical Modelling"},{"key":"5977_CR19","doi-asserted-by":"publisher","unstructured":"Rao R (2016) Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems. International Journal of Industrial Engineering Computations 7(1):19\u201334. https:\/\/doi.org\/10.5267\/j.ijiec.2015.8.004","DOI":"10.5267\/j.ijiec.2015.8.004"},{"key":"5977_CR20","doi-asserted-by":"publisher","unstructured":"Rao RV (2019) Jaya: an advanced optimization algorithm and its engineering applications. Springer. https:\/\/doi.org\/10.1007\/978-3-319-78922-4","DOI":"10.1007\/978-3-319-78922-4"},{"key":"5977_CR21","unstructured":"Saad Y (1985) Partial eigensolutions of large nonsymmetric matrices. Yale University, Department of Computer Science, Tech. rep"},{"key":"5977_CR22","doi-asserted-by":"publisher","unstructured":"Saad Y (2011) Numerical methods for large eigenvalue problems: revised edition. SIAM, https:\/\/doi.org\/10.1137\/1.9781611970739","DOI":"10.1137\/1.9781611970739"},{"issue":"2","key":"5977_CR23","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1002\/nla.2026","volume":"23","author":"AK Saibaba","year":"2016","unstructured":"Saibaba AK, Lee J, Kitanidis PK (2016) Randomized algorithms for generalized hermitian eigenvalue problems with application to computing karhunen-lo\u00e8ve expansion. Numerical Linear Algebra with Applications 23(2):314\u2013339. https:\/\/doi.org\/10.1002\/nla.2026","journal-title":"Numerical Linear Algebra with Applications"},{"issue":"1","key":"5977_CR24","first-page":"131","volume":"3","author":"M Shahrouzi","year":"2013","unstructured":"Shahrouzi M, Yousefi A (2013) Fixed-weight eigenvalue optimization of truss structures by swarm intelligent algorithms. Iran University of Science & Technology 3(1):131\u2013149","journal-title":"Iran University of Science & Technology"},{"issue":"1\u20133","key":"5977_CR25","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/s0024-3795(01)00289-0","volume":"335","author":"A Sidi","year":"2001","unstructured":"Sidi A (2001) Dgmres: A gmres-type algorithm for drazin-inverse solution of singular non-symmetric linear systems. Linear Algebra Appl 335(1\u20133):189\u2013204. https:\/\/doi.org\/10.1016\/s0024-3795(01)00289-0","journal-title":"Linear Algebra Appl"},{"key":"5977_CR26","doi-asserted-by":"publisher","unstructured":"Tanaka H, Kung EC (1988) Normal mode energetics of the general circulation during the fgge year. J Atmos Sci 45(23):3723\u20133737.\u00a0https:\/\/doi.org\/10.1175\/1520-0469(1988)045<3723:NMEOTG>2.0.CO;2","DOI":"10.1175\/1520-0469(1988)045<3723:NMEOTG>2.0.CO;2"},{"key":"5977_CR27","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.asoc.2018.11.00","volume":"75","author":"Y Villacampa","year":"2019","unstructured":"Villacampa Y, Navarro-Gonz\u00e1lez FJ, Compa\u00f1-Rosique P, Satorre-Cuerda R (2019) A guided genetic algorithm for diagonalization of symmetric and hermitian matrices. Applied Soft Computing 75:180\u2013189. https:\/\/doi.org\/10.1016\/j.asoc.2018.11.00","journal-title":"Applied Soft Computing"},{"issue":"1","key":"5977_CR28","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.cam.2006.05.035","volume":"205","author":"G Wu","year":"2007","unstructured":"Wu G (2007) A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigenproblems. Journal of computational and Applied Mathematics 205(1):343\u2013363. https:\/\/doi.org\/10.1016\/j.cam.2006.05.035","journal-title":"Journal of computational and Applied Mathematics"},{"key":"5977_CR29","doi-asserted-by":"publisher","unstructured":"Zhong H, Wu G (2011) Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems. International Journal of Computer Mathematics 88(5):994\u20131012. https:\/\/doi.org\/10.1016\/j.laa.2014.08.011","DOI":"10.1016\/j.laa.2014.08.011"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05977-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-05977-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05977-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T14:44:31Z","timestamp":1628520271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-05977-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,16]]},"references-count":29,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["5977"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-05977-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2021,7,16]]},"assertion":[{"value":"15 June 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All the codes implemented during this study are available from the corresponding author on reasonable request.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}