English
Related papers

Related papers: Global dynamics of the real secant method

200 papers

The secant method, as an important approach for solving nonlinear equations, is introduced in nearly all numerical analysis textbooks. However, most textbooks only briefly address the Q-order of convergence of this method, with few…

Numerical Analysis · Mathematics 2025-10-16 Yan Tan , Chenhao Ye , Qinghai Zhang , Shubo Zhao

In this paper, we consider nonlocal, nonlinear partial differential equations to model anisotropic dynamics of complex root sets of random polynomials under differentiation. These equations aim to generalise the recent PDE obtained by…

Numerical Analysis · Mathematics 2022-05-19 André Galligo

Some of the most common mathematical models in biology, chemistry, physics, and engineering, are polynomial dynamical systems, i.e., systems of differential equations with polynomial right-hand sides. Inspired by notions and results that…

Dynamical Systems · Mathematics 2019-01-10 Gheorghe Craciun

Solving polynomials is a fundamental computational problem in mathematics. In the real setting, we can use Descartes' rule of signs to efficiently isolate the real roots of a square-free real polynomial. In this paper, we translate this…

Number Theory · Mathematics 2022-03-15 Josué Tonelli-Cueto

We present a new eigenvalue method for solving a system of Laurent polynomial equations defining a zero-dimensional reduced subscheme of a toric compactification $X$ of $(\mathbb{C} \setminus \{0\})^n$. We homogenize the input equations to…

Algebraic Geometry · Mathematics 2020-02-13 Simon Telen

We consider the problem of classifying the dynamics of complex polynomials $f: \mathbb{C} \to \mathbb{C}$ restricted to their basins of infinity. We synthesize existing combinatorial tools --- tableaux, trees, and laminations --- into a new…

Dynamical Systems · Mathematics 2011-07-07 Laura DeMarco , Kevin Pilgrim

In the graph exploration problem, a team of mobile computational entities, called agents, arbitrarily positioned at some nodes of a graph, must cooperate so that each node is eventually visited by at least one agent. In the literature, the…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-05-21 Giuseppe Antonio Di Luna , Stefan Dobrev , Paola Flocchini , Nicola Santoro

Here is an English summary of the abstract: This research investigates a geometric dynamical mechanism within a specific class of domains that contain a fixed convex core. By using a radial structure that links the boundaries of the core…

Dynamical Systems · Mathematics 2026-05-13 Mohammed Barkatou , Mohamed El Morsalani

This paper investigates the stratification of the discriminant hypersurface associated with a univariate polynomial via the number of its distinct complex roots. We introduce two novel approaches different from the one based on…

Algebraic Geometry · Mathematics 2025-10-01 Rizeng Chen , Hoon Hong , Jing Yang

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

Classical Analysis and ODEs · Mathematics 2022-04-12 Reuben Wheeler

We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…

Algebraic Geometry · Mathematics 2009-09-25 J. Maurice Rojas

Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…

Symbolic Computation · Computer Science 2014-04-21 Victor Y. Pan , Elias Tsigaridas

We study the existence and uniqueness of (locally) absolutely continuous trajectories of a dynamical system governed by a nonexpansive operator. The weak convergence of the orbits to a fixed point of the operator is investigated by relying…

Dynamical Systems · Mathematics 2014-12-16 Radu Ioan Bot , Ernö Robert Csetnek

We show that contact-rich motion planning is also sparsity-rich when viewed as polynomial optimization (POP). We can exploit not only the correlative and term sparsity patterns that are general to all POPs, but also specialized sparsity…

Robotics · Computer Science 2025-09-08 Shucheng Kang , Guorui Liu , Heng Yang

We present a sampling-based framework for multi-robot motion planning which combines an implicit representation of a roadmap with a novel approach for pathfinding in geometrically embedded graphs tailored for our setting. Our pathfinding…

Robotics · Computer Science 2014-04-01 Kiril Solovey , Oren Salzman , Dan Halperin

We study an ancient problem that in a static or dynamical system, sought an optimal path, which the context always means within an extremal condition. In fact, through those discussions about this theme, we established a universal essential…

Data Structures and Algorithms · Computer Science 2016-02-09 Yong Tan

A theory of numerical path-following in toric varieties was suggested in two previous papers. The motivation is solving systems of polynomials with real or complex coefficients. When those polynomials are not assumed 'dense', solving them…

Algebraic Geometry · Mathematics 2025-06-23 Gregorio Malajovich

The theory of polynomial-like maps is of fundamental importance in holomorphic dynamics. We study dynamical properties of a larger class of maps. Our main result is that, under some natural conditions, a map of this class has a completely…

Dynamical Systems · Mathematics 2025-10-17 Genadi Levin

Recent works demonstrated that the dynamics caused by the planetary oblateness coupled with the solar radiation pressure can be described through a model based on singly-averaged equations of motion. The coupled perturbations affect the…

Earth and Planetary Astrophysics · Physics 2020-11-24 Ioannis Gkolias , Elisa Maria Alessi , Camilla Colombo

This paper presents a method for calculating Region of Attraction of a target set (not necessarily an equilibrium) for controlled polynomial dynamical systems, using a hierarchy of semidefinite programming problems (SDPs). Our approach…

Optimization and Control · Mathematics 2021-03-08 Vít Cibulka , Milan Korda , Tomáš Haniš
‹ Prev 1 3 4 5 6 7 10 Next ›