Related papers: V-cycle optimal convergence for DCT-III matrices
We investigate the optimal rate of convergence in the multidimensional normal approximation of vector-valued Wiener-Ito integrals of which components all belong to the same fixed Wiener chaos. Combining Malliavin calculus, Stein's method…
A multigrid method for the Stokes system discretized with an Hdiv-conforming discontinuous Galerkin method is presented. It acts on the combined velocity and pressure spaces and thus does not need a Schur complement approximation. The…
Let $G$ be a connected graph on $n$ vertices and $D(G)$ its distance matrix. The formula for computing the determinant of this matrix in terms of the number of vertices is known when the graph is either a tree or {a} unicyclic graph. In…
This paper puts forth two new closure models for the proper orthogonal decomposition reduced-order modeling of structurally dominated turbulent flows: the dynamic subgrid-scale model and the variational multiscale model. These models, which…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
The simulation of systems that act on multiple time scales is challenging. A stable integration of the fast dynamics requires a highly accurate approximation whereas for the simulation of the slow part, a coarser approximation is accurate…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
We study the accuracy of triangulation in multi-camera systems with respect to the number of cameras. We show that, under certain conditions, the optimal achievable reconstruction error decays quadratically as more cameras are added to the…
We develop and analyze a new hybridizable discontinuous Galerkin (HDG) method for solving third-order Korteweg-de Vries type equations. The approximate solutions are defined by a discrete version of a characterization of the exact solution…
We introduce circulant matrices that capture the structure of a skew-polynomial ring F[x;\theta] modulo the left ideal generated by a polynomial of the type x^n-a. This allows us to develop an approach to skew-constacyclic codes based on…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…
A matrix is said to be {\it cyclic} if its characteristic polynomial is equal to its minimal polynomial. Cyclic matrices play an important role in some algorithms for matrix group computation, such as the Cyclic Meataxe developed by P. M.…
In this article, we discuss the optimal allocation problem in an experiment when a regression model is used for statistical analysis. Monotonic convergence for a general class of multiplicative algorithms for $D$-optimality has been…
We propose energy-conserving discontinuous Galerkin (DG) methods for symmetric linear hyperbolic systems on general unstructured meshes. Optimal a priori error estimates of order $k+1$ are obtained for the semi-discrete scheme in one…
We present an analysis for the performance of decentralized consensus-based gradient (DCG) methods for solving optimization problems over a cluster network of nodes. This type of network is composed of a number of densely connected clusters…
Uniform convergence of the geometric multigrid V-cycle is proven for HDG methods with a new set of assumptions on the injection operators from coarser to finer meshes. The scheme involves standard smoothers and local solvers which are…
The subject of this paper is multigrid solvers for Helmholtz operators with large wave numbers. Algorithms presented here are variations of the wave-ray solver which is modified to allow efficient solutions for operators with constant,…
The motivation of this paper is twofold. First, we investigate the block-diagonalization of the $z$-block circulant matrix $\mathtt{bcirc_z}(\mathcal A)$, based on this block-diagonal structure, and develop the algorithm…
The problem of straggler mitigation in distributed matrix multiplication (DMM) is considered for a large number of worker nodes and a fixed small finite field. Polynomial codes and matdot codes are generalized by making use of algebraic…
We adapt the CRT approach for computing Hilbert class polynomials to handle a wide range of class invariants. For suitable discriminants D, this improves its performance by a large constant factor, more than 200 in the most favourable…