相关论文: Bounds via spectral radius-preserving row sum expa…
This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive improved upper and lower bounds based on the entropy of a…
The problem of construction of Barabanov norms for analysis of properties of the joint (generalized) spectral radius of matrix sets has been discussed in a number of publications. The method of Barabanov norms was the key instrument in…
Matrix perturbation bounds play an essential role in the design and analysis of spectral algorithms. In this paper, we use a "contour bootstrapping" argument to derive several new perturbation bounds. As applications, we discuss new bounds…
The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the main diagonal. This work focuses on investigating novel…
In this paper we develop algorithms for approximating matrix multiplication with respect to the spectral norm. Let A\in{\RR^{n\times m}} and B\in\RR^{n \times p} be two matrices and \eps>0. We approximate the product A^\top B using two…
We consider radially symmetric capillary surfaces that are described by bounded generating curves. We use the arc-length representation of the differential equations for these surfaces to allow for vertical points and inflection points…
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…
We obtain sequences of inclusion sets for the spectrum, essential spectrum, and pseudospectrum of banded, in general non-normal, matrices of finite or infinite size. Each inclusion set is the union of the pseudospectra of certain…
A graph is called $k$-extendable if each $k$-matching can be extended to a perfect matching. We give spectral conditions for the $k$-extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations.…
In the paper, a simple condition guaranteing the finiteness property for a bounded set of matrices is presented. Given a bounded set S of real or complex matrices, it is shown that existence of a sequence of matrix products such that the…
We focus on \emph{row sampling} based approximations for matrix algorithms, in particular matrix multipication, sparse matrix reconstruction, and \math{\ell_2} regression. For \math{\matA\in\R^{m\times d}} (\math{m} points in \math{d\ll m}…
Equations arising in General Relativity are usually too complicated to be solved analytically and one has to rely on numerical methods to solve sets of coupled partial differential equations. Among the possible choices, this paper focuses…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
The competitive spectral radius extends the notion of joint spectral radius to the two-player case: two players alternatively select matrices in prescribed compact sets, resulting in an infinite matrix product; one player wishes to maximize…
We prove the following for a bounded convex planar domain that is symmetric with respect to both coordinate axes. Consider a centered rectangle with sides parallel to the axes that strictly contains the domain. If the domain is not a…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
We consider the problem of determining the limiting spectral distribution for random matrices whose row distributions are permitted to have limited dependence. We assume mild moment conditions and give an extension of the…
The spectral density of random matrices is studied through a quaternionic generalisation of the Green's function, which precisely describes the mean spectral density of a given matrix under a particular type of random perturbation. Exact…
We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.
This work concerns with the following problem. Given a two-dimensional domain whose boundary is a closed polygonal line with internal boundaries defined also by polygonal lines, it is required to generate a grid consisting only of…