Institutional Repository of Vilnius University
M-matrices, chebyshev polynomials and applications for finite difference schemes /
Abstract
dc:descriptionThis study develops a framework that combines $M$-matrix theory and Chebyshev polynomials to improve the stability and accuracy of finite difference methods. We use key $M$-matrix traits invertibility, non-positive off-diagonals, and diagonal dominance to ensure stable discretizations that converge reliably. Chebyshev polynomials help improve spectral approximations, reduce oscillations, and speed up solvers. This combined approach tackles stability issues in problems with steep gradients or ill-conditioned systems. Analysis and experiments show it delivers better error bounds, less sensitivity to grid choice, and higher efficiency. Tests on boundary layers and high-dimensional PDEs confirm the framework's practical value for robustly simulating complex phenomena, demonstrating how merging matrix algebra and polynomial techniques advances numerical methods.
Degree
thesis:*- Grantor dc:publisher
- Institutional Repository of Vilnius University
- Year dc:date
- 2025
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Yousaf, Umair,
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- info:eu-repo/semantics/openAccess
- Language dc:language
- eng
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.vu.lt/VU:ELABAETD238881995&prefLang=en_US