Skip to main content

Comparative Analysis of Marching Algorithms for Separable Elliptic Problems

  • Conference paper
  • First Online:
Numerical Analysis and Its Applications (NAA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1988))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Axelsson O., Vassilevski, P. S.: Solution of Equations Rn (Part II): Iterative Solution of Linear Systems. In: Ciarlet, P., Lions, J. (eds.): Handbook on Numerical Methods, North Holland, to appear.

    Google Scholar 

  2. Bank, R.: Marching Algorithms for Elliptic Boundary Value Problems. II: The Variable Coefficient Case. SIAM J. Numer. Anal. 14 (1977) 950–970

    Article  MATH  MathSciNet  Google Scholar 

  3. Bank, R., Rose, D.: Marching Algorithms for Elliptic Boundary Value Problems. I: The Constant Coefficient Case. SIAM J. Numer. Anal. 14 (1977) 792–829

    Article  MATH  MathSciNet  Google Scholar 

  4. Bencheva, G.: Comparative Performance Analysis of 2D Separable Elliptic Solvers. Proceedings of XII Conference “Software and Algorithms of Numerical Mathematics”, Nectiny Castle, Czech Republic (1999), to appear.

    Google Scholar 

  5. Vassilevski, P. S.: An Optimal Stabilization of Marching Algorithm. Compt. rend. de l’Acad. bulg. Sci. 41 (1988) No 7, 29–32

    MATH  MathSciNet  Google Scholar 

  6. Vassilevski, P. S.: Fast Algorithm for Solving a Linear Algebraic Problem with Separable Variables. Compt. rend. de l’Acad. bulg. Sci. 37 (1984) No 3, 305–308

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bencheva, G. (2001). Comparative Analysis of Marching Algorithms for Separable Elliptic Problems. In: Vulkov, L., Yalamov, P., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2000. Lecture Notes in Computer Science, vol 1988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45262-1_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45262-1_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41814-6

  • Online ISBN: 978-3-540-45262-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics