FIXED-POINT PROBLEMS IN DISCRETE TOMOGRAPHY: A CASE OF SQUARE WINDOWS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixed-Point Problems in Discrete Tomography: Case of Square Windows

A kind of fixed-point problem in the area of discrete tomography is proposed and investigated. Our chief concern in this paper is the case of square windows in the plane. Dealing with the arrays which are bounded, of polynomial growth, and finite-ring-valued, one comes across several interesting phenomena of combinatorial and arithmetic nature. keywords: discrete tomography; fixed point; square...

متن کامل

A strong convergence theorem for solutions of zero point problems and fixed point problems

Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated‎. ‎A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces‎.

متن کامل

a strong convergence theorem for solutions of zero point problems and fixed point problems

zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated‎. ‎a strong convergence theorem for the common solutions of the problems is established in the framework of hilbert spaces‎.

متن کامل

Equilibrium problems and fixed point problems for nonspreading-type mappings in hilbert space

In this paper by using the idea of mean convergence, weintroduce an iterative scheme for finding a common element of theset of solutions of an equilibrium problem and the fixed points setof a nonspreading-type mappings in Hilbert space. A strongconvergence theorem of the proposed iterative scheme is establishedunder some control conditions. The main result of this paper extendthe results obtain...

متن کامل

Evolutionary Fixed Point Distance Problems

One of the basic problems in comparative genomics is the computation of the true evolutionary distance between two genomes. Several different estimates of such distances exist. One method, introduced in [2], makes use of a distance measure in the symmetric group called the transposition distance. Briefly, the expected value of the transposition distance of a permutation formed by applying t ran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances and Applications in Discrete Mathematics

سال: 2016

ISSN: 0974-1658

DOI: 10.17654/dm017030323