Related papers: An implementation of CAD in Maple utilising proble…
Recently, considerable research efforts have been devoted to the design of methods to learn from data overcomplete dictionaries for sparse coding. However, learned dictionaries require the solution of an optimization problem for coding new…
Many important problems in science and engineering require solving the so-called parametric partial differential equations (PDEs), i.e., PDEs with different physical parameters, boundary conditions, shapes of computational domains, etc.…
We propose a physics-informed machine learning method for uncertainty quantification in high-dimensional inverse problems. In this method, the states and parameters of partial differential equations (PDEs) are approximated with truncated…
One of the few available complete methods for checking the satisfiability of sets of polynomial constraints over the reals is the cylindrical algebraic covering (CAlC) method. In this paper, we propose an extension for this method to…
{\sc CLIFFORD} is a Maple package for computations in Clifford algebras $\cl (B)$ of an arbitrary symbolic or numeric bilinear form B. In particular, B may have a non-trivial antisymmetric part. It is well known that the symmetric part g of…
Component-Based Development (CBD) is a popular approach to mitigating the costs of creating software systems. However, it is not clear to what extent the core component selection and adaptation activities of CBD can be implemented to…
Inclusive deep inelastic scattering factorization combines two features that are often treated separately: an asymptotic reconstruction of the current-current matrix element from hard and long-distance data, and an invariance under finite…
We present different methods for symbolic computer algebra computations in higher dimensional (\ge9) Clifford algebras using the \Clifford\ and \Bigebra\ packages for \Maple(R). This is achieved using graded tensor decompositions,…
We compare and discuss the respective efficiency of three methods (with two variants for each of them), based respectively on Taylor (Maclaurin) series, Pad\'{e} approximants and conformal mappings, for solving quasi-analytically a…
The problem of scheduling conflicting jobs on parallel machines consists in assigning a set of jobs to a set of machines so that no two conflicting jobs are allocated to the same machine, and the maximum processing time among all machines…
The current implementation of Thiele rational interpolation in Maple (the ThieleInterpolation routine) breaks down when the points are not well-ordered. In this article, it is shown how this breakdown can be avoided by ordering the…
A Maple code is presented for algebraic collective model (ACM) calculations. The ACM is an algebraic version of the Bohr model of the atomic nucleus, in which all required matrix elements are derived by exploiting the model's SU(1,1) x…
We present MADAM, a parallel semidefinite based exact solver for Max-Cut, a problem of finding the cut with maximum weight in a given graph. The algorithm uses branch and bound paradigm that applies alternating direction method of…
We describe a Maple package that serves at least four purposes. First, one can use it to compute whether or not a given polyhedral structure is Zometool constructible. Second, one can use it to manipulate Zometool objects, for example to…
The conformal mapping of the Borel plane can be utilized for the analytic continuation of the Borel transform to the entire positive real semi-axis and is thus helpful in the resummation of divergent perturbation series in quantum field…
This is a user guide for the first version of our developed Maple library, named Singularity. The first version here is designed for the qualitative study of local real zeros of scalar smooth maps. This library will be extended for symbolic…
The black box problem in machine learning has led to the introduction of an ever-increasing set of explanation methods for complex models. These explanations have different properties, which in turn has led to the problem of method…
In this study, an algorithm for computing the inverse of periodic k banded matrices, which are needed for solving the differential equations by using the finite differences, the solution of partial differential equations and the solution of…
Various control schemes rely on a solution of a convex optimization problem involving a particular robust quadratic constraint, which can be reformulated as a linear matrix inequality using the well-known $\mathcal{S}$-lemma. However, the…
Nonclassical symmetries and reductions of polynomial equations and systems of polynomial equations are considered. It is shown that specific polynomial equations having "hidden" symmetries can be reduced to classical symmetric systems of…