English
Related papers

Related papers: Reduced normal form of local integral bases

200 papers

Matrices over the ring of formal power series are considered. Normal forms with respect to various sub-groups of the two-sided transformations are constructed. The construction is based on the special property of the action: it induces a…

Representation Theory · Mathematics 2010-11-04 Genrich Belitskii , Dmitry Kerner

Among all of the non-Hermitian large-tridiagonal-matrix quantum Hamiltonians we choose a subclass with the structure resembling the ``benchmark'' realistic Bose-Hubbard model. We demonstrate that this choice can be declared user-friendly in…

Quantum Physics · Physics 2025-12-09 Miloslav Znojil

Conjugation covariants of matrices are applied to study the real algebraic variety consisting of complex Hermitian matrices with a bounded number of distinct eigenvalues. A minimal generating system of the vanishing ideal of degenerate…

Representation Theory · Mathematics 2013-02-22 M. Domokos

A $n\times n$ matrix $A$ has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size $(n+1)\times (n+1)$. The latter is called a minimal normal completion of $A$. A construction…

Functional Analysis · Mathematics 2009-03-03 D. S. Kaliuzhnyi-Verbovetskyi , I. M. Spitkovsky , H. J. Woerdeman

In this paper, we analyze some theoretical properties of the problem of minimizing a quadratic function with a cubic regularization term, arising in many methods for unconstrained and constrained optimization that have been proposed in the…

Optimization and Control · Mathematics 2018-09-05 Andrea Cristofari , Tayebeh Dehghan Niri , Stefano Lucidi

The problem of estimating the smallest singular value of random square matrices is important in connection with matrix computations and analysis of the spectral distribution. In this survey, we consider recent developments in the study of…

Probability · Mathematics 2022-06-02 Konstantin Tikhomirov

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F} \in \mathbb{K}[x]^{n \times n}$ over a field $\mathbb{K}$, we give a fast, deterministic algorithm for finding the Hermite normal form of $\mathbf{F}$ with complexity…

Symbolic Computation · Computer Science 2016-02-08 George Labahn , Wei Zhou

Normalization of polynomials plays a vital role in the approximate basis computation of vanishing ideals. Coefficient normalization, which normalizes a polynomial with its coefficient norm, is the most common method in computer algebra.…

Symbolic Computation · Computer Science 2022-07-04 Hiroshi Kera

We introduce the projective Hermite constant for positive definite binary hermitian forms associated with an imaginary quadratic number field $K$. It is a lower bound for the classical Hermite constant, and these two constants coincide when…

Number Theory · Mathematics 2015-05-12 Wai Kiu Chan , Maria Ines Icaza , Emilio A. Lauret

In this article, we design fast algorithms for the computation of approximant bases in shifted Popov normal form. We first recall the algorithm known as PM-Basis, which will be our second fundamental engine after polynomial matrix…

Symbolic Computation · Computer Science 2019-04-09 Claude-Pierre Jeannerod , Vincent Neiger , Gilles Villard

In this paper, we formally investigate two mathematical aspects of Hermite splines which translate to features that are relevant to their practical applications. We first demonstrate that Hermite splines are maximally localized in the sense…

Numerical Analysis · Mathematics 2019-02-11 Julien Fageot , Shayan Aziznejad , Michael Unser , Virginie Uhlmann

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Buse , Marc Chardin

We present a reduction algorithm that simultaneously extends Hermite's reduction for rational functions and the Hermite-like reduction for hyperexponential functions. It yields a unique additive decomposition and allows to decide…

Symbolic Computation · Computer Science 2013-01-23 Alin Bostan , Shaoshi Chen , Frédéric Chyzak , Ziming Li , Guoce Xin

We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…

Number Theory · Mathematics 2016-12-30 Tommy Hofmann , Claus Fieker

We develop a new method of umbral nature to treat blocks of Hermite and of Hermite like polynomials as independent algebraic quantities. The Calculus we propose allows the formulation of a number of practical rules allowing significant…

Classical Analysis and ODEs · Mathematics 2016-09-27 G. Dattoli , B. Germano , S. Licciardi , M. R. Martinelli

In this paper we the formulation of inverse problems as constrained minimization problems and their iterative solution by gradient or Newton type. We carry out a convergence analysis in the sense of regularization methods and discuss…

Numerical Analysis · Mathematics 2021-01-15 Barbara Kaltenbacher , Kha Van Huynh

In this work, we consider the problem of computing triangular bases of integral closures of one-dimensional local rings. Let $(K, v)$ be a discrete valued field with valuation ring $\mathcal{O}$ and let $\mathfrak{m}$ be the maximal ideal.…

Number Theory · Mathematics 2015-06-16 Hayden D. Stainsby

A computation method of algebraic local cohomology with parameters, associated with zero-dimensional ideal with parameter, is introduced. This computation method gives us in particular a decomposition of the parameter space depending on the…

Symbolic Computation · Computer Science 2015-08-28 Katsusuke Nabeshima , Shinichi Tajima

This article presets a review of lattice lattice basis reduction types. Paper contains the main five types of lattice basis reduction: size reduced (weak Hermit), c-reduced, Lovasz condition, Hermit-Korkin-Zolotarev, Minkowski reduced. The…

Discrete Mathematics · Computer Science 2012-11-13 Vasiliy Usatyuk

The equivalence group is determined for systems of linear ordinary differential equations in both the standard form and the normal form. It is then shown that the normal form of linear systems reducible by an invertible point transformation…

Classical Analysis and ODEs · Mathematics 2015-02-26 JC Ndogmo