RADAU5: Difference between revisions
No edit summary |
No edit summary |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{solvers}}{{experimental}}{{stub}} | {{solvers}}{{experimental}}{{stub}} | ||
This is ASCEND wrapper for the '''RADAU5''' solver, by Ernst Hairer, also referenced in the book by Ascher & Petzold, and with [http://www.unige.ch/~hairer/software.html source code available here]. From Hairer's webpage, RADAU5 implements "implicit Runge-Kutta method of order 5 (Radau IIA) for problems of the form <math>\mathrm{M} \mathbf{y^{'}} = \mathbf{f} \left(\mathbf{x},\mathbf{y} \right)</math> with possibly singular matrix <math>\mathrm{M}</math>; with dense output (collocation solution)." | This is ASCEND wrapper for the '''RADAU5''' solver, by Ernst Hairer, also referenced in the book by Ascher & Petzold, and with [http://www.unige.ch/~hairer/software.html source code available here]. From Hairer's webpage, RADAU5 implements "implicit Runge-Kutta method of order 5 (Radau IIA) for problems of the form <math>\mathrm{M} \mathbf{y^{'}} = \mathbf{f} \left(\mathbf{x},\mathbf{y} \right)</math> with possibly singular matrix <math>\mathrm{M}</math>; with dense output (collocation solution)." | ||
This means that, in principle, RADAU5 can solve a sub-set of possible DAE systems. However since this imposes restrictions on the possible equation forms that can be passed to this solver, whereas the ASCEND language itself imposes no such limitation, we therefore need to find a way to check the equation structure is acceptable before attempting to pass the system to RADAU5 for solution. This work is ongoing. | |||
[[Shrikanth Ranganadham]] is working on integrating RADAU5 into ASCEND as part of his current Masters project. | [[Shrikanth Ranganadham]] is working on integrating RADAU5 into ASCEND as part of his current Masters project. | ||
[[C S Karthik]] is working on RADAU5 as part of [[GSOC2011]]. | |||
Latest revision as of 08:39, 16 June 2011
| NLA |
|---|
| QRSlv |
| CMSlv |
| IPSlv |
| NLP |
| CONOPT |
| IPOPT |
| TRON |
| MINOS |
| Opt |
| NGSlv |
| DAE/ODE |
| IDA |
| LSODE |
| DOPRI5 |
| RADAU5 |
| LA |
| Linsolqr |
| Linsol |
| LP |
| MakeMPS |
| Logic |
| LRSlv |
This is ASCEND wrapper for the RADAU5 solver, by Ernst Hairer, also referenced in the book by Ascher & Petzold, and with source code available here. From Hairer's webpage, RADAU5 implements "implicit Runge-Kutta method of order 5 (Radau IIA) for problems of the form <math>\mathrm{M} \mathbf{y^{'}} = \mathbf{f} \left(\mathbf{x},\mathbf{y} \right)</math> with possibly singular matrix <math>\mathrm{M}</math>; with dense output (collocation solution)."
This means that, in principle, RADAU5 can solve a sub-set of possible DAE systems. However since this imposes restrictions on the possible equation forms that can be passed to this solver, whereas the ASCEND language itself imposes no such limitation, we therefore need to find a way to check the equation structure is acceptable before attempting to pass the system to RADAU5 for solution. This work is ongoing.
Shrikanth Ranganadham is working on integrating RADAU5 into ASCEND as part of his current Masters project.
C S Karthik is working on RADAU5 as part of GSOC2011.