QRSlv: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
{{solvers}} | {{solvers}} | ||
{{ | {{stub}} | ||
'''QRSlv''' is the primary [[NLA]] solver for ASCEND. It can solve systems of nonlinear algebraic equation, but it is not suitable for [[optimisation]] problems containing [[MAXIMIZE]] or [[MINIMIZE]] statements (for those, [[IPOPT]] or [[CONOPT]] are suggested). It is also not suitable for [[conditional modelling]] problems. | '''QRSlv''' is the primary [[NLA]] solver for ASCEND. It can solve systems of nonlinear algebraic equation, but it is not suitable for [[optimisation]] problems containing [[MAXIMIZE]] or [[MINIMIZE]] statements (for those, [[IPOPT]] or [[CONOPT]] are suggested). It is also not suitable for [[conditional modelling]] problems. | ||
Revision as of 08:52, 2 August 2010
| NLA |
|---|
| QRSlv |
| CMSlv |
| IPSlv |
| NLP |
| CONOPT |
| IPOPT |
| TRON |
| MINOS |
| Opt |
| NGSlv |
| DAE/ODE |
| IDA |
| LSODE |
| DOPRI5 |
| RADAU5 |
| LA |
| Linsolqr |
| Linsol |
| LP |
| MakeMPS |
| Logic |
| LRSlv |
QRSlv is the primary NLA solver for ASCEND. It can solve systems of nonlinear algebraic equation, but it is not suitable for optimisation problems containing MAXIMIZE or MINIMIZE statements (for those, IPOPT or CONOPT are suggested). It is also not suitable for conditional modelling problems.
QRSlv divides a system into precedence-ordered 'blocks' which are solved one-by-one using a powerful Newton-style iterative solver. It provides a number of algorithms for scaling and reordering the equations for efficient solution.
Add here: problem definition.
Add here: sample problems.