<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">44732</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2025-33-1-46-56</article-id><article-id pub-id-type="edn">BLFUDE</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Modeling and Simulation</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Математическое моделирование</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Symbolic algorithm for solving SLAEs with multi-diagonal coefficient matrices</article-title><trans-title-group xml:lang="ru"><trans-title>Символьный алгоритм решения СЛАУ с многодиагональными матрицами коэффициентов</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-6421-4716</contrib-id><name-alternatives><name xml:lang="en"><surname>Milena</surname><given-names>Veneva</given-names></name><name xml:lang="ru"><surname>Венева</surname><given-names>Милена</given-names></name></name-alternatives><bio xml:lang="en"><p>Master of Sciences in Applied Mathematics</p></bio><email>milena.p.veneva@gmail.com</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Joint Institute for Nuclear Research</institution></aff><aff><institution xml:lang="ru">Объединённый институт ядерных исследований</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">RIKEN Center for Computational Science, R-CCS</institution></aff><aff><institution xml:lang="ru">Центр вычислительной науки RIKEN (R-CCS)</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2025-06-15" publication-format="electronic"><day>15</day><month>06</month><year>2025</year></pub-date><volume>33</volume><issue>1</issue><issue-title xml:lang="en">VOL 33, NO1 (2025)</issue-title><issue-title xml:lang="ru">ТОМ 33, №1 (2025)</issue-title><fpage>46</fpage><lpage>56</lpage><history><date date-type="received" iso-8601-date="2025-06-27"><day>27</day><month>06</month><year>2025</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2025, Milena V.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2025, Венева М.</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="en">Milena V.</copyright-holder><copyright-holder xml:lang="ru">Венева М.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by-nc/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/44732">https://journals.rudn.ru/miph/article/view/44732</self-uri><abstract xml:lang="en"><p>Systems of linear algebraic equations with multi-diagonal coefficient matrices may arise after many different scientific and engineering problems, as well as problems of the computational linear algebra where finding the solution of such a system of linear algebraic equations is considered to be one of the most important problems. This paper presents a generalised symbolic algorithm for solving systems of linear algebraic equations with multi-diagonal coefficient matrices. The algorithm is given in a pseudocode. A theorem which gives the condition for correctness of the algorithm is formulated and proven. Formula for the complexity of the multidiagonal numerical algorithm is obtained.</p></abstract><trans-abstract xml:lang="ru"><p>Системы линейных алгебраических уравнений с многодиагональными матрицами коэффициентов возникают во многих прикладных и теоретических задачах науки и техники, а также в задачах вычислительной линейной алгебры, где их решение представляет собой одну из ключевых проблем. В данной работе представлен обобщённый символьный алгоритм решения систем линейных алгебраических уравнений с многодиагональными матрицами коэффициентов. Алгоритм приведён в виде псевдокода. Сформулирована и доказана теорема, определяющая условие корректности алгоритма. Получена формула, описывающая вычислительную сложность соответствующего численного алгоритма для многодиагональных систем.</p></trans-abstract><kwd-group xml:lang="en"><kwd>numerical analysis</kwd><kwd>computational methods for sparse matrices</kwd><kwd>numerical mathematical programming methods</kwd><kwd>complexity of numerical algorithms</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>численные методы</kwd><kwd>вычислительные методы для разреженных матриц</kwd><kwd>методы численного математического программирования</kwd><kwd>вычислительная сложность численных алгоритмов</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Spiteri, R. J. Notes in Numerical Analysis I. Chapter 2 (University of Saskatchewan, 2007).</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Christov, C. I. Gaussian elimination with pivoting for multidiagonal systems. University of Reading, Department of Mathematics, Numerical Analysis Report 5/94 (1994).</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>El-Mikkawy, M. A Generalized Symbolic Thomas Algorithm. Applied Mathematics 3, 342-345. doi:10.4236/am.2012.34052 (2012).</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Thomas, L. H. Elliptic Problems in Linear Difference Equations over a Network (Watson Sci. Comput. Lab. Rept., Columbia University, 1949).</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Higham, N. J. Accuracy and Stability of Numerical Algorithms 2nd ed. 710 pp. (SIAM, 2002).</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Samarskii, A. A. &amp; Nikolaev, E. S. Metody Resheniya Setochnyh Uravnenii Russian (Nauka, 1978).</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Samarskii, A. A. &amp; Nikolaev, E. S. Numerical Methods for Grid Equations. Direct Methods (Birkhäuser Basel, 1989).</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Karawia, A. A. &amp; Rizvi, Q. M. On solving a general bordered tridiagonal linear system. International Journal of Mathematical Sciences 33 (2013).</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Atlan, F. &amp; El-Mikkawy, M. A new symbolic algorithm for solving general opposite-bordered tridiagonal linear systems. American Journal of Computational Mathematics 5, 258-266. doi:10. 4236/ajcm.2015.53023 (2015).</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Askar, S. S. &amp; Karawia, A. A. On Solving Pentadiagonal Linear Systems via Transformations. Mathematical Problems in Engineering. Hindawi Publishing Corporation. 9. doi:10.1155/2015/232456 (2015).</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Jia, J.-T. &amp; Jiang, Y.-L. Symbolic algorithm for solving cyclic penta-diagonal linear systems. Numerical Algorithms 63, 357-367. doi:10.1007/s11075-012-9626-2 (2012).</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Karawia, A. A. A new algorithm for general cyclic heptadiagonal linear systems using Sherman-Morrisor-Woodbury formula. ARS Combinatoria 108, 431-443 (2013).</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Bernardin, L. e. a. Maple Programming Guide (Maplesoft, a division of Waterloo Maple Inc., 1996-2021.).</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Wolfram Research, I. System Modeler (Version 13.2, Champaign, IL, 2022).</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Higham, D. J. &amp; Higham, N. J. MATLAB guide (SIAM, 2016).</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Veneva, M. &amp; Ayriyan, A. Symbolic Algorithm for Solving SLAEs with Heptadiagonal Coefficient Matrices. Mathematical Modelling and Geometry 6, 22-29 (2018).</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Veneva, M. &amp; Ayriyan, A. Performance Analysis of Effective Methods for Solving Band Matrix SLAEs after Parabolic Nonlinear PDEs in Advanced Computing in Industrial Mathematics, Revised Selected Papers of the 12th Annual Meeting of the Bulgarian Section of SIAM, December 20-22, 2017, Sofia, Bulgaria (Studies in Computational Intelligence, 2019), 407-419. doi:10.1007/978-3-319-97277-0_33.</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Veneva, M. &amp; Ayriyan, A. Effective Methods for Solving Band SLAEs after Parabolic Nonlinear PDEs. AYSS-2017, European Physics Journal - Web of Conferences (EPJ-WoC) 177 (2018).</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Veneva, M. &amp; Ayriyan, A. Performance Analysis of Effective Symbolic Methods for Solving Band Matrix SLAEs in 23rd International Conference on Computing in High Energy and Nuclear Physics (CHEP 2018) 214 (European Physics Journal - Web of Conferences (EPJ-WoC), 2019).</mixed-citation></ref><ref id="B20"><label>20.</label><mixed-citation>Kaye, R. &amp; Wilson, R. Linear Algebra 242 pp. (Oxford University Press, 1998).</mixed-citation></ref></ref-list></back></article>
