Related papers: Adleman-Manders-Miller Root Extraction Method Revi…
Many popular first order algorithms for convex optimization, such as forward-backward splitting, Douglas-Rachford splitting, and the alternating direction method of multipliers (ADMM), can be formulated as averaged iteration of a…
This short note provides an explicit description of the Fr\'echet derivatives of the principal square root matrix functional at any order. We present an original formulation that allows to compute sequentially the Fr\'echet derivatives of…
[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…
We present an explicit algorithmic method for computing square roots in quaternion algebras over global fields of characteristic different from 2.
We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented…
Let $R$ be a reduced irreducible root system, $h$ its Coxeter number and $m$ a positive integer smaller than $h$. Choose of base of $R$, whence a corresponding height function, and let $R(m)$ be the set of roots whose height is a multiple…
In this second paper on the method of deriving linearizing transformations for nonlinear ODEs, we extend the method to a set of two coupled second order nonlinear ODEs. We show that besides the conventional point, Sundman and generalized…
In this work, we study the application the classical Richardson extrapolation (RE) technique to accelerate the convergence of sequences resulting from linear multistep methods (LMMs) for solving initial-value problems of systems of ordinary…
Modulo a prime number, we define semi-primitive roots as the square of primitive roots. We present a method for calculating primitive roots from quadratic residues, including semi-primitive roots. We then present progressions that generate…
The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…
Using a new technique involving integration it is possible to find the exact roots of simple functions. In this case, simple functions are defined as smooth functions having an inverse, and that inverse having an antiderivative. This…
The generalized alternating direction method of multipliers (ADMM) of Xiao et al. [{\tt Math. Prog. Comput., 2018}] aims at the two-block linearly constrained composite convex programming problem, in which each block is in the form of…
In this paper four fundamental methods for an iso-surface extraction are compared, based on cell decomposition to tetrahedra. The methods are compared both on mathematically generated data sets as well as on real data sets. The comparison…
Linearization is a standard approach in the computation of eigenvalues, eigenvectors and invariant subspaces of matrix polynomials and rational matrix value functions. An important source of linearizations are the so called Fiedler…
We extend expansion formulas of Liu given in 2013 to the context of multiple series over root systems. Liu and others have shown the usefulness of these formulas in Special Functions and number-theoretic contexts. We extend Wang and Ma's…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
We study the problem of extracting randomness from somewhere-random sources, and related combinatorial phenomena: partition analogues of Shearer's lemma on projections. A somewhere-random source is a tuple $(X_1, \ldots, X_t)$ of (possibly…
We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…