Name
Abstract | ||
|---|---|---|
A fixed point problem is one where we seek a vector, X, for a function, f, such that f(X) = X. The solution of many such problems can be accelerated by using a fixed point acceleration algorithm. With the release of the FixedPoint package there is now a number of algorithms available in R that can be used for accelerating the finding of a fixed point of a function. These algorithms include Newton acceleration, Aitken acceleration and Anderson acceleration as well as epsilon extrapolation methods and minimal polynomial methods. This paper demonstrates the use of fixed point accelerators in solving numerical mathematics problems using the algorithms of the FixedPoint package as well as the squarem method of the SQUAREM package. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.32614/RJ-2019-037 | R JOURNAL |
Field | DocType | Volume |
Econometrics,Mathematical analysis,Computer science,Acceleration,Fixed point | Journal | 11 |
Issue | ISSN | Citations |
1 | 2073-4859 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stuart Baumann | 1 | 0 | 0.68 |
| Margaryta Klymak | 2 | 0 | 0.34 |