default search action
Francis Collino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i2]Hadrien Montanelli, Francis Collino, Houssem Haddar:
Computing singular and near-singular integrals over curved boundary elements: The strongly singular case. CoRR abs/2309.17039 (2023) - 2022
- [j14]Xavier Claeys, Francis Collino, Emile Parolin:
Nonlocal optimized schwarz methods for time-harmonic electromagnetics. Adv. Comput. Math. 48(6): 72 (2022) - 2021
- [i1]Xavier Claeys, Francis Collino, Emile Parolin:
Matrix form of nonlocal OSM for electromagnetics. CoRR abs/2108.11352 (2021)
2010 – 2019
- 2017
- [j13]Marc Bakry, Sébastien Pernet, Francis Collino:
A new accurate residual-based a posteriori error indicator for the BEM in 2D-acoustics. Comput. Math. Appl. 73(12): 2501-2514 (2017) - 2016
- [j12]Jean-David Benamou, Francis Collino, Jean-Marie Mirebeau:
Monotone and consistent discretization of the Monge-Ampère operator. Math. Comput. 85(302): 2743-2775 (2016) - 2015
- [j11]Stéphanie Chaillat, Francis Collino:
A wideband Fast Multipole Method for the Helmholtz kernel: Theoretical developments. Comput. Math. Appl. 70(4): 660-678 (2015) - 2013
- [j10]Jean-David Benamou, Francis Collino, Simon Marmorat:
Numerical microlocal analysis of 2-D noisy harmonic plane and circular waves. Asymptot. Anal. 83(1-2): 157-187 (2013) - 2012
- [j9]Jean-David Benamou, Francis Collino, Simon Marmorat:
Source point discovery through high frequency asymptotic time reversal. J. Comput. Phys. 231(14): 4643-4661 (2012) - 2011
- [j8]Xavier Claeys, Francis Collino:
Asymptotic and numerical analysis for Holland and Simpson's thin wire formalism. J. Comput. Appl. Math. 235(15): 4418-4438 (2011) - 2010
- [j7]Xavier Claeys, Francis Collino:
Augmented Galerkin schemes for the numerical solution of scattering by small obstacles. Numerische Mathematik 116(2): 243-268 (2010)
2000 – 2009
- 2004
- [j6]Tomi Huttunen, Peter Monk, Francis Collino, Jari P. Kaipio:
The Ultra-Weak Variational Formulation for Elastic Wave Problems. SIAM J. Sci. Comput. 25(5): 1717-1742 (2004) - 2003
- [j5]Francis Collino, Thierry Fouquet, Patrick Joly:
A Conservative Space-time Mesh Refinement Method for the 1-D Wave Equation. Part I: Construction. Numerische Mathematik 95(2): 197-221 (2003) - [j4]Francis Collino, Thierry Fouquet, Patrick Joly:
A Conservative Space-time Mesh Refinement Method for the 1-D Wave Equation. Part II: Analysis. Numerische Mathematik 95(2): 223-251 (2003)
1990 – 1999
- 1998
- [j3]Francis Collino, Peter Monk:
The Perfectly Matched Layer in Curvilinear Coordinates. SIAM J. Sci. Comput. 19(6): 2061-2090 (1998) - 1995
- [j2]Francis Collino, Patrick Joly:
Splitting of Operators, Alternate Directions, and Paraxial Approximations for the Three-Dimensional Wave Equation. SIAM J. Sci. Comput. 16(5): 1019-1048 (1995)
1980 – 1989
- 1986
- [j1]Pierre Kolb, Francis Collino, Patrick Lailly:
Pre-stack inversion of a 1-D medium. Proc. IEEE 74(3): 498-508 (1986)
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 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint