Related papers: Relationships between different types of initial c…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…
This paper presents an iterative method suitable for inverting semilinear problems which are important kernels in many numerical applications. The primary idea is to employ a parametrization that is able to reduce semilinear problems into…
We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the…
The existence of solutions of some nonlocal initial value problems for differential inclusions is established. The guiding potential method is used and the topological degree theory for admissible multivalued vector fields is applied. Some…
Nonlinear matrix equations arise in many practical contexts related to control theory, dynamical programming and finite element methods for solving some partial differential equations. In most of these applications, it is needed to compute…
This paper investigates iterative methods for solving bi-level optimization problems where both inner and outer functions have a composite structure. We establish novel theoretical results, including the first analysis that provides…
We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with…
In this article, we present an iterative method to find simple roots of nonlinear equations, that is, to solving an equation of the form $f(x) = 0$. Different from Newton's method, the method we purpose do not require evaluation of…
This is a survey of "Iterated Local Search", a general purpose metaheuristic for finding good solutions of combinatorial optimization problems. It is based on building a sequence of (locally optimal) solutions by: (1) perturbing the current…
New modifications of the methods for simultaneous extraction of all roots of polynomials over an arbitrary Chebyshev system are elaborated. A cubic convergence of iterations is proved. The method presented is a generalisation of the…
This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…
Non-stationary signals are ubiquitous in real life. Many techniques have been proposed in the last decades which allow decomposing multi-component signals into simple oscillatory mono-components, like the groundbreaking Empirical Mode…
We present an algorithm based on continuation techniques that can be applied to solve numerically minimization problems with equality constraints. We focus on problems with a great number of local minima which are hard to obtain by local…
In this paper, we study the convergence properties of an iterative algorithm for fast nonlinear model predictive control of quasi-linear parameter-varying systems without inequality constraints. Compared to previous works considering this…
We present a new approach for search of coexisting classes of localised modes admitted by the repulsive (defocusing) scalar or vector nonlinear Schr\"odinger-type equations. The approach is based on the observation that generic solutions of…
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…
In this paper we established a class of optimal fourth-order methods which is obtained by existing third-order method for solving nonlinear equations for simple roots by using weight functions. Some physical examples are given to illustrate…
We revisit a unified methodology for the iterative solution of nonlinear equations in Hilbert spaces. Our key observation is that the general approach from [Heid & Wihler, Math. Comp. 89 (2020), Calcolo 57 (2020)] satisfies an energy…
We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…