The Krasnoselskii-Mann Method for Common Fixed Point Problems
This book delves into the intricate world of fixed point theory, focusing on the Krasnoselskii-Mann method to tackle common fixed point problems within a finite family of quasi-nonexpansive mappings in hyperbolic metric spaces. By exploring various iterative algorithms, including the Cimmino algorit...
Sparad:
| Huvudupphovsman: | |
|---|---|
| Institutionell upphovsman: | |
| Materialtyp: | Elektronisk E-bok |
| Språk: | engelska |
| Publicerad: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2025.
|
| Upplaga: | 1st ed. 2025. |
| Serie: | SpringerBriefs in Optimization,
|
| Ämnen: | |
| Länkar: | https://doi.org/10.1007/978-3-031-85841-3 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-85841-3 | ||
| 003 | DE-He213 | ||
| 005 | 20260906083305.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 250324s2025 sz | o |||| 0|eng d | ||
| 020 | |a 9783031858413 |9 978-3-031-85841-3 | ||
| 024 | 7 | |a 10.1007/978-3-031-85841-3 |2 doi | |
| 050 | 4 | |a QA402.5-402.6 | |
| 072 | 7 | |a PBU |2 bicssc | |
| 072 | 7 | |a MAT042000 |2 bisacsh | |
| 072 | 7 | |a PBU |2 thema | |
| 082 | 0 | 4 | |a 519.6 |2 23 |
| 100 | 1 | |a Zaslavski, Alexander J. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 4 | |a The Krasnoselskii-Mann Method for Common Fixed Point Problems |h [electronic resource] / |c by Alexander J. Zaslavski. |
| 250 | |a 1st ed. 2025. | ||
| 264 | 1 | |a Cham : |b Springer Nature Switzerland : |b Imprint: Springer, |c 2025. | |
| 300 | |a 1 online resource (VIII, 137 p.). | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 341 | 0 | |b Table of contents navigation |2 onix | |
| 341 | 0 | |b Single logical reading order |2 onix | |
| 341 | 0 | |b Use of colour is Not sole means of conveying information |2 onix | |
| 341 | 0 | |b Use of high contrast between text and background colour |2 onix | |
| 341 | 0 | |b Next / Previous structural navigation |2 onix | |
| 341 | 0 | |b All Non-decorative content supports reading without sight |2 onix | |
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a SpringerBriefs in Optimization, |x 2191-575X | |
| 505 | 0 | |a Introduction -- Iterative methods -- Methods with remotest set control -- Set-valued inclusions -- The Cimmino algorithm in a normed space -- Dynamic string-averaging methods -- References. | |
| 520 | |a This book delves into the intricate world of fixed point theory, focusing on the Krasnoselskii-Mann method to tackle common fixed point problems within a finite family of quasi-nonexpansive mappings in hyperbolic metric spaces. By exploring various iterative algorithms, including the Cimmino algorithm and dynamic string-averaging methods, this volume offers a comprehensive study of convergence and approximate solutions amidst computational errors. Key concepts such as W-hyperbolic spaces, convex combinations, and set-valued inclusions are meticulously examined. The author presents a detailed analysis of iterative methods, highlighting their effectiveness in solving complex fixed-point problems. Readers will encounter critical discussions on the behavior of exact and inexact iterates, the role of computational errors, and innovative approaches like remotest set control. This book invites readers to engage with challenging questions about convergence and solution accuracy in mathematical spaces. Ideal for researchers and scholars in mathematics and related fields, this book provides valuable insights into advanced iterative methods for solving fixed-point problems. Whether you are a mathematician specializing in nonlinear analysis or an academic exploring optimization theory, this volume is an essential resource for understanding the latest developments in fixed point theory. | ||
| 532 | 8 | |a Accessibility summary: This PDF does Not fully comply with PDF/UA standards but does include limited screen reader support, bookmarks for easy navigation, and searchable, selectable text. Users of assistive technologies may experience difficulty navigating or interpreting content in this document. We recognise the importance of accessibility and welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us via https://www.springernature.com/gp/info/accessibility | |
| 532 | 8 | |a Inaccessible, or known limited accessibility | |
| 532 | 8 | |a No reading system accessibility options actively disabled | |
| 532 | 8 | |a Publisher contact for further accessibility information: accessibilitysupport@springernature.com | |
| 588 | |a Print version record. | ||
| 650 | 0 | |a Mathematical optimization. | |
| 650 | 0 | |a Operator theory. | |
| 650 | 0 | |a Topology. | |
| 650 | 1 | 4 | |a Optimization. |
| 650 | 2 | 4 | |a Operator Theory. |
| 650 | 2 | 4 | |a Topology. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783031858406 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031858420 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031858437 |
| 830 | 0 | |a SpringerBriefs in Optimization, |x 2191-575X | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-85841-3 |
| 912 | |a ZDB-2-SMA | ||
| 912 | |a ZDB-2-SXMS | ||
| 912 | |a ZDB-2-251 | ||
| 950 | |a Mathematics and Statistics (SpringerNature-11649) | ||
| 950 | |a Mathematics and Statistics (R0) (SpringerNature-43713) | ||
| 950 | |a Focus Bundle Mathematics and Statistics (SpringerNature-85421) | ||