Related papers: Adaptive Aggregation Based Domain Decomposition Mu…
Balancing domain decomposition by constraints (BDDC) algorithms with adaptive primal constraints are developed in a concise variational framework for the weighted plane wave least-squares (PWLS) discritization of Helmholtz equations with…
Pallalel GPGPU computing for lattice QCD simulations has a bottleneck on the GPU to GPU data communication due to the lack of the direct data exchanging facility. In this work we investigate the performance of quark solver using the…
Robust and efficient solvers for coupled-adjoint linear systems are crucial to successful aerostructural optimization. Monolithic and partitioned strategies can be applied. The monolithic approach is expected to offer better robustness and…
We develop non-overlapping domain decomposition methods for the Biot system of poroelasticity in a mixed form. The solid deformation is modeled with a mixed three-field formulation with weak stress symmetry. The fluid flow is modeled with a…
We present a new multigrid scheme for solving the Poisson equation with Dirichlet boundary conditions on a Cartesian grid with irregular domain boundaries. This scheme was developed in the context of the Adaptive Mesh Refinement (AMR)…
We develop a generalization of low-mode averaging in which the number of low quark modes of the Dirac operator required for a constant variance reduction can be kept independent of the volume by exploiting their local coherence. Typically…
We consider three improvements to seed methods for Hermitian linear systems with multiple right-hand sides: only the Krylov subspace for the first system is used for seeding subsequent right-hand sides, the first right-hand side is solved…
A numerical approach for solving evolutionary partial differential equations in two and three space dimensions on block-based adaptive grids is presented. The numerical discretization is based on high-order, central finite-differences and…
A recently developed numerical method for the calculation of derivatives of functions of general complex matrices, which can also be combined with implicit matrix function approximations such as Krylov-Ritz type algorithms, is presented. An…
Multiple solutions are common in various non-convex problems arising from industrial and scientific computing. Nonetheless, understanding the nontrivial solutions' qualitative properties seems limited, partially due to the lack of efficient…
Graph based clustering is one of the major clustering methods. Most of it work in three separate steps: similarity graph construction, clustering label relaxing and label discretization with k-means. Such common practice has three…
This paper deals with the definition and optimization of augmentation spaces for faster convergence of the conjugate gradient method in the resolution of sequences of linear systems. Using advanced convergence results from the literature,…
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…
Matching and partitioning problems are fundamentals of computer vision applications with examples in multilabel segmentation, stereo estimation and optical-flow computation. These tasks can be posed as non-convex energy minimization…
For several classes of mathematical models that yield linear systems, the splitting of the matrix into its Hermitian and skew Hermitian parts is naturally related to properties of the underlying model. This is particularly so for…
We investigate the application of Krylov space methods to the solution of shifted linear systems of the form (A+\sigma) x - b = 0 for several values of \sigma simultaneously, using only as many matrix-vector operations as the solution of a…
Due to its optimal complexity, the multigrid (MG) method is one of the most popular approaches for solving large-scale linear systems arising from the discretization of partial differential equations. However, the parallel implementation of…
A simple minded approach to implement three discretizations of the Dirac operator (staggered, Wilson, Brillouin) on two architectures (KNL and core i7) is presented. The idea is to use a high-level compiler along with OpenMP parallelization…
I review the theoretical foundations, properties as well as the simulation results obtained so far of a variant of the Wilson lattice QCD formulation: Wilson twisted mass lattice QCD. Emphasis is put on the discretization errors and on the…
The paper studies decentralized optimization over networks, where agents minimize a sum of {\it locally} smooth (strongly) convex losses and plus a nonsmooth convex extended value term. We propose decentralized methods wherein agents {\it…