"Fully Implicit Time Stepping Can Be Efficient on Parallel Computers."

Brandon Cloutier, Benson K. Muite, Matteo Parsani (2019)

> Home

Details and statistics

DOI: 10.14529/JSFI190206

access: open

type: Journal Article

metadata version: 2020-12-29

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/superfri/CloutierMP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/superfri/CloutierMP19
Brandon Cloutier, Benson K. Muite, Matteo Parsani:
Fully Implicit Time Stepping Can Be Efficient on Parallel Computers. Supercomput. Front. Innov. 6(2): 75-85 (2019)

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.