Related papers: An adapted deflated conjugate gradient solver for …
Circulant preconditioners are commonly used to accelerate the rate of convergence of iterative methods when solving linear systems of equations with a Toeplitz matrix. Block extensions that can be applied when the system has a block…
Finite alphabet iterative decoders (FAIDs) for LDPC codes were recently shown to be capable of surpassing the Belief Propagation (BP) decoder in the error floor region on the Binary Symmetric channel (BSC). More recently, the technique of…
Ill-conditioning of the system matrix is a well-known complication in immersed finite element methods and trimmed isogeometric analysis. Elements with small intersections with the physical domain yield problematic eigenvalues in the system…
This work presents uniform preconditioners for the discrete Laplace--Beltrami operator on hypersurfaces. In particular, within the framework of fast auxiliary space preconditioning (FASP), we develop efficient and user-friendly multilevel…
In this paper we consider second order elliptic partial differential equations with highly varying (heterogeneous) coefficients on a two-dimensional region. The problems are discretized by a composite finite element (FE) and discontinuous…
We introduce and explain key relations between a posteriori error estimates and subspace correction methods viewed as preconditioners for problems in infinite dimensional Hilbert spaces. We set the stage using the Finite Element Exterior…
In this paper, we study sliding window decoding of braided convolutional codes (BCCs) in the context of a streaming application, where decoder error propagation can be a serious problem. A window extension algorithm and a resynchronization…
We present a novel augmented Lagrangian (AL) preconditioner for the solution of linear systems arising from finite element discretizations of elliptic interface problems with jump coefficients. The method is based on the Fictitious Domain…
A structured preconditioned conjugate gradient (PCG) solver is developed for the Newton steps in second-order methods for a class of constrained network optimal control problems. Of specific interest are problems with discrete-time dynamics…
We develop all of the components needed to construct an adaptive finite element code that can be used to approximate fractional partial differential equations, on non-trivial domains in $d\geq 1$ dimensions. Our main approach consists of…
Recent advances in the field of machine learning open a new era in high performance computing. Applications of machine learning algorithms for the development of accurate and cost-efficient surrogates of complex problems have already…
We revisit the problem of large-scale bundle adjustment and propose a technique called Multidirectional Conjugate Gradients that accelerates the solution of the normal equation by up to 61%. The key idea is that we enlarge the search space…
Nonlinear systems of partial differential equations (PDEs) may permit several distinct solutions. The typical current approach to finding distinct solutions is to start Newton's method with many different initial guesses, hoping to find…
This paper applies an idea of adaptive momentum for the nonlinear conjugate gradient to accelerate optimization problems in sparse recovery. Specifically, we consider two types of minimization problems: a (single) differentiable function…
We present parameter-robust preconditioners for linear systems that arise after applying static condensation to a hybridizable discontinuous Galerkin (HDG) discretization of the time-dependent Stokes problem. Building upon the theoretical…
This paper concerns robust numerical treatment of an elliptic PDE with high contrast coefficients, for which classical finite-element discretizations yield ill-conditioned linear systems. This paper introduces a procedure by which the…
In this paper, a class of new preconditioners based on matrix splitting are presented for generalized saddle-point linear systems, which can be viewed as further modified improvements of some recently published preconditioners. Moreover, we…
Nonlinear optimal control problems for trajectory planning with obstacle avoidance present several challenges. While general-purpose optimizers and dynamic programming methods struggle when adopted separately, their combination enabled by a…
We present a finite element discretisation to model the interaction between a poroelastic structure and an elastic medium. The consolidation problem considers fully coupled deformations across an interface, ensuring continuity of…
Farhi and others have introduced the notion of solving NP problems using adiabatic quantum com- puters. We discuss an application of this idea to the problem of integer factorization, together with a technique we call gluing which can be…