Factorizations of Matrices With Recursive Entries and Related Topics
Abstract
This article examines matrices whose entries are determined by recursive relations of the form Ai, j = x Ai, j-1 + y Ai-1, j-1 + z Ai-1, j, where x, y, z are constants, and the initial conditions are defined along the first row and column. We present a general decomposition for such matrices and show that many of the known decompositions are particular cases of this more general decomposition. Additionally, we provide a decomposition of these matrices into Pascal-like matrices and a basic Toeplitz matrix.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.