On producing multiple solutions using repeated trials (Q1272987)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On producing multiple solutions using repeated trials |
scientific article; zbMATH DE number 1228654
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On producing multiple solutions using repeated trials |
scientific article; zbMATH DE number 1228654 |
Statements
On producing multiple solutions using repeated trials (English)
0 references
7 March 1999
0 references
The number of trials that is required by an algorithm to produce a given fraction of the problem solutions with a specified level of confidence is analyzed. The analysis indicates that the number of trials required to find a large fraction of the solution rapidly decreases as the number of solutions obtained on each trial by an algorithm increases. The analysis is done by probabilistic arguments. Numerical results for a comparison of a damped Newton algorithm, a homotopy method, and an ideal globally convergent single-solution algorithm.
0 references
exhaustive solution methods
0 references
homotopy methods
0 references
repeated trials
0 references
convergence
0 references
algorithm
0 references
numerical results
0 references
damped Newton algorithm
0 references
0.81916076
0 references
0.8182176
0 references
0 references
