osprei
Code for generating Optimal Stability Polynomials in Roots for Explicit time Integration.
Science Score: 64.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
✓CITATION.cff file
Found CITATION.cff file -
✓codemeta.json file
Found codemeta.json file -
○.zenodo.json file
-
✓DOI references
Found 1 DOI reference(s) in README -
✓Academic publication links
Links to: zenodo.org -
✓Committers with academic emails
1 of 2 committers (50.0%) from academic institutions -
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (6.8%) to scientific vocabulary
Keywords
Repository
Code for generating Optimal Stability Polynomials in Roots for Explicit time Integration.
Basic Info
Statistics
- Stars: 3
- Watchers: 3
- Forks: 1
- Open Issues: 0
- Releases: 6
Topics
Metadata Files
README.md
& (/
&& && &
&& && &&
&& &&& && &&/
&&&( &&& &&& &&
#%%%&&%&&%%%&&
((%%%%%%%%&&
%%# %##%#((####%&%
(%%##%%&%#########%%
/%%###&%%%%#######&&%#
%%####%%%####%##%&&&&%%
/%%%%%%%#%#%#%#%#&&&&%&&%
#%&&&%%&%#%#&&&&%#%&%&&&&/
/%%%#%(##%%%#%&&&%%%##%#&&
/%%(##%&&&%%#&&&%%%###%%##
(%%%%%%%#%%#%&&&########((
%#&%#%%%%%%%&&%%&######((/
&&&&#(/%#%%&&%########((///
/%&&&%%%%%%&###%####(((#((
%&&&&%&%%&&&###(#(((((((((/
#&&&&&&%%%%%#((((((((((((//
#&&&&&&%%&&####((((//////,,,/ # .#%/&#
&&&&&&#(((((((//((#( . ..#%%, ##%#
###%%%%%(///// // ,,,,.,,/ //((/
&&((/ / ,,, (((%##((#####(#/
/(( / //( /////////((#(#################//#
(/#((((//((///(((((((((((#(#%%#&%&#&%&&%#%&%#%#######%%%%(
%%&%%%&&&//((###(((( %&%%%%%%%%%#%%###%%%###%%%%%%%&&&&%&&&
%%&&%&%%%#%/ (#%%%%%#%###%###(##%%%#(%####&%%&&#
/##/#/(######(((###%%%####%%&%
((%%((####%#########%%
#%# ##%(#%%%%%# #%
&&% &&% /(
Code for generating Optimal Stability Polynomials in Roots for Explicit Time Integration.
Dependencies
IpOptis the core package (optimizer). Following the installation instructions should suffice, no special installation directory is required. For the linear solver onlyMUMPShas been applied both in combination withMETISand without.NAG dco/c++is used to compute the necessary derivatives algorithmically.dco/c++is proprietary software, but chances are that you can obtain an academic license (NAG Campus) if you are working in research. After obtainingdco/c++and licensing it, you need to change the path in the Makefiles (line 7) accordingly, i.e.,DCO_PATH=YOUR/PATH/TO/DCO.- Optional: If you want to compute also the monomial coefficients of the stability polynomial the usage of higher precision datatypes is necessary, where I resort to the implementation by
Boost.
Building
After obtaining and licensing the dependencies, execute in both directories Feasibility_Problem and Optimization_Problem
make -j NUMTHREADS
where you can specify the NUMTHREADS according to your machine, e.g. 8.
This builds object files and binaries in the corresponding directories obj and bin.
Usage
Best starting point are the examples.
In order to carry out the optimization of a stability polynomial of degree $S$ and linear order of accuracy $p$ you require the spectrum and a reference timestep $\Delta t\text{Ref}$ with a corresponding reference stage count $S\text{Ref}$.
The syntax of calling the feasible point searchers/optimizers is then
./Roots_Real(Imag).exe S p S_ref dt_ref Spectrum
If the spectrum itself does not form a convex hull, you need to supply the path to the files containing the real and imaginary part, respectively.
A call would then look like this:
./Roots_Real(Imag).exe S p S_ref dt_ref Spectrum PathToHullPoints
Again, this is best seen in the examples.
Roots_Real.exe looks for the parameter file Roots_Real.opt and Roots_RealImag.exe accordingly for Roots_RealImag.opt in the working directory.
If none of these files is present, default Ipopt options are used.
Credit
If you use the implementations provided here, please also cite this repository as
bibtex
@misc{OSPREI,
author={Doehring, Daniel and Torrilhon, Manuel},
title={{OSPREI}: Optimal Stability Polynomials in Roots for Explicit Time Integration},
year={2023},
doi={10.5281/zenodo.8009493},
publisher = {GitHub},
journal = {GitHub Repository},
howpublished = {\url{https://github.com/DanielDoehring/OSPREI}}
}
Affiliation
This project was developed at the Institute for Applied and Computational Mathematics (ACoM) at RWTH Aachen University.
Acknowledgements
This code is a result of research performed in the research unit "Structure-Preserving Numerical Methods for Bulk- and Interface Coupling of Heterogeneous Models (SNuBIC)"
This project has benefited from funding by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the research unit FOR 5409 "Structure-Preserving Numerical Methods for Bulk- and Interface Coupling of Heterogeneous Models (SNuBIC)" (project number 463312734).
Owner
- Name: Daniel Doehring
- Login: DanielDoehring
- Kind: user
- Repositories: 13
- Profile: https://github.com/DanielDoehring
Graduate/PhD Computational Engineering & Science student
Citation (CITATION.bib)
@misc{OSPREI,
author={Doehring, Daniel and Torrilhon, Manuel},
title={{OSPREI}: Optimal Stability Polynomials in Roots for Explicit Time Integration},
year={2023},
doi={10.5281/zenodo.8009493},
publisher = {GitHub},
journal = {GitHub Repository},
howpublished = {\url{https://github.com/DanielDoehring/OSPREI}}
}
GitHub Events
Total
- Watch event: 1
Last Year
- Watch event: 1
Committers
Last synced: about 2 years ago
Top Committers
| Name | Commits | |
|---|---|---|
| Daniel_Doehring | d****g@r****e | 47 |
| Daniel Doehring | d****2@g****m | 1 |
Committer Domains (Top 20 + Academic)
Issues and Pull Requests
Last synced: about 2 years ago
All Time
- Total issues: 0
- Total pull requests: 0
- Average time to close issues: N/A
- Average time to close pull requests: N/A
- Total issue authors: 0
- Total pull request authors: 0
- Average comments per issue: 0
- Average comments per pull request: 0
- Merged pull requests: 0
- Bot issues: 0
- Bot pull requests: 0
Past Year
- Issues: 0
- Pull requests: 0
- Average time to close issues: N/A
- Average time to close pull requests: N/A
- Issue authors: 0
- Pull request authors: 0
- Average comments per issue: 0
- Average comments per pull request: 0
- Merged pull requests: 0
- Bot issues: 0
- Bot pull requests: 0