Related papers: Linear system matrices of rational transfer functi…
For an exponentially decaying potential, analytic structure of the $s$-wave S-matrix can be determined up to the slightest detail, including position of all its poles and their residues. Beautiful hidden structures can be revealed by its…
In this paper, we introduce and analyze a new $LU$-factorization technique for square matrices over idempotent semifields. In particular, more emphasis is put on "max-plus" algebra here, but the work is extended to other idempotent…
This paper develops the preconditioning technique as a method to address the accuracy issue caused by ill-conditioning. Given a preconditioner $M$ for an ill-conditioned linear system $Ax=b$, we show that, if the inverse of the…
In this work, we consider the controllability of a discrete-time linear dynamical system with sparse control inputs. Sparsity constraints on the input arises naturally in networked systems, where activating each input variable adds to the…
We introduce the notion of Universally Decodable Matrices of Genus g (UDMG), which for g=0 reduces to the notion of Universally Decodable Matrices (UDM) introduced in [8]. A UDMG is a set of L matrices over a finite field, each with K rows,…
Let $R$ be a discrete valuation domain with field of fractions $Q$ and maximal ideal generated by $\pi$. Let $\Lambda$ be an $R$-order such that $Q\Lambda$ is a separable $Q$-algebra. Maranda showed that there exists $k\in\mathbb{N}$ such…
The random reshuffling Kaczmarz (RRK) method enjoys the simplicity and efficiency in solving linear systems as a Kaczmarz-type method, whereas it also inherits the practical improvements of the stochastic gradient descent (SGD) with random…
The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector space, without placing any restrictions on the dimension of the space or on the base field. We define a…
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…
This paper develops a systematic approach to realising linear detectors with an optimised sensitivity, allowing for the detection of extremely weak signals. First, general constraints are derived on a specific class of input-output transfer…
The paper presents realization theory of discrete-time linear switched systems. A discrete-time linear switched system is a hybrid system, such that the continuous sub-system associated with each discrete state is linear. In this paper we…
We study the notion of strong integrability for classically integrable $\lambda$-deformed CFTs and coset CFTs. To achieve this goal we employ the Poisson brackets of the spatial Lax matrix which we prove that it assumes the Maillet…
The nonlinear inverse problem of exponential data fitting is separable since the fitting function is a linear combination of parameterized exponential functions, thus allowing to solve for the linear coefficients separately from the…
We propose necessary and sufficient conditions for an integer matrix to be decomposable in terms of its Hermite normal form. Specifically, to each integer matrix of maximal row rank without columns of zeros, we associate a symmetric whole…
A linear space is a system of points and lines such that any two distinct points determine a unique line; a Steiner $k$-system (for $k \geq 2$) is a linear space such that each line has size exactly $k$. Clearly, as a two-sorted structure,…
Let $A$ be an $n \times n$ matrix with rational entries and let \[ \mathbb{Z}^n[A] := \bigcup_{k=1}^{\infty} \left( \mathbb{Z}^n + A\mathbb{Z}^n + \dots + A^{k-1}\mathbb{Z}^n\right) \] be the minimal $A$-invariant $\mathbb{Z}$-module…
This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…
The main purpose of this paper is providing a simple method to generate the matrices of irreducible representations because it is useful to reduce the computational time of solving the eigenvalue problems. The only information we need to…
We study the bit complexity of inverting diagonally dominant matrices, which are associated with random walk quantities such as hitting times and escape probabilities. Such quantities can be exponentially small, even on undirected…
This paper investigates two issues on identification of switched linear systems: persistence of excitation and numerical algorithms. The main contribution is a much weaker condition on the regressor to be persistently exciting that…