Related papers: An algorithm for computing the multigraded Hilbert…
A description of the real, complete modules over the Clifford algebra of a Hilbert space, with the elements of the latter acting by skew-symmetric operators.
We propose a variable metric forward-backward splitting algorithm and prove its convergence in real Hilbert spaces. We then use this framework to derive primal-dual splitting algorithms for solving various classes of monotone inclusions in…
A method of induction the distances with Hilbert structure is proposed. Some properties of the method are studied. Typical examples of corresponding metric spaces are discussed. Key words: Hilbert spaces; metric spaces; isometric embedding…
In this paper, we study temporal splitting algorithms for multiscale problems. The exact fine-grid spatial problems typically require some reduction in degrees of freedom. Multiscale algorithms are designed to represent the fine-scale…
We address two fundamental questions in the representation theory of affine Hecke algebras of classical types. One is an inductive algorithm to compute characters of tempered modules, and the other is the determination of the constants in…
The aim of this paper is to develop an algebraic multigrid method to solve eigenvalue problems based on the combination of the multilevel correction scheme and the algebraic multigrid method for linear equations. Our approach uses the…
This contribution presents a hierarchical multigrid approach for the solution of large-scale finite cell problems on both uniform grids and multi-level hp-discretizations. The proposed scheme leverages the hierarchical nature of the basis…
Given a finite-dimensional inner product space $V$ and a group $G$ of isometries, we consider the problem of embedding the orbit space $V/G$ into a Hilbert space in a way that preserves the quotient metric as well as possible. This inquiry…
In this paper, we define the geometric median of a probability measure on a Riemannian manifold, give its characterization and a natural condition to ensure its uniqueness. In order to calculate the median in practical cases, we also…
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…
In this paper, we introduce a system of split variational inequality problems in real Hilbert spaces. Using projection method, we propose an iterative algorithm for the system of split variational inequality problems. Further, we prove that…
The purpose of these notes is to provide the details of the Jacobian ring computations carried out in [1], based on the computer algebra system Magma [2].
Given a numerical function $h:\mathbb Z_{\geq 0}\to\mathbb Z_{\geq 0}$ with $h(0)>0$, the Hilbert depth of $h$ is $\operatorname{hdepth}(h)=\max\{d\;:\;\sum\limits_{j=0}^k (-1)^{k-j}\binom{d-j}{k-j}h(j)\geq 0\text{ for all }k\leq d\}$; see…
This paper presents 10-point and 12-point versions of the recently introduced number theoretic Hilbert (NHT) transforms. Such transforms have applications in signal processing and scrambling. Polymorphic solutions with respect to different…
We establish a connection between multiple polylogarithms on a torus and the Steinberg module of $\mathbb{Q}$, and show that multiple polylogarithms of depth $d$ and weight $n$ can be expressed via a single function…
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove…
Low rank matrix approximation is a popular topic in machine learning. In this paper, we propose a new algorithm for this topic by minimizing the least-squares estimation over the Riemannian manifold of fixed-rank matrices. The algorithm is…
The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…
Let $\lambda$ be a general length function for modules over a Noetherian ring R. We use $\lambda$ to introduce Hilbert series and polynomials for R[X]-modules, measuring the growth rate of~$\lambda$. We show that the leading term $\mu$ of…
We propose a novel method to compute multi-loop master integrals by constructing and numerically solving a system of ordinary differential equations, with almost trivial boundary conditions. Thus it can be systematically applied to problems…