Related papers: Fraction-free algorithm for the computation of dia…
The application of methods of computational algebra has recently introduced new tools for the study of Hilbert schemes. The key idea is to define flat families of ideals endowed with a scheme structure whose defining equations can be…
The paper presents a new generalized integer orthogonal transformation which consists of a well known orthogonal transform followed by stretching the basis vectors maintaining the asymptotic behavior of the number of integer solutions for…
Computing the critical points of a polynomial function $q\in\mathbb Q[X_1,\ldots,X_n]$ restricted to the vanishing locus $V\subset\mathbb R^n$ of polynomials $f_1,\ldots, f_p\in\mathbb Q[X_1,\ldots, X_n]$ is of first importance in several…
In this work, we explore the use of operator splitting algorithms for solving regularized structural topology optimization problems. The context is the classical structural design problems (e.g., compliance minimization and compliant…
Let $(f\_1,\dots, f\_s) \in \mathbb{Q}\_p [X\_1,\dots, X\_n]^s$ be a sequence of homogeneous polynomials with $p$-adic coefficients. Such system may happen, for example, in arithmetic geometry. Yet, since $\mathbb{Q}\_p$ is not an effective…
Computationally efficient numerical methods for high-order approximations of convolution integrals involving weakly singular kernels find many practical applications including those in the development of fast quadrature methods for…
We consider the linear time-dependent Schr\"odinger equation with a time-dependent smooth potential on an unbounded domain. A Galerkin spectral method with a tensor-product Hermite basis is used as a discretization in space. Discretizing…
$L^1$ based optimization is widely used in image denoising, machine learning and related applications. One of the main features of such approach is that it naturally provide a sparse structure in the numerical solutions. In this paper, we…
In this paper, we develop a new type of accelerated algorithms to solve some classes of maximally monotone equations as well as monotone inclusions. Instead of using Nesterov's accelerating approach, our methods rely on a so-called…
In the papers dealing with derivation and applications of operational matrices of Bernstein polynomials, a basis transformation, commonly a transformation to power basis, is used. The main disadvantage of this method is that the…
A theorem of Gekeler compares the number of non-isomorphic automorphic representations associated with the space of cusp forms of weight $k$ on $\Gamma_0(N)$ to a simpler function of $k$ and $N$, showing that the two are equal whenever $N$…
The Difference-of-Gaussian (DoG) is a widely used operator across applications, including image processing (feature and edge detection), quantum machine learning, and finite-difference methods (approximations of the Laplacian-of-Gaussian).…
Sparse polynomial interpolation, sparse linear system solving or modular rational reconstruction are fundamental problems in Computer Algebra. They come down to computing linear recurrence relations of a sequence with the Berlekamp-Massey…
Joint diagonalization, the process of finding a shared set of approximate eigenvectors for a collection of matrices, arises in diverse applications such as multidimensional harmonic analysis or quantum information theory. This task is…
In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division…
In the current paper the authors linked two methods in order to evaluate general n-th order tridiagonal determinants. A breakdown free numerical algorithm is developed for computing the inverse of any nxn general nonsingular tridiagonal…
The objective of this paper is to apply the well-known exact operational matrices (EOMs) idea for solving the Emden-Fowler equations, illustrating the superiority of EOMs versus ordinary operational matrices (OOMs). Up to now, a few studies…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
The definition for the Slater-type orbitals is generalized. Transformation between an orthonormal basis function and the Slater-type orbital with non-integer principal quantum numbers is investigated. Analytical expressions for the linear…
We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed…