Sciweavers

151 search results - page 3 / 31
» Computing in Solvable Matrix Groups
Sort
View
DCC
1998
IEEE
13 years 9 months ago
Quasideterminant Characterization of MDS Group Codes over Abelian Groups
A group code defined over a group G is a subset of Gn which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Sepa...
A. A. Zain, B. Sundar Rajan
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
14 years 1 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
DISOPT
2011
201views Education» more  DISOPT 2011»
13 years 1 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
VLSID
2002
IEEE
91views VLSI» more  VLSID 2002»
14 years 10 months ago
Rational ABCD Modeling of High-Speed Interconnects
This paper introduces a new numerical approximation technique, called the Differential Quadrature Method (DQM), in order to derive the rational ABCD matrix representing the high-s...
Qinwei Xu, Pinaki Mazumder
EUROPAR
1998
Springer
14 years 1 months ago
Parallel Sparse Matrix Computations Using the PINEAPL Library: A Performance Study
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
Arnold R. Krommer