A fast algorithm for solving linear systems of the Pascal type

DOI10.1016/j.amc.2005.07.022zbMath1093.65031OpenAlexW1973251812MaRDI QIDQ2369171

Xiang Wang, Lin-Zhang Lu

Publication date: 28 April 2006

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

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

zbMATH Keywords

complexitylinear systemsCholesky factorizationToeplitz matrixfast algorithmPascal matrixMatlab program

Mathematics Subject Classification ID

Linear ordinary differential equations and systems (34A30) Numerical methods for initial value problems involving ordinary differential equations (65L05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Related Items (5)

Unnamed Item ⋮ A fast eigenvalue algorithm for Pascal matrices ⋮ The geometric mean algorithm ⋮ 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

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Generalized Pascal matrix and recurrence sequences.
• On a connection between the Pascal, Vandermonde and Stirling matrices. II.
• On solving linear systems of the Pascal type
• The Matrices of Pascal and Other Greats
• Conjugate Gradient Methods for Toeplitz Systems
• Fast Recursive Least Squares Adaptive Filtering by Fast Fourier Transform-Based Conjugate Gradient Iterations
• The linear algebra of the generalized Pascal matrix

This page was built for publication: A fast algorithm for solving linear systems of the Pascal type