Related papers: Cusp bifurcations: numerical detection via two-par…
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…
This paper investigates the local behavior of 3D Filippov systems $Z=(X,Y)$, focusing on the dynamics around cusp-fold singularities. These singular points, characterized by cubic contact of vector field $X$ and quadratic contact of vector…
We construct a non-proper set of two variables polynomial maps and study the nowhere vanishing Jacobian condition of the Jacobian conjecture for this set. We obtain some classes of polynomial maps satisfying the 2-dimensional Jacobian…
The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…
Quasi-Newton methods form an important class of methods for solving nonlinear optimization problems. In such methods, first order information is used to approximate the second derivative. The aim is to mimic the fast convergence that can be…
In this paper we provide a new method to certify that a nearby polynomial system has a singular isolated root with a prescribed multiplicity structure. More precisely, given a polynomial system f $=(f\_1, \ldots, f\_N)\in C[x\_1, \ldots,…
We develop quaternion--native iterative methods for computing the Moore--Penrose (MP) pseudoinverse of quaternion matrices and analyze their convergence. Our starting point is a damped Newton--Schulz (NS) iteration tailored to…
We present and analyze rigorously a quadratically convergent algorithm to compute an invariant circle for 2-dimensional maps along with the corresponding foliation by stable manifolds. We prove that when the algorithm starts from an initial…
The need to compute the intersections between a line and a high-order curve or surface arises in a large number of finite element applications. Such intersection problems are easy to formulate but hard to solve robustly. We introduce a…
This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First, we give conditions so that much smaller quadratic programs…
The PC algorithm is the state-of-the-art algorithm for causal structure discovery on observational data. It can be computationally expensive in the worst case due to the conditional independence tests are performed in an…
There are a large number of methods for solving under-determined linear inverse problem. Many of them have very high time complexity for large datasets. We propose a new method called Two-Stage Sparse Representation (TSSR) to tackle this…
In this paper, we propose two algorithms for nonlinear semi-infinite semi-definite programs with infinitely many convex inequality constraints, called SISDP for short. A straightforward approach to the SISDP is to use classical methods for…
We consider a non-polynomial cubic spline to develop the classes of methods for the numerical solution of singularly perturbed two-point boundary value problems. The proposed methods are second and fourth order accurate and applicable to…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
Solving complex optimization problems in engineering and the physical sciences requires repetitive computation of multi-dimensional function derivatives. Commonly, this requires computationally-demanding numerical differentiation such as…
In this work we study qualitative properties of real analytic bounded maps. The main tool is approximation of real valued functions analytic in rectangular domains of the complex plane by continued g-fractions of Wall. As an application,…
Bifurcation analysis collects techniques for characterizing the dependence of certain classes of solutions of a dynamical system on variations in problem parameters. Common solution classes of interest include equilibria and periodic…
In this paper, we take advantage of the averaging theory to investigate a torus bifurcation in two-parameter families of 2D nonautonomous differential equations. Our strategy consists in looking for generic conditions on the averaged…
The presence of slow-fast Hopf (or singular Hopf) points in slow-fast systems in the plane is often deduced from the shape of a vector field brought into normal form. It can however be quite cumbersome to put a system in normal form. In the…