Related papers: Computing $\sqrt{2}$ with FRACTRAN
We state and give self contained proofs of semidefinite programming characterizations of the numerical radius and its dual norm for matrices. We show that the computation of the numerical radius and its dual norm within $\varepsilon$…
In this paper we consider a system of quadratic equations |<z_j, x>|^2 = b_j, j = 1, ..., m, where x in R^n is unknown while normal random vectors z_j in R_n and quadratic measurements b_j in R are known. The system is assumed to be…
We give a converging semidefinite programming hierarchy of outer approximations for the set of quantum correlations of fixed dimension and derive analytical bounds on the convergence speed of the hierarchy. In particular, we give a…
This thesis will be discussing scoring play combinatorial games and looking at the general structure of these games under different operators. I will also be looking at the Sprague-Grundy values for scoring play impartial games, and…
We discuss an extension of the massively parallel cosmological simulation code GADGET-2, which now enables investigation of multiple and distinct gravitational force laws, provided they are dominated by a constant scaling of the Newtonian…
This paper presents a comparative study three numerical schemes such as Linear, Quadratic and Quadratic-Linear scheme for the fractional integro-differential equations defined in terms of the Caputo fractional derivatives. The error…
We have developed a simulation technique that uses non-linear finite element analysis and elastic fracture mechanics to compute physically plausible motion for three-dimensional, solid objects as they break, crack, or tear. When these…
In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either…
Bayesian networks and their accompanying graphical models are widely used for prediction and analysis across many disciplines. We will reformulate these in terms of linear maps. This reformulation will suggest a natural extension, which we…
In mathematical optimization, second-order Newton's methods generally converge faster than first-order methods, but they require the inverse of the Hessian, hence are computationally expensive. However, we discover that on sparse graphs,…
We present a numerical framework for computing nested quadrature rules for various weight functions. The well-known Kronrod method extends the Gauss-Legendre quadrature by adding new optimal nodes to the existing Gauss nodes for integration…
We introduce the fractal expansions, sequences of integers associated to a number. We show that these sequences characterize the O-sequences and encode some information on lex segment ideals. Moreover, we introduce a numerical functions…
We use deep sparsely connected neural networks to measure the complexity of a function class in $L^2(\mathbb R^d)$ by restricting connectivity and memory requirement for storing the neural networks. We also introduce representation system -…
This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966),…
We consider combining the definition of a cardinal invariant and the notion of an infinite game. We focus on the splitting number $\mathfrak{s}$ since the corresponding cardinal invariants behave in an interesting way. We introduce three…
The space of finite games can be decomposed into three orthogonal subspaces [5], which are the subspaces of pure potential games, nonstrategic games and pure harmonic games. The orthogonal projections onto these subspaces are represented as…
We use a way to extend partial combinatory algebras (pcas) by forcing them to represent certain functions. In the case of Scott's Graph model, equality is computable relative to the complement function. However, the converse is not true.…
We show that the value of a general two-prover quantum game cannot be computed by a semi-definite program ofvpolynomial size (unless P=NP), a method that has been successful in more restricted quantum games. More precisely, we show that…
We present a numerical method to solve the optimal transport problem with a quadratic cost when the source and target measures are periodic probability densities. This method is based on a numerical resolution of the corresponding…
Counterfactual Regret Minimization (CFR) is the leading framework for solving large imperfect-information games. It converges to an equilibrium by iteratively traversing the game tree. In order to deal with extremely large games,…