CLOUTIER, B.; MUITE, B. K.; PARSANI, M. Fully Implicit Time Stepping Can Be Efficient on Parallel Computers. Supercomputing Frontiers and Innovations, [S. l.], v. 6, n. 2, p. 75–85, 2019. DOI: 10.14529/jsfi190206. Disponível em: https://superfri.susu.ru/index.php/superfri/article/view/275. Acesso em: 22 dec. 2024.