Related papers: Iterated Resultants in CAD
The quest for regular models of arithmetic surfaces allows different viewpoints and approaches: using valuations or a covering by charts. In this article, we sketch both approaches and then show in a concrete example, how surprisingly…
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…
Context. The numerical modeling of the generation and transfer of polarized radiation is a key task in solar and stellar physics research and has led to a relevant class of discrete problems that can be reframed as linear systems. In order…
Flexibility of structures is extremely important for chemistry and robotics. Following our earlier work, we study flexibility using polynomial equations, resultants, and a symbolic algorithm of our creation that analyzes the resultant. We…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
We study solutions of the Yang-Baxter equation on a tensor product of an arbitrary finite-dimensional and an arbitrary infinite-dimensional representations of the rank one symmetry algebra. We consider the cases of the Lie algebra sl_2, the…
This article advocates factorized and hybrid dimensional decompositions (FDD/HDD), as alternatives to analysis-of-variance dimensional decomposition (ADD), for second-moment statistical analysis of multivariate functions. New formulae…
We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…
A proof is given that hard-scattering factorization is valid for deep-inelastic processes which are diffractive or which have some other condition imposed on the final state in the target fragmentation region.
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…
We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…
One relates factorization of bivariate polynomials to singularities of projective plane curves. One proves that adjoint polynomials permit to solve the recombinations of the modular factors induced by the absolute and rational…
In this paper, we study the relationship between iterated resultant and multivariate discriminant. We show that, for generic form $f(X_n)$ with even degree $d$, if the polynomial is squarefreed after each iteration, the multivariate…
The paper describes two iterative algorithms for solving general systems of M simultaneous linear algebraic equations (SLAE) with real matrices of coefficients. The system can be determined, underdetermined, and overdetermined. Linearly…
This article primarily aims to unify the various formalisms of multivariate coefficients of variation, leveraging advanced concepts of generalized means, whether weighted or not, applied to the eigenvalues of covariance matrices. We…
A divide-and-conquer method for parameter estimation is the chunked-and-averaged (CA) estimator. CA estimators have been studied for univariate parameters under independent and identically distributed (IID) sampling. We study the CA…
In this paper we discuss the desingularization algorithm for a toric surface. In particular, we construct an iterable method of determining the Hirzebruch-Jung continued fraction decomposition. These results are then applied to weighted…
We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…
An algorithm is developed to compute the complete CS decomposition (CSD) of a partitioned unitary matrix. Although the existence of the CSD has been recognized since 1977, prior algorithms compute only a reduced version (the 2-by-1 CSD)…