Related papers: Improved Computation of Involutive Bases
We develop algorithms to compute two versions of the motivic Hilbert zeta function for curve singularities: the classical version, applicable to singularities with a monomial valuation semigroup or to singular curves defined by…
We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the…
This paper proposes a novel scheme for reduced-rank Gaussian process regression. The method is based on an approximate series expansion of the covariance function in terms of an eigenfunction expansion of the Laplace operator in a compact…
We present a method for nonlinear parametric optimization based on algebraic geometry. The problem to be studied, which arises in optimal control, is to minimize a polynomial function with parameters subject to semialgebraic constraints.…
Nonlinear parametric inverse problems appear in many applications and are typically very expensive to solve, especially if they involve many measurements. These problems pose huge computational challenges as evaluating the objective…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…
In this work we discuss the possibility to reduce the computational complexity of modal methods, i.e. methods based on eigenmodes expansion, from the third power to the second power of the number of eigenmodes. The proposed approach is…
We introduce an efficient algorithm for the computation of the $W_3$ invariant of general unitary maps, which converges rapidly even on coarse discretization grids. The algorithm does not require extensive manipulation of the unitary maps,…
The template-based method is one of the most successful approaches to algebraic invariant synthesis. In this method, an algorithm designates a template polynomial p over program variables, generates constraints for p=0 to be an invariant,…
Methods for the computation of classical Gaussian quadrature rules are described which are effective both for small and large degree. These methods are reliable because the iterative computation of the nodes has guaranteed convergence, and…
In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone…
It was recently shown [7, 9] that "properly built" linear and polyhedral estimates nearly attain minimax accuracy bounds in the problem of recovery of unknown signal from noisy observations of linear images of the signal when the signal set…
For the arbitrary-Lagrangian-Eulerian (ALE) calculations, the geometric information needs to be calculated at each time step due to the movement of mesh. To achieve the high-order spatial accuracy, a large number of matrix inversions are…
We present an algorithmic embedded desingularization of arithmetic surfaces bearing in mind implementability. Our algorithm is based on work by Cossart-Jannsen-Saito, though our variant uses a refinement of the order instead of the…
We introduce a new algorithm for complex image reconstruction with separate regularization of the image magnitude and phase. This optimization problem is interesting in many different image reconstruction contexts, although is nonconvex and…
This paper introduces a subgradient extragradient algorithm with a conjugate gradient-type direction to solve pseudomonotone variational inequality problems in Hilbert spaces. The algorithm features a self-adaptive strategy that eliminates…
Hilbert schemes of zero-dimensional ideals in a polynomial ring can be covered with suitable affine open subschemes whose construction is achieved using border bases. Moreover, border bases have proved to be an excellent tool for describing…
We propose in this paper a unifying scheme for several algorithms from the literature dedicated to the solving of monotone inclusion problems involving compositions with linear continuous operators in infinite dimensional Hilbert spaces. We…
We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…