default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Bassi
Person information
- affiliation: University of Bergamo, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Francesco Carlo Massa
, Lukas Ostrowski, Francesco Bassi, Christian Rohde:
An artificial Equation of State based Riemann solver for a discontinuous Galerkin discretization of the incompressible Navier-Stokes equations. J. Comput. Phys. 448: 110705 (2022)
2010 – 2019
- 2019
- [j11]Alessandra Nigro, Carmine De Bartolo, Andrea Crivellini, Matteo Franciolini, Alessandro Colombo, Francesco Bassi:
A low-dissipation DG method for the under-resolved simulation of low Mach number turbulent flows. Comput. Math. Appl. 77(6): 1739-1755 (2019) - [j10]Andrea Crivellini, Matteo Franciolini, Alessandro Colombo, Francesco Bassi:
OpenMP Parallelization Strategies for a Discontinuous Galerkin Solver. Int. J. Parallel Program. 47(5-6): 838-873 (2019) - 2017
- [j9]Lorenzo Botti, Alessandro Colombo, Francesco Bassi:
h-multigrid agglomeration based solution strategies for discontinuous Galerkin discretizations of incompressible flow problems. J. Comput. Phys. 347: 382-415 (2017) - [j8]Alessandra Nigro, Carmine De Bartolo, Andrea Crivellini, Francesco Bassi:
Second derivative time integration methods for discontinuous Galerkin solutions of unsteady compressible flows. J. Comput. Phys. 350: 493-517 (2017) - 2016
- [j7]Nicoletta Franchina, M. Savini, Francesco Bassi:
Multicomponent gas flow computations by a discontinuous Galerkin scheme using L2-projection of perfect gas EOS. J. Comput. Phys. 315: 302-322 (2016) - 2014
- [j6]Alessandra Nigro, Carmine De Bartolo, Francesco Bassi, Antonio Ghidoni:
Up to sixth-order accurate A-stable implicit schemes applied to the Discontinuous Galerkin discretized Navier-Stokes equations. J. Comput. Phys. 276: 136-162 (2014) - 2013
- [j5]Andrea Crivellini, Valerio D'Alessandro, Francesco Bassi:
A Spalart-Allmaras turbulence model implementation in a discontinuous Galerkin solver for incompressible flows. J. Comput. Phys. 241: 388-415 (2013) - 2012
- [j4]Francesco Bassi, Lorenzo Botti, Alessandro Colombo, Daniele A. Di Pietro, P. Tesini:
On the flexibility of agglomeration based physical space discontinuous Galerkin discretizations. J. Comput. Phys. 231(1): 45-65 (2012) - 2011
- [j3]Francesco Bassi, Antonio Ghidoni, Stefano Rebay:
Optimal Runge-Kutta smoothers for the p-multigrid discontinuous Galerkin solution of the 1D Euler equations. J. Comput. Phys. 230(11): 4153-4175 (2011)
2000 – 2009
- 2009
- [j2]Francesco Bassi, Carmine De Bartolo, Ralf Hartmann, Alessandra Nigro:
A discontinuous Galerkin method for inviscid low Mach number flows. J. Comput. Phys. 228(11): 3996-4011 (2009) - 2006
- [j1]Francesco Bassi, Andrea Crivellini, Daniele A. Di Pietro, Stefano Rebay:
An artificial compressibility flux for the discontinuous Galerkin solution of the incompressible Navier-Stokes equations. J. Comput. Phys. 218(2): 794-815 (2006)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
