相关论文: Real dqds for the nonsymmetric tridiagonal eigenva…

Quartic eigenvalue problem $(\lambda^4 A + \lambda^3 B + \lambda^2C + \lambda D + E)x = \mathbf{0}$ naturally arises e.g. when solving the Orr-Sommerfeld equation in the analysis of the stability of the {Poiseuille} flow, in theoretical…

A very common problem in science is the numerical diagonalization of symmetric or hermitian 3x3 matrices. Since standard "black box" packages may be too inefficient if the number of matrices is large, we study several alternatives. We…

We give a self-contained randomized algorithm based on shifted inverse iteration which provably computes the eigenvalues of an arbitrary matrix $M\in\mathbb{C}^{n\times n}$ up to backward error $\delta\|M\|$ in…

When using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is likely not the signs of those polynomials that are of paramount importance but rather the truth values of certain quantifier…

In this study, we propose a virtual element scheme to solve the Darcy problem in three physical dimensions. The main novelty, here proposed, is that curved elements are naturally handled without any degradation of the solution accuracy. In…

This paper considers computing interior singular triplets corresponding to the singular values in some interval. Based on the concept of the complex moment-based parallel eigensolvers, in this paper, we propose a novel complex moment-based…

Divide and Conquer (D&C) is a widely used algorithmic strategy for symmetric eigenvalue decomposition. Its natural parallelism makes D&C attractive on modern multicore CPUs and GPUs, but existing eigenvalue-only routines often default to…

Let $n\ge 2$ be an integer. Let $R_n$ denote the $n\times n$ tridiagonal matrix with $-1$'s on the sub-diagonal, $1$'s on the super-diagonal, $-1$ in the $(1,1)$ entry, $1$ in the $(n,n)$ entry and zeros elsewhere. We find the eigen-pairs…

Two algorithms are introduced for the computation of discrete integral transforms with a multiscale approach operating in discrete three-dimensional (3D) volumes while considering its real-time implementation. The first algorithm, referred…

We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} =…

We show how to efficiently solve a clustering problem that arises in a method to evaluate functions of matrices. The problem requires finding the connected components of a graph whose vertices are eigenvalues of a real or complex matrix and…

We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

A simple iterative scheme is proposed for locating the parameter values for which a 2-parameter family of real symmetric matrices has a double eigenvalue. The convergence is proved to be quadratic. An extension of the scheme to complex…

Motivated by investigations of the tridiagonal pairs of linear transformations, we introduce the augmented tridiagonal algebra ${\mathcal T}_q$. This is an infinite-dimensional associative ${\mathbb C}$-algebra with 1. We classify the…

We present a novel algorithm that solves the turbo code LP decoding problem in a fininte number of steps by Euclidean distance minimizations, which in turn rely on repeated shortest path computations in the trellis graph representing the…

We consider a quadrature-based eigensolver to find eigenpairs of Hermitian matrices arising in lattice quantum chromodynamics. To reduce the computational cost for finding eigenpairs of such Hermitian matrices, we propose a new technique…

In this paper, we are concerned with the problem of determining the existence of multiple equilibria in economic models. We propose a general and complete approach for identifying multiplicities of equilibria in semi-algebraic economies,…

This paper first reviews how anti-symmetric matrices in two dimensions yield imaginary eigenvalues and complex eigenvectors. It is shown how this carries on to rotations by means of the Cayley transformation. Then a real geometric…

We present a practical and efficient means to compute the singular value decomposition (svd) of a quaternion matrix A based on bidiagonalization of A to a real bidiagonal matrix B using quaternionic Householder transformations. Computation…

Non-parametric two-sample tests based on energy distance or maximum mean discrepancy are widely used statistical tests for comparing multivariate data from two populations. While these tests enjoy desirable statistical properties, their…