Abstract. We analyze a model optimal control problem for a 2D scalar conservation law: The so-called inverse design problem, the goal being to identify the initial datum leading to...
We present fast algorithms for computing rational first integrals with bounded degree of a planar polynomial vector field. Our approach builds upon a method proposed by Ferragut ...
A bound is obtained for the condition number of a BDDC algorithm for problems posed in H(curl) in two dimensions, where the subdomains are only assumed to be uniform in the sense o...
We establish the contraction property between consecutive loops of adaptive hybridizable discontinuous Galerkin methods for the Poisson problem with homogeneous Dirichlet condition...
Bernardo Cockburn, Ricardo H. Nochetto, Wujun Zhan...
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 ...
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...
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...
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...
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...
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...