國立虎尾科技大學 |

The Krasnoselskii-Mann method for common fixed point problems

Record Type:	Language materials, printed : Monograph/item
Title/Author:	The Krasnoselskii-Mann method for common fixed point problems/ by Alexander J. Zaslavski.
Author:	Zaslavski, Alexander J.
Published:	Cham :Springer Nature Switzerland : : 2025.,
Description:	viii, 137 p. :ill., digital ; : 24 cm.;
Contained By:	Springer Nature eBook
Subject:	Fixed point theory. -
Online resource:	https://doi.org/10.1007/978-3-031-85841-3
ISBN:	9783031858413

The Krasnoselskii-Mann method for common fixed point problems
Zaslavski, Alexander J.

The Krasnoselskii-Mann method for common fixed point problems[electronic resource] /by Alexander J. Zaslavski. - Cham :Springer Nature Switzerland :2025. - viii, 137 p. :ill., digital ;24 cm. - SpringerBriefs in optimization,2191-575X. - SpringerBriefs in optimization..

Introduction -- Iterative methods -- Methods with remotest set control -- Set-valued inclusions -- The Cimmino algorithm in a normed space -- Dynamic string-averaging methods -- References.

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.

ISBN: 9783031858413

Standard No.: 10.1007/978-3-031-85841-3doiSubjects--Topical Terms:

528441
Fixed point theory.

LC Class. No.: QA329.9

Dewey Class. No.: 515.7248

The Krasnoselskii-Mann method for common fixed point problems
LDR:02633nam a2200337 a 4500 001 1161565
003 DE-He213
005 20250324115258.0
006 m d
007 cr nn 008maaau
008 251029s2025 sz s 0 eng d
020 $a 9783031858413 $q (electronic bk.)
020 $a 9783031858406 $q (paper)
024 7 $a 10.1007/978-3-031-85841-3 $2 doi
035 $a 978-3-031-85841-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA329.9
072 7 $a PBU $2 bicssc
072 7 $a MAT042000 $2 bisacsh
072 7 $a PBU $2 thema
082 0 4 $a 515.7248 $2 23
090 $a QA329.9 $b .Z38 2025
100 1 $a Zaslavski, Alexander J. $3 1022503
245 1 4 $a The Krasnoselskii-Mann method for common fixed point problems $h [electronic resource] / $c by Alexander J. Zaslavski.
260 $a Cham : $c 2025. $b Springer Nature Switzerland : $b Imprint: Springer,
300 $a viii, 137 p. : $b ill., digital ; $c 24 cm.
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.
650 0 $a Fixed point theory. $3 528441
650 1 4 $a Optimization. $3 669174
650 2 4 $a Operator Theory. $3 672127
650 2 4 $a Topology. $3 633483
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
830 0 $a SpringerBriefs in optimization. $3 883718
856 4 0 $u https://doi.org/10.1007/978-3-031-85841-3
950 $a Mathematics and Statistics (SpringerNature-11649)