相关论文: An upper $J$- Hessenberg reduction of a matrix thr…

The reduction of a matrix to an upper $J$-Hessenberg form is a crucial step in the $SR$-algorithm (which is a $QR$-like algorithm), structure-preserving, for computing eigenvalues and vectors, for a class of structured matrices. This…

The determinant of a lower Hessenberg matrix (Hessenbergian) is expressed as a sum of signed elementary products indexed by initial segments of nonnegative integers. A closed form alternative to the recurrence expression of Hessenbergians…

We rewrite various lattice Hamiltonian in condensed matter physics in terms of U(2/2) operators that we introduce. In this representation the symmetry structure of the models becomes clear. Especially, the Heisenberg, the supersymmetric t-J…

We present a class of symplectic matrices which transform by similarity given $2n\times 2n$ -dimensional matrix into Bunse-Gerstner form. If the given matrix is skew-Hamiltonian, the transformation gives a solution of an antisymmetric…

We develop two fast algorithms for Hessenberg reduction of a structured matrix $A = D + UV^H$ where $D$ is a real or unitary $n \times n$ diagonal matrix and $U, V \in\mathbb{C}^{n \times k}$. The proposed algorithm for the real case…

We introduce an eigenvalue-preserving transformation algorithm from the generalized eigenvalue problem by matrix pencil of the upper and the lower bidiagonal matrices into a standard eigenvalue problem while preserving sparsity, using the…

We present a theory for Euclidean dimensionality reduction with subgaussian matrices which unifies several restricted isometry property and Johnson-Lindenstrauss type results obtained earlier for specific data sets. In particular, we…

The QZ algorithm for computing eigenvalues and eigenvectors of a matrix pencil $A - \lambda B$ requires that the matrices first be reduced to Hessenberg-triangular (HT) form. The current method of choice for HT reduction relies entirely on…

We present in this report 1+1 dimensional nonlinear partial differential equation integrable through inverse scattering transform. The integrable system under consideration is a pseudo-Hermitian reduction of a matrix generalization of…

The ability to decompose a signal in an orthonormal basis (a set of orthogonal components, each normalized to have unit length) using a fast numerical procedure rests at the heart of many signal processing methods and applications. The…

Many applications, such as optimization, uncertainty quantification and inverse problems, require repeatedly performing simulations of large-dimensional physical systems for different choices of parameters. This can be prohibitively…

This work presents two novel approaches for the symplectic model reduction of high-dimensional Hamiltonian systems using data-driven quadratic manifolds. Classical symplectic model reduction approaches employ linear symplectic subspaces for…

The paper re-analyzes a version of the celebrated Johnson-Lindenstrauss Lemma, in which matrices are subjected to constraints that naturally emerge from neuroscience applications: a) sparsity and b) sign-consistency. This particular variant…

In this paper, we introduce a new kind of Siegel upper half space and consider the symplectic geometry on it explicitly under the action of the group of all holomorphic transformations of it. The results and methods will form a basis for…

Toeplitz matrices are abundant in computational mathematics, and there is a rich literature on the development of fast and superfast algorithms for solving linear systems involving such matrices. Any Toeplitz matrix can be transformed into…

This paper reveals the relation between the canonical coset decomposition of unitary matrices and the corresponding decomposition via Householder reflections. These results can be used to parametrize unitary matrices via Householder…

Boundary integral equations lead to dense system matrices when discretized, yet they are data-sparse. Using the $\mathcal{H}$-matrix format, this sparsity is exploited to achieve $\mathcal{O}(N\log N)$ complexity for storage and…

The tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated…

Recently we showed that Hessenberg matrices are proper to represent conjugacy classes in SL(n,Z). In this paper we focus on the reducibility properties in the set of Hessenberg matrices of SL(3,Z). We investigate the first interesting open…

Numerous problems in optics, quantum physics, stability analysis, and control of dynamical systems can be brought to an optimization problem with matrix variable subjected to the symplecticity constraint. As this constraint nicely forms a…