A fast eigenvalue algorithm for Pascal matrices

DOI10.1016/J.AMC.2006.05.093zbMATH Open1109.65033OpenAlexW2152433431MaRDI QIDQ868255FDOQ868255

Authors: Xiang Wang, Jituan Zhou 

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

Recommendations

• A fast eigenvalue algorithm for Hankel matrices
• scientific article; zbMATH DE number 4070183
• Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm
• Fast algorithm for computing eigenvalue of Toeplitz periodic tridiagonal matrices
• scientific article; zbMATH DE number 1786137
• A Fast Iterative Algorithm for Near-Diagonal Eigenvalue Problems
• A Fast Recursive Algorithm for Constructing Matrices with Prescribed Eigenvalues and Singular Values
• Fast algorithms for calculating the eigenvalues of normal Hankel matrices
• A new algorithm for computing eigenpairs of matrices
• scientific article; zbMATH DE number 2095809

zbMATH Keywords

fast algorithmeigenvaluesToeplitz matrixfast Fourier transformPascal matrixLanczos tridiagonalizationQR diagonalization

Mathematics Subject Classification ID

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

Cites Work

• Templates for the Solution of Algebraic Eigenvalue Problems
• Title not available (Why is that?)
• The Matrices of Pascal and Other Greats
• The linear algebra of the generalized Pascal matrix
• Title not available (Why is that?)
• 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

Cited In (7)

• A systematic approach to matrix forms of the Pascal triangle: the twelve triangular matrix forms and relations
• On computing Bézier curves by Pascal matrix methods
• The geometric mean algorithm
• 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.
• Conditioning and accurate computations with Pascal matrices
• Unstructured quotient fixed modes and decentralised stabilisability

Uses Software

• JDQR
• JDQZ

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868255)