Related papers: Condition number and matrices

We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…

The condition number of solutions to full rank linear least-squares problem are shown to be given by an optimization problem that involves nuclear norms of rank 2 matrices. The condition number is with respect to the least-squares…

We use the core model for sequences of measures to prove a new lower bound for the consistency strength of the failure of the SCH: THEOREM (i) If there is a singular strong limit cardinal $\kappa$ such that $2^\kappa > kappa^+$ then there…

Inter-coder agreement measures, like Cohen's kappa, correct the relative frequency of agreement between coders to account for agreement which simply occurs by chance. However, in some situations these measures exhibit behavior which make…

We describe explicit formulas for the product rule in $\kappa^*(\mathcal{M}_{g,n}^{ct})$.

An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of…

We give a necessary and sufficient condition for the following property of an integer $d\in\mathbb N$ and a pair $(a,A)\in\mathbb R^2$: There exist $\kappa > 0$ and $Q_0\in\mathbb N$ such that for all $\mathbf x\in \mathbb R^d$ and $Q\geq…

In this paper, within a unified framework of the condition number theory we present the explicit expression of the projected condition number of the equality constrained indefinite least squares problem. By setting specific norms and…

Let $\kappa$,$\lambda$ be regular uncountable cardinals such that $\lambda > \kappa^+$ is not a successor of a singular cardinal of low cofinality. We construct a generic extension with $s(\kappa) = \lambda$ starting from a ground model in…

The condition number for eigenvalue computations is a well--studied quantity. But how small can we expect it to be? Namely, which is a perfectly conditioned matrix w.r.t. eigenvalue computations? In this note we answer this question with…

We analyze the complexity of quantum state verification in the context of solving systems of linear equations of the form $A \vec x = \vec b$. We show that any quantum operation that verifies whether a given quantum state is within a…

Let kappa a regular uncountable cardinal and lambda a cardinal >kappa, and suppose lambda^{<kappa} is less than the covering number for category cov(M_{kappa,kappa}). Then (a) I_{kappa,lambda}^+ -->^kappa (I_{kappa, lambda}^+,omega +1)^2,…

Matrix functions play an increasingly important role in many areas of scientific computing and engineering disciplines. In such real-world applications, algorithms working in floating-point arithmetic are used for computing matrix functions…

Kaniadakis deformed \kappa-mathematics is an area of mathematics that has found relevance in the analysis of complex systems. Specifically, the mathematical framework in the context of a first-order decay \kappa-differential equation is…

We are interested in the relative conditioning of the problem $y_0\mapsto \mathrm{e}^{tA}y_0$, i.e., the relative conditioning of the action of the matrix exponential $\mathrm{e}% ^{tA}$ on a vector with respect to perturbations of this…

Bilevel optimization minimizes an objective function, defined by an upper-level problem whose feasible region is the solution of a lower-level problem. We study the oracle complexity of finding an $\epsilon$-stationary point with…

Absolute value equations, due to their relation to the linear complementarity problem, have been intensively studied recently. In this paper, we present error bounds for absolute value equations. Along with the error bounds, we introduce an…

The determinant can be computed by classical circuits of depth $O(\log^2 n)$, and therefore it can also be computed in classical space $O(\log^2 n)$. Recent progress by Ta-Shma [Ta13] implies a method to approximate the determinant of…

Agreement measures are useful to both compare different evaluations of the same diagnostic outcomes and validate new rating systems or devices. Information Agreement (IA) is an information-theoretic-based agreement measure introduced to…

Sensitivity of an eigenvalue $\lambda_i$ to the perturbation of matrix elements is controlled by the eigenvalue condition number defined as $\kappa_i = \sqrt{\left< L_i | L_i\right> \left< R_i|R_i \right> }$, where $\left<L_i\right|$ and…