相关论文: Simple Constructive Weak Factorization
The proposed article aims at offering a comprehensive tutorial for the computational aspects of structured matrix and tensor factorization. Unlike existing tutorials that mainly focus on {\it algorithmic procedures} for a small set of…
We detail the construction of a weak Poisson bracket over a submanifold of a smooth manifold M with respect to a local foliation of this submanifold. Such a bracket satisfies a weak type Jacobi identity but may be viewed as a usual Poisson…
Nonnegative matrix factorization (NMF) is widely used for clustering with strong interpretability. Among general NMF problems, symmetric NMF is a special one that plays an important role in graph clustering where each element measures the…
The universal scheme of clusters of sections is an adaption of Kleiman's iterated blow ups (which parametrise clusters of points) to parametrise clusters of sections. They can also be constructed iteratively, but the iterative step is not…
In this paper a deterministic sparse Fourier transform algorithm is presented which breaks the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhibiting structured frequency support. These functions…
We present a fast direct algorithm for computing symmetric factorizations, i.e. $A = WW^T$, of symmetric positive-definite hierarchical matrices with weak-admissibility conditions. The computational cost for the symmetric factorization…
Branes and defects in topological Landau-Ginzburg models are described by matrix factorisations. We revisit the problem of deforming them and discuss various deformation methods as well as their relations. We have implemented these…
This paper addresses weak approximation for rationally connected varieties defined over the function field of a curve, especially at places of bad reduction. Our approach entails analyzing the rational connectivity of the smooth locus of…
We describe an explicit algorithm to factorize an even antisymmetric N^2 matrix into triangular and trivial factors. This allows for a straight forward computation of Pfaffians (including their signs) at the cost of N^3/3 flops.
We introduce a new higher categorical structure called a weakly globular n-fold category. This structure is based on iterated internal categories and on the notion of weak globularity. We identify a suitable class of pseudo-functors whose…
In this paper, we propose several dictionary learning algorithms for sparse representations that also impose specific structures on the learned dictionaries such that they are numerically efficient to use: reduced number of…
We study the factorization of soft and collinear singularities in dimensionally-regularized fixed-angle scattering amplitudes in massless gauge theories. Our factorization is based on replacing the hard massless partons by light-like Wilson…
We suggest an elementary Harmonic Analysis approach to canceling and weakly canceling differential operators, which allows to extend these notions to anisotropic setting and also replace differential operators with Fourier multiplies with…
This paper introduces lax orthogonal algebraic weak factorisation systems on 2-categories and describes a method of constructing them. This method rests in the notion of simple 2-monad, that is a generalisation of the simple reflections…
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 introduces the multidimensional butterfly factorization as a data-sparse representation of multidimensional kernel matrices that satisfy the complementary low-rank property. This factorization approximates such a kernel matrix of…
We compare the theoretical frameworks and the phenomenological applications of the factorization approaches to exclusive $B$ meson decays, which include QCD-improved factorization, perturbative QCD, and soft-collinear effective theory.…
Symmetric nonnegative matrix factorization (NMF), a special but important class of the general NMF, is demonstrated to be useful for data analysis and in particular for various clustering tasks. Unfortunately, designing fast algorithms for…
We extend the Cox-Hu-Keel construction of the Cox rings to any proper birational morphisms of normal noetherian schemes. It allows the representation of any proper birational morphism by a map of schemes with mild singularities with torus…
We give an account of lax orthogonal factorisation systems on order-enriched categories. Among them, we define and characterise the KZ-reflective ones, in a way that mirrors the characterisation of reflective orthogonal factorisation…