Related papers: Lazy Hermite Reduction and Creative Telescoping fo…
Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…
Given a sparse Hermitian matrix $A$ and a real number $\mu$, we construct a set of sparse vectors, each approximately spanned only by eigenvectors of $A$ corresponding to eigenvalues near $\mu$. This set of vectors spans the column space of…
The main theme of this dissertation is the study of the lattice points in a rational convex polyhedron and their encoding in terms of Barvinok's short rational functions. The first part of this thesis looks into theoretical applications of…
Algebraic model counting unifies many inference tasks on logic formulas by exploiting semirings. Rather than focusing on inference, we consider learning, especially in statistical-relational and neurosymbolic AI, which combine logical,…
It is shown that if a non-zero function $f\in B_\sigma$ has infinitely many double zeros on the real axis, then there exists at least one pair of consecutive zeros whose distance apart is greater than $\dfrac{\pi}{\sigma}\tau^{1/4}$,…
The classification of local Artinian Gorenstein algebras is equivalent to the study of orbits of a certain non-reductive group action on a polynomial ring. We give an explicit formula for the orbits and their tangent spaces. We apply our…
We consider a numerical scheme for Hamilton-Jacobi equations based on a direct discretization of the Lax-Oleinik semi-group. We prove that this method is convergent with respect to the time and space stepsizes provided the solution is…
We consider the Mellin transforms of certain generalized Hermite functions based upon certain generalized Hermite polynomials, characterized by a parameter $\mu>-1/2$. We show that the transforms have polynomial factors whose zeros lie all…
So far, the scope of computer algebra has been needlessly restricted to exact algebraic methods. Its possible extension to approximate analytical methods is discussed. The entangled roles of functional analysis and symbolic programming,…
We extend our formulation of Merge and Minimalism in terms of Hopf algebras to an algebraic model of a syntactic-semantic interface. We show that methods adopted in the formulation of renormalization (extraction of meaningful physical…
Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…
Terahertz (THz) tomography is a rather novel technique for nondestructive testing that is particularly suited for the testing of plastics and ceramics. Previous publications showed a large variety of conventional algorithms adapted from…
An analysis of the influence of missing samples in signals exhibiting sparsity in the Hermite transform domain is provided. Based on the statistical properties derived for the Hermite coefficients of randomly undersampled signal, the…
We define reduced zeta functions of Lie algebras, which can be derived from motivic zeta functions using the Euler characteristic. We show that reduced zeta functions of Lie algebras possessing a suitably well-behaved basis are easy to…
Lattice reduction is a NP-hard problem well known in computer science and cryptography. The Lenstra-Lenstra-Lovasz (LLL) algorithm based on the calculation of orthogonal Gram-Schmidt (GS) bases is efficient and gives a good solution in…
We provide first the functional analysis background required for reduced order modeling and present the underlying concepts of reduced basis model reduction. The projection-based model reduction framework under affinity assumptions,…
We propose a second-order method for unconditional minimization of functions $f(z)$ of complex arguments. We call it the Mixed Newton Method due to the use of the mixed Wirtinger derivative $\frac{\partial^2f}{\partial\bar z\partial z}$ for…
We propose a new fast algorithm for solving one of the standard approaches to ill-posed linear inverse problems (IPLIP), where a (possibly non-smooth) regularizer is minimized under the constraint that the solution explains the observations…
We introduce new Hermite-style and Bernstein-style geometric decompositions of the cubic order serendipity finite element spaces $S_3(I^2)$ and $S_3(I^3)$, as defined in the recent work of Arnold and Awanou [Found. Comput. Math. 11 (2011),…
The commonly used radial distortion model for camera calibration is in fact an assumption or a restriction. In practice, camera distortion could happen in a general geometrical manner that is not limited to the radial sense. This paper…