Related papers: Computing Cylindrical Algebraic Decomposition via …
The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular…
Linear projection schemes like Proper Orthogonal Decomposition can efficiently reduce the dimensions of dynamical systems but are naturally limited, e.g., for convection-dominated problems. Nonlinear approaches have shown to outperform…
The notion of a \emph{$G$-completely reducible} subgroup is important in the study of algebraic groups and their subgroup structure. It generalizes the usual idea of complete reducibility from representation theory: a subgroup $H$ of a…
A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal…
We study questions of existence and uniqueness of quadrature domains using computational tools from real algebraic geometry. These problems are transformed into questions about the number of solutions to an associated real semi-algebraic…
Chordal and factor-width decomposition methods for semidefinite programming and polynomial optimization have recently enabled the analysis and control of large-scale linear systems and medium-scale nonlinear systems. Chordal decomposition…
Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…
Composition is an important feature of a specification language, as it enables the design of a complex system in terms of a product of its parts. Decomposition is equally important in order to reason about structural properties of a system.…
A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
Computing spherical harmonic decompositions is a ubiquitous technique that arises in a wide variety of disciplines and a large number of scientific codes. Because spherical harmonics are defined by integrals over spheres, however, one must…
An irreducible algebraic decomposition $\cup_{i=0}^{d}X_i=\cup_{i=0}^{d} (\cup_{j=1}^{d_i}X_{ij})$ of an affine algebraic variety X can be represented as an union of finite disjoint sets $\cup_{i=0}^{d}W_i=\cup_{i=0}…
Decoupling multivariate polynomials is useful for obtaining an insight into the workings of a nonlinear mapping, performing parameter reduction, or approximating nonlinear functions. Several different tensor-based approaches have been…
The decompositions of an element of a finite von Neumann algebra into the sum of a normal operator plus an s.o.t.-quasinilpotent operator, obtained using the Haagerup--Schultz hyperinvariant projections, behave well with respect to…
Taking advantage of the flexibility of the variational method with coordinate transformations, we derive a self-consistent set of equations of motion from a discretized Lagrangian to study kinetic plasmas using a Fourier decomposed…
We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…
Computations in Dynamical Triangulation Models of Four-Dimensional Quantum Gravity involve weighted averaging over sets of all distinct triangulations of compact four-dimensional manifolds. In order to be able to perform such computations…
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…
In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…
We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…