Binomial matrices

Geoff Boyd, Charles A. Micchelli, Gilbert Strang, Ding-Xuan Zhou

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

4 Citations (Scopus)

Abstract

Every s x s matrix A yields a composition map acting on polynomials on ℝs. Specifically, for every polynomial p we define the mapping CA by the formula (CAP)(x) := p(Ax), x ∈ ℝs. For each nonnegative integer n, homogeneous polynomials of degree n form an invariant subspace for CA. We let A(n) be the matrix representation of CA relative to the monomial basis and call A(n) a binomial matrix. This paper studies the asymptotic behavior of A(n) as n → ∞. The special case of 2 × 2 matrices A with the property that A2 = I corresponds to discrete Taylor series and motivated our original interest in binomial matrices.
Original languageEnglish
Pages (from-to)379-391
JournalAdvances in Computational Mathematics
Volume14
Issue number4
DOIs
Publication statusPublished - 2001

Research Keywords

  • Bernstein polynomials
  • Binomial matrix
  • De Casteljau subdivision
  • Homogeneous polynomial
  • Krawtchouk polynomials
  • Permanents

Fingerprint

Dive into the research topics of 'Binomial matrices'. Together they form a unique fingerprint.

Cite this