article · Algorithms
This article proposes numerical algorithms for solving second-order and telegraph linear partial differential equations using a matrix approach that employs certain generalized Chebyshev polynomials as basis functions. This approach uses the operational matrix of derivatives of the generalized Chebyshev polynomials and applies the collocation method to convert the equations with their underlying conditions into algebraic systems of equations that can be numerically treated. The convergence and error bounds are examined deeply. Some numerical examples are shown to demonstrate the efficiency and applicability of the proposed algorithms.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.3390/a18010002
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.