| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Suppose we have a function f(x)=0, and we have to find all the real roots of it.
For example, we have some function a.x^4 + b.x^3 + c.x^2 + d.x^1 + e = 0, assume each term can have any coefficient of their own.
We have to find all real values of x satisfying it.
How can we find it? Any help would be appreciated!
You can search a billion results online, and the classical way you'd be taught in an introductory algo class is with newton's method. However what people may be less familiar with is that you can find all roots at once with arbitrary precision with matrices as described in this paper. I haven't actually read it, but I just came across it one day and think it is interesting as it gets all root including complex ones, but could hardly find any mentions of it.