Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Comparative Analysis of Marching Algorithms for Separable Elliptic Problems

Gergana BenchevaContact Information

(6)  Central Laboratory of Parallel Processing, Bulgarian Academy of Sciences, Acad. G. Bontchev Str., Bl.25A, 1113 Sofia, Bulgaria
Abstract
Standard marching algorithms (MA) and generalized marching algorithms (GMA) for 2D separable second order elliptic problems on rectangular n×m grids are described. Their numerical stability and computational complexity are theoretically and experimentally compared. Results of numerical experiments performed to demonstrate the stability of GMA versus the instability of MA are presented.

Keywords  fast elliptic solvers - marching algorithms - computational complexity of algorithms


Contact Information Gergana Bencheva
Email: gery@cantor.bas.bg
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.106 • Server: mpweb24
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)