The QR factorization of a banded-plus-semiseparable matrix is computable in linear complexity with Householder reflections

Tao Chen, Sheehan Olver

We show that the QR factorization of a banded-plus-semiseparable (BPS) matrix is computable in optimal linear complexity with respect to the discretization size by showing that the…