3rd European Workshop on Automatic Differentiation

Shahadat Hossain (University of Lethbridge, Alberta, Canada )

On Pascal-like Matrices for the Compression and Reconstruction of Sparse Jacobians

Abstract:  We consider the Pascal Seeding for the efficient compression and reconstruction of sparse Jacobian matrices. Being sparse and having highly regular structure (banded Toeplitz) some of the common linear algebraic operations with Pascal seed matrices can be described by elegant recursive constructions resulting in efficient calculation of the inverse of its square submatrices. In this talk, we provide results concerning nonsingularity and numerical conditioning of the square submatrices of Pascal seed.

Slides: HossainJune06.pdf