Livrare gratuită pentru comenzile peste 349,00 lei.

Verifică starea comenzii

Faceți parte dintr-o comunitate de iubitori de cărți din întreaga lume și beneficiați de o mulțime de avantaje Creați-vă un cont gratuit

Transport gratuit la punctele de livrare Pick Up peste 349.00 lei

Packeta 15.00 lei Serviciul de curierat Cargus 28.00 lei Easybox 20.00 lei FAN Courier 20.00 lei Punct FAN 16.00 lei Punct DPD 17.00 lei Curier DPD 25.00 lei

Contact

Cum să cumpăr

Ajutor

Contul meu

▸ Gol :-(

Livrare gratuită pentru comenzile peste 349,00 lei.

Approximate Solutions of Common Fixed-Point Problems

Name: Approximate Solutions of Common Fixed-Point Problems
Brand: Springer International Publishing AG
SKU: 02972317
Price: 540.72 RON
Availability: InStock
Author: Alexander Zaslavski
ISBN: 9783319332536

Alexander Zaslavski

Limba

engleză

Carte Copertă tare

Codul Libristo: 02972317

Editura Springer International Publishing AG, iulie 2016

This book presents results on the§convergence behavior of algorithms which are known as vital tools... Descrierea completă

Codul Libristo: 02972317

249 b

540.72 lei

În depozitul extern Expediem în 10-13 zile

Până la 30 de zile pentru returnare

Clienții au cumpărat de asemenea

Ein bisschen so wie Martin, Das Liederbuch Stephen Janetzko

Note muzicale

70.11 lei

Puzzle 3D Socha Svobody - 39 dílků

Puzzle

46.67 lei

Yoga des Lehrens Frank Mühlhäuser

Carte broșată

71.15 lei

Biographische Notizen über Ludwig van Beethoven Franz G. Wegeler

Carte broșată

89.17 lei

Ciao, Please... Federica Leone

Carte broșată

82.92 lei

Etter atomulykken Vladimir Babenko

Carte broșată

59.69 lei

Zur Kritik der Konzepte der ostdeutschen Landesregierungen fur den Erhalt industrieller Kerne Alexander Gauler

Carte broșată

178.36 lei

CDV 2008 PRIMAIRE CM1/CM2 Josiane Thiriot

Carte broșată

43.33 lei

Les Derniers Jours de Paul Verlaine. Nombreux Documents Et Dessins. Nouvelle Edition Frédéric-Auguste Cazals

Carte broșată

138.46 lei

Les recettes colorées Locatelli

Carte broșată

113.03 lei

Autocars et bus Saviem Tourniquet

Carte

307.45 lei

Controle genetique de la qualite des graines chez le tournesol Asa Ebrahimi

Carte broșată

336.31 lei

This book presents results on the§convergence behavior of algorithms which are known as vital tools for solving§convex feasibility problems and common fixed point problems. The main goal for§us in dealing with a known computational error is to find what approximate§solution can be obtained and how many iterates one needs to find it. According§to know results, these algorithms should converge to a solution. In this§exposition, these algorithms are studied, taking into account computational§errors which remain consistent in practice. In this case the convergence to a§solution does not take place. We show that our algorithms generate a good§approximate solution if computational errors are bounded from above by a small§positive constant.§§Beginning with an introduction, this monograph moves on§to study:§§· dynamic§string-averaging methods for common fixed point problems in a Hilbert space§§· dynamic§string methods for common fixed point problems in a metric space§· dynamic§string-averaging version of the proximal algorithm§· common fixed§point problems in metric spaces§§· common fixed§point problems in the spaces with distances of the Bregman type§§· a proximal§algorithm for finding a common zero of a family of maximal monotone operators§§· subgradient§projections algorithms for convex feasibility problems in Hilbert spaces§