{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T11:51:38Z","timestamp":1771329098746,"version":"3.50.1"},"reference-count":33,"publisher":"Wiley","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Education and Science of Republic of Serbia","award":["174013"],"award-info":[{"award-number":["174013"]}]},{"name":"Goce Del\u010dev University","award":["174013"],"award-info":[{"award-number":["174013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2017]]},"abstract":"<jats:p>Conditions for the existence and representations of <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:mrow><mml:mfenced open=\"{\" close=\"}\" separators=\"|\"><mml:mrow><mml:mn mathvariant=\"normal\">2<\/mml:mn><\/mml:mrow><\/mml:mfenced><\/mml:mrow><\/mml:math>-, <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><mml:mrow><mml:mfenced open=\"{\" close=\"}\" separators=\"|\"><mml:mrow><mml:mn mathvariant=\"normal\">1<\/mml:mn><\/mml:mrow><\/mml:mfenced><\/mml:mrow><\/mml:math>-, and <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\"><mml:mrow><mml:mfenced open=\"{\" close=\"}\" separators=\"|\"><mml:mrow><mml:mn mathvariant=\"normal\">1,2<\/mml:mn><\/mml:mrow><\/mml:mfenced><\/mml:mrow><\/mml:math>-inverses which satisfy certain conditions on ranges and\/or null spaces are introduced. These representations are applicable to complex matrices and involve solutions of certain matrix equations. Algorithms arising from the introduced representations are developed. Particularly, these algorithms can be used to compute the Moore-Penrose inverse, the Drazin inverse, and the usual matrix inverse. The implementation of introduced algorithms is defined on the set of real matrices and it is based on the Simulink implementation of GNN models for solving the involved matrix equations. In this way, we develop computational procedures which generate various classes of inner and outer generalized inverses on the basis of resolving certain matrix equations. As a consequence, some new relationships between the problem of solving matrix equations and the problem of numerical computation of generalized inverses are established. Theoretical results are applicable to complex matrices and the developed algorithms are applicable to both the time-varying and time-invariant real matrices.<\/jats:p>","DOI":"10.1155\/2017\/6429725","type":"journal-article","created":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T17:02:31Z","timestamp":1496682151000},"page":"1-27","source":"Crossref","is-referenced-by-count":22,"title":["Conditions for Existence, Representations, and Computation of Matrix Generalized Inverses"],"prefix":"10.1155","volume":"2017","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0655-3741","authenticated-orcid":true,"given":"Predrag S.","family":"Stanimirovi\u0107","sequence":"first","affiliation":[{"name":"Faculty of Science and Mathematics, Department of Computer Science, University of Ni\u0161, Vi\u0161egradska 33, 18000 Ni\u0161, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8625-4682","authenticated-orcid":true,"given":"Miroslav","family":"\u0106iri\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Science and Mathematics, Department of Computer Science, University of Ni\u0161, Vi\u0161egradska 33, 18000 Ni\u0161, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9752-9856","authenticated-orcid":true,"given":"Igor","family":"Stojanovi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, Goce Del\u010dev University, Goce Del\u010dev 89, 2000 \u0160tip, Macedonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Gerontitis","sequence":"additional","affiliation":[{"name":"Aristoteleion Panepistimion, Thessalonikis, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","year":"2003"},{"key":"24","year":"2003"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2007.05.011"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1142\/S1005386706000368"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(99)00269-4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2013.05.005"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/262034"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2008.04.037"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2013.12.033"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(98)00008-1"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-3003(01)00327-7"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1080\/00207160108805075"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2008.04.024"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1137\/1010035"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.09.004"},{"key":"8","first-page":"397","volume-title":"An optimization network for matrix inversion","year":"1988"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/0096-3003(92)90040-8"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/0096-3003(93)90007-2"},{"key":"5","first-page":"387","volume":"40","year":"1992","journal-title":"Bulletin of the Polish Academy of Sciences, Technical Sciences"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/81.167018"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827594267161"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-3003(99)00147-2"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00549"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2397551"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00821"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2016.03.035"},{"issue":"(1-2)","key":"2","first-page":"155","volume":"11","year":"2003","journal-title":"Journal of Applied Mathematics and Computing"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2011.04.024"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2014.06.010"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1007\/BF02238196"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/298689"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1002\/mma.2751"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-013-0062-2"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2017\/6429725.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2017\/6429725.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2017\/6429725.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T17:02:34Z","timestamp":1496682154000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2017\/6429725\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":33,"alternative-id":["6429725","6429725"],"URL":"https:\/\/doi.org\/10.1155\/2017\/6429725","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}