Related papers: Robust Algebraic multilevel preconditioning in $H(…
A local and parallel algorithm based on the multilevel discretization is proposed in this paper to solve the eigenvalue problem by the finite element method. With this new scheme, solving the eigenvalue problem in the finest grid is…
The aim of this paper is to solve linear semidefinite programs arising from higher-order Lasserre relaxations of unconstrained binary quadratic optimization problems. For this we use an interior point method with a preconditioned conjugate…
Discovering discrete algebraic rules from data is a fundamental challenge in machine learning. We formalize this problem through Cayley-table completion -- an algebraic counterpart to classical matrix completion -- where the degree of…
We devise and analyze hybrid polyhedral methods of arbitrary order for the approximation of div-curl systems on three-dimensional domains featuring non-trivial topology. The div-curl systems we are interested in stem from magnetostatics,…
We study acceleration and preconditioning strategies for a class of Douglas-Rachford methods aiming at the solution of convex-concave saddle-point problems associated with Fenchel-Rockafellar duality. While the basic iteration converges…
We present two new algebraic multilevel hierarchical matrix algorithms to perform fast matrix-vector product (MVP) for $N$-body problems in $d$ dimensions, namely efficient $\mathcal{H}^2_{*}$ (fully nested algorithm, i.e., $\mathcal{H}^2$…
In this work, we develop a fully implicit Hybrid High-Order algorithm for the Cahn-Hilliard problem in mixed form. The space discretization hinges on local reconstruction operators from hybrid polynomial unknowns at elements and faces. The…
Fourth-order differential equations play an important role in many applications in science and engineering. In this paper, we present a three-field mixed finite-element formulation for fourth-order problems, with a focus on the effective…
We design and analyze a novel accelerated gradient-based algorithm for a class of bilevel optimization problems. These problems have various applications arising from machine learning and image processing, where optimal solutions of the two…
The purpose of this research is to describe an efficient iterative method suitable for obtaining high accuracy solutions to high frequency time-harmonic scattering problems. The method allows for both refinement of local polynomial degree…
In this paper we present a formally fourth-order accurate hybrid-variable method for the Euler equations in the context of method of lines. The hybrid-variable (HV) method seeks numerical approximations to both cell-averages and nodal…
This paper describes a massively parallel algebraic multigrid method based on non-smoothed aggregation. It is especially suited for solving heterogeneous elliptic problems as it uses a greedy heuristic algorithm for the aggregation that…
This paper presents an efficient algorithm for the approximation of the rank-one convex hull in the context of nonlinear solid mechanics. It is based on hierarchical rank-one sequences and simultaneously provides first and second derivative…
In this work, we present scalable balancing domain decomposition by constraints methods for linear systems arising from arbitrary order edge finite element discretizations of multi-material and heterogeneous 3D problems. In order to enforce…
A hyperbolic integro-differential equation is considered, as a model problem, where the convolution kernel is assumed to be either smooth or no worse than weakly singular. Well-posedness of the problem is studied in the context of semigroup…
In this paper, we present a fast and accurate numerical scheme for the solution of fifth-order boundary-value problems. We apply the reproducing kernel Hilbert space method (RKHSM) for solving this problem. The analytic results of the…
To numerically solve a generic elliptic equation on two-dimensional domains with rectangular Cartesian grids, we propose a cut-cell geometric multigrid method that features (1) general algorithmic steps that apply to two-dimensional…
A cascadic multigrid method is proposed for eigenvalue problems based on the multilevel correction scheme. With this new scheme, an eigenvalue problem on the finest space can be solved by smoothing steps on a series of multilevel finite…
Increasing spatial and temporal resolution of numerical models continues to propel progress in hydrological sciences, but, at the same time, it has strained the ability of modern automatic calibration methods to produce realistic model…
In this work, we consider bilevel optimization when the lower-level problem is strongly convex. Recent works show that with a Hessian-vector product (HVP) oracle, one can provably find an $\epsilon$-stationary point within…