Related papers: Solving Sparse, Symmetric, Diagonally-Dominant Lin…
Computing the convolution $A \star B$ of two vectors of dimension $n$ is one of the most important computational primitives in many fields. For the non-negative convolution scenario, the classical solution is to leverage the Fast Fourier…
In this document, some structured operator approximation theoretical methods for system identification of nearly eventually periodic systems, are presented. Let $\mathbb{C}^{n\times m}$ denote the algebra of $n\times m$ complex matrices.…
For a graph $G=(V,E)$, a set $S \subseteq V$ is a $[1,2]$-set if it is a dominating set for $G$ and each vertex $v \in V \setminus S$ is dominated by at most two vertices of $S$, i.e. $1 \leq \vert N(v) \cap S \vert \leq 2$. Moreover a set…
This article introduces a new fast direct solver for linear systems arising out of wide range of applications, integral equations, multivariate statistics, radial basis interpolation, etc., to name a few. \emph{The highlight of this new…
This paper addresses the qualitative theory of mixed-order positive linear coupled systems with bounded or unbounded delays. First, we introduce a general result on the existence and uniqueness of solutions to mixed-order linear coupled…
We extend the definition of $n$-dimensional difference equations to complex order $\alpha\in \mathbb{C} $. We investigate the stability of linear systems defined by an $n$-dimensional matrix $A$ and derive conditions for the stability of…
Let $E \subseteq R^n$ be a closed set of Hausdorff dimension $\alpha$. For $m \geq n$, let $\{B_1,\ldots,B_k\}$ be $n \times (m-n)$ matrices. We prove that if the system of matrices $B_j$ is non-degenerate in a suitable sense, $\alpha$ is…
This paper introduces a new robust interior point method analysis for semidefinite programming (SDP). This new robust analysis can be combined with either logarithmic barrier or hybrid barrier. Under this new framework, we can improve the…
Let $X$ be an arbitrary separable symmetric space on $[0,1]$. By using a combination of the frame approach and the notion of the multiplicator space $\mathscr{M}(X)$ of $X$ with respect to the tensor product, we investigate the problem when…
We introduce a novel algorithm for approximating the logarithm of the determinant of a symmetric positive definite (SPD) matrix. The algorithm is randomized and approximates the traces of a small number of matrix powers of a specially…
We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in $\tilde{O}(n^{4/3}m^{1/2}+n^{2})$ time (The $\tilde{O}(\cdot)$ notation hides $\operatorname{polylog}(n)$…
A discrete-time linear dynamical system (LDS) is given by an update matrix $M \in \mathbb{R}^{d\times d}$, and has the trajectories $\langle s, Ms, M^2s, \ldots \rangle$ for $s \in \mathbb{R}^d$. Reachability-type decision problems of…
We present the first near optimal approximation schemes for the maximum weighted (uncapacitated or capacitated) $b$--matching problems for non-bipartite graphs that run in time (near) linear in the number of edges. For any…
In geometry processing, numerical optimization methods often involve solving sparse linear systems of equations. These linear systems have a structure that strongly resembles to adjacency graphs of the underlying mesh. We observe how…
This work addresses fundamental issues related to the structure and conditioning of linear time-delayed models of non-linear dynamics on an attractor. While this approach has been well-studied in the asymptotic sense (e.g. for infinite…
In this paper, we study a nonlocal logistic system with nonlinear advection terms \begin{equation*} \left\{ \begin{array}{lcl} -\Delta u+\vec{\alpha}(x)\cdot \nabla (|u|^{p-1}u)&=&\left(a-\int_{\Omega}K_1(x,y)f(u,v)dy \right)u+bv\mbox{ in…
As it follows from the theory of almost periodic functions the set of integer solutions $q$ to the Kronecker system $|\omega_{j} q - \theta_{j}| < \varepsilon \pmod 1$, $j=1,\ldots,m$, where $1,\omega_{1},\ldots,\omega_{m}$ are linearly…
We consider a static data structure problem of computing a linear operator under cell-probe model. Given a linear operator $M \in \mathbb{F}_2^{m \times n}$, the goal is to pre-process a vector $X \in \mathbb{F}_2^n$ into a data structure…
Let $\Omega\subset\mathbb{R}^{N}$, $N\geq1$, be a smooth bounded domain, and let $m:\Omega\rightarrow\mathbb{R}$ be a possibly sign-changing function. We investigate the existence of positive solutions for the semipositone problem $-\Delta…
Given a graph $G = (V, E)$ with $n$ vertices and $m$ edges, the DominatingSet problem asks for a set $D \subseteq V$ of minimal cardinality such that every vertex either is in $D$ or adjacent to a member of $D$. Although there is little…