MARC Record from harvard_bibliographic_metadata

LEADER: 01975cam a2200301uu 4500
001 000674659-4
005 20020606090541.3
008 721110c19721973nju b 00010 eng
010 $a 78039843
020 $a0130223352
035 0 $aocm00515987
040 $aDLC$cDLC
050 00 $aQA402.5$b.B74
100 1 $aBrent, R. P.$q(Richard P.)
245 10 $aAlgorithms for minimization without derivatives$c[by] Richard P. Brent.
260 0 $aEnglewood Cliffs, N.J.,$bPrentice-Hall$c[1972, c1973]
300 $axii, 195 p.$c24 cm.
440 0 $aPrentice-Hall series in automatic computation
504 $aBibliography: p. 169-185.
520 $aOutstanding text for graduate students and research workers proposes improvements to existing algorithms, extends their related mathematical theories, and offers details on new algorithms for approximating local and global minima. Many numerical examples, along with complete analysis of rate of convergence for most of the algorithms and error bounds that allow for the effect of rounding errors.
505 0 $aPreface -- Introduction and summary -- Some useful results on Taylor series, divided differences, and LaGrange interpolation -- The use of successive interpolation for finding simple zeros of a function and its derivatives -- An algorithm with guaranteed convergence for finding a zero of a function -- An algorithm with guaranteed convergence for finding a minimum of a function of one variable -- Global minimization given an upper bound on the second derivative -- A new algorithm for minimizing a function of several variable without calculating derivatives.
650 0 $aAlgorithms.
650 0 $aMaxima and minima.
650 0 $aApproximation theory.
655 7 $aExtremwertbestimmung.$2swd
776 08 $iOnline version:$aBrent, R.P. (Richard P.).$tAlgorithms for minimization without derivatives.$dEnglewood Cliffs, N.J., Prentice-Hall [1972, ©1973]$w(OCoLC)567965277
988 $a20020608
906 $0DLC