Treffer: An iteration process for a general class of contractive-like operators: Convergence, stability and polynomiography

Title:
An iteration process for a general class of contractive-like operators: Convergence, stability and polynomiography
Authors:
Yong-Min Li, Khurram Shabbir, Abdul Aziz Shahid, Ti-Ming Yu, Nehad Ali Shah, Economics, Chengdu , China
Source:
AIMS Mathematics, Vol 6, Iss 7, Pp 6699-6714 (2021)
Publisher Information:
American Institute of Mathematical Sciences (AIMS), 2021.
Publication Year:
2021
Subject Terms:
Artificial intelligence, Class (philosophy), Convex Optimization, polynomials, Quadratic Programming, Economics, Iterative and incremental development, 02 engineering and technology, 01 natural sciences, Fixed Point Theorems in Metric Spaces, Maple, Machine learning, QA1-939, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Iterative Algorithms, 0101 mathematics, Stability (learning theory), Biology, Economic growth, Numerical Analysis, convergence, Software engineering, Numerical Optimization Techniques, Mathematical optimization, Botany, Iterative Algorithms for Nonlinear Operators and Optimization, Generalized Contractions, Applied mathematics, iterative schemes, Computer science, Iterative method, Process (computing), Programming language, Computational Theory and Mathematics, Contractive Mappings, contractive-like operators, Physical Sciences, Computer Science, Convergence (economics), image generation, Geometry and Topology, Mathematics
Document Type:
Fachzeitschrift Article<br />Other literature type
ISSN:
2473-6988
DOI:
10.3934/math.2021393
DOI:
10.60692/v6x26-4w722
DOI:
10.60692/vw37p-wmt38
Access URL:
https://doaj.org/article/346fe52d48134ab1b3aafd40b526410d
https://www.aimspress.com/article/doi/10.3934/math.2021393
Rights:
CC BY
Accession Number:
edsair.doi.dedup.....da59a37ac4a19c7881875c2be87ea24e
Database:
OpenAIRE

Weitere Informationen

Dans cet article, nous proposons un processus d'itération en trois étapes et analysons la performance du processus pour un opérateur de type contractuel. On observe que cette procédure itérative est plus rapide que plusieurs méthodes itératives dans la littérature existante. Pour appuyer la revendication, un exemple numérique est présenté à l'aide de Maple 13. Certaines images sont générées en utilisant cette méthode d'itération pour des polynômes cubiques complexes. Nous pensons que nos travaux présentés enrichissent le logiciel de polynomiographie.
En este documento, proponemos un proceso de iteración de tres pasos y analizamos el rendimiento del proceso para un operador de tipo contractivo. Se observa que este procedimiento iterativo es más rápido que varios métodos iterativos en la literatura existente. Para respaldar la afirmación, se presenta un ejemplo numérico utilizando Maple 13. Algunas imágenes se generan utilizando este método de iteración para polinomios cúbicos complejos. Creemos que nuestro trabajo presentado enriquece el software de polinomiografía.
In this paper, we propose a three step iteration process and analyze the performance of the process for a contractive-like operators. It is observed that this iterative procedure is faster than several iterative methods in the existing literature. To support the claim, a numerical example is presented using Maple 13. Some images are generated by using this iteration method for complex cubic polynomials. We believe that our presented work enrich the polynomiography software.
في هذه الورقة، نقترح عملية تكرار من ثلاث خطوات ونحلل أداء العملية للمشغلين الشبيهين بالتعاقد. ويلاحظ أن هذا الإجراء التكراري أسرع من العديد من الأساليب التكرارية في الأدبيات الحالية. لدعم المطالبة، يتم تقديم مثال رقمي باستخدام القيقب 13. يتم إنشاء بعض الصور باستخدام طريقة التكرار هذه لكثيرات الحدود المكعبة المعقدة. نحن نؤمن بأن عملنا المقدم يثري برنامج polynomiography.