{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T15:12:41Z","timestamp":1760368361373,"version":"build-2065373602"},"reference-count":21,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T00:00:00Z","timestamp":1578873600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>In this paper, we derive recursive algorithms for calculating the determinant and inverse of the generalized Vandermonde matrix. The main advantage of the recursive algorithms is the fact that the computational complexity of the presented algorithm is better than calculating the determinant and the inverse by means of classical methods, developed for the general matrices. The results of this article do not require any symbolic calculations and, therefore, can be performed by a numerical algorithm implemented in a specialized (like Matlab or Mathematica) or general-purpose programming language (C, C++, Java, Pascal, Fortran, etc.).<\/jats:p>","DOI":"10.3390\/info11010042","type":"journal-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T03:20:22Z","timestamp":1579058422000},"page":"42","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Recursive Matrix Calculation Paradigm by the Example of Structured Matrix"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5621-3783","authenticated-orcid":false,"given":"Jerzy S.","family":"Respondek","sequence":"first","affiliation":[{"name":"Institute of Computer Science, Faculty of Automatic Control, Electronics and Computer Science, Silesian University of Technology, ul. Akademicka 16, 44-100 Gliwice, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,1,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.aml.2010.08.026","article-title":"On the confluent Vandermonde matrix calculation algorithm","volume":"24","author":"Respondek","year":"2011","journal-title":"Appl. Math. Lett."},{"key":"ref_2","first-page":"2044","article-title":"Numerical recipes for the high efficient inverse of the confluent Vandermonde matrices","volume":"218","author":"Respondek","year":"2011","journal-title":"Appl. Math. Comput."},{"key":"ref_3","unstructured":"Respondek, J. (2016, January 26\u201328). Highly Efficient Recursive Algorithms for the Generalized Vandermonde Matrix. Proceedings of the 30th European Simulation and Modelling Conference\u2014ESM\u2019 2016, Las Palmas de Gran Canaria, Spain."},{"key":"ref_4","unstructured":"Respondek, J. (2019, January 28\u201330). Recursive Algorithms for the Generalized Vandermonde Matrix Determinants. Proceedings of the 33rd Annual European Simulation and Modelling Conference\u2014ESM\u2019 2019, Palma de Mallorca, Spain."},{"key":"ref_5","first-page":"643","article-title":"Explicit inverse of a generalized Vandermonde matrix","volume":"146","year":"2003","journal-title":"Appl. Math. Comput."},{"key":"ref_6","first-page":"12","article-title":"Recursive computation of inverses of confluent Vandermonde matrices","volume":"1","author":"Hou","year":"2007","journal-title":"Electron. J. Math. Technol."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1016\/S0898-1221(02)00117-7","article-title":"Inversion of confluent Vandermonde matrices","volume":"43","author":"Hou","year":"2002","journal-title":"Comput. Math. Appl."},{"key":"ref_8","unstructured":"Gorecki, H. (1993). Optimization of the Dynamical Systems, PWN."},{"key":"ref_9","unstructured":"Klamka, J. (1991). Controllability of Dynamical Systems, Kluwer Academic Publishers."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.2478\/v10006-008-0018-7","article-title":"Approximate controllability of infinite dimensional systems of the n-th order","volume":"18","author":"Respondek","year":"2008","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1080\/00207720701832655","article-title":"Approximate controllability of the n-th order infinite dimensional systems with controls delayed by the control devices","volume":"39","author":"Respondek","year":"2008","journal-title":"Int. J. Syst. Sci."},{"key":"ref_12","unstructured":"Timoshenko, S. (1955). Vibration Problems in Engineering, D, Van Nostrand Company. [3rd ed.]."},{"key":"ref_13","unstructured":"Bellman, R. (1960). Introduction to Matrix Analysis, Mcgraw-Hill Book Company."},{"key":"ref_14","first-page":"1384","article-title":"On the inversion of the Vandermonde matrix","volume":"174","author":"Eisinberg","year":"2006","journal-title":"Appl. Math. Comput."},{"key":"ref_15","unstructured":"Kincaid, D.R., and Cheney, E.W. (2001). Numerical Analysis: Mathematics of Scientific Computing, Brooks Cole. [3rd ed.]."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2587","DOI":"10.1109\/TIT.2010.2046208","article-title":"Algebraic soft-decision decoding of Hermitian codes","volume":"56","author":"Lee","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","first-page":"23","article-title":"On switching instants in minimum-time control problem. One-dimensional case n-tuple eigenvalue","volume":"16","author":"Gorecki","year":"1968","journal-title":"Bull. Acad. Pol. Sci."},{"key":"ref_18","unstructured":"Yan, S., and Yang, A. (2009, January 5\u20136). Explicit Algorithm to the Inverse of Vandermonde Matrix. Proceedings of the 2009 Internatonal Conference on Test and Measurement, Hong Kong, China."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"A2783","DOI":"10.1137\/141002062","article-title":"A preconditioner for a primal-dual newton conjugate gradients method for compressed sensing problems","volume":"37","author":"Dassios","year":"2015","journal-title":"SIAM J. Sci. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Dassios, I., and Baleanu, D. (2018). Optimal solutions for singular linear systems of Caputo fractional differential equations. Math. Methods Appl. Sci.","DOI":"10.1002\/mma.5410"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Dassios, I. (2019). Analytic Loss Minimization: Theoretical Framework of a Second Order Optimization Method. Symmetry, 11.","DOI":"10.3390\/sym11020136"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/11\/1\/42\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:33:05Z","timestamp":1760365985000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/11\/1\/42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,13]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1]]}},"alternative-id":["info11010042"],"URL":"https:\/\/doi.org\/10.3390\/info11010042","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2020,1,13]]}}}