Reparameterized Low-Rank Updates

• Reparameterized low-rank updates are techniques that refine solutions to matrix equations by applying targeted low-rank corrections instead of full recomputation.
• They leverage rational and extended Krylov subspace methods to efficiently compress correction terms, ensuring rapid convergence and rigorous singular value decay guarantees.
• This approach underpins scalable solvers for Sylvester, Lyapunov, and Riccati equations, yielding significant speedups and memory savings in large-scale control and PDE applications.

Reparameterized Updates (Low-Rank)

A reparameterized low-rank update is a computational strategy in which the solution to a linear or nonlinear matrix equation—in particular, Sylvester, Lyapunov, and Riccati equations—is updated when the coefficients undergo structured low-rank changes. Rather than recomputing the full solution, the method targets only the correction, exploiting the low effective dimension induced by the perturbation. The approach leverages rational or extended block Krylov subspace methods for efficient large-scale computation, enables rigorous singular value decay guarantees, and underpins scalable algorithms for divide-and-conquer over hierarchical low-rank structures such as HODLR and HSS matrices. Reparameterized low-rank updating is now fundamental to large-scale control, PDE discretizations, and matrix function applications, yielding nearly linear time and memory complexity when appropriately embedded (Kressner et al., 2017).

1. Sylvester/Lyapunov Equation and Low-Rank Modeling

Consider the Sylvester equation

$A\,X \;+\; X\,B \;=\; C,$

where $A\in\mathbb{C}^{n\times n}$, $B\in\mathbb{C}^{m\times m}$, and $C\in\mathbb{C}^{n\times m}$, with $$\operatorname{spec}(A)\cap[-\operatorname{spec}(B)]=\varnothing$$ to guarantee unique solvability. The Lyapunov case is recovered for $B=A^*$, $C=C^* \preceq 0$, and Hurwitz $A$.

Suppose a reference solution $X_0$ to $A_0 X_0 + X_0 B_0 = C_0$ is known. A low-rank perturbation modifies the problem: $A\in\mathbb{C}^{n\times n}$0 with each update possessing factored form, e.g., $A\in\mathbb{C}^{n\times n}$1, $A\in\mathbb{C}^{n\times n}$2, $A\in\mathbb{C}^{n\times n}$3, where the ranks are much smaller than $A\in\mathbb{C}^{n\times n}$4.

2. Correction Equation and Right-Hand Side Compression

Subtracting the old from the new Sylvester equation and collecting terms yields a correction equation for $A\in\mathbb{C}^{n\times n}$5: $A\in\mathbb{C}^{n\times n}$6 where

$A\in\mathbb{C}^{n\times n}$7

with rank at most $A\in\mathbb{C}^{n\times n}$8.

A skinny factorization $A\in\mathbb{C}^{n\times n}$9 with

$B\in\mathbb{C}^{m\times m}$0

enables efficient compressed low-rank representation. A thin SVD can further reduce this to an optimal (numerically) effective rank $B\in\mathbb{C}^{m\times m}$1.

3. Rational and Extended Block Krylov Subspaces

To solve

$B\in\mathbb{C}^{m\times m}$2

with $B\in\mathbb{C}^{m\times m}$3 of small column dimension, tensorized block (rational/extended) Krylov subspaces are constructed:

• Left: $B\in\mathbb{C}^{m\times m}$4
• Right: $B\in\mathbb{C}^{m\times m}$5

After $B\in\mathbb{C}^{m\times m}$6 iterations, orthonormal bases $B\in\mathbb{C}^{m\times m}$7, $B\in\mathbb{C}^{m\times m}$8 are formed ($B\in\mathbb{C}^{m\times m}$9), yielding the approximation $C\in\mathbb{C}^{n\times m}$0. The "compressed" Sylvester equation is small ($C\in\mathbb{C}^{n\times m}$1) and solved directly, with convergence monitored via the residual norm.

4. Algorithmic Workflow, Computational Complexity, and Storage

The procedure divides into two stages:

1. Right-Hand Side Compression: Compute and compress $C\in\mathbb{C}^{n\times m}$2 factors on the updated right-hand side.
2. EKSM Solution: Apply the extended Krylov subspace method to produce the low-rank correction $C\in\mathbb{C}^{n\times m}$3.

High-level pseudocode:

• Input: $C\in\mathbb{C}^{n\times m}$4
• Compute $C\in\mathbb{C}^{n\times m}$5 so $C\in\mathbb{C}^{n\times m}$6, recompress as needed.
• Solve $C\in\mathbb{C}^{n\times m}$7 via block EKSM.
• Return the updated solution $C\in\mathbb{C}^{n\times m}$8.

Complexity:

• For HODLR coefficients, a single EKSM invocation costs $C\in\mathbb{C}^{n\times m}$9 flops (or $$\operatorname{spec}(A)\cap[-\operatorname{spec}(B)]=\varnothing$$0 for HSS).
• Memory requirements: storing $$\operatorname{spec}(A)\cap[-\operatorname{spec}(B)]=\varnothing$$1 in $$\operatorname{spec}(A)\cap[-\operatorname{spec}(B)]=\varnothing$$2; HODLR structure needs $$\operatorname{spec}(A)\cap[-\operatorname{spec}(B)]=\varnothing$$3.

5. Singular Value Decay and Stability Guarantees

Under mild spectral separation, the singular values of the update $$\operatorname{spec}(A)\cap[-\operatorname{spec}(B)]=\varnothing$$4 decay rapidly. For the correction equation

$$\operatorname{spec}(A)\cap[-\operatorname{spec}(B)]=\varnothing$$5

with numerical ranges $$\operatorname{spec}(A)\cap[-\operatorname{spec}(B)]=\varnothing$$6, $$\operatorname{spec}(A)\cap[-\operatorname{spec}(B)]=\varnothing$$7 disjoint and compact, for any rational $$\operatorname{spec}(A)\cap[-\operatorname{spec}(B)]=\varnothing$$8,

$$\operatorname{spec}(A)\cap[-\operatorname{spec}(B)]=\varnothing$$9

where $B=A^*$0 is the $B=A^*$1th Zolotarev number and decays exponentially with $B=A^*$2. For Hermitian positive definite $B=A^*$3 with spectra in $B=A^*$4, this yields exponential decay of $B=A^*$5 in $B=A^*$6, enabling $B=A^*$7-rank approximations with $B=A^*$8 (Kressner et al., 2017).

6. Embedding in Newton-Kleinman Iteration for Riccati Equations

In continuous-time CARE: $B=A^*$9 the Newton-Kleinman iteration solves a sequence of Lyapunov equations: $C=C^* \preceq 0$0 If $C=C^* \preceq 0$1 is low-rank, each right-hand side difference remains low-rank. The low-rank update machinery specifically computes $C=C^* \preceq 0$2 as the solution with low-rank right-hand side, so subsequent Lyapunov solves become computationally cheap. Newton's quadratic convergence ensures only a few expensive solves are needed, the rest benefiting fully from the low-rank update formalism.

7. Empirical Benchmarks and Role in Divide-and-Conquer Solvers

Numerical experiments demonstrate:

• 5–10× speedup for large (up to $C=C^* \preceq 0$3) 2D Poisson/Lyapunov equations, with residuals ≤ $C=C^* \preceq 0$4.
• Memory reductions: HODLR from ≈0.5 GB to HSS ≈0.27 GB.
• For convection–diffusion and heat equations, 10× memory savings when compared to sparse-CG.
• For CAREs with banded + low-rank $C=C^* \preceq 0$5, 3–5× speedup relative to plain Newton+EKSM.

Ranks remain small, often $C=C^* \preceq 0$6, and residuals are driven to $C=C^* \preceq 0$7–$C=C^* \preceq 0$8. Performance gains are pronounced when many related Sylvester/Lyapunov (or CARE) solves share similarities apart from low-rank perturbations.

The methodology serves as the foundation for divide-and-conquer algorithms over hierarchical low-rank formats (HODLR, HSS), achieving nearly linear complexity in $C=C^* \preceq 0$9 by recursively splitting and updating only the low-rank couplings (Kressner et al., 2017).

---

In summary, the reparameterized low-rank update approach for large matrix equations enables efficient, stable incremental solution updating under low-rank data changes. It achieves near-optimal storage and computational complexity, underpins fast solvers for hierarchical matrix structures, and integrates naturally into Newton-type methods for more complex nonlinear matrix equations. This framework is a core algorithmic building block for large-scale linear algebra in scientific computing and control (Kressner et al., 2017).