Related papers: Routines for the diagonalization of complex matric…

We consider matrix orthogonal polynomials related to Jacobi type matrices of weights that can be defined in terms of a given matrix Pearson equation. Stating a Riemann-Hilbert problem we can derive first and second order differential…

We present a prescription for forming matrices with specified eigenvalues and known eigenvectors. With this method, we can form Hermitian, anti-Hermitian, symmetric and general matrices with arbitrary eigenvalues. In addition we propose an…

In this paper we introduce an iterative Jacobi algorithm for solving distributed model predictive control (DMPC) problems, with linear coupled dynamics and convex coupled constraints. The algorithm guarantees stability and persistent…

We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…

In this work, we present a mixed precision algorithm that leverages the Gram matrix and Jacobi methods to compute the singular value decomposition (SVD) of tall-and-skinny matrices. By constructing the Gram matrix in higher precision and…

The Wigner-von Neumann method, which was previously used for perturbing continuous Schr\"{o}dinger operators, is here applied to their discrete counterparts. In particular, we consider perturbations of arbitrary $T$-periodic Jacobi…

The reciprocal Pascal matrix has entries $\binom{i+j}{j}^{-1}$. Explicit formullae for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, $q$-analogues are also presented.

In this paper, the theory of the fractional singular Lagrangian systems is investigated with second order derivatives. The fractional quantization for these systems is examined using the WKB approximation. The Hamilton Jacobi treatment can…

The Jacobi system with matrix-valued coefficients and with the spectral parameter depending on a matrix-valued weight factor is considered on the full-line lattice. The scattering from the full-line lattice is expressed in terms of the…

For the solution of discrete ill-posed problems, in this paper a novel preconditioned iterative method based on the Arnoldi algorithm for matrix functions is presented. The method is also extended to work in connection with Tikhonov…

This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality…

In this note we summarize four important matrix decompositions commonly used in quantum optics, namely the Takagi/Autonne, Bloch-Messiah/Euler, Iwasawa, and Williamson decompositions. The first two of these decompositions are specialized…

Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation were developed. We show that all three approaches can be…

In this paper we prove the global convergence of the complex Jacobi method for Hermitian matrices for a large class of generalized serial pivot strategies. For a given Hermitian matrix $A$ of order $n$ we find a constant $\gamma<1$…

Using a self-replicating method, we generalize with a free parameter some Borwein algorithms for the number $\pi$. This generalization includes values of the Gamma function like $\Gamma(1/3)$, $\Gamma(1/4)$ and of course…

The problem of approximate joint diagonalization of a collection of matrices arises in a number of diverse engineering and signal processing problems. This problem is usually cast as an optimization problem, and it is the main goal of this…

We present a novel algorithm for performing the Cartan-Khaneja-Glaser decomposition of unitary matrices in $SU(2^n)$, a critical task for efficient quantum circuit design. Building upon the approach introduced by S\'a Earp and Pachos…

We discuss the close connection between eigenvalue computation and optimization using the Newton method and subspace methods. From the connection we derive a new class of Newton updates. The new update formulation is similar to the…

In this paper we derive and analyze an algorithm for inverting quaternion matrices. The algorithm is an analogue of the Frobenius algorithm for the complex matrix inversion. On the theory side, we prove that our algorithm is more efficient…

We introduce right eigenvalues and subeigenvalues for square dual complex matrices. An $n \times n$ dual complex Hermitian matrix has exactly $n$ right eigenvalues and subeigenvalues, which are all real. The Hermitian matrix is positive…