Related papers: Newton iteration, conditioning and zero counting
Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…
Translation from the Latin original, "Demonstratio gemina theorematis Neutoniani, quo traditur relatio inter coefficientes cuiusvis aequationis algebraicae et summas potestatum radicum eiusdem" (1747). E153 in the Enestrom index. In this…
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,…
In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…
The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…
These lecture notes endeavour to collect in one place the mathematical background required to understand the properties of kernels in general and the Random Fourier Features approximation of Rahimi and Recht (NIPS 2007) in particular. We…
The lectures are devoted to a remarkable class of $3$-dimensional polytopes, which are mathematical models of the important object of quantum physics, quantum chemistry and nanotechnology -- fullerenes. The main goal is to show how results…
We discuss existence of factorizations with linear factors for (left) polynomials over certain associative real involutive algebras, most notably over Clifford algebras. Because of their relevance to kinematics and mechanism science, we put…
We explain the notion of the {\em entropy} of a discrete random variable, and derive some of its basic properties. We then show through examples how entropy can be useful as a combinatorial enumeration tool. We end with a few open…
We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…
The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…
The textbook Newton's iteration is practically inapplicable on solutions of nonlinear systems with singular Jacobians. By a simple modification, a novel extension of Newton's iteration regains its local quadratic convergence toward…
These lecture notes provide an introduction to free probability theory, with a focus on tools and techniques useful in the study of large random matrices. Topics include freeness, free cumulants, additive and multiplicative free…
Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…
In this book we describe an approach through toric geometry to the following problem: "estimate the number (counted with appropriate multiplicity) of isolated solutions of n polynomial equations in n variables over an algebraically closed…
Algorithmic information theory roots the concept of information in computation rather than probability. These lecture notes were constructed in conjunction with the graduate course I taught at Universit\`a della Svizzera italiana in the…
We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms…
The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…
The first two lectures are devoted to describing the basic concepts of scattering theory in a very compressed way. A detailed presentation of the abstract part can be found in \cite{I} and numerous applications in \cite{RS} and \cite{Y2}.…
Quantum theory may be formulated using Hilbert spaces over any of the three associative normed division algebras: the real numbers, the complex numbers and the quaternions. Indeed, these three choices appear naturally in a number of…