Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 31 min ago
PreprintCC BY 4.0arXiv

Multi-Index Recovery for Total-Degree Multivariate Vandermonde Matrices

Abstract

For multivariate polynomial bases of total degree at most n, a column of the Vandermonde matrix is identified by a multi-index of exponents. In this work, we give a direct, recursive map from the scalar column index to this multi-index, based on a prescribed ordering in which exponents of the last variable are increased at the block level and the same rule is applied recursively to the remaining variables. The map is first derived explicitly in the bivariate case, where it yields closed-form column indices for the univariate Vandermonde matrices, and is then extended recursively to arbitrary dimension by means of a binomial counting function, with a proof of correctness by induction. The procedure provides random access to any total-degree column without forming the full tensor-product matrix, and is particularly advantageous for streaming construction and matrix-free evaluation. It is basis independent and applies directly to Chebyshev--Vandermonde matrices. For the full dense matrix, nested loops over the exponent multi-indices achieve the same asymptotic cost; the gain of the present approach lies in exact indexing and the avoidance of superfluous intermediate arrays.

Related

  1. Spectra of Multivariate Vandermonde Matrices and Min-max Error Bounds for the High-dimensional Super-resolution Problem
    Nuha Diab, Dmitry Batenkov
    arXivPreprintCC BY-SA 4.0Full textAnalysis & PDEsNumerical analysis & scientific computingarXiv
  2. From Inverse Vandermonde Matrices to the Shift Structure of the Dirichlet Eta and Beta Functions
    Serge Iovleff
    HALPreprintCC BY 4.0Full textAlgebra & number theoryHALarXiv
  3. Matrix equivalence to Smith normal form: new theoretical results for multivariate polynomial matrices
    Dong Lu, Yuanyuan Ruan, Dingkang Wang +1
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. A Unified Spectral Framework for Weighted Adjacency-Degree Matrices of Dendrimer and Bethe Trees
    Metrose Metsidik
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Algorithm XXXX: Computation of finite element degree-of-freedom transformation matrices
    Matthew W. Scroggs, Garth N. Wells
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
BibTeX
@misc{santosperez2026multiindex,
  title = {{Multi-Index Recovery for Total-Degree Multivariate Vandermonde Matrices}},
  author = {Samuel Santos-Pérez},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.03775},
  eprint = {2610.03775},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.03775},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Multi-Index Recovery for Total-Degree Multivariate Vandermonde Matrices
AU  - Samuel Santos-Pérez
PY  - 2026
DA  - 2026/10/01
PB  - arXiv
DO  - 10.48550/arxiv.2610.03775
UR  - https://arxiv.org/abs/2610.03775
AB  - For multivariate polynomial bases of total degree at most n, a column of the Vandermonde matrix is identified by a multi-index of exponents. In this work, we give a direct, recursive map from the scalar column index to this multi-index, based on a prescribed ordering in which exponents of the last variable are increased at the block level and the same rule is applied recursively to the remaining variables. The map is first derived explicitly in the bivariate case, where it yields closed-form column indices for the univariate Vandermonde matrices, and is then extended recursively to arbitrary dimension by means of a binomial counting function, with a proof of correctness by induction. The procedure provides random access to any total-degree column without forming the full tensor-product matrix, and is particularly advantageous for streaming construction and matrix-free evaluation. It is basis independent and applies directly to Chebyshev--Vandermonde matrices. For the full dense matrix, nested loops over the exponent multi-indices achieve the same asymptotic cost; the gain of the present approach lies in exact indexing and the avoidance of superfluous intermediate arrays.
ER  -