Computing the complete CS decomposition

Brian D. Sutton

Home/Archive/arXiv

arXiv · 0707.1838

Computing the complete CS decomposition

Brian D. Sutton

View original source ↗Read source document ↗Export metadata ↓

Abstract

An algorithm is developed to compute the complete CS decomposition (CSD) of a partitioned unitary matrix. Although the existence of the CSD has been recognized since 1977, prior algorithms compute only a reduced version (the 2-by-1 CSD) that is equivalent to two simultaneous singular value decompositions. The algorithm presented here computes the complete 2-by-2 CSD, which requires the simultaneous diagonalization of all four blocks of a unitary matrix partitioned into a 2-by-2 block structure. The algorithm appears to be the only fully specified algorithm available. The computation occurs in two phases. In the first phase, the unitary matrix is reduced to bidiagonal block form, as described by Sutton and Edelman. In the second phase, the blocks are simultaneously diagonalized using techniques from bidiagonal SVD algorithms of Golub, Kahan, and Demmel. The algorithm has a number of desirable numerical features.

Explore related subjects

math.NA cs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Brian D. Sutton. 2008-05-19. Computing the complete CS decomposition. https://arxiv.org/abs/0707.1838

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Discrete normalized gradient flow for two-component Bose-Einstein condensates: Energy dissipation, global convergence and sharp local convergence behavior

The gradient flow with semi-implicit discretization (GFSI) is the most widely used algorithm for computing the ground state of Gross-Pitaevskii energy functional. We apply GFSI to the two-component scenario with Josephson junction and rotating term, which is one of the most important and topical models in multi-component Bose-Einstein condensates (MBECs), and rigorously establish the following fundamental results for the first time. By introducing a Lagrange multiplier to reformulate GFSI into an equivalent form, we prove its energy dissipation property and global convergence to stationary states. More significantly, we uncover an intrinsic connection between this classical numerical PDE discretization rooted in imaginary-time evolution and Riemannian optimization, a state-of-the-art mathematical framework for manifold-constrained optimization. This connection enables us to fully characterize the local convergence behavior of GFSI within the Riemannian optimization framework. Together with the aforementioned global convergence result, this yields a complete global--local convergence theory for GFSI. Finally, numerical experiments comprehensively validate the theoretically predicted energy dissipation and convergence properties.

math.NA↗

arXiv2026

Discretization, Uniform-in-Time Estimations and Approximation of Invariant Measures for Nonlinear Stochastic Differential Equations with Non-Uniform Dissipativity

The approximation of invariant measures for nonlinear ergodic stochastic differential equations (SDEs) is a central problem in scientific computing, with important applications in stochastic sampling, physics, and ecology. We first propose an easily applicable explicit Truncated Euler-Maruyama (TEM) scheme and prove its numerical ergodicity in the $L^p$-Wasserstein distance ($p\geqslant 1$). Furthermore, by combining truncation techniques with the coupling method, we establish a uniform-in-time $1/2$-order convergence rate in moments for the TEM scheme. Additionally, leveraging the exponential ergodicity of both the numerical and exact solutions, we derive a $1/2$-order convergence rate for the invariant measures of the TEM scheme and the exact solution in the $L^1$-Wasserstein distance. Finally, two numerical experiments are conducted to validate our theoretical results.

math.NA↗

arXiv2026

Barotropic-Baroclinic Splitting for Multilayer Shallow Water Models with Exchanges

This work presents the numerical analysis of a barotropic-baroclinic splitting in a nonlinear multilayer framework with exchanges between the layers in terrain-following coordinates. The splitting is formulated as an exact operator splitting. The barotropic step handles free surface evolution and depth-averaged velocity via a well-balanced one-layer model, while the baroclinic step manages vertical exchanges between layers and adjusts velocities to their mean values. We show that the barotropic-baroclinic splitting preserves total energy conservation and meets both a discrete maximum principle and a discrete entropy inequality. Several numerical experiments are presented showing the gain in computational cost, particularly in low Froude simulations, with no loss of accuracy. The benefits of using a well-balancing strategy in the barotropic step to preserve the geostrophic equilibrium are inherited in the overall scheme.

math.NA↗