Related papers: Symbolic Algorithm for Solving SLAEs with Multi-Di…
We present Ca$\Sigma$oS, the first MATLAB software specifically designed for nonlinear sum-of-squares optimization. A symbolic polynomial algebra system allows to formulate parametrized sum-of-squares optimization problems and facilitates…
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different boundary conditions may hold on different regions. For any…
In this article we determine several theorems and methods for solving linear congruences and systems of linear congruences, and we find the number of distinct solutions. Many examples of solving congruences are given.
Large Language Models (LLMs) often struggle with complex mathematical reasoning, where prose-based generation leads to unverified and arithmetically unsound solutions. Current prompting strategies like Chain of Thought still operate within…
We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…
We show constructively that, under certain regularity assumptions, any system of coupled linear differential equations with variable coefficients can be tridiagonalized by a time-dependent Lanczos-like method. The proof we present formally…
Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal…
We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral…
We present a new open source implementation in the SageMath computer algebra system of algorithms for the numerical solution of linear ODEs with polynomial coefficients. Our code supports regular singular connection problems and provides…
This paper presents an algorithm for 3-SAT problems. First, logical formulas are transformed into elementary algebraic formulas. Second, complex trigonometric functions are assigned to the variables in the elementary algebraic formulas, and…
We study methods for finding the solution set of a generic system in a family of polynomial systems with parametric coefficients. We present a framework for describing monodromy based solvers in terms of decorated graphs. Under the…
A new symbolic algorithmic implementation of the general scheme of the exponentially convergent functional-discrete (FD-) method is developed and justified for the Sturm-Liouville problem on a finite interval for the Schr\"odinger equation…
In this paper, we present a new multiscale domain decomposition algorithm for computing solutions of static Eikonal equations. The new method is an iterative two-scale method that uses a parareal-like update scheme in combination with…
In latest years, several advancements have been made in symbolic-numerical eigenvalue techniques for solving polynomial systems. In this article, we add to this list. We design an algorithm which solves systems with isolated solutions…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
Computer Algebra systems are widely spread because of some of their remarkable features such as their ease of use and performance. Nonetheless, this focus on performance sometimes leads to unwanted consequences: algorithms and computations…
We present an efficient quantum algorithm to simulate nonlinear differential equations with polynomial vector fields of arbitrary degree on quantum platforms. Models of physical systems that are governed by ordinary differential equations…
In this paper, we introduce a numerical solution of a stochastic partial differential equation (SPDE) of elliptic type using polynomial chaos along side with polynomial approximation at Sinc points. These Sinc points are defined by a…
The aim of this article is to give a concise algebraic treatment of the modular symbols formalism, generalised from modular curves to Hecke triangle surfaces. A sketch is included of how the modular symbols formalism gives rise to the…
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…