Related papers: Computing Spectral Elimination Ideals
A Comprehensive Grobner system for a parametric ideal I in K(A)[X] represents the collection of all Grobner bases of the ideals I' in K[X] obtained as the values of the parameters A vary in K. The recent algorithms for computing them…
We study algebraic varieties associated with the camera resectioning problem. We characterize these resectioning varieties' multigraded vanishing ideals using Gr\"obner basis techniques. As an application, we derive and re-interpret…
We consider the question when the so--called spectral condition} for Hermite subdivision schemes extends to spaces generated by polynomials and exponential functions. The main tool are convolution operators that annihilate the space in…
We consider determinantal ideals, where the generating minors are encoded in a hypergraph. We study when the generating minors form a Gr\"obner basis. In this case, the ideal is radical, and we can describe algebraic and numerical…
We introduce a spectrum for arbitrary varieties. This generalizes the definition by Steenbrink for hypersurfaces. In the isolated complete intersection singularity case, it coincides with the one given by Ebeling and Steenbrink except for…
In this article we investigate the spectral properties of the infinitesimal generator of an infinite system of master equations arising in the analysis of the approach to equilibrium in statistical mechanics. The system under investigation…
Our goal is to provide simple and practical algorithms in higher-order Fourier analysis which are based on spectral decompositions of operators. We propose a general framework for such algorithms and provide a detailed analysis of the…
In this paper we derive sequences of Gershgorin-type inclusion sets for the spectra and pseudospectra of finite matrices. In common with previous generalisations of the classical Gershgorin bound for the spectrum, our inclusion sets are…
This is a survey about spectral sets, to appear in the second edition of Handbook of Linear Algebra (L. Hogben, ed.). Spectral sets and K-spectral sets, introduced by John von Neumann, offer a possibility to estimate the norm of functions…
We study bihomogeneous systems defining, non-zero dimensional, biprojective varieties for which the projection onto the first group of variables results in a finite set of points. To compute (with) the 0-dimensional projection and the…
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
This paper presents a novel approach to constructing finite generating sets for infinitely generated ideals. By integrating algebraic and computational techniques, we provide a method to identify finite generators, demonstrated through…
In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work,…
Using vanishing of graded components of local cohomology modules of the Rees algebra of the normal filtration of an ideal, we give bounds on the normal reduction number. This helps to get necessary and sufficient conditions in…
We establish necessary and sufficient conditions on simultaneous symplectic spectral decomposition of a family of $2n \times 2n$ real positive semidefinite matrices with symplectic kernels. We also provide a precise algebraic condition on a…
We present conditions for which X-ray spectra can be ``unfolded'' to present accurate representation of the true source spectra. The method we use to unfold the data is implemented in the \textit{Interactive Spectral Interpretation…
Spectral decomposition of matrices is a recurring and important task in applied mathematics, physics and engineering. Many application problems require the consideration of matrices of size three with spectral decomposition over the real…
Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…
A new algorithm is presented for computing the largest degree invariant factor of the Sylvester matrix (with respect either to $x$ or $y$) associated to two polynomials $a$ and $b$ in $\mathbb F_q[x,y]$ which have no non-trivial common…
Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopping criterion for two way spectral partitioning. More…