A Divide-and-Conquer Method for the Takagi Factorization
From MaRDI portal
Publication:3609018
DOI10.1137/050624558zbMath1159.65321OpenAlexW2069980512MaRDI QIDQ3609018
Publication date: 6 March 2009
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050624558
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25)
Related Items (13)
Inexact and incremental bilinear Lanczos components algorithms for high dimensionality reduction and image reconstruction ⋮ Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization ⋮ Takagi Factorization of Matrices Depending on Parameters and Locating Degeneracies of Singular Values ⋮ Singular value decomposition for skew-Takagi factorization with quantum applications ⋮ Simulations of quantum dynamics with fermionic phase-space representations using numerical matrix factorizations as stochastic gauges ⋮ A divide-and-conquer method for constructing a pseudo-Jacobi matrix from mixed given data ⋮ Fast optimization of viscosities for frequency‐weighted damping of second‐order systems ⋮ Singular value decomposition for the Takagi factorization of symmetric matrices ⋮ A fast symmetric SVD algorithm for square Hankel matrices ⋮ A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix ⋮ Computing eigenvalues of normal matrices via complex symmetric matrices ⋮ A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices ⋮ OPUC, CMV matrices and perturbations of measures supported on the unit circle
Uses Software
This page was built for publication: A Divide-and-Conquer Method for the Takagi Factorization
