Related papers: Reduced normal form of local integral bases
We present an alternative account of the problem of classifying and finding normal forms for arbitrary bilinear forms. Beginning from basic results developed by Riehm, our solution to this problem hinges on the classification of…
Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…
In this paper, we make a contribution to the computation of Gr\"obner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we…
We construct a resonant normal form for an area-preserving map near a generic resonant elliptic fixed point. The normal form is obtained by a simplification of a formal interpolating Hamiltonian. The resonant normal form is unique and…
This study presents the derivation of a recursive formula for integrals of products of $N$ Hermite polynomials, establishing a numerically stable scheme for their accurate evaluation in computer codes. The derivation is notably simple and…
Our main purpose is to give multiple examples for using the available implementations for computing the normalization of an affine ring, computing the minimial generators of the normalization as an algebra over the original ring and…
Parametric Gr\"obner bases have been studied for more than 15 years and are now a further developed subject. Here we propose a general study of parametric standard bases, that is with local orders. We mainly focus on the commutative case…
We give a closed form for $quotients$ of truncated basic hypergeometric series where the base $q$ is evaluated at roots of unity.
This work concerns the global minimization of a prescribed eigenvalue or a weighted sum of prescribed eigenvalues of a Hermitian matrix-valued function depending on its parameters analytically in a box. We describe how the analytical…
Although there is no natural internal product for hermitian forms over an algebra with involution of the first kind, we describe how to multiply two $\varepsilon$-hermitian forms to obtain a quadratic form over the base field. This allows…
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.…
This paper introduces a novel tangential-normal ($t$-$n$) decomposition for finite element differential forms, presenting a new framework for constructing bases in finite element exterior calculus. The main contribution is the development…
We derive inversion formulas involving orthogonal polynomials which can be used to find coefficients of differential equations satisfied by certain generalizations of the classical orthogonal polynomials. As an example we consider special…
In this contribution, we are concerned with model order reduction in the context of iterative regularization methods for the solution of inverse problems arising from parameter identification in elliptic partial differential equations. Such…
Let $[A]: Y'=AY$ with $A\in \mathrm{M}_n (k)$ be a differential linear system. We say that a matrix $R\in {\cal M}_{n}(\bar{k})$ is a {\em reduced form} of $[A]$ if $R\in \mathfrak{g}(\bar{k})$ and there exists $P\in GL_n (\bar{k})$ such…
In this paper, we first present an algorithm for computing the Hermite normal form of pseudo-matrices over Pr\"ufer domains. This algorithm allows us to provide constructive proofs of the main theoretical results on finitely presented…
Many eigenvalue problems arising in practice are often of the generalized form $A\x=\lambda B\x$. One particularly important case is symmetric, namely $A, B$ are Hermitian and $B$ is positive definite. The standard algorithm for solving…
We consider the computation of averaged coefficients for the homogenization of elliptic partial differential equations. In this problem, like in many multiscale problems, a large number of similar computations parametrized by the…
The reduction algorithm is used to compute reduced ideals of a number field. However, there are reduced ideals that can never be obtained from this algorithm. In this paper, we will show that these ideals have inverses of larger norms among…
Following several decades of successive algorithmic improvements, works from the 2010s have showed how to compute the Hermite normal form (HNF) of a univariate polynomial matrix within a complexity bound which is essentially that of…