Root-Finding Numerical Methods This repository contains a Python implementation of numerical root-finding methods for solving ( f (x) = 0 ). The methods include Bisection, Newton-Raphson, Fixed Point ...

This is a Streamlit application that leverages LangChain and Groq's LLMs to create an interactive assistant for mathematical solutions. It's especially focused on fixed-point iteration methods, but ...

This fixed-point “prox method” has been popular over the last decades. However, the tuning of the iteration parameter r is difficult, because r affects the convergence of the fixed-point iteration ...

Abstract. We study the convergence analysis of a Picard-S iterative method for a particular class of weak-contraction mappings and give a data dependence result for fixed points of these mappings.

In the Fixed Point Iteration- based Adaptive Control (FPIAC) that has been developed as an alternative of the Lyapunov function-based approach the actuator saturation causes problems in its both ...

A uniform transfinite iteration procedure for selecting fixed points of nonexpansive mappings is introduced. This procedure, which applies to arbitrary nonexpansive mappings in Banach spaces having ...