хранилище/kolxo3/issue5─6/DVD12/_Papers/Numerical_methods/Root finding/
01 011455 Alefeld et al. Algorithm 748, enclosing zeros of functions(T)(18s).djvu [request] 02-09-2013:02-52

02 011456 Bauer, Stoer. Algorithm 105.. Newton Maehly(T)(7s).djvu [request] 02-09-2013:02-52

03 011457 Brent et al. Optimal iterative rootfinding rpb016i(T)(16s).djvu [request] 02-09-2013:02-52

04 011458 Brent. High-order root finding methods(T)(29s).djvu [request] 02-09-2013:02-52

05 011459 Brent. Optimal iterative rootfinding (gif)(T)(16s).djvu [request] 02-09-2013:02-52

06 011460 Brent. rpb026i High-order zero-finding with orthogonal polynomials(T)(29s).djvu [request] 02-09-2013:02-52

07 011461 Brent. rpb027 High-order zero-finding with many evaluations of derivatives (L)(T)(8s).djvu [request] 02-09-2013:02-52

08 011462 Brent. Solving systems of nonlinear equations(T)(18s).djvu [request] 02-09-2013:02-52

09 011463 King et al. Starting value for Newton#s method for sqrt(T)(2s).djvu [request] 02-09-2013:02-52

10 011464 Le. Root finding without derivatives(T)(13s).djvu [request] 02-09-2013:02-52

11 011465 More. Numerical solutions of nonlinear equations(T)(22s).djvu [request] 02-09-2013:02-52

12 011466 Potra, Shi. Remark on Brent#s rootfinding method 1995(12s).ps.gz [request] 02-09-2013:02-52

13 011467 Sebah, Gourdon. Newton#s method and high order generalizations (2001)(10s).ps.gz [request] 02-09-2013:02-52

14 011468 Sonnenschein. Minimierung programmierbarer Funktionen (disser)(de)(130s).ps.gz [request] 02-09-2013:02-52

15 011469 Sonnenschein. Minimierung programmierbarer Funktionen (disser)(de).tex.bz2 [request] 02-09-2013:02-52