Crossref
On exact computational complexity of triangular factorization algorithms for general banded matrices
Advances in Computational Science and Engineering · 2024
DOI: 10.3934/acse.2024006 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances in Computational Science and Engineering, 2024. Verfasst von Qingyi Li und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Li, Q., & Zhu, L. (2024). On exact computational complexity of triangular factorization algorithms for general banded matrices. Advances in Computational Science and Engineering. https://doi.org/10.3934/acse.2024006
Vancouver
Li Q, Zhu L. On exact computational complexity of triangular factorization algorithms for general banded matrices. Advances in Computational Science and Engineering. 2024. doi:10.3934/acse.2024006
BibTeX
@article{Li2024,
author = {Li, Qingyi and Zhu, Liyong},
title = {On exact computational complexity of triangular factorization algorithms for general banded matrices},
journal = {Advances in Computational Science and Engineering},
year = {2024},
doi = {10.3934/acse.2024006}
}
EUVIMED