相关论文: The Multiplicative Inverse Eigenvalue Problem over…

We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…

The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph $G$. In this paper, we refer to the $i$-nullity pair of a matrix…

The paper studies a general inverse eigenvalue problem which contains as special cases many well studied pole placement and matrix extension problems. It is shown that the studied problem corresponds on the geometric side to a central…

In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…

We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…

Let $F$ be an algebraically closed field of characteristic zero, and $G$ be a finite abelian group. If $A=\oplus_{g\in G} A_g$ is a $G$-graded algebra, we study degree-inverting involutions on $A$, i.e., involutions $*$ on $A$ satisfying…

We give an algebraic characterization of the affine $3$-space over an algebraically closed field of arbitrary characteristic. We use this characterization to reformulate the following question. Let $$A=k[X, Y, Z, T]/(XY+Z^{p^e}+T+T^{sp})$$…

Let $\mathbb{F}$ be an infinite field with characteristic different from two. For a graph $G=(V,E)$ with $V={1,...,n}$, let $S(G;\mathbb{F})$ be the set of all symmetric $n\times n$ matrices $A=[a_{i,j}]$ over $\mathbb{F}$ with…

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

We consider the problem of the reconstruction of a Schwarz matrix from exactly one given eigenvalue. This inverse eigenvalue problem leads to the Jacobi orthogonal polynomials~$\{P_k^{(-n,n)}\}_{k=0}^{n-1}$ that can be treated as a discrete…

Let $k$ be a field and $n,a,b$ natural numbers. A matrix pencil $P$ is given by $n$ matrices of the same size with coefficients in $k$, say by $(b\times a)$-matrices, or, equivalently, by $n$ linear transformations $\alpha_i\:k^a \to k^b$…

We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…

Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…

It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…

The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical…

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

A matrix $P$ is said to be a nontrivial generalized reflection matrix over the real quaternion algebra $\mathbb{H}$ if $P^{\ast }=P\neq I$ and $P^{2}=I$ where $\ast$ means conjugate and transpose. We say that $A\in\mathbb{H}^{n\times n}$ is…

The matrix inversion is an interesting topic in algebra mathematics. However, to determine an inverse matrix from a given matrix is required many computation tools and time resource if the size of matrix is huge. In this paper, we have…

We study the P versus NP problem through properties of functions and monoids, continuing the work of [3]. Here we consider inverse monoids whose properties and relationships determine whether P is different from NP, or whether injective…

Over the past decades, transformations between different classes of eigenvalue problems have played a central role in the development of numerical methods for eigenvalue computations. One of the most well-known and successful examples of…