Related papers: Cross product-free matrix pencils for computing ge…
We extend the construction of so-called encapsulated global summation-by-parts operators to the general case of a mesh which is not boundary conforming. Owing to this development, energy stable discretizations of nonlinear and variable…
In Parts I and II of this series of papers, three new methods for the computation of eigenvalues of singular pencils were developed: rank-completing perturbations, rank-projections, and augmentation. It was observed that a straightforward…
A generalized matrix function is a generalization of determinant and permanent function. In this paper, we introduced the formula for the value of a generalized matrix function of a linear sum of permutation matrices. We show that a linear…
Numerical computations involving rational matrices often benefit from preserving underlying matrix structures such as symmetry, Hermitian properties, or sparsity that reflect physical, geometric, or algebraic characteristics of the system.…
Based on the column pivoted QR decomposition, we propose some randomized algorithms including pass-efficient ones for the generalized CUR decompositions of matrix pair and matrix triplet. Detailed error analyses of these algorithms are…
Given a right eigenvector $x$ and a left eigenvector $y$ associated with the same eigenvalue of a matrix $A$, there is a Hermitian positive definite matrix $H$ for which $y=Hx$. The matrix $H$ defines an inner product and consequently also…
Starting with a spectral triple on a unital $C^{*}$-algebra $A$ with an action of a discrete group $G$, if the action is uniformly bounded (in a Lipschitz sense) a spectral triple on the reduced crossed product $C^{*}$-algebra $A\rtimes_{r}…
Let $B$ and $C$ be square complex matrices. The differential equation \begin{equation*} x''(t)+Bx'(t)+Cx(t)=f(t) \end{equation*} is considered. A solvent is a matrix solution $X$ of the equation $X^2+BX+C=\mathbf0$. A pair of solvents $X$…
We associate a complete intersection singularity to a graded matrix factorization of size two of a polynomial in three variables. We show that we get an inverse to the reduction of singularities considered by C.T.C.Wall. We study this for…
The matrix pencil method is an eigenvalue based approach for the parameter identification of sparse exponential sums. We derive a reconstruction algorithm for multivariate exponential sums that is based on simultaneous diagonalization.…
We establish, under a moment matching hypothesis, the local universality of the correlation functions associated with products of $M$ independent iid random matrices, as $M$ is fixed, and the sizes of the matrices tend to infinity. This…
It is a classical result that the absolute value of any $k$-minor of an $r\times s$ real or complex matrix is bounded by the product of its first $k$ singular values. We generalize this statement to the context of real or complex simple…
This is an introductory note concerning the distribution vectors in a unitary representation of a Lie group. We discuss the definition of matrix coefficients associated with a pair of distributions and how one can compute them. Most of the…
A real square matrix is Perron-like if it has a real eigenvalue $s$, called the principal eigenvalue of the matrix, and $\mbox{Re}\,\mu<s$ for any other eigenvalue $\mu$. Nonnegative matrices and symmetric ones are typical examples of this…
Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…
We consider a product of an arbitrary number of independent rectangular Gaussian random matrices. We derive the mean densities of its eigenvalues and singular values in the thermodynamic limit, eventually verified numerically. These…
This paper provides an accurate method to obtain the bidiagonal factorization of many generalized Pascal matrices, which in turn can be used to compute with high relative accuracy the eigenvalues, singular values and inverses of these…
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…
Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient…
An exact renormalization group equation is derived for the free energy of matrix models. The renormalization group equation turns out to be nonlinear for matrix models, as opposed to linear for vector models. An algorithm for determining…