Related papers: V-cycle optimal convergence for DCT-III matrices
The properties of ideal tri-functional dendrimers with forty-five, ninety-three and one hundred and eighty-nine branches are investigated. Three methods are employed to calculate the mean-square radius of gyration, $g$-ratios, asphericity,…
Multi-level numerical methods that obtain the exact solution of a linear system are presented. The methods are devised by combining ideas from the full multi-grid algorithm and perfect reconstruction filters. The problem is stated as…
In this paper, we utilize a variant of the scaled relative graph (SRG), referred to as the $\theta$-symmetric SRG, to develop a graphical stability criterion for the feedback interconnection of a cascade of systems. A crucial…
For all practical purposes, the Micali-Vazirani general graph maximum matching algorithm is still the most efficient known algorithm for the problem. The purpose of this paper is to provide a complete proof of correctness of the algorithm…
In this paper, we consider the decomposition of multigraphs under minimum degree constraints and give a unified generalization of several results by various researchers. Let $G$ be a multigraph in which no quadrilaterals share edges with…
We construct an explicit Hamiltonian cycle in the state graph of the 5-puzzle on a toroidal 2x 3 grid, a graph with 720 vertices. The cycle is described by a short symbolic sequence of 48 moves over the alphabet {L,R,V}, repeated $15$…
We propose to use a hybridizable discontinuous Galerkin (HDG) method combined with the continuous Galerkin (CG) method to approximate Maxwell's equations. We make two contributions in this paper. First, even though there are many papers…
In this paper, we present an efficient adaptive multigrid strategy for the geometry optimization of large-scale three dimensional molecular mechanics. The resulting method can achieve significantly reduced complexity by exploiting the…
In this paper we study the convex problem of optimizing the sum of a smooth function and a compactly supported non-smooth term with a specific separable form. We analyze the block version of the generalized conditional gradient method when…
The present work develops hybrid multigrid methods for high-order discontinuous Galerkin discretizations of elliptic problems. Fast matrix-free operator evaluation on tensor product elements is used to devise a computationally efficient PDE…
The constrained gradient method (CGM) has recently been proposed to solve convex optimization and monotone variational inequality (VI) problems with general functional constraints. While existing literature has established convergence…
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L. We investigate how well L-cycle covers of minimum weight…
Iterative hard thresholding (IHT) has gained in popularity over the past decades in large-scale optimization. However, convergence properties of this method have only been explored recently in non-convex settings. In matrix completion,…
We develop 3rd order maximum-principle-satisfying direct discontinuous Galerkin methods [8, 9, 19, 21] for convection diffusion equations on unstructured triangular mesh. We carefully calculate the normal derivative numerical flux across…
We develop and analyze the first hybridizable discontinuous Galerkin (HDG) method for solving fifth-order Korteweg-de Vries (KdV) type equations. We show that the semi-discrete scheme is stable with proper choices of the stabilization…
We consider a standard elliptic partial differential equation and propose a geometric multigrid algorithm based on Dirichlet-to-Neumann (DtN) maps for hybridized high-order finite element methods. The proposed unified approach is applicable…
Constructing fast numerical solvers for partial differential equations (PDEs) is crucial for many scientific disciplines. A leading technique for solving large-scale PDEs is using multigrid methods. At the core of a multigrid solver is the…
We consider Vinberg $\theta$-groups associated to a cyclic quiver on $k$ nodes. Let $K$ be the product of the general linear groups associated to each node. Then $K$ acts naturally on $\oplus \text{Hom}(V_i, V_{i+1})$ and by Vinberg's…
A convergence result for a discontinuous Galerkin multiscale method for a second order elliptic problem is presented. We consider a heterogeneous and highly varying diffusion coefficient in $L^\infty(\Omega,\mathbb{R}^{d\times d}_{sym})$…
As is well known, any complex cyclic matrix $A$ is similar to the unique companion matrix associated with the minimal polynomial of $A$. On the other hand, a cyclic matrix over a division ring $\mathbb F$ is similar to a companion matrix of…