2n-by-2n symplectic completions of matrices of order 2n − 1
From MaRDI portal
Publication:4985505
DOI10.1142/S1793557121500650zbMath1465.15032OpenAlexW3042724197MaRDI QIDQ4985505
Ralph John de la Cruz, Jonathan V. Caalim
Publication date: 23 April 2021
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557121500650
Factorization of matrices (15A23) Canonical forms, reductions, classification (15A21) Matrix completion problems (15A83)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Each symplectic matrix is a product of four symplectic involutions
- Matrix completion problems over integral domains: the case with a diagonal of prescribed blocks
- Positive definite completions of partial Hermitian matrices
- Complementary bases in symplectic matrices and a proof that their determinant is one
- The positive definite completion problem revisited
- Matrix completion problems
- The autonomous linear quadratic control problem. Theory and numerical solution
- Products of transvections in one conjugacy class in the symplectic group over \(\text{GF}(3)\)
- Completing symplectic matrices
- The doubly negative matrix completion problem
- The Cartan-Dieudonné-Scherk theorems for complex \(S\)-orthogonal matrices
- On completions of symmetric and antisymmetric block diagonal partial matrices
- Products of \(\lambda\)-transvections in Sp(2n,q)
- Parametrization of the Matrix Symplectic Group and Applications
- Structured tools for structured matrices
- Corrigenda to: Introduction to Symplectic Topology
- Products of transvections in one conjugacy class of the symplectic group over the \(p\)-adic numbers
This page was built for publication: 2n-by-2n symplectic completions of matrices of order 2n − 1