Condensation of homomorphism spaces

Klaus M Lux, Max Neunhöffer, Felix Noeske

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We present an efficient algorithm for the condensation of homomorphism spaces. This provides an improvement over the known tensor condensation method which is essentially due to a better choice of bases. We explain the theory behind this approach and describe the implementation in detail. Finally, we give timings to compare with previous methods.

Original languageEnglish (US)
Pages (from-to)140-157
Number of pages18
JournalLMS Journal of Computation and Mathematics
Volume15
DOIs
StatePublished - Dec 2012

Fingerprint

Condensation
Homomorphism
Tensors
Timing
Efficient Algorithms
Tensor

ASJC Scopus subject areas

  • Mathematics(all)
  • Computational Theory and Mathematics

Cite this

Condensation of homomorphism spaces. / Lux, Klaus M; Neunhöffer, Max; Noeske, Felix.

In: LMS Journal of Computation and Mathematics, Vol. 15, 12.2012, p. 140-157.

Research output: Contribution to journalArticle

Lux, Klaus M ; Neunhöffer, Max ; Noeske, Felix. / Condensation of homomorphism spaces. In: LMS Journal of Computation and Mathematics. 2012 ; Vol. 15. pp. 140-157.
@article{c793e2b9262a43e08560c1be8614d76e,
title = "Condensation of homomorphism spaces",
abstract = "We present an efficient algorithm for the condensation of homomorphism spaces. This provides an improvement over the known tensor condensation method which is essentially due to a better choice of bases. We explain the theory behind this approach and describe the implementation in detail. Finally, we give timings to compare with previous methods.",
author = "Lux, {Klaus M} and Max Neunh{\"o}ffer and Felix Noeske",
year = "2012",
month = "12",
doi = "10.1112/S1461157012000071",
language = "English (US)",
volume = "15",
pages = "140--157",
journal = "LMS Journal of Computation and Mathematics",
issn = "1461-1570",
publisher = "London Mathematical Society",

}

TY - JOUR

T1 - Condensation of homomorphism spaces

AU - Lux, Klaus M

AU - Neunhöffer, Max

AU - Noeske, Felix

PY - 2012/12

Y1 - 2012/12

N2 - We present an efficient algorithm for the condensation of homomorphism spaces. This provides an improvement over the known tensor condensation method which is essentially due to a better choice of bases. We explain the theory behind this approach and describe the implementation in detail. Finally, we give timings to compare with previous methods.

AB - We present an efficient algorithm for the condensation of homomorphism spaces. This provides an improvement over the known tensor condensation method which is essentially due to a better choice of bases. We explain the theory behind this approach and describe the implementation in detail. Finally, we give timings to compare with previous methods.

UR - http://www.scopus.com/inward/record.url?scp=84882362360&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84882362360&partnerID=8YFLogxK

U2 - 10.1112/S1461157012000071

DO - 10.1112/S1461157012000071

M3 - Article

AN - SCOPUS:84882362360

VL - 15

SP - 140

EP - 157

JO - LMS Journal of Computation and Mathematics

JF - LMS Journal of Computation and Mathematics

SN - 1461-1570

ER -