Related papers: Linear system matrices of rational transfer functi…
In the literature, there exist several studies on symbol-based multigrid methods for the solution of linear systems having structured coefficient matrices. In particular, the convergence analysis for such methods has been obtained in an…
We construct a new family of strong linearizations of rational matrices considering the polynomial part of them expressed in a basis that satisfies a three term recurrence relation. For this purpose, we combine the theory developed by…
The complex-shifted Laplacian systems arising in a wide range of applications. In this work, we propose an absolute-value based preconditioner for solving the complex-shifted Laplacian system. In our approach, the complex-shifted Laplacian…
Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\in\mathbb{F}^{N\times N}$ and a vector $b$, it is known that in the worst case $\Theta(N^2)$ operations over $\mathbb{F}$ are needed to…
The class of quasiseparable matrices is defined by the property that any submatrix entirely below or above the main diagonal has small rank, namely below a bound called the order of quasiseparability. These matrices arise naturally in…
A system of linear equations $L$ is said to be norming if a natural functional $t_L(\cdot)$ giving a weighted count for the set of solutions to the system can be used to define a norm on the space of real-valued functions on…
We establish necessary and sufficient conditions for invertibility of symmetric three-by-three block matrices having a double saddle-point structure \fb{that guarantee the unique solvability of double saddle-point systems}. We consider…
We introduce a new definition of a model for a formal mathematical system. The definition is based upon the substitution in the formal systems, which allows a purely algebraic approach to model theory. This is very suitable for applications…
Although it is easy to prove the sufficient conditions for optimality of a linear program, the necessary conditions pose a pedagogical challenge. A widespread practice in deriving the necessary conditions is to invoke Farkas' lemma, but…
This paper presents a definition for local linearizations of rational matrices and studies their properties. This definition allows us to introduce matrix pencils associated to a rational matrix that preserve its structure of zeros and…
In this article, a new notion of modal strong structural controllability is introduced and examined for a family of LTI networks. These networks include structured LTI subsystems, whose system matrices have the same zero/nonzero/arbitrary…
We show that the one dimensional unitary matrix model with potential of the form $a U + b U^2 + h.c.$ is integrable. By reduction to the dynamics of the eigenvalues, we establish the integrability of a system of particles in one space…
Optimal model reduction for large-scale linear dynamical systems is studied. In contrast to most existing works, the systems under consideration are not required to be stable, neither in discrete nor in continuous time. As a consequence,…
We present a comprehensive and self-contained discussion of the use of the transfer matrix to study propagation in one-dimensional lossless systems, including a variety of examples, such as superlattices, photonic crystals, and optical…
For a rational differential operator $L=AB^{-1}$, the Lenard-Magri scheme of integrability is a sequence of functions $F_n, n\geq 0$, such that (1) $B(F_{n+1})=A(F_n)$ for all $n \geq 0$ and (2) the functions $B(F_n)$ pairwise commute. We…
Many practical problems can be formulated as l0-minimization problems with nonnegativity constraints, which seek the sparsest nonnegative solutions to underdetermined linear systems. Recent study indicates that l1-minimization is efficient…
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…
We derive the matrix elements of generators of unitary irreducible representations of SL(2,C) with respect to basis states arising from a decomposition into irreducible representations of SU(1,1). This is done with regard to a discrete…
In the present work, we demonstrate how the pseudoinverse concept from linear algebra can be used to represent and analyze the boundary conditions of linear systems of partial differential equations. This approach has theoretical and…
An arbitrary $m\times n$ Boolean matrix $M$ can be decomposed {\em exactly} as $M =U\circ V$, where $U$ (resp. $V$) is an $m\times k$ (resp. $k\times n$) Boolean matrix and $\circ$ denotes the Boolean matrix multiplication operator. We…