Minimax Models in the Theory of Numerical Methods: Theory and Decision Library B, cartea 21
Autor A. Sukharev Traducere de Olga Chuyanen Limba Engleză Paperback – 26 oct 2012
Din seria Theory and Decision Library B
-
Preț: 374.54 lei - 18%
Preț: 1186.41 lei - 18%
Preț: 1757.22 lei - 18%
Preț: 912.55 lei - 18%
Preț: 1179.30 lei - 18%
Preț: 1180.81 lei - 18%
Preț: 1757.66 lei - 18%
Preț: 1181.87 lei -
Preț: 375.07 lei - 18%
Preț: 1178.40 lei -
Preț: 382.85 lei - 18%
Preț: 918.47 lei - 18%
Preț: 915.89 lei - 18%
Preț: 1174.61 lei -
Preț: 375.07 lei - 15%
Preț: 623.05 lei - 18%
Preț: 912.55 lei - 15%
Preț: 457.53 lei - 18%
Preț: 1636.48 lei - 15%
Preț: 622.59 lei - 18%
Preț: 921.04 lei -
Preț: 367.33 lei - 18%
Preț: 916.80 lei -
Preț: 379.51 lei -
Preț: 373.03 lei - 18%
Preț: 1178.53 lei - 15%
Preț: 621.80 lei - 15%
Preț: 617.25 lei - 18%
Preț: 715.72 lei - 18%
Preț: 1175.66 lei
Preț: 372.31 lei
Nou
Puncte Express: 558
Preț estimativ în valută:
65.88€ • 77.36$ • 57.83£
65.88€ • 77.36$ • 57.83£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9789401052252
ISBN-10: 9401052255
Pagini: 276
Ilustrații: XIV, 258 p.
Dimensiuni: 160 x 240 x 14 mm
Greutate: 0.39 kg
Ediția:Softcover reprint of the original 1st ed. 1992
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Theory and Decision Library B
Locul publicării:Dordrecht, Netherlands
ISBN-10: 9401052255
Pagini: 276
Ilustrații: XIV, 258 p.
Dimensiuni: 160 x 240 x 14 mm
Greutate: 0.39 kg
Ediția:Softcover reprint of the original 1st ed. 1992
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Theory and Decision Library B
Locul publicării:Dordrecht, Netherlands
Public țintă
ResearchCuprins
1. General Computation Model.- 1. Basic concepts.- 2. Functional classes under consideration.- 3. Classes of deterministic algorithms.- 4. Minimax concept of optimality and specific notions of optimality.- 5. Comparison of the best guaranteed results for adaptive and nonadaptive algorithms.- 6. Sequentially optimal algorithms.- 7. Stochastic algorithms.- 2. Numerical Integration.- 1. Optimal quadratures for functional classes determined by quasi-metrics.- 2. Optimal quadratures for functional classes determined by moduli of continuity.- 3. Sequentially optimal and one-step optimal integration algorithms.- 4. Numerical tests.- 5. Optimal computation of iterated integrals.- 6. Computation of multiple integrals using Peano type developments.- 3. Recovery of Functions from Their Values.- 1. Optimal nonadaptive algorithms.- 2. Sequentially optimal and one-step optimal recovery algorithms.- 3. Solution of a multistep antagonistic game related to the problem of optimal recovery.- 4. Search for the Global Extremum.- 1. On the choice of starting points for local optimization methods.- 2. Optimal nonadaptive search for a functional class determined by a quasi-metric.- 3. Reduction of the problem of constructing a sequentially optimal algorithm for a functional dass determined by a quasi-metric to aseries of problems of optimal covering.- 4. Specific computational algorithms.- 5. Case of approximate information.- 6. One-step optimal stochastic algorithm.- 5. Some Special Classes of Extremal Problems.- 1. Solution of equations and systems of equations.- 2. Maximization of a minimum function with coupled variables.- 3. Optimization with several criteria.- Author Index.