Symbolic algorithm for solving SLAEs with multi-diagonal coefficient matrices
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...
Uložené v:
| Vydané v: | Discrete and continuous models and applied computational science Ročník 33; číslo 1; s. 46 - 56 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Peoples’ Friendship University of Russia (RUDN University)
15.06.2025
|
| Predmet: | |
| ISSN: | 2658-4670, 2658-7149 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | 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. |
|---|---|
| AbstractList | 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. |
| Author | Milena, Veneva |
| Author_xml | – sequence: 1 givenname: Veneva orcidid: 0000-0002-6421-4716 surname: Milena fullname: Milena, Veneva organization: Joint Institute for Nuclear Research, RIKEN Center for Computational Science, R-CCS |
| BookMark | eNo9kF9LwzAUxYMoOOe-Q_A9mv9pfBtj6mDiw_Q5pGkyM9pG0qrs29t2w6d7z7mHc-F3Ay7b1HoA7gi-p5RJ9kClKBCXCiOKqUCMITJIJOQFmE03Rbi-PO9j7hosuu6AMaaFYgLLGXjdHZsy1dFBW-9Tjv1nA0PKsEv1T2z3cLddrjv4O_iw-a77iKpo96m1NXTJhxBd9G0PG9vn6Hx3C66CrTu_OM85-Hhav69e0PbtebNabpGjnEjkC84cIyVTnuqCE6yZVGUQUminS-zxYFdeW6KUdKx0eAprgZXjXlPJ5mBz6q2SPZivHBubjybZaCYj5b2xuY-u9iZoz5wYflSO81AUZSGk9wI7z60Ugg9dj6cul1PXZR_--wg2E2cz8jMjPzNyNowZMkgjJPsDLq9yCQ |
| Cites_doi | 10.1007/978-3-319-97277-0_33 10.1137/1.9780898718027 10.1007/s11075-012-9626-2 10.1051/epjconf/201817707004 10.1051/epjconf/201921405004 10.26456/mmg/2018-633 10.1155/2015/232456 10.4236/am.2012.34052 10.1007/978-3-0348-9272-8 10.1093/oso/9780198502388.001.0001 10.4236/ajcm.2015.53023 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.22363/2658-4670-2025-33-1-46-56 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2658-7149 |
| EndPage | 56 |
| ExternalDocumentID | oai_doaj_org_article_f9e3c5410dc44f88b856ee50ce4a6554 10_22363_2658_4670_2025_33_1_46_56 |
| GroupedDBID | AAFWJ AAYXX AFPKN ALMA_UNASSIGNED_HOLDINGS CITATION GROUPED_DOAJ VCL VIT |
| ID | FETCH-LOGICAL-c2416-e843c31b37e2984109367bf5659c9b0e0e29de9a1776c3bc0c31b39507c4e9263 |
| IEDL.DBID | DOA |
| ISSN | 2658-4670 |
| IngestDate | Fri Oct 03 12:53:49 EDT 2025 Wed Oct 29 21:21:29 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | https://creativecommons.org/licenses/by-nc/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2416-e843c31b37e2984109367bf5659c9b0e0e29de9a1776c3bc0c31b39507c4e9263 |
| ORCID | 0000-0002-6421-4716 |
| OpenAccessLink | https://doaj.org/article/f9e3c5410dc44f88b856ee50ce4a6554 |
| PageCount | 11 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_f9e3c5410dc44f88b856ee50ce4a6554 crossref_primary_10_22363_2658_4670_2025_33_1_46_56 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-06-15 |
| PublicationDateYYYYMMDD | 2025-06-15 |
| PublicationDate_xml | – month: 06 year: 2025 text: 2025-06-15 day: 15 |
| PublicationDecade | 2020 |
| PublicationTitle | Discrete and continuous models and applied computational science |
| PublicationYear | 2025 |
| Publisher | Peoples’ Friendship University of Russia (RUDN University) |
| Publisher_xml | – name: Peoples’ Friendship University of Russia (RUDN University) |
| References | ref13 ref12 ref15 ref14 ref20 ref11 ref10 ref2 ref1 ref17 ref16 ref19 ref18 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
| References_xml | – ident: ref13 – ident: ref1 – ident: ref4 – ident: ref17 doi: 10.1007/978-3-319-97277-0_33 – ident: ref2 – ident: ref5 doi: 10.1137/1.9780898718027 – ident: ref6 – ident: ref11 doi: 10.1007/s11075-012-9626-2 – ident: ref18 doi: 10.1051/epjconf/201817707004 – ident: ref19 doi: 10.1051/epjconf/201921405004 – ident: ref16 doi: 10.26456/mmg/2018-633 – ident: ref10 doi: 10.1155/2015/232456 – ident: ref8 – ident: ref3 doi: 10.4236/am.2012.34052 – ident: ref7 doi: 10.1007/978-3-0348-9272-8 – ident: ref20 doi: 10.1093/oso/9780198502388.001.0001 – ident: ref9 doi: 10.4236/ajcm.2015.53023 – ident: ref12 – ident: ref15 – ident: ref14 |
| SSID | ssj0002873506 ssib050730783 |
| Score | 2.2949688 |
| Snippet | Systems of linear algebraic equations with multi-diagonal coefficient matrices may arise after many different scientific and engineering problems, as well as... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| StartPage | 46 |
| SubjectTerms | complexity of numerical algorithms computational methods for sparse matrices numerical analysis numerical mathematical programming methods |
| Title | Symbolic algorithm for solving SLAEs with multi-diagonal coefficient matrices |
| URI | https://doaj.org/article/f9e3c5410dc44f88b856ee50ce4a6554 |
| Volume | 33 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2658-7149 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002873506 issn: 2658-4670 databaseCode: DOA dateStart: 20080101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2658-7149 dateEnd: 99991231 omitProxy: false ssIdentifier: ssib050730783 issn: 2658-4670 databaseCode: M~E dateStart: 20190101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA4iHvQgPvFNDl5DdzevzbFKxYOKUIXeQjJNfGBbaavgv3eSbcvevHjcYXdZvpnNNzMJ3xByqaLCJDo4pqIAJqKKzIErWVV6GZUvwBfNsAn98FAPBuaxNeornQlr5IEb4DrRBA5SlMUQhIh17WupQpAFBOEUcmFafTHraRVTGEkyBe5yf-o9t5A0l3nQZoWUy3B1WCiQIjsq3lkZMWgqyThPhZViaap1i61aov6ZfW52yPYibaTd5nN3yVoY75GtlpjgPrnv_4x8Uvml7uNlgjX_64hiRkoxuFLTgPbvur0ZTX1Xmk8RMoyMl5SHU5iELCSB_ENHWbI_zA7I803v6fqWLYYlMEASVizUggMvPdehMrVIKlFK-4j5mgHji1CgeRiMK7VWwD0U-WaDSIEIplL8kKyPJ-NwRKge6to7LMUcYo5sZfAvN6BKCNpEp_kx4UtQ7GejiWGxlshQ2gSlTVDaBKXl3JZ4aaU6JlcJv9UTSdc6G9DbduFt-5e3T_7jJadkM7s5TSCSZ2R9Pv0K52QDvudvs-lFDqRfDVPF7A |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Symbolic+algorithm+for+solving+SLAEs+with+multi-diagonal+coefficient+matrices&rft.jtitle=Discrete+and+continuous+models+and+applied+computational+science&rft.au=Veneva+Milena&rft.date=2025-06-15&rft.pub=Peoples%E2%80%99+Friendship+University+of+Russia+%28RUDN+University%29&rft.issn=2658-4670&rft.eissn=2658-7149&rft.volume=33&rft.issue=1&rft.spage=46&rft.epage=56&rft_id=info:doi/10.22363%2F2658-4670-2025-33-1-46-56&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_f9e3c5410dc44f88b856ee50ce4a6554 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2658-4670&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2658-4670&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2658-4670&client=summon |