A fast eigenvalue algorithm for Pascal matrices

DOI10.1016/j.amc.2006.05.093zbMath1109.65033OpenAlexW2152433431MaRDI QIDQ868255

Jituan Zhou, Xiang Wang

Publication date: 19 February 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.093

zbMATH Keywords

eigenvaluesfast Fourier transformToeplitz matrixfast algorithmPascal matrixLanczos tridiagonalizationQR diagonalization

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical methods for discrete and fast Fourier transforms (65T50) Matrices of integers (15B36)

Related Items (7)

Conditioning and accurate computations with Pascal matrices ⋮ The geometric mean algorithm ⋮ Unstructured quotient fixed modes and decentralised stabilisability ⋮ On computing Bézier curves by Pascal matrix methods ⋮ A systematic approach to matrix forms of the Pascal triangle: the twelve triangular matrix forms and relations ⋮ A new algorithm for linear systems of the Pascal type ⋮ On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics

Uses Software

• JDQR
• JDQZ

Cites Work

• Generalized Pascal matrix and recurrence sequences.
• On solving linear systems of the Pascal type
• A fast algorithm for solving linear systems of the Pascal type
• The Matrices of Pascal and Other Greats
• Templates for the Solution of Algebraic Eigenvalue Problems
• The linear algebra of the generalized Pascal matrix
• Unnamed Item
• Unnamed Item

This page was built for publication: A fast eigenvalue algorithm for Pascal matrices