Comparative Analysis of Polynomials with Their Computational Costs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929571948920832 |
|---|---|
| author | Khan, Qasim Suen, Anthony |
| author_facet | Khan, Qasim Suen, Anthony |
| contents | In this article, we explore the effectiveness of two polynomial methods in solving non-linear time and space fractional partial differential equations. We first outline the general methodology and then apply it to five distinct experiments. The proposed method, noted for its simplicity, demonstrates a high degree of accuracy. Comparative analysis with existing techniques reveals that our approach yields more precise solutions. The results, presented through graphs and tables, indicate that He's and Daftardar-Jafari polynomials significantly enhance accuracy. Additionally, we provide an in-depth discussion on the computational costs associated with these polynomials. Due to its straightforward implementation, the proposed method can be extended for application to a broader range of problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_00487 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Comparative Analysis of Polynomials with Their Computational Costs Khan, Qasim Suen, Anthony Numerical Analysis Analysis of PDEs In this article, we explore the effectiveness of two polynomial methods in solving non-linear time and space fractional partial differential equations. We first outline the general methodology and then apply it to five distinct experiments. The proposed method, noted for its simplicity, demonstrates a high degree of accuracy. Comparative analysis with existing techniques reveals that our approach yields more precise solutions. The results, presented through graphs and tables, indicate that He's and Daftardar-Jafari polynomials significantly enhance accuracy. Additionally, we provide an in-depth discussion on the computational costs associated with these polynomials. Due to its straightforward implementation, the proposed method can be extended for application to a broader range of problems. |
| title | Comparative Analysis of Polynomials with Their Computational Costs |
| topic | Numerical Analysis Analysis of PDEs |
| url | https://arxiv.org/abs/2411.00487 |