2017/05/21 by Pranay Seshadri, Seshadri, Pranay
Computer Science · Mathematics · Physics and Astronomy · #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Scientific Research and Discoveries #Statistical and numerical algorithms
paper · pdf · doi:10.48550/arxiv.1705.08731
openalex publication_date 2017/05/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this rather brief note we present and discuss techniques for solving Kronecker matrix product least squares problems. Our main contribution is an iterative approach that uses the efficient Kronecker matrix-vector multiplication strategy (Fernandes et al. 1998) with a conjugate gradient solver. Numerical results contrast this approach---in terms of running times and accuracy---against the direct approach.