Show simple item record  

The Number of Lattice Rules of Specified Upper Class and Rank

dc.contributor.authorLyness, J.N.
dc.contributor.authorJoe, Stephen
dc.date.accessioned2009-02-10T23:01:14Z
dc.date.available2009-02-10T23:01:14Z
dc.date.issued2003
dc.identifier.citationLyness, J.N. & Joe, Stephen(2003). The Number of Lattice Rules of Specified Upper Class and Rank. Bit Numerical Mathematics, 43(2), 413-426.en
dc.identifier.urihttps://hdl.handle.net/10289/2003
dc.description.abstractThe upper class of a lattice rule is a convenient entity for classification and other purposes. The rank of a lattice rule is a basic characteristic, also used for classification. By introducing a rank proportionality factor and obtaining certain recurrence relations, we show how many lattice rules of each rank exist in any prime upper class. The Sylow p-decomposition may be used to obtain corresponding results for any upper class.en
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherSpringer Netherlandsen
dc.relation.urihttp://www.springerlink.com/content/h0018j5661g52463/?p=4e452a3790584091b9121432e00c5307&pi=11en
dc.rightsThis is an author’s version of an article published in the journal: BIT Numerical Mathematics. © Springer Netherlands. The original publication is available at www.springerlink.com.en
dc.subjectmathematicsen
dc.subjectlattice rulesen
dc.subjectupper classen
dc.subjectrank of lattice ruleen
dc.subjectsylow p- decompositionen
dc.titleThe Number of Lattice Rules of Specified Upper Class and Ranken
dc.typeJournal Articleen
dc.identifier.doi10.1023/A:1026048021823en
dc.relation.isPartOfBIT Numerical Mathematicsen_NZ
pubs.begin-page413en_NZ
pubs.editionJuneen_NZ
pubs.elements-id29447
pubs.end-page426en_NZ
pubs.issue2en_NZ
pubs.volume43en_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record