Details
| Originalsprache | Englisch |
|---|---|
| Seitenumfang | 7 |
| Fachzeitschrift | IEEE Transactions on Information Theory |
| Frühes Online-Datum | 4 Dez. 2024 |
| Publikationsstatus | Elektronisch veröffentlicht (E-Pub) - 4 Dez. 2024 |
Abstract
The Schläfli function fn(x) allows to compute volume of a regular (n - 1)-dimensional spherical simplex of the dihedral angle 2α = arcsec(x) and it has many applications. For example, it defines conjectured upper bounds on the sphere packing problem and the kissing number problem, and a lower bound on the mean-squared error in the quantizing problem. The function is defined recursively via a first-order non-linear differential relation, that makes it difficult to compute, especially for large values of n. Here we present a method for an accurate numerical computation of the Schläfli function fn(x) for n ≥ 4 in the frequently used in applications interval x ∈ [n - 1, n + 1]. The computation is based on the Chebyshev approximation of the function qn(x), which is related to the Schläfli function via a simple factor of an algebraic expression and regular in the interval. We also present the computation algorithm based on the method.
ASJC Scopus Sachgebiete
- Informatik (insg.)
- Information systems
- Informatik (insg.)
- Angewandte Informatik
- Sozialwissenschaften (insg.)
- Bibliotheks- und Informationswissenschaften
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: IEEE Transactions on Information Theory, 04.12.2024.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Computation of the Schläfli Function
AU - Shoom, Andrey A.
N1 - Publisher Copyright: © 1963-2012 IEEE.
PY - 2024/12/4
Y1 - 2024/12/4
N2 - The Schläfli function fn(x) allows to compute volume of a regular (n - 1)-dimensional spherical simplex of the dihedral angle 2α = arcsec(x) and it has many applications. For example, it defines conjectured upper bounds on the sphere packing problem and the kissing number problem, and a lower bound on the mean-squared error in the quantizing problem. The function is defined recursively via a first-order non-linear differential relation, that makes it difficult to compute, especially for large values of n. Here we present a method for an accurate numerical computation of the Schläfli function fn(x) for n ≥ 4 in the frequently used in applications interval x ∈ [n - 1, n + 1]. The computation is based on the Chebyshev approximation of the function qn(x), which is related to the Schläfli function via a simple factor of an algebraic expression and regular in the interval. We also present the computation algorithm based on the method.
AB - The Schläfli function fn(x) allows to compute volume of a regular (n - 1)-dimensional spherical simplex of the dihedral angle 2α = arcsec(x) and it has many applications. For example, it defines conjectured upper bounds on the sphere packing problem and the kissing number problem, and a lower bound on the mean-squared error in the quantizing problem. The function is defined recursively via a first-order non-linear differential relation, that makes it difficult to compute, especially for large values of n. Here we present a method for an accurate numerical computation of the Schläfli function fn(x) for n ≥ 4 in the frequently used in applications interval x ∈ [n - 1, n + 1]. The computation is based on the Chebyshev approximation of the function qn(x), which is related to the Schläfli function via a simple factor of an algebraic expression and regular in the interval. We also present the computation algorithm based on the method.
KW - Chebyshev approximation
KW - kissing number problem
KW - quantizing problem
KW - Schläfli function
KW - sphere packing problem
UR - http://www.scopus.com/inward/record.url?scp=85211431984&partnerID=8YFLogxK
U2 - 10.1109/TIT.2024.3511134
DO - 10.1109/TIT.2024.3511134
M3 - Article
AN - SCOPUS:85211431984
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
SN - 0018-9448
ER -