IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-34288-5_35.html
   My bibliography  Save this book chapter

Parallel Algorithms for Nonlinear Diffusion by Using Relaxation Approximation

In: Numerical Mathematics and Advanced Applications

Author

Listed:
  • Fausto Cavalli

    (University of Milano, Department of Mathematics)

  • Giovanni Naldi

    (University of Milano, Department of Mathematics)

  • Matteo Semplice

    (University of Milano, Department of Mathematics)

Abstract

It has been shown that the equation of diffusion, linear and nonlinear, can be obtained in a suitable scaling limit by a two-velocity model of the Boltzmann equation [7] . Several numerical approximations were introduced in order to discretize the corresponding multiscale hyperbolic systems [8, 1, 4]. In the present work we consider relaxed approximations for multiscale kinetic systems with asymptotic state represented by nonlinear diffusion equations. The schemes are based on a relaxation approximation that permits to reduce the second order diffusion equations to first order semi-linear hyperbolic systems with stiff terms. The numerical passage from the relaxation system to the nonlinear diffusion equation is realized by using semi-implicit time discretization combined with ENO schemes and central differences in space. Finally, parallel algorithms are developed and their performance evaluated. Application to porous media equations in one and two space dimensions are presented.

Suggested Citation

  • Fausto Cavalli & Giovanni Naldi & Matteo Semplice, 2006. "Parallel Algorithms for Nonlinear Diffusion by Using Relaxation Approximation," Springer Books, in: Alfredo Bermúdez de Castro & Dolores Gómez & Peregrina Quintela & Pilar Salgado (ed.), Numerical Mathematics and Advanced Applications, pages 404-411, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-34288-5_35
    DOI: 10.1007/978-3-540-34288-5_35
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-34288-5_35. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.