An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization
From MaRDI portal
Publication:2957679
DOI10.1137/16M1080756zbMath1354.15008arXiv1607.00716OpenAlexW2569837888MaRDI QIDQ2957679
Publication date: 27 January 2017
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.00716
Related Items
On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms ⋮ Perturbation analysis for matrix joint block diagonalization ⋮ On identifiability of higher order block term tensor decompositions of rank Lr⊗ rank-1
Uses Software
Cites Work
- Unnamed Item
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with general irreducible components
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Exploiting group symmetry in truss topology optimization
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Lower bound estimation for the separation of two matrices
- Symmetry groups, semidefinite programs, and sums of squares
- Gradient-based joint block diagonalization algorithms: application to blind separation of FIR convolutive mixtures
- On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part I: Basic Results and Uniqueness of One Factor Matrix
- On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition
- On Uniqueness of the Canonical Tensor Decomposition with Some Form of Symmetry
- Algorithm for Error-Controlled Simultaneous Block-Diagonalization of Matrices
- New Uniqueness Conditions for the Canonical Polyadic Decomposition of Third-Order Tensors
- Pivot Selection Strategies in Jacobi Joint Block-Diagonalization
- A Tensor Framework for Nonunitary Joint Block Diagonalization
- Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank-$(L_r,n,L_r,n,1)$ Terms---Part I: Uniqueness
- A Matrix Polynomial Spectral Approach for General Joint Block Diagonalization
- Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned Matrices
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
This page was built for publication: An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization
