Related papers: Cylindrical Algebraic Decomposition With Frontier …
It is well known that the variable ordering can be critical to the efficiency or even tractability of the cylindrical algebraic decomposition (CAD) algorithm. We propose new heuristics inspired by complexity analysis of CAD to choose the…
The structure of the reconstruction algorithm OPED permits a natural way to generate additional data, while still preserving the essential feature of the algorithm. This provides a method for image reconstruction for limited angel problems.…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…
The $P_1$--nonconforming quadrilateral finite element space with periodic boundary condition is investigated. The dimension and basis for the space are characterized with the concept of minimally essential discrete boundary conditions. We…
A scheme to perform the Cartan decomposition for the Lie algebra su(N) of arbitrary finite dimensions is introduced. The schme is based on two algebraic structures, the conjugate partition and the quotient algebra, that are easily generated…
The C*-envelope of a non self-adjoint operator algebra is known to encode many properties of the underlying subalgebra. However, the C*-envelope does not always encode the residual finite-dimensionality of an operator algebra. To elucidate…
In this paper, we investigate a sixth order elliptic equation with the simply supported boundary conditions in a polygonal domain. We propose a new method that decouples the sixth order problem into a system of second order equations.…
A 2+1-dimensional topological quantum field theory (TQFT) may or may not admit topological (gapped) boundary conditions. A famous necessary, but not sufficient, condition for the existence of a topological boundary condition is that the…
We describe a family $\textrm{Cyc}_p(\mathcal{F})$ of marked cycle curves that parameterize the cycles of period $p$ of a given family $\mathcal{F}$ of dynamical systems. We produce algorithms to compute a canonical cell decomposition for…
The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A special beneficial characteristic of the method is the…
We study residually finite-dimensional (or RFD) operator algebras which may not be self-adjoint. An operator algebra may be RFD while simultaneously possessing completely isometric representations whose generating C*-algebra is not RFD.…
Matrix configurations coming from matrix models comprise many important aspects of modern physics. They represent special quantum spaces and are thus strongly related to noncommutative geometry. In order to establish a semiclassical limit…
The construction of robust solvers for linear systems obtained from the discretization of partial differential equations using Isogeometric Analysis is challenging since the condition number of the system matrix not only grows with the…
The properties of two-state nearest-neighbour cellular automata (CA) that are capable of density classification are discussed. It is shown that these CA actually conserve the total density, rather than merely classifying it. This is also…
It is well known that the composition of a D-finite function with an algebraic function is again D-finite. We give the first estimates for the orders and the degrees of annihilating operators for the compositions. We find that the analysis…
Simulating non-Hermitian dynamics on quantum computers is often hindered by the decay of success probability and the instability of non-diagonalizable matrices. Here, we present contour-based matrix decomposition (CBMD), a rigorous and…
The Canonical Polyadic decomposition (CPD) is a convenient and intuitive tool for tensor factorization; however, for higher-order tensors, it often exhibits high computational cost and permutation of tensor entries, these undesirable…
Component-Based Development (CBD) is a popular approach to mitigating the costs of creating software systems. However, it is not clear to what extent the core component selection and adaptation activities of CBD can be implemented to…
We introduce the flag decomposition as a central tool for unitary synthesis. It lets us carve out a diagonal unitary with $2^n$ degrees of freedom in such a way that the remaining flag circuit is parametrized by the optimal number of…
Assume $\alpha\in (0, 2)$ and $d\ge 2$. Let $\mathcal L^\alpha$ be the generator of a symmetric, but not necessarily isotropic, $\alpha$-stable process $X$ in $\mathbb R^d$ whose L\'evy density is comparable with that of an isotropic…