The standard operation refinement ordering is a kind of “meet of opposites”: non-determinism reduction suggests “smaller” behaviour while increase of definition suggests “larger” behaviour. Groves’ factorization of this ordering into two simpler relations, one per refinement concern, makes it more mathematically tractable but is far from fully exploited in the literature. We present a pointfree...

We present a method for updating certain hierarchical factorizations for solving linear integral equations with elliptic kernels. In particular, given a factorization corresponding to some initial geometry or material parameters, we can locally perturb the geometry or coefficients and update the initial factorization to reflect this change with asymptotic complexity that is polylogarithmic in t...

We extend the theory of chiral and factorization algebras, developed for curves by Beilinson and Drinfeld in [BD1], to higher-dimensional varieties. This extension entails the development of the homotopy theory of chiral and factorization structures, in a sense analogous to Quillen’s homotopy theory of differential graded Lie algebras. We prove the equivalence of higherdimensional chiral and fa...

In this paper, we propose a novel method for subspace estimation used high resolution method without eigendecomposition where the sample Cross-Spectral Matrix (CSM) is replaced by upper triangular matrix obtained from LU factorization. This novel method decreases the computational complexity. The method relies on a recently published result on Rank-Revealing LU (RRLU) factorization. Simulation ...

We provide further details on performance analysis for our block-wise matrix tri-factorization. In particular, we include analysis of orthogonal matrix tri-factorization that is discussed in our manuscript but whose results, due to conceptual similarity with non-orthogonal factorization were not included in there. We also present the impact of communication overhead on both non-orthogonal and o...