Related papers: Multilevel correction type of adaptive finite elem…
The Hermite-Taylor method evolves all the variables and their derivatives through order $m$ in time to achieve a $2m+1$ order rate of convergence. The data required at each node of the staggered Cartesian meshes used by this method makes…
We propose a new randomized optimization method for high-dimensional problems which can be seen as a generalization of coordinate descent to random subspaces. We show that an adaptive sampling strategy for the random subspace significantly…
Convex optimization encompasses a wide range of optimization problems that contain many efficiently solvable subclasses. Interior point methods are currently the state-of-the-art approach for solving such problems, particularly effective…
We propose a multigrid correction scheme to solve a new Steklov eigenvalue problem in inverse scattering. With this scheme, solving an eigenvalue problem in a fine finite element space is reduced to solve a series of boundary value problems…
A new method is presented to reconstruct the potential of a quantum mechanical many-body system from observational data, combining a nonparametric Bayesian approach with a Hartree-Fock approximation. A priori information is implemented as a…
The adaptively compressed exchange (ACE) method provides an efficient way for solving Hartree-Fock-like equations in quantum physics, chemistry, and materials science. The key step of the ACE method is to adaptively compress an operator…
Obtaining high-precision guaranteed lower eigenvalue bounds remains difficult, even though the standard high-order conforming finite element (FEM) easily yields extremely sharp upper bounds. Recently developed rigorous approaches using such…
The use of neural networks to approximate partial differential equations (PDEs) has gained significant attention in recent years. However, the approximation of PDEs with localised phenomena, e.g., sharp gradients and singularities, remains…
This paper investigates simple bilevel optimization problems where we minimize an upper-level objective over the optimal solution set of a convex lower-level objective. Existing methods for such problems either only guarantee asymptotic…
We study multilevel techniques, commonly used in PDE multigrid literature, to solve structured optimization problems. For a given hierarchy of levels, we formulate a coarse model that approximates the problem at each level and provides a…
Hypergraph matching has recently become a popular approach for solving correspondence problems in computer vision as it allows to integrate higher-order geometric information. Hypergraph matching can be formulated as a third-order…
Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying LP problem. In this paper, we…
The convergence analysis for least-squares finite element methods led to various adaptive mesh-refinement strategies: Collective marking algorithms driven by the built-in a posteriori error estimator or an alternative explicit…
The versatile Arbitrary-DERivative (ADER) scheme is cast in a multilevel framework (ML-ADER) for fast solution of system of linear hyperbolic partial differential equations. The solution is cycled through spatial operators of varying…
In this paper, we first discuss the optimal convergence of the adaptive finite element methods for non-self-adjoint eigenvalue problems. We present new theoretical error estimators and computable error estimators for multiple and clustered…
For a generalized Hodge Laplace equation, we prove the quasi-optimal convergence rate of an adaptive mixed finite element method. This adaptive method can control the error in the natural mixed variational norm when the space of harmonic…
This paper is concerned with the development and analysis of an iterative solver for high-dimensional second-order elliptic problems based on subspace-based low-rank tensor formats. Both the subspaces giving rise to low-rank approximations…
We present an adaptive methodology for the solution of (linear and) non-linear time dependent problems that is especially tailored for massively parallel computations. The basic concept is to solve for large blocks of space-time unknowns…
In this paper, we propose a multilevel stochastic framework for the solution of nonconvex unconstrained optimization problems. The proposed approach uses random regularized first-order models that exploit an available hierarchical…
This paper presents a high-order deferred correction algorithm combined with penalty iteration for solving free and moving boundary problems, using a fourth-order finite difference method. Typically, when free boundary problems are solved…