Study of Algorithms for Fast Computation of Crack Expansion Problem

Farid Smaï, Hideo Aochi. Study of Algorithms for Fast Computation of Crack Expansion Problem. In Petros Koumoutsakos, Michael Lees, Valeria V. Krzhizhanovskaya, Jack J. Dongarra, Peter M. A. Sloot, editors, International Conference on Computational Science, ICCS 2017, 12-14 June 2017, Zurich, Switzerland. Volume 108 of Procedia Computer Science, pages 745-754, Elsevier, 2017. [doi]

@inproceedings{SmaiA17,
  title = {Study of Algorithms for Fast Computation of Crack Expansion Problem},
  author = {Farid Smaï and Hideo Aochi},
  year = {2017},
  doi = {10.1016/j.procs.2017.05.273},
  url = {https://doi.org/10.1016/j.procs.2017.05.273},
  researchr = {https://researchr.org/publication/SmaiA17},
  cites = {0},
  citedby = {0},
  pages = {745-754},
  booktitle = {International Conference on Computational Science, ICCS 2017, 12-14 June 2017, Zurich, Switzerland},
  editor = {Petros Koumoutsakos and Michael Lees and Valeria V. Krzhizhanovskaya and Jack J. Dongarra and Peter M. A. Sloot},
  volume = {108},
  series = {Procedia Computer Science},
  publisher = {Elsevier},
}