Fast algorithms for least squares problems with Kronecker lower subsets
Journal of Scientific Computing · 2026-04 · 107 (1)
DOI: 10.1007/s10915-026-03224-9 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Scientific Computing, online erschienen am 09.03.2026. Verfasst von Osman Asif Malik und 5 weiteren Autor:innen. Die Arbeit nennt 51 Literaturangaben. Gefördert von: Air Force Office of Scientific Research.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Air Force Office of Scientific Research
Zitieren
APA
Malik, O. A., Xu, Y., Cheng, N., Becker, S., Doostan, A., & Narayan, A. (2026). Fast algorithms for least squares problems with Kronecker lower subsets. Journal of Scientific Computing, 107(1). https://doi.org/10.1007/s10915-026-03224-9
Vancouver
Malik OA, Xu Y, Cheng N, Becker S, Doostan A, Narayan A. Fast algorithms for least squares problems with Kronecker lower subsets. Journal of Scientific Computing. 2026;107(1). doi:10.1007/s10915-026-03224-9
BibTeX
@article{Malik2026,
author = {Malik, Osman Asif and Xu, Yiming and Cheng, Nuojin and Becker, Stephen and Doostan, Alireza and Narayan, Akil},
title = {Fast algorithms for least squares problems with Kronecker lower subsets},
journal = {Journal of Scientific Computing},
year = {2026},
volume = {107},
number = {1},
doi = {10.1007/s10915-026-03224-9}
}
EUVIMED