Paper · 2020
Non-overlapping domain decomposition algorithm for 2D time-harmonic elastic wave problems
HAL, 401, 109050 · Published 1 January 2020
In brief
“Non-overlapping domain decomposition algorithm for 2D time-harmonic elastic wave problems” is a 2020 paper by Marion Darbas and 2 co-authors, published in HAL. OpenAlex counts 0 citations as of 21 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
- Authors
- 3
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Darbas, M., Mattesi, V., & Geuzaine, C. (2020). Non-overlapping domain decomposition algorithm for 2D time-harmonic elastic wave problems. HAL, 401, 109050. https://u-picardie.hal.science/hal-03884623
MLA 9
Darbas, Marion, et al. “Non-overlapping domain decomposition algorithm for 2D time-harmonic elastic wave problems.” HAL, vol. 401, 2020, p. 109050. https://u-picardie.hal.science/hal-03884623.
Chicago
Darbas, Marion, Vanessa Mattesi, and Christophe Geuzaine. 2020. “Non-overlapping domain decomposition algorithm for 2D time-harmonic elastic wave problems.” HAL 401: 109050. https://u-picardie.hal.science/hal-03884623.
Harvard
Darbas, M., Mattesi, V. and Geuzaine, C. (2020) ‘Non-overlapping domain decomposition algorithm for 2D time-harmonic elastic wave problems’, HAL, 401, p. 109050. Available at: https://u-picardie.hal.science/hal-03884623.
IEEE
M. Darbas, V. Mattesi, and C. Geuzaine, “Non-overlapping domain decomposition algorithm for 2D time-harmonic elastic wave problems,” HAL, vol. 401, p. 109050, 2020.
BibTeX
@article{darbas2020overlapping,
title = {{Non-overlapping domain decomposition algorithm for 2D time-harmonic elastic wave problems}},
author = {Darbas, Marion and Mattesi, Vanessa and Geuzaine, Christophe},
journal = {HAL},
year = {2020},
volume = {401},
pages = {109050},
url = {https://u-picardie.hal.science/hal-03884623}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Engineering › Computational Mechanics › Advanced Numerical Methods in Computational Mathematics
- non-overlapping domain decomposition
- domain decomposition algorithm
- elastodynamics
Work with this paper
Most-cited papers in Engineering
- A Closed‐form Equation for Predicting the Hydraulic Conductivity of Unsaturated SoilsMartinus Th. van Genuchten · Soil Science Society of America Journal · 1980 · 28,197 citations
- An improved technique for determining hardness and elastic modulus using load and displacement sensing indentation experimentsW. C. Oliver, George M. Pharr · Journal of materials research/Pratt's guide to venture capital sources · 1992 · 27,379 citations
- Digital communicationsOwen Bishop · Routledge eBooks · 2007 · 24,890 citations
- The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysisNorden Eh Huang, Zhengwei Shen, Steven R. Long and 6 more · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · 1998 · 24,008 citations
- Numerical Heat Transfer and Fluid FlowSuhas V. Patankar · CRC Press eBooks · 2018 · 23,491 citations
Questions about this paper
How do I cite this paper in APA style?
Darbas, M., Mattesi, V., & Geuzaine, C. (2020). Non-overlapping domain decomposition algorithm for 2D time-harmonic elastic wave problems. HAL, 401, 109050. https://u-picardie.hal.science/hal-03884623
How many times has this paper been cited?
0 times, according to OpenAlex on 21 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Marion Darbas, Vanessa Mattesi, Christophe Geuzaine.
Bibliographic data from OpenAlex (CC0), last checked 21 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.