Related papers: The Schur complements for $SDD_{1}$ matrices and t…
We are interested in finding a solution to the tensor complementarity problem with a strong M-tensor, which we call the M-tensor complementarity problem. We propose a lower dimensional linear equation approach to solve that problem. At each…
We derive bounds on the eigenvalues of a generic form of double saddle-point matrices. The bounds are expressed in terms of extremal eigenvalues and singular values of the associated block matrices. Inertia and algebraic multiplicity of…
We introduce Power Bundle Adjustment as an expansion type algorithm for solving large-scale bundle adjustment problems. It is based on the power series expansion of the inverse Schur complement and constitutes a new family of solvers that…
Motivated by applications to the theory of rank-metric codes, we study the problem of estimating the number of common complements of a family of subspaces over a finite field in terms of the cardinality of the family and its intersection…
In this work, we develop a new theory and method for sufficient dimension reduction (SDR) in single-index models, where SDR is a sub-field of supervised dimension reduction based on conditional independence. Our work is primarily motivated…
In this paper we show how to construct diagonal scalings for arbitrary matrix pencils $\lambda B-A$, in which both $A$ and $B$ are complex matrices (square or nonsquare). The goal of such diagonal scalings is to "balance" in some sense the…
We consider the inverse problems of for the fractional Schr\"odinger equation by using monotonicity formulas. We provide if-and-only-if monotonicity relations between positive bounded potentials and their associated nonlocal…
Semidefinite programs (SDPs) are standard convex problems that are frequently found in control and optimization applications. Interior-point methods can solve SDPs in polynomial time up to arbitrary accuracy, but scale poorly as the size of…
We establish a rather unexpected and simple criterion for the boundedness of Schur multipliers $S_M$ on Schatten $p$-classes which solves a conjecture proposed by Mikael de la Salle. Given $1 < p < \infty$, a simple form our main result…
The problem of when the vanishing of a (generalized) Schur complement of a block matrix (corresponding to the leading principal subblock) implies that the other (generalized) Schur complement (corresponding to the trailing principal…
The Schur-Horn theorem is a classical result in matrix analysis which characterizes the existence of positive semidefinite matrices with a given diagonal and spectrum. In recent years, this theorem has been used to characterize the…
In this paper, we discuss numerical approximation of the eigenvalues of the one-dimensional radial Schr\"{o}dinger equation posed on a semi-infinite interval. The original problem is first transformed to one defined on a finite domain by…
In this paper we analytically explore the modularity of the flavored Schur index of 4d $\mathcal{N} = 2$ SCFTs. We focus on the $A_1$ theories of class-$\mathcal{S}$ and $\mathcal{N} = 4$ theories with $SU(N)$ gauge group. We work out the…
In this article we study the structured distance to singularity for a nonsingular matrix $A\in\mathbb{C}^{n\times n}$, with a prescribed linear structure $\mathcal{S}$ (for instance, a sparsity pattern, or a real Toeplitz structure), i.e.,…
We revisit the following nonlinear Schr\"odinger system \begin{align*}\begin{cases} -\epsilon^{2}\Delta u +P(x) u= \mu_1 u^3 +\beta uv^2, &~\text{in}\;\mathbb {R}^3,\\ -\epsilon^{2}\Delta v+Q(x) v= \mu_2 v^3 +\beta u^2v,…
New error bounds for the linear complementarity problems are given respectively when the involved matrices are Nekrasov matrices and B-Nekrasov matrices. Numerical examples are given to show that new bounds are better respectively than…
We focus on the estimating problem of the infinity norm of the inverse of Nekrasov matrices, give new bounds which involve a parameter, and then determine the optimal value of the parameter such that the new bounds are better than those in…
This PhD thesis is concerned with SDP bounds for codes: upper bounds for (non)-binary error correcting codes and lower bounds for (non)-binary covering codes. The methods are based on the method of Schrijver that uses triple distances in…
This paper is dedicated to the problem of verification of matrices for unitary similarity. For the case of nonderogatory matrices, we have been able to present the new solution for this problem based on geometric approach. The main…
The purpose of this paper is to investigate the effects of the use of mass-lumping in the finite element discretization of the reduced first-order optimality system arising from a standard tracking-type, distributed elliptic optimal control…