Related papers: A duality relation for matrix pencils with applica…
The connection between symmetries and linearizations of discrete-time dynamical systems is being inverstigated. It is shown, that existence of semigroup structures related to the vector field and having linear representations enables…
Complex-linearization of a class of systems of second order ordinary differential equations (ODEs) has already been studied with complex symmetry analysis. Linearization of this class has been achieved earlier by complex method, however,…
In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…
Although a good portion of elementary linear algebra concerns itself with matrices over a field such as $\mathbb{R}$ or $\mathbb{C}$, many combinatorial problems naturally surface when we instead work with matrices over a finite field. As…
Random matrices now play a role in many parts of computational mathematics. To advance these applications, it is desirable to have tools that are flexible, easy to use, and powerful. Over the last 25 years, researchers have developed a…
We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order…
Matrix factorization is a key tool in data analysis; its applications include recommender systems, correlation analysis, signal processing, among others. Binary matrices are a particular case which has received significant attention for…
Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category…
Regularization methods are a key tool in the solution of inverse problems. They are used to introduce prior knowledge and make the approximation of ill-posed (pseudo-)inverses feasible. In the last two decades interest has shifted from…
Regularization techniques are widely employed in optimization-based approaches for solving ill-posed inverse problems in data analysis and scientific computing. These methods are based on augmenting the objective with a penalty function,…
We assess the situation of our elementary Linear Algebra classes in the US holistically and through personal history recollections. Possible remedies for our elementary Linear Algebra's teaching problems are discussed and a change from…
Generalized eigenvalue problems involving a singular pencil may be very challenging to solve, both with respect to accuracy and efficiency. While Part I presented a rank-completing addition to a singular pencil, we now develop two…
The study of partial-twuality polynomials originates from the classical operations of geometric duality and Petrie duality on cellularly embedded graphs. These involutions generate the symmetric group $S_3$, and applying them to subsets of…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
A system of linear equations is normally understood as a linear mapping between two vector spaces. However, most direct solutions (e.g., QR, LU, ...) rely on the inelegant approach of back-substitution: a significant departure from such a…
In this paper a general theory of semi-classical matrix orthogonal polynomials is developed. We define the semi-classical linear functionals by means of a distributional equation $D(u A) = u B,$ where $A$ and $B$ are matrix polynomials.…
V. I. Arnold [Russian Math. Surveys 26, no. 2, 1971, 29-43] constructed smooth generic families of matrices with respect to similarity transformations depending smoothly on the entries of matrices and got bifurcation diagrams of such…
It is well known that the generalized (or quotient) singular values of a matrix pair $(A, C)$ can be obtained from the generalized eigenvalues of a matrix pencil consisting of two augmented matrices. The downside of this reformulation is…
In this paper, we revisit foundations of umbral calculus using a straightforward approach based on an explicit matrix realization of binomial convolution. We construct an umbral duality of Wronskian type for rational curves in echelon form,…
Szalai et al. (SIAM J. on Sci. Comp. 28(4), 2006) gave a general construction for characteristic matrices for systems of linear delay-differential equations with periodic coefficients. First, we show that matrices constructed in this way…