Comparative Analysis of Marching Algorithms for Separable Elliptic Problems

Autor:	Gergana Bencheva
Rok vydání:	2001
Předmět:	Elliptic curve Computational complexity theory Numerical analysis Stability (learning theory) Order (group theory) Algorithm Instability Computer Science::Distributed Parallel and Cluster Computing Numerical stability Separable space Mathematics
Zdroj:	Lecture Notes in Computer Science ISBN: 9783540418146 NAA
DOI:	10.1007/3-540-45262-1_10
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::eb7c7aee0eb3d99ce1fa650e3eeaa25d https://doi.org/10.1007/3-540-45262-1_10 Zobrazit plný text záznamu