Giuseppe Toscani

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Laurent Gosse

> Home > Persons > Giuseppe Toscani

Publications

2006
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/siamnum/GosseT06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamnum/GosseT06
Laurent Gosse, Giuseppe Toscani:
Identification of Asymptotic Decay to Self-Similarity for One-Dimensional Filtration Equations. SIAM J. Numer. Anal. 43(6): 2590-2606 (2006)
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/siamsc/GosseT06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamsc/GosseT06
Laurent Gosse, Giuseppe Toscani:
Lagrangian Numerical Approximations to One-Dimensional Convolution-Diffusion Equations. SIAM J. Sci. Comput. 28(4): 1203-1227 (2006)
2004
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/nm/GosseT04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/nm/GosseT04
Laurent Gosse, Giuseppe Toscani:
Asymptotic-preserving & well-balanced schemes for radiative transfer and the Rosseland approximation. Numerische Mathematik 98(2): 223-250 (2004)
2003
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/siamnum/GosseT03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamnum/GosseT03
Laurent Gosse, Giuseppe Toscani:
Space Localization and Well-Balanced Schemes for Discrete Kinetic Models in Diffusive Regimes. SIAM J. Numer. Anal. 41(2): 641-658 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.