Related papers: Modified Potra-Pt\'ak method to determine the mult…
We propose an iterative method for nonlinear semidefinite programs with box constraints. The search direction in the proposed method utilizes the distance from the current point to the boundary of a feasible set. The computation of the…
In this paper, we introduce the new optimal perturbation iteration method based on the perturbation iteration algorithms for the approximate solutions of nonlinear differential equations of many types. The proposed method is illustrated by…
A method is presented for calculating solutions to differential equations analytically for a variety of problems in physics. An iteration procedure based on the recently proposed BLUES (Beyond Linear Use of Equation Superposition) function…
This paper presents a modification of Secant method for finding roots of equations that uses three points for iteration instead of just two. The development of the mathematical formula to be used in the iteration process is provided…
The object of the present work is to present the new classes of third-order and fourth-order iterative methods for solving nonlinear equations. Our third-order method includes methods of Weerakoon \cite{Weerakoon}, Homeier \cite{Homeier2},…
In this paper, we present a three-point without memory iterative method based on Kung and Traub's method for solving non-linear equations in one variable. The proposed method has eighth-order convergence and costs only four function…
Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…
This paper introduces a new method for constructing approximate solutions to a class of Wiener--Hopf equations. This is particularly useful since exact solutions of this class of Wiener--Hopf equations, at the moment, cannot be obtained.…
Computing the matrix square root and its inverse in a differentiable manner is important in a variety of computer vision tasks. Previous methods either adopt the Singular Value Decomposition (SVD) to explicitly factorize the matrix or use…
We propose a novel numerical method for solving a quadratic vector equation arising in Markovian Binary Trees. The numerical method consists in a fixed point iteration, expressed by means of the Perron vectors of a sequence of nonnegative…
This paper proposes a partially inexact alternating direction method of multipliers for computing approximate solution of a linearly constrained convex optimization problem. This method allows its first subproblem to be solved inexactly…
It is quite common that a nonlinear partial differential equation (PDE) admits multiple distinct solutions and each solution may carry a unique physical meaning. One typical approach for finding multiple solutions is to use the Newton…
In this paper, we present a new iterative approximate method of solving boundary value problems. The idea is to compute approximate polynomial solutions in the Bernstein form using least squares approximation combined with some properties…
In this work, we consider a boundary value problem for nonlinear triharmonic equation. Due to the reduction of nonlinear boundary value problems to operator equation for nonlinear terms we establish the existence, uniqueness and positivity…
The Colebrook equation $\zeta$ is implicitly given in respect to the unknown flow friction factor $\lambda$; $\lambda=\zeta(Re,\epsilon^*,\lambda)$ which cannot be expressed explicitly in exact way without simplifications and use of…
In this letter we apply a method recently devised in \cite{aapla03} to find precise approximate solutions to a certain class of nonlinear differential equations. The analysis carried out in \cite{aapla03} is refined and results of much…
This article concerned with the issue of solving a nonlinear equation with the help of iterative method where no any derivative evaluation is required per iteration. Therefore, this work contributes to a new class of optimal eighth-order…
The systems of nonlinear Volterra integral equations of the first kind with jump discontinuous kernels are studied. The iterative numerical method for such nonlinear systems is proposed. Proposed method employs the modified…
There are thousands of papers on rootfinding for nonlinear scalar equations. Here is one more, to talk about an apparently new method, which I call ``Inverse Cubic Iteration'' (ICI) in analogy to the Inverse Quadratic Iteration in Richard…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…