Skip to main content

Multi-level adaptive technique (MLAT) for fast numerical solution to boundary value problems

  • Fundamental Numerical Techniques
  • Conference paper
  • First Online:
Proceedings of the Third International Conference on Numerical Methods in Fluid Mechanics

Part of the book series: Lecture Notes in Physics ((LNP,volume 18))

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hubbard (ed.), Numerical Solution of PDE-II, Academic Press 1971.Especially the papers by Babuška; Bramble and Schatz; Marcal; Strang; and references therein.

    Google Scholar 

  2. E. Wachspres, Iterative solutions of Elliptic Systems, Prentice Hall, 1966.

    Google Scholar 

  3. P. P. Fedorenko, Zh. \(v\bar ychisl.\) Mat. Fiz. 4,3 (1964), 559–664.

    MathSciNet  Google Scholar 

  4. N. S. Bakhvalov, Zh. \(v\bar ychisl.\) Mat. Fiz. 6,5 (1966), 861–885.

    MATH  Google Scholar 

  5. H. L. Stone, SIAM J. Num. Anal., 5 (1968), 530–558.

    Article  MATH  ADS  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Henri Cabannes Roger Temam

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer Verlag

About this paper

Cite this paper

Brandt, A. (1973). Multi-level adaptive technique (MLAT) for fast numerical solution to boundary value problems. In: Cabannes, H., Temam, R. (eds) Proceedings of the Third International Conference on Numerical Methods in Fluid Mechanics. Lecture Notes in Physics, vol 18. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0118663

Download citation

  • DOI: https://doi.org/10.1007/BFb0118663

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06170-0

  • Online ISBN: 978-3-540-38377-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics