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ț: 389.31 lei
- 18% Preț: 1234.46 lei
- 18% Preț: 1828.60 lei
- 18% Preț: 949.42 lei
- 18% Preț: 1227.04 lei
- 18% Preț: 1228.62 lei
- 18% Preț: 1829.05 lei
- 18% Preț: 1229.73 lei
- Preț: 389.88 lei
- 18% Preț: 1226.11 lei
- Preț: 397.97 lei
- 18% Preț: 955.56 lei
- 18% Preț: 952.89 lei
- 18% Preț: 1222.17 lei
- Preț: 389.88 lei
- 15% Preț: 648.05 lei
- 18% Preț: 949.42 lei
- 15% Preț: 475.80 lei
- 18% Preț: 1544.95 lei
- 15% Preț: 647.59 lei
- 18% Preț: 958.25 lei
- Preț: 381.81 lei
- 18% Preț: 953.82 lei
- Preț: 394.51 lei
- Preț: 387.75 lei
- 18% Preț: 1226.24 lei
- 15% Preț: 646.75 lei
- 15% Preț: 642.03 lei
- 18% Preț: 744.53 lei
- 18% Preț: 1229.58 lei
Preț: 386.99 lei
Nou
Puncte Express: 580
Preț estimativ în valută:
74.06€ • 77.22$ • 61.55£
74.06€ • 77.22$ • 61.55£
Carte tipărită la comandă
Livrare economică 21 martie-04 aprilie
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.