Skip to main content

Different Algorithms of 2D Transport Equation Parallelization on Random Non-Orthogonal Grids

  • Conference paper
Computational Methods in Transport

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 48))

  • 1396 Accesses

Abstract

Numerical solution of a non-stationary kinetic equation at a multi-group setting in the 2D spatial approximation demands much computer operating memory and calendar execution time. One of the ways of solving such problems is using algorithms of parallelization.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer

About this paper

Cite this paper

Shagaliev, R., Alekseev, A., Beliakov, I., Gichuk, A., Nuzhdin, A., Rezchikov, V. (2006). Different Algorithms of 2D Transport Equation Parallelization on Random Non-Orthogonal Grids. In: Graziani, F. (eds) Computational Methods in Transport. Lecture Notes in Computational Science and Engineering, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28125-8_24

Download citation

Publish with us

Policies and ethics