Related papers: Numerical computation of H-bases
In this survey, we present a detailed guide on using the computer algebra system OSCAR to compute monomial bases for simple, finite-dimensional modules of simple, complex Lie algebras. We will also demonstrate how to determine monomial…
Reduced basis methods are popular for approximately solving large and complex systems of differential equations. However, conventional reduced basis methods do not generally preserve conservation laws and symmetries of the full order model.…
In this paper, a method for constructing a near optimal normal basis for algebraic extensions of a finite field is described. In each extension, except for the squares of basis elements, the product of two distinct normal basis elements can…
This manuscript discusses a scalable controller synthesis method for networked systems with a large number of identical subsystems based on the H-infinity control framework. The dynamics of the individual subsystems are described by…
In this paper, based on techniques of Newton polygons, a result which allows the computation of a p integral basis of every quartic number field is given. For each prime integer p, this result allows to compute a p-integral basis of a…
In this article, we define the notion of slim (normal) bases and show their existence for various fields. As an application, an algorithm will be given that computes the spectrum of a basefield transform by merely using O(n) additions.
The Hirzebruch-Milnor class is given by the difference between the homology Hirzebruch characteristic class and the virtual one. It is known that the Hirzebruch-Milnor class for a certain singular hypersurface can be calculated by using the…
We give a general formula of the bias of root numbers for Hilbert modular newforms of cubic level. Explicit calculation is given when the base field is $\mathbb{Q}, \mathbb{Q}(\sqrt{2}), \mathbb{Q}(\sqrt{5})$ and the level is the cube of…
In this note, a classification of Homogenization-Based Numerical Methods and (in particular) of Numerical Methods that are based on the Two-Scale Convergence is done. In this classification stand: Direct Homogenization-Based Numerical…
We consider the computation of H-infinity norms for Single-Input-Single-Output (SISO) time-delay systems, which are described by delay differential algebraic equations. Unlike the iterative level set methods in the literature, we present a…
We give a formula computing the irregular Hodge numbers for a confluent hypergeometric differential equation.
We exhibit algorithms to compute systems of Hecke eigenvalues for spaces of Hilbert modular forms over a totally real field. We provide many explicit examples as well as applications to modularity and Galois representations.
We develop a new method in the computation of equivariant homotopy, which is based on the splitting of cofiber sequences associated to universal spaces in the category of equivariant spectra. In particular, we use this method to compute the…
A new family of Gaussian-type basis sets named sigma basis sets is presented and preliminarily tested. Sigma basis sets for H, C, N, O and P are reported and their performance is tested in some atomic and molecular calculations.
We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…
The aim of this paper is to introduce a method for computing Hilbert decompositions (and consequently the Hilbert depth) of a finitely generated multigraded module $M$ over the polynomial ring $K[X_1,..., X_n]$ by reducing the problem to…
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph…
We present a new formulation of the hyperbolic singular value decomposition (HSVD) for an arbitrary complex (or real) matrix without hyperexchange matrices and redundant invariant parameters. In our formulation, we use only the concept of…
Reliable estimation and approximation of probability density functions is fundamental for their further processing. However, their specific properties, i.e. scale invariance and relative scale, prevent the use of standard methods of spline…
We define Macaulay bases of modules, which are a common generalization of Groebner bases and Macaulay $H$-bases to suitably graded modules over a commutative graded $\mathbf{k}$-algebra, where the index sets of the two gradings may differ.…