Related papers: Computing $H$-equations with 2-by-2 integral matri…
We develop a generalized hybrid iterative approach for computing solutions to large-scale Bayesian inverse problems. We consider a hybrid algorithm based on the generalized Golub-Kahan bidiagonalization for computing Tikhonov regularized…
We show that the equation associated with a group word $w \in G \ast {\mathbf F}_2$ can be solved over a hyperlinear group $G$ if its content - that is its augmentation in ${\mathbf F}_2$ - does not lie in the second term of the lower…
We present the first systematic extension of the classical Hermite-Laguerre quadratic correspondence to the matrix-valued setting. Starting from a Hermite-type weight matrix W(x) = exp(-x^2) Z(x) with W(x) = W(-x), the change of variables y…
We propose a general matrix-valued multiple kernel learning framework for high-dimensional nonlinear multivariate regression problems. This framework allows a broad class of mixed norm regularizers, including those that induce sparsity, to…
We propose a general matrix-valued multiple kernel learning framework for high-dimensional nonlinear multivariate regression problems. This framework allows a broad class of mixed norm regularizers, including those that induce sparsity, to…
Let $G$ be a linear algebraic group over an algebraically closed field of characteristic $p\geq 0$. We show that if $H_1$ and $H_2$ are connected subgroups of $G$ such that $H_1$ and $H_2$ have a common maximal unipotent subgroup and…
We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…
Horn's problem, i.e., the study of the eigenvalues of the sum $C=A+B$ of two matrices, given the spectrum of $A$ and of $B$, is re-examined, comparing the case of real symmetric, complex Hermitian and self-dual quaternionic $3\times 3$…
The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of…
Let $R$ be a root datum with affine Weyl group $W^e$, and let $H = H (R,q)$ be an affine Hecke algebra with positive, possibly unequal, parameters $q$. Then $H$ is a deformation of the group algebra $\mathbb C [W^e]$, so it is natural to…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…
Computation of the large sparse matrix exponential has been an important topic in many fields, such as network and finite-element analysis. The existing scaling and squaring algorithm (SSA) is not suitable for the computation of the large…
This article presents a new approach to the real-time solution of inverse problems on embedded systems. The class of problems addressed corresponds to ordinary differential equations (ODEs) with generalized linear constraints, whereby the…
In this note we determine the irreducible square integrable representations of a simple group which admits an admissible restriction to a subgroup $H$ locally isomorphic to $SL_2(\mathbb R).$ We show such representation is holomorphic and…
We propose an algorithm for computing bases and dimensions of spaces of invariants of Weil representations of $\mathrm{SL}_2(\mathbb{Z})$ associated to finite quadratic modules. We prove that these spaces are defined over $\mathbb{Z}$, and…
The spectral transformation Lanczos method for the sparse symmetric definite generalized eigenvalue problem for matrices $A$ and $B$ is an iterative method that addresses the case of semidefinite or ill conditioned $B$ using a shifted and…
We study the computational complexity of constrained nonnegative Gram feasibility. Given a partially specified symmetric matrix together with affine relations among selected entries, the problem asks whether there exists a nonnegative…
We solve some forms of non homogeneous differential equations in one and two dimensions. By expanding the solution into whell-posed closed form-Eisenstein series the solution itself is quite simple and elementary. Also we consider Fourier…
We consider solutions to the equation f = h^r for polynomials f and h and integer r > 1. Given a polynomial f in the lacunary (also called sparse or super-sparse) representation, we first show how to determine if f can be written as h^r…