Crossref
LU-Cholesky QR algorithms for thin QR decomposition
Parallel Computing · 2020-04 · 92 · 102571
DOI: 10.1016/j.parco.2019.102571 ↗Kurz gefasst
Fachartikel in der Zeitschrift Parallel Computing, 2020-04. Verfasst von Takeshi Terao und 2 weiteren Autor:innen. Die Arbeit wurde bisher 26-mal zitiert (Crossref) und nennt 15 Literaturangaben. Gefördert von: Core Research for Evolutional Science and Technology, Nagoya University, Japan Society for the Promotion of Science.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Core Research for Evolutional Science and Technology
- Nagoya University
- Japan Society for the Promotion of Science
- RIKEN
- Ministry of Education, Culture, Sports, Science and Technology
Zitieren
APA
Terao, T., Ozaki, K., & Ogita, T. (2020). LU-Cholesky QR algorithms for thin QR decomposition. Parallel Computing, 92, 102571. https://doi.org/10.1016/j.parco.2019.102571
Vancouver
Terao T, Ozaki K, Ogita T. LU-Cholesky QR algorithms for thin QR decomposition. Parallel Computing. 2020;92:102571. doi:10.1016/j.parco.2019.102571
BibTeX
@article{Terao2020,
author = {Terao, Takeshi and Ozaki, Katsuhisa and Ogita, Takeshi},
title = {LU-Cholesky QR algorithms for thin QR decomposition},
journal = {Parallel Computing},
year = {2020},
volume = {92},
pages = {102571},
doi = {10.1016/j.parco.2019.102571}
}
EUVIMED