Sciweavers

56 search results - page 2 / 12
» Computing the Determinant and Smith Form of an Integer Matri...
Sort
View
AAECC
2001
Springer
121views Algorithms» more  AAECC 2001»
13 years 9 months ago
Algorithms for Large Integer Matrix Problems
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...
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Sto...
FCSC
2008
88views more  FCSC 2008»
13 years 5 months ago
Fraction-free matrix factors: new forms for LU and QR factors
Gaussian elimination and LU factoring have been greatly studied from the algorithmic point of view, but much less from the point view of the best output format. In this paper, we g...
Wenqin Zhou, David J. Jeffrey
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
13 years 10 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
COLT
2008
Springer
13 years 7 months ago
Learning Rotations
An algorithm is presented for online learning of rotations. The proposed algorithm involves matrix exponentiated gradient updates and is motivated by the von Neumann divergence. T...
Adam M. Smith, Manfred K. Warmuth
COMBINATORICS
2000
90views more  COMBINATORICS 2000»
13 years 5 months ago
Determinantal Expression and Recursion for Jack Polynomials
We describe matrices whose determinants are the Jack polynomials expanded in terms of the monomial basis. The top row of such a matrix is a list of monomial functions, the entries...
Luc Lapointe, Alain Lascoux, Jennifer Morse