Related papers: Numerical computation of H-bases
In this paper two ways to compute singular values are presented which use Cholesky decomposition as their basic operation.
In this work, we give a new method to compute the Hilbert basis of the semigroup of certain positive divisors supported on the exceptional divisor of a normal surface singularity. Our approach is purely combinatorial which permits to avoid…
We propose a new more efficient method for the computation of two-sided Gr\"obner bases of ideals and bimodules shifting the problem to the enveloping algebra. Arising from the ideas this method involves, we introduce the notion of…
In this note we compute length, support and dimension of syzygy modules of certain modules. This partially answers questions asked by Huneke et al.
Based on a theorem by Vasconcelos, we give an algorithm for equidimensional decomposition of algebraic sets using syzygy computations via Gr\"obner bases. This algorithm avoids the use of elimination, homological algebra and processing the…
We present a reduced basis method for cheaply constructing (possibly rough) approximations to the nodal basis functions of the virtual element space, and propose to use such approximations for the design of the stabilization term in the…
A solenoidal basis is constructed to compute velocities using a certain finite element method for the Stokes problem. The method is conforming, with piecewise linear velocity and piecewise constant pressure on the Powell-Sabin split of a…
A persistence module $M$, with coefficients in a field $\mathbb{F}$, is a finite-dimensional linear representation of an equioriented quiver of type $A_n$ or, equivalently, a graded module over the ring of polynomials $\mathbb{F}[x]$. It is…
In our previous work we studied minimal fractional decompositions of a rational matrix pseudodifferential operator: H=A/B, where A and B are matrix differential operators, and B is non-degenerate of minimal possible degree deg(B). In the…
In this note we provide an algorithm for computing the fractional integrals of orthogonal polynomials, which is more stable than that using the expression of the polynomials w.r.t. the canonical basis. This algorithm is aimed at solving…
We present an approach to accelerate real-space electronic structure methods several fold, without loss of accuracy, by reducing the dimension of the discrete eigenproblem that must be solved. To accomplish this, we construct an efficient,…
A simple approximation within the framework of the hybrid methods for the calculation of the electronic structure of solids is presented. By considering only the diagonal elements of the perturbation operator (Hartree-Fock exchange minus…
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending…
We present an approach to solid-state electronic-structure calculations based on the finite-element method. In this method, the basis functions are strictly local, piecewise polynomials. Because the basis is composed of polynomials, the…
The symplectic blob algebra is a physically motivated quotient of the Hecke algebra $H(\tilde{C}_n)$ with a diagram calculus. We find the blocks for the symplectic blob algebra for all specialisations of its parameters over the complex…
Closed-form expressions for the pH of ideal weak acid and weak acid buffer solutions (and their titration with a strong base) were obtained and analyzed with the aid of computer algebra systems. These expressions are used to evaluate,…
Let L be the Lie algebra of a simple algebraic group defined over a field F and let H be a split Cartan subalgebra of L. Then L has a Chevalley basis with respect to H. If the characteristic of F is not 2 or 3, it is known how to find it.…
We show that the homology of modules for Hurwitz spaces stabilizes and compute its stable value. As one consequence, we compute the moments of Selmer groups in quadratic twist families of abelian varieties over suitably large function…
A radial basis function (RBF) method based on matrix-valued kernels is presented and analyzed for computing two types of vector decompositions on bounded domains: one where the normal component of the divergence-free part of the field is…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.