119
Voted
MOC
2016
9 years 11 months ago
2016
Dual Gramian analysis is one of the fundamental tools developed in a series of papers [37, 40, 38, 39, 42] for studying frames. Using dual Gramian analysis, the frame operator can ...
122
Voted
MOC
2016
9 years 11 months ago
2016
We provide a simple analysis of the Douglas-Rachford splitting algorithm in the context of 1 minimization with linear constraints, and quantify the asymptotic linear convergence r...
122
Voted
MOC
2016
9 years 11 months ago
2016
This paper extends tools developed in [10, 8] to study character polylogarithms. These objects are used to compute Mordell-Tornheim-Witten character sums and to explore their conn...
113
Voted
MOC
2016
9 years 11 months ago
2016
Mazur, Tate, and Teitelbaum gave a p-adic analogue of the Birch and Swinnerton-Dyer conjecture for elliptic curves. We provide a generalization of their conjecture in the good ordi...
114
Voted
MOC
2016
9 years 11 months ago
2016
Abstract. We consider a numerical scheme for Hamilton–Jacobi equations based on a direct discretization of the Lax–Oleinik semi–group. We prove that this method is convergent...
99
Voted
MOC
2016
9 years 11 months ago
2016
We further study the properties of the back and forth error compensation and correction (BFECC) method for advection equations such as those related to the level set method and fo...
116
Voted
MOC
2016
9 years 11 months ago
2016
We find the weak rate of convergence of the spatially semidiscrete finite element approximation of the nonlinear stochastic heat equation. Both multiplicative and additive noise ...
100
Voted
MOC
2016
9 years 11 months ago
2016
We study analytical properties of the Toro-Titarev solver for generalized Riemann problems (GRPs), which is the heart of the flux computation in ADER generalized Godunov schemes. ...
123
Voted
MOC
2016
9 years 11 months ago
2016
Abstract. The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial ...
112
Voted
MOC
2016
9 years 11 months ago
2016
Assuming GRH, we prove an explicit upper bound for the number of zeros of a Dedekind zeta function having imaginary part in [T−a, T+a]. We also prove a bound for the multiplicity...