Two splittings of a square matrix
complex symmetricfast matrix-vector productsmatrix nearnessnumerical examplepersymmetric splittingproblem, iterative methodsToeplitz+small rank matrixunitary congruence
The author shows that any square matrix \(A\) can be represented as the sum of \(A =\tilde S + \tilde T\), where \(\tilde S\) is a complex symmetric and rank\((\tilde T) \leq \lfloor\frac n 2\rfloor\). Additionally, this idea also applies to the persymmetric splitting of \(A\) by considering \(A\) as the sum of a Toeplitz matrix and a low rank matrix via \(O(n^2)\) computations, which allows fast matrix-vector products in case \(n\) is large. A numerical example is given to illustrate the proposed methodology.
- scientific article; zbMATH DE number 2201223
- Split algorithms for symmetric Toeplitz matrices with arbitrary rank profile
- Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile
- Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile
- Matrix representations of split Bezoutians
This page was built for publication: Two splittings of a square matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1431663)
