Related papers: Towards a Symbolic-Numeric Method to Compute Puise…
In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in…
Recent results in the theory and application of Newton-Puiseux expansions, i.e. fractional power series solutions of equations, suggest further developments within a more abstract algebraic-geometric framework, involving in particular the…
Quasi-Newton methods are well known techniques for large-scale numerical optimization. They use an approximation of the Hessian in optimization problems or the Jacobian in system of nonlinear equations. In the Interior Point context,…
We study the algebraic dynamical systems generated by triangular systems of rational functions and estimate the height growth of iterations generated by such systems. Further, using a result on the reduction modulo primes of systems of…
There are several numerical methods for computing approximate zeros of a given univariate polynomial. In this paper, we develop a simple and novel method for determining sharp upper bounds on errors in approximate zeros of a given…
Floating-point addition on a finite-precision machine is not associative, so not all mathematically equivalent summations are computationally equivalent. Making this assumption can lead to numerical error in computations. Proper ordering…
The Dirichlet forms methods, in order to represent errors and their propagation, are particularly powerful in infinite dimensional problems such as models involving stochastic analysis encountered in finance or physics, cf. [5]. Now, coming…
We propose a new semi-Lagrangian Vlasov-Poisson solver. It employs elements of metric to follow locally the flow and its deformation, allowing one to find quickly and accurately the initial phase-space position $Q(P)$ of any test particle…
A new algorithm for the symbolic computation of polynomial conserved densities for systems of nonlinear evolution equations is presented. The algorithm is implemented in Mathematica. The program condens.m automatically carries out the…
Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…
Many interesting and useful symbolic computation algorithms manipulate mathematical expressions in mathematically meaningful ways. Although these algorithms are commonplace in computer algebra systems, they can be surprisingly difficult to…
We present fast algorithms for computing rational first integrals with bounded degree of a planar polynomial vector field. Our approach is inspired by an idea of Ferragut and Giacomini. We improve upon their work by proving that rational…
Given the importance of floating-point~(FP) performance in numerous domains, several new variants of FP and its alternatives have been proposed (e.g., Bfloat16, TensorFloat32, and Posits). These representations do not have correctly rounded…
We propose a heuristic algorithm for fast computation of the Poincar\'{e} series $P_n(t)$ of the invariants of binary forms of degree $n$, viewed as rational functions. The algorithm is based on certain polynomial identities which remain to…
The aim of this paper is to construct a new non-uniform corner-cutting (NUCC) subdivision scheme that improves the accuracy of the classical (stationary and nonstationary) methods. The refinement rules are formulated via the reproducing…
It is often difficult to learn new mathematics semantically and syntactically, even when there are similarities in the words and meaning when discussed aloud. The goal of this document is to facilitate learning through explanations and…
Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…
Computations over the rational numbers often suffer from intermediate coefficient swell. One solution to this problem is to apply the given algorithm modulo a number of primes and then lift the modular results to the rationals. This method…
We present the $\textit{NumericalImplicitization}$ package for $\textit{Macaulay2}$, which allows for user-friendly computation of the invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values. This…
We present a new manifold learning algorithm that takes a set of data points lying on or near a lower dimensional manifold as input, possibly with noise, and outputs a simplicial complex that fits the data and the manifold. We have…