Related papers: Determinants of Interval Matrices
The discontinuous Galerkin time-stepping method has many advantageous properties for solving parabolic equations. However, it requires the solution of a large nonsymmetric system at each time-step. This work develops a fully robust and…
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed interval pieces (that is, the pieces that are not covered by…
Olkin [3] obtained a neat upper bound for the determinant of a correlation matrix. In this note, we present an extension and improvement of his result.
A structured preconditioned conjugate gradient (PCG) solver is developed for the Newton steps in second-order methods for a class of constrained network optimal control problems. Of specific interest are problems with discrete-time dynamics…
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…
Let $\{a_k\}$ be a sequence of real numbers defined by an $m$th order linear homogenous recurrence relation. In this paper we obtain a determinant formula for the circulant matrix $A=circ(a_1, a_2, \cdots, a_n)$, providing a generalization…
The work is devoted to the development of numerical methods for computing "formal solutions" of interval systems of linear algebraic equations. These solutions are found in Kaucher interval arithmetic, which extends and completes the…
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…
We estimate weighted character sums with determinants $ad-bc $ of $2\times 2$ matrices modulo a prime $p$ with entries $a,b,c,d $ varying over the interval $ [1,N]$. Our goal is to obtain nontrivial bounds for values of $N$ as small as…
We deal with interval parametric systems of linear equations and the goal is to solve such systems, which basically comes down to finding an enclosure for a parametric solution set. Obviously we want this enclosure to be as tight as…
This paper systematically investigates the properties and characterization of interval B-tensors and interval double B-tensors. We propose verifiable necessary and sufficient conditions that allow for determining whether an entire interval…
We investigate determinants of random unitary pencils (with scalar or matrix coefficients), which generalize the characteristic polynomial of a single unitary matrix. In particular we examine moments of such determinants, obtained by…
We propose an approach to compute inner and outer-approximations of the sets of values satisfying constraints expressed as arbitrarily quantified formulas. Such formulas arise for instance when specifying important problems in control such…
Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…
Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with…
A general closed interval matrix is a matrix whose entries are closed connected nonempty subsets of the set of the real numbers, while an interval matrix is defined to be a matrix whose entries are closed bounded nonempty intervals in the…
We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we…
We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland…
In this paper, we find determinant formulas of several Hessenberg-Toeplitz matrices whose nonzero entries are derived from the small and large Schroder and Fine number sequences. Algebraic proofs of these results can be given which make use…