# Kronecker Product Least Squares

**Authors:** Pranay Seshadri

arXiv: 1705.08731 · 2017-05-25

## TL;DR

This paper introduces an iterative method using conjugate gradient and efficient Kronecker multiplication for solving Kronecker product least squares problems, demonstrating improved performance over direct methods.

## Contribution

It presents a novel iterative approach combining conjugate gradient with Kronecker matrix-vector multiplication for least squares problems.

## Key findings

- Iterative approach reduces computation time.
- Method achieves comparable or better accuracy.
- Numerical results validate efficiency improvements.

## Abstract

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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1705.08731/full.md

## Figures

1 figure with captions in the complete paper: https://tomesphere.com/paper/1705.08731/full.md

## References

8 references — full list in the complete paper: https://tomesphere.com/paper/1705.08731/full.md

---
Source: https://tomesphere.com/paper/1705.08731