Please use this identifier to cite or link to this item:
|Title:||Parallel Dixon matrices by bracket||Authors:||Chionh, E.-W.||Keywords:||Brackets
|Issue Date:||2003||Citation:||Chionh, E.-W. (2003). Parallel Dixon matrices by bracket. Advances in Computational Mathematics 19 (4) : 373-383. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1024264830187||Abstract:||It is known that the Dixon matrix can be constructed in parallel either by entry or by diagonal. This paper presents another parallel matrix construction, this time by bracket. The parallel by bracket algorithm is the fastest among the three, but not surprisingly it requires the highest number of processors. The method also shows analytically that the Dixon matrix has a total of m(m + 1)2(m + 2)n(n + 1)2(n + 2)/36 brackets but only mn(m + 1)(n + 1)(mn + 2m + 2n + 1)/6 of them are distinct.||Source Title:||Advances in Computational Mathematics||URI:||http://scholarbank.nus.edu.sg/handle/10635/39889||ISSN:||10197168||DOI:||10.1023/A:1024264830187|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 3, 2019
checked on Dec 2, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.