Related papers: A modified three-point Secant method with improved…
In this paper, we introduce three new iterative methods for finding a common point of the set of fixed points of a symmetric generalized hybrid mapping and the set of solutions of an equilibrium problem in a real Hilbert space. Each method…
We discuss alternative iteration methods for differential equations. We provide a convergence proof for exactly solvable examples and show more convenient formulas for nontrivial problems.
Risk parity, also known as equal risk contribution, has recently gained increasing attention as a portfolio allocation method. However, solving portfolio weights must resort to numerical methods as the analytic solution is not available.…
Some fractional Newton methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper we introduce a fractional Newton method with order $\alpha+1$ and compare with another fractional…
We propose a new type of multilevel method for solving eigenvalue problems based on Newton iteration. With the proposed iteration method, solving eigenvalue problem on the finest finite element space is replaced by solving a small scale…
There are some types of ill-conditioned algebraic equations that have difficulty in obtaining accurate roots and coefficients that must be expressed with a multiple precision floating-point number. When all their roots are simple, the…
In most introductory numerical analysis textbooks, the treatment of a single nonlinear equation often consists of a collection of all-purpose methods that frequently do not work or are inefficient. These textbooks neglect to teach the…
In this paper, we introduce and study a new extragradient iterative process for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of a variational inequality for an…
Consider the problem: given a real number $x$ and an error bound $\epsilon$, find an interval such that it contains the $\sqrt[n]{x}$ and its width is less than $\epsilon$. One way to solve the problem is to start with an initial interval…
This paper presents a novel variant of the Broyden quasi-Newton secant-type method aimed at solving constrained mixed generalized equations, which can include functions that are not necessarily differentiable. The proposed method integrates…
We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…
This paper describes a systematic method of numerically computing and indexing fixed points of $z^{z^w}$ for fixed $z$ or equivalently, the roots of $T_2(w;z)=w-z^{z^w}$. The roots are computed using a modified version of fixed-point…
This paper proposes and analyzes an iterative minimization formulation for search- ing index-1 saddle points of an energy function. This formulation differs from other eigenvector-following methods by constructing a new objective function…
Floating-point arithmetic performance determines the overall performance of important applications, from graphics to AI. Meeting the IEEE-754 specification for floating-point requires that final results of addition, subtraction,…
We develop and analyze iterative methods for computing the principal square root of third-order tensors under the T-product framework. Tensor extensions of the Newton iteration (quadratic convergence) and the Denman--Beavers iteration…
This article is the first of a series of three presenting an alternative method to compute the one-loop scalar integrals. This novel method enjoys a couple of interesting features as compared with the method closely following 't Hooft and…
Unconstrained convex optimization problems have enormous applications in various field of science and engineering. Different iterative methods are available in literature to solve such problem, and Newton method is among the oldest and…
Variational inequalities can in general support distinct solutions. In this paper we study an algorithm for computing distinct solutions of a variational inequality, without varying the initial guess supplied to the solver. The central idea…
In this paper, we present a third-order iterative method based on Potra-Pt{\'a}k method to compute the approximate multiple roots of nonlinear equations. The method requires two evaluations of the function and one evaluation of its first…
In this paper, we investigate how to determine a better perturbation for superiorized iteration. We propose to seek the perturbation by proximal point method. In our method, the direction and amount of perturbation are computed…