Difference between revisions of "Solver Software"
(Created page with "Category:Software{{Knoppen}} <noinclude><!------------------------------------------------ * READ THIS FIRST * Only edit this page if you can improve the content. * Improper...") |
|||
| Line 1: | Line 1: | ||
[[Category:Software]]{{Knoppen}} | [[Category:Software]]{{Knoppen}} | ||
[[File:Solver software.jpg|thumb|right|Solver Software]] | |||
* | '''Solver Software''' is a generic term indicating a piece of mathematical software, possibly in the form of a stand-alone computer program or as a software library, that solves a mathematical problem. A solver takes problem descriptions in some sort of generic form and calculate their solution. In a solver, the emphasis is on creating a program or library that can easily be applied to other problems of similar type. | ||
* | |||
Types of problems with existing dedicated solvers include: | |||
* Linear and non-linear equations. In the case of a single equation, the solver is more appropriately called a root-finding algorithm. | |||
* Systems of linear equations. | |||
* Nonlinear systems. | |||
* Systems of polynomial equations, which are a special case of non linear systems, better solved by specific solvers. | |||
* Linear and non-linear optimisation problems | |||
* Systems of ordinary differential equations | |||
* Systems of differential algebraic equations | |||
* Logic or satisfiability problems | |||
* Constraint satisfaction problems | |||
* Shortest path problems | |||
* Minimum spanning tree problems | |||
* Search algorithms | |||
The General Problem Solver (GPS) is a particular computer program created in 1957 by Herbert Simon, J.C. Shaw, and Allen Newell intended to work as a universal problem solver, that theoretically can be used to solve every possible problem that can be formalized in a symbolic system, given the right input configuration. It was the first computer program which separated its knowledge of problems from its strategy of how to solve problems . | |||
General solvers typically use an architecture similar to the GPS to decouple a problem's definition from the strategy used to solve it. While the strategy utilized by GPS was a general algorithm with the only goal of completeness, modern solvers tend to use a more specialized approach tailored to the specific problem class which the solver aims for. The advantage in this decoupling is that the solver doesn't depend on the details of any particular problem instance. | |||
For problems of a particular class there are usually a wide range of different algorithms available; sometimes a solver implements multiple algorithms, but sometimes just one. | |||
==Sources== | |||
[http://en.wikipedia.org/wiki/Solver Wikipedia Solver Software] | |||
Latest revision as of 23:11, 5 February 2013
Solver Software is a generic term indicating a piece of mathematical software, possibly in the form of a stand-alone computer program or as a software library, that solves a mathematical problem. A solver takes problem descriptions in some sort of generic form and calculate their solution. In a solver, the emphasis is on creating a program or library that can easily be applied to other problems of similar type.
Types of problems with existing dedicated solvers include:
- Linear and non-linear equations. In the case of a single equation, the solver is more appropriately called a root-finding algorithm.
- Systems of linear equations.
- Nonlinear systems.
- Systems of polynomial equations, which are a special case of non linear systems, better solved by specific solvers.
- Linear and non-linear optimisation problems
- Systems of ordinary differential equations
- Systems of differential algebraic equations
- Logic or satisfiability problems
- Constraint satisfaction problems
- Shortest path problems
- Minimum spanning tree problems
- Search algorithms
The General Problem Solver (GPS) is a particular computer program created in 1957 by Herbert Simon, J.C. Shaw, and Allen Newell intended to work as a universal problem solver, that theoretically can be used to solve every possible problem that can be formalized in a symbolic system, given the right input configuration. It was the first computer program which separated its knowledge of problems from its strategy of how to solve problems .
General solvers typically use an architecture similar to the GPS to decouple a problem's definition from the strategy used to solve it. While the strategy utilized by GPS was a general algorithm with the only goal of completeness, modern solvers tend to use a more specialized approach tailored to the specific problem class which the solver aims for. The advantage in this decoupling is that the solver doesn't depend on the details of any particular problem instance.
For problems of a particular class there are usually a wide range of different algorithms available; sometimes a solver implements multiple algorithms, but sometimes just one.