Project Summary
Dohp aims to be a very efficient implementation of the hp-version of the finite element method. It exploits the tensor product structure of nodal bases on hexahedra to significantly reduce the memory requirements and computational cost compared to low-order elements. It uses Q1 elements on the nodes of the high-order basis to assemble a preconditioning matrix which is much sparser than Q2 elements. Preliminary results show that memory and solver runtime for arbitrary order (2-10 or so) is half that required by a standard Q2 approximation.
Dohp development is primarily focused on scalable solution of indefinite problems such as those found in incompressible flow and PDE-constrained optimization.
In a Nutshell, Dohp...
- ...
- ...
- ...
-
...
took an estimated 6 years of effort (COCOMO model)
starting with its first commit in May, 2008
ending with its most recent commit over 6 years ago
Quick Reference
BSD 4-clause (University of California-Specific)
Permitted
Commercial Use
Modify
Distribute
Place Warranty
Forbidden
Hold Liable
Use Trademarks
Required
Include Copyright
Include License
These details are provided for information only. No information here is legal advice and should not be used as such.
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
65% of companies leverage OSS to speed application development in 2016
-
...
data presented on the Open Hub is available through our API
-
...
nearly 1 in 3 companies have no process for identifying, tracking, or remediating known open source vulnerabilities
-
...
check out hot projects on the Open Hub
30 Day SummarySep 18 2019 — Oct 18 2019
|
12 Month SummaryOct 18 2018 — Oct 18 2019
|
