𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The -permanent of a tridiagonal matrix, orthogonal polynomials, and chain sequences

✍ Scribed by C.M. da Fonseca


Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
159 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis


Let A = (a ij ) be an n Γ— n complex matrix. For any real ΞΌ, define the polynomial

where (Οƒ ) is the number of inversions of the permutation Οƒ in the symmetric group S n . We analyze and establish a conjecture on the location of the zeros of P ΞΌ (A), when A is a non-diagonal positive definite matrix. We prove the conjecture for the particular case when A is a Jacobi matrix. Our proof is independent from known results, and uses a connection with orthogonal polynomials and chain sequences.


πŸ“œ SIMILAR VOLUMES


An algorithm for the numerical inversion
✍ Kumar, Surendra ;Shashi, ;PethΓΆ, Árpad πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 280 KB πŸ‘ 2 views

This paper presents an algorithm for obtaining the inverse of a tridiagonal matrix numerically. The algorithm does not require diagonal dominance in the matrix and is also computationally efficient.