Skip to main
Zenodo home
Communities
My dashboard
Log in Sign up
Published March 2, 2020 | Version 1.1
Software Open

Timmmdavis/CutAndDisplace: Getting a DOI

Creators

  • Tim Davis1
  • 1. GFZ

Description

Boundary Element MATLAB code. Modelling faults and deformation

Files

Timmmdavis/CutAndDisplace-1.1.zip

Files (8.7 MB)

Name Size Download all
Timmmdavis/CutAndDisplace-1.1.zip
md5:2b1c50450f4949220c54fe2c53d28c9d
8.7 MB Preview Download

Additional details

Related works

Is supplement to
https://github.com/Timmmdavis/CutAndDisplace/tree/1.1 (URL)
514
Views
63
Downloads
Show more details
All versions This version
Views

Total views

514 505
Downloads

Total downloads

63 63
Data volume

Total data volume

614.8 MB 614.8 MB

More info on how stats are collected....

Versions

External resources

Available in
  • Timmmdavis/CutAndDisplace

    Release: 1.1

Indexed in
  • OpenAIRE

Communities

Details

DOI
10.5281/zenodo.3694164
DOI Badge

DOI

10.5281/zenodo.3694164

Markdown

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.3694164.svg)](https://doi.org/10.5281/zenodo.3694164)

reStructuredText

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.3694164.svg
  :target: https://doi.org/10.5281/zenodo.3694164

HTML

<a href="https://doi.org/10.5281/zenodo.3694164"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.3694164.svg" alt="DOI"></a>

Image URL

https://zenodo.org/badge/DOI/10.5281/zenodo.3694164.svg

Target URL

https://doi.org/10.5281/zenodo.3694164
Resource type
Software
Publisher
Zenodo

Rights

License
Other (Open)
No further description.

Citation

Export

Technical metadata

Created
March 2, 2020
Modified
March 3, 2020

About

  • About
  • Policies
  • Infrastructure
  • Principles
  • Projects
  • Roadmap
  • Contact

Blog

  • Blog

Help

  • FAQ
  • Docs
  • Guides
  • Support

Developers

  • REST API
  • OAI-PMH

Contribute

  • GitHub
  • Donate

Funded by

Powered by CERN Data Centre & InvenioRDM

  • Status
  • Privacy policy
  • Cookie policy
  • Terms of Use
  • Support

This site uses cookies. Find out more on how we use cookies