Please use this identifier to cite or link to this item:
http://ir-library.mmust.ac.ke:8080/xmlui/handle/123456789/2848
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Angwenyi, N. David | - |
dc.contributor.author | Lawi, George | - |
dc.contributor.author | Ojiema, Michael | - |
dc.contributor.author | Owino, Maurice | - |
dc.date.accessioned | 2024-05-31T11:20:00Z | - |
dc.date.available | 2024-05-31T11:20:00Z | - |
dc.date.issued | 2018-02 | - |
dc.identifier.uri | http://dx.doi.org/10.12988/imf.2014.311224 | - |
dc.identifier.uri | http://ir-library.mmust.ac.ke:8080/xmlui/handle/123456789/2848 | - |
dc.description.abstract | Named after Hermann L. F. von Helmholtz (1821-1894), Helmholtz equation has obtained application in many elds: investigation of acaustic phenomena in aeronautics, electromagnetic application, migration in 3-D geophysical application, among many other areas. As shown in [2], Helmholtz equation is used in weather prediction at the Met O ce in UK. Ine ciency, that is the bottleneck in Numerical Weather Prediction, arise partly from solving of the Helmholtz equation. This study investigates the computationally e cient iterative method for solving the Helmholtz equation. We begin by analysing the condition for stability of Jacobi Iterative method using Von Neumann method. Finally, we conclude that Bi-Conjugate Gradient Stabilised Method is the most computationally e cient method. | en_US |
dc.language.iso | en | en_US |
dc.publisher | International Mathematical Forum, | en_US |
dc.subject | On, Computationally, E_cient, Numerical, Solution, Helmholtz, Equation | en_US |
dc.title | On the Computationally Efficient Numerical Solution to the Helmholtz Equation | en_US |
dc.type | Article | en_US |
Appears in Collections: | Gold Collection |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
On the Computationally Efficient Numerical Solution to the Helmholtz Equation.pdf | 464.15 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.