Decreasing the Displacement Rank of a Matrix
Für eine \(n\times n\)-Matrix \(S\) sei \(W(S)=S-ZSZ^ T\), wobei \(Z\) nur in der ersten Subdiagonalen Einsen und sonst Nullen aufweist. Zwei \(n\times d\)-Matrizen \(G,H\) werden ein \(d\)-Generator (displacement) von \(S\) der Länge \(d\) genannt, wenn \(W(S)=GH^ T\) erfüllt ist. Die maximale Länge \(d(S)\) einer solchen Darstellung heißt der \(d\)-Rang von \(S\). Verf. konstruiert zu einem \(d\)-Generator \((M,N)\) der Länge \(r\) einer \(n\times n\)-Matrix \(B\) für \(0\leq d<r\) einen \(d\)-Generator \((G_ d,H_ d)\) der Länge \(d\) zu einer Matrix \(B_ d\) mit minimaler Norm \(\| MN^ T-G_ dH^ T_ d\|_ 2\), eine Matrix \(C\) mit \(d\)-Rang \(C=d\) und beweist \(\| C-B_ d\|_ 2\leq(1+2n(r-d))\| B-C\|_ 2\).
- The rank of reduced dispersion matrices
- On a class of matrices with low displacement rank
- Rank Reducing Matrix Norms
- scientific article; zbMATH DE number 6515828
- Displacements of matrix products
- Matrix decompositions using displacement rank and classes of commutative matrix algebras
- scientific article; zbMATH DE number 4053805
- Displacement Rank of Generalized Inverses of Persymmetric Matrices
- A note on matrix displacement representation
- Displacement rank and quasitriangular decomposition for r-Toeplitz matrices
- New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration
- Structured matrices and Newton's iteration: unified approach
- Newton's iteration for inversion of Cauchy-like and other structured matrices
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Randomized preprocessing versus pivoting
- Superfast algorithms for Cauchy-like matrix computations and extensions
- On the rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices
- Fast computation of the matrix exponential for a Toeplitz matrix
- Homotopic residual correction processes
- Iterative inversion of structured matrices
- Root-finding by expansion with independent constraints
- Randomized preprocessing of homogeneous linear systems of equations
This page was built for publication: Decreasing the Displacement Rank of a Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033820)