English
Related papers

Related papers: Condition number bounds for problems with integer …

200 papers

Using oblique projections and angles between subspaces we write condition number estimates for abstract nonsymmetric domain decomposition methods. In particular, we consider a restricted additive method for the Poisson equation and write a…

Numerical Analysis · Mathematics 2023-04-19 Juan Galvis

The numerical solution of singular eigenvalue problems is complicated by the fact that small perturbations of the coefficients may have an arbitrarily bad effect on eigenvalue accuracy. However, it has been known for a long time that such…

Numerical Analysis · Mathematics 2023-01-10 Daniel Kressner , Ivana Šain Glibić

We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…

Number Theory · Mathematics 2019-02-20 Igor E. Shparlinski

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh

This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…

Motivated by some applications in signal processing and machine learning, we consider two convex optimization problems where, given a cone $K$, a norm $\|\cdot\|$ and a smooth convex function $f$, we want either 1) to minimize the norm over…

Optimization and Control · Mathematics 2013-03-29 Zaid Harchaoui , Anatoli Juditsky , Arkadi Nemirovski

In a configuration space whose boundary can be identified with a subset of its interior, a boundary condition can relate the behaviour of a function on the boundary and in the interior. Additionally, boundary values can appear as additive…

Spectral Theory · Mathematics 2025-06-19 Tim Binz , Jonas Lampart

We study ill-conditioned positive definite matrices that are disturbed by the sum of $m$ rank-one matrices of a specific form. We provide estimates for the eigenvalues and eigenvectors. When the condition number of the initial matrix tends…

Numerical Analysis · Mathematics 2024-03-13 Armand Gissler , Anne Auger , Nikolaus Hansen

The aim of the paper is to develop a general theory of solvability of linear inhomogeneous boundary-value problems for systems of ordinary differential equations of arbitrary order in Sobolev spaces. Boundary conditions are allowed to be…

Classical Analysis and ODEs · Mathematics 2023-10-12 Vladimir Mikhailets , Olena Atlasiuk

We present a simple algebraic procedure that can be applied to solve a range of quantum eigenvalue problems without the need to know the solution of the Schr\"odinger equation. The procedure, presented with a pedagogical purpose, is based…

Quantum Physics · Physics 2021-11-17 Luis de la Peña , Ana María Cetto , Andrea Valdés-Hernández

In this paper, we present a comprehensive system for the treatment of the topic of limits--conceptually, computationally, and formally. The system addresses fundamental linguistic flaws in the standard presentation of limits, which attempts…

General Mathematics · Mathematics 2007-05-23 Frank Swenton

This article is concerned with the existence and uniqueness of solutions to some fractional order boundary value problems. Our results are based on some fixed point theorems. For the applicability of our results, we provide an example.

Classical Analysis and ODEs · Mathematics 2016-12-13 Anwarrud Din , Shah Faisal

Performance of optimization on quadratic problems sensitively depends on the low-lying part of the spectrum. For large (effectively infinite-dimensional) problems, this part of the spectrum can often be naturally represented or approximated…

Optimization and Control · Mathematics 2024-03-26 Maksim Velikanov , Dmitry Yarotsky

An approach is proposed for bounding the number of zeros that solutions of linear differential systems with polynomial coefficients may have. A bound is obtained in a special case which improves upon currently existing.

Dynamical Systems · Mathematics 2007-05-23 Alexei Grigoriev

We consider estimation of the covariance matrix of a multivariate random vector under the constraint that certain covariances are zero. We first present an algorithm, which we call Iterative Conditional Fitting, for computing the maximum…

Statistics Theory · Mathematics 2010-03-04 Sanjay Chaudhuri , Mathias Drton , Thomas S. Richardson

We study approximations of compact linear multivariate operators defined over Hilbert spaces. We provide necessary and sufficient conditions on various notions of tractability. These conditions are mainly given in terms of sums of certain…

Numerical Analysis · Mathematics 2018-07-10 Peter Kritzer , Henryk Wozniakowski

Motivated by complexity questions in integer programming, this paper aims to contribute to the understanding of combinatorial properties of integer matrices of row rank $r$ and with bounded subdeterminants. In particular, we study the…

Combinatorics · Mathematics 2023-09-08 Björn Kriepke , Gohar M. Kyureghyan , Matthias Schymura

We consider difference equations with several non-monotone deviating arguments and nonnegative coefficients. The deviations (delays and advances) are, generally, unbounded. Sufficient oscillation conditions are obtained in an explicit…

Dynamical Systems · Mathematics 2017-02-13 Elena Braverman , George E. Chatzarakis , Ioannis P. Stavroulakis

Systems of orthogonal polynomials whose recurrence coefficients tend to infinity are considered. A summability condition is imposed on the coefficients and the consequences for the measure of orthogonality are discussed. Also discussed are…

Classical Analysis and ODEs · Mathematics 2014-08-28 A. I. Aptekarev , J. S. Geronimo

We provide a formula for the lower bound in the form of $|F| \ge K$, in such a way that the decision version of unweighted non-bipartite matching can be solved in polynomial time. ~The parameter $K$ can vary from instance to instance. We…

Logic in Computer Science · Computer Science 2014-10-24 Prabhu Manyem