151 search results - page 5 / 31 » Computing in Solvable Matrix Groups |
JSC
2011
13 years 4 months ago
2011
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...
GI
2010
Springer
13 years 8 months ago
2010
Springer
: Based on previous work of the authors, this paper provides a comparison of two different tracking methodologies for extended objects and group targets, where the true shape of th...
APPML
2007
13 years 9 months ago
2007
We consider the computation of the Iwasawa decomposition of a symplectic matrix via the QR factorization. The algorithms presented improve on the method recently decribed in [8]. K...
AAECC
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically fast...