English
Related papers

Related papers: Computing Spectral Elimination Ideals

200 papers

The aim of this paper is to design a band-limited optimal input with power constraints for identifying a linear multi-input multi-output system. It is assumed that the nominal system parameters are specified. The key idea is to use the…

Systems and Control · Computer Science 2017-06-14 Shravan Mohan , Mithun Im , Bharath Bhikkaji

We compare two established and a new method for the calculation of spectral bounds for Hessian matrices on hyperrectangles by applying them to a large collection of 1522 objective and constraint functions extracted from benchmark global…

Optimization and Control · Mathematics 2013-09-06 Moritz Schulze Darup , Martin Kastsian , Stefan Mross , Martin Mönnigmann

An algorithm for resolution of singularities in characteristic zero is described. It is expressed in terms of multi-ideals, that essentially are defined as a finite sequence of pairs, each one consiting of a sheaf of ideals and a positive…

Algebraic Geometry · Mathematics 2013-04-10 Augusto Nobile

We define a version of multiplier ideals, the Mather multiplier ideals, on a variety with arbitrary singularities, using the Mather discrepancy and the Jacobian ideal. In this context we prove a relative vanishing theorem, thus obtaining…

Algebraic Geometry · Mathematics 2011-07-13 Lawrence Ein , Shihoko Ishii , Mircea Mustata

We study the problem of the computation of Groebner basis for the ideal of linear recurring relations of a doubly periodic array. We find a set of indexes such that, along with some conditions, guarantees that the set of polynomials…

Information Theory · Computer Science 2024-01-22 José Joaquín Bernal , Juan Jacobo Simón

This note computes a Gr\"obner basis for the ideal defining a union of Schubert varieties. More precisely, it computes a Gr\"obner basis for unions of schemes given by northwest rank conditions on the space of all matrices of a fixed size.…

Algebraic Geometry · Mathematics 2014-05-14 Anna Bertiger

We study birational maps with empty base locus defined by almost complete intersection ideals. Birationality is shown to be expressed by the equality of two Chern numbers. We provide a relatively effective method of their calculation in…

Commutative Algebra · Mathematics 2007-05-23 J. Hong , A. Simis , W. V. Vasconcelos

We precisely quantify the impact of statistical error in the quality of a numerical approximation to a random matrix eigendecomposition, and under mild conditions, we use this to introduce an optimal numerical tolerance for residual error…

We study the relationship between certain Groebner bases for zero dimensional ideals, and the interpolation condition functionals of ideal interpolation. Ideal interpolation is defined by a linear idempotent projector whose kernel is a…

Symbolic Computation · Computer Science 2024-01-17 Yihe Gong , Xue Jiang

This paper presents a bicomplex version of the Spectral Decomposition Theorem on infinite dimensional bicomplex Hilbert spaces. In the process, the ideas of bounded linear operators, orthogonal complements and compact operators on bicomplex…

Functional Analysis · Mathematics 2013-01-25 Kuldeep Singh Charak , Ravinder Kumar , Dominic Rochon

Imaging spectrometers measure electromagnetic energy scattered in their instantaneous field view in hundreds or thousands of spectral channels with higher spectral resolution than multispectral cameras. Imaging spectrometers are therefore…

Data Analysis, Statistics and Probability · Physics 2012-04-25 José M. Bioucas-Dias , Antonio Plaza , Nicolas Dobigeon , Mario Parente , Qian Du , Paul Gader , Jocelyn Chanussot

We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…

Combinatorics · Mathematics 2016-10-07 Wayne Barrett , Amanda Francis , Ben Webb

We give explicit generators for ideals of two classes of subspace arrangements embedded in certain reflection arrangements, generalizing results of Li-Li and Kleitman-Lovasz. We also give minimal generators for the ideals of arrangements…

Combinatorics · Mathematics 2012-01-25 Jessica Sidman

We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…

Commutative Algebra · Mathematics 2008-06-04 Kei-ichiro Iima , Yuji Yoshino

A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…

Algebraic Geometry · Mathematics 2016-07-08 Alessandra Bernardi , Noah S. Daleo , Jonathan D. Hauenstein , Bernard Mourrain

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…

Number Theory · Mathematics 2018-08-17 Ha Thanh Nguyen Tran

We discuss four different constructions of vector space bases associated to vanishing ideals of points. We show how to compute normal forms with respect to these bases and give new complexity bounds. As an application, we improve the…

Commutative Algebra · Mathematics 2010-10-20 Samuel Lundqvist

This paper establishes a theory of nonlinear spectral decompositions by considering the eigenvalue problem related to an absolutely one-homogeneous functional in an infinite-dimensional Hilbert space. This approach is both motivated by…

Analysis of PDEs · Mathematics 2021-09-21 Leon Bungert , Martin Burger , Antonin Chambolle , Matteo Novaga

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

We give a spectral algorithm for decomposing overcomplete order-4 tensors, so long as their components satisfy an algebraic non-degeneracy condition that holds for nearly all (all but an algebraic set of measure $0$) tensors over…

Machine Learning · Computer Science 2022-03-08 Samuel B. Hopkins , Tselil Schramm , Jonathan Shi