An Efficient Petrov–Galerkin Scheme for the Euler–Bernoulli Beam Equation via Second-Kind Chebyshev Polynomials
The current article introduces a Petrov–Galerkin method (PGM) to address the fourth-order uniform Euler–Bernoulli pinned–pinned beam equation. Utilizing a suitable combination of second-kind Chebyshev polynomials as a basis in spatial variables, the proposed method elegantly and simultaneously satis...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-01-01
|
| Series: | Fractal and Fractional |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2504-3110/9/2/78 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The current article introduces a Petrov–Galerkin method (PGM) to address the fourth-order uniform Euler–Bernoulli pinned–pinned beam equation. Utilizing a suitable combination of second-kind Chebyshev polynomials as a basis in spatial variables, the proposed method elegantly and simultaneously satisfies pinned–pinned and clamped–clamped boundary conditions. To make PGM application easier, explicit formulas for the inner product between these basis functions and their derivatives with second-kind Chebyshev polynomials are derived. This leads to a simplified system of algebraic equations with a recognizable pattern that facilitates effective inversion to produce an approximate spectral solution. Presentations are made regarding the method’s convergence analysis and the computational cost of matrix inversion. The efficiency of the method described in precisely solving the Euler–Bernoulli beam equation under different scenarios has been validated by numerical testing. Additionally, the procedure proposed in this paper is more effective compared to other existing techniques. |
|---|---|
| ISSN: | 2504-3110 |