Related papers: A Subdivision Solver for Systems of Large Dense Po…

This paper studies a new class of integration schemes for the numerical solution of semi-explicit differential-algebraic equations of differentiation index 2 in Hessenberg form. Our schemes provide the flexibility to choose different…

This survey describes a class of methods known as "fast direct solvers". These algorithms address the problem of solving a system of linear equations $\boldsymbol{Ax}=\boldsymbol{b}$ arising from the discretization of either an elliptic PDE…

The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerful algorithmic paradigm which captures state-of-the-art algorithmic guarantees for a wide array of problems. In the average case setting, SoS lower bounds provide strong…

We describe a practical algorithm for computing the Stokes multipliers of a linear differential equation with polynomial coefficients at an irregular singular point of single level one. The algorithm follows a classical approach based on…

Several well known large scale linear programming decomposition methodologies exist. Benders Decomposition, which covers the case where some small subset of variables link the otherwise separable subproblems. Dantzig-Wolfe decomposition and…

We approximate the d complex zeros of a univariate polynomial p(x) of a degree d or those zeros that lie in a fixed region of interest on the complex plane such as a disc or a square. Our divide and conquer algorithm of STOC 1995 supports…

A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…

In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…

This paper presents a Kharitonov-type algorithm for complex interval Hurwitz polynomials that determines whether all roots of a given interval polynomial lie within a prescribed angular sector of the complex plane. The method requires…

A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…

There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…

The mainstream theory of hypothesis testing in high-dimensional regression typically assumes the underlying true model is a low-dimensional linear regression model, yet the Box-Cox transformation is a regression technique commonly used to…

In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time…

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

The Invar package is introduced, a fast manipulator of generic scalar polynomial expressions formed from the Riemann tensor of a four-dimensional metric-compatible connection. The package can maximally simplify any polynomial containing…

We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…

In high-dimensional generalized linear models, it is crucial to identify a sparse model that adequately accounts for response variation. Although the best subset section has been widely regarded as the Holy Grail of problems of this type,…

We present a Lohner-type algorithm for rigorous integration of systems of Delay Differential Equations (DDEs) with multiple delays and its application in computation of Poincar\'e maps to study the dynamics of some bounded, eternal…

Consider a system of polynomials in many variables over the ring of integers of a number field $K$. We prove an asymptotic formula for the number of integral zeros of this system in homogeneously expanding boxes. As a consequence, any…

High-order tensor methods that employ Taylor-based local models (of degree $p\ge 3$) within adaptive regularization frameworks have been recently proposed for both convex and nonconvex optimization problems. They have been shown to have…