Related papers: Multilevel correction type of adaptive finite elem…
In this work, we propose an adaptive spectral element algorithm for solving nonlinear optimal control problems. The method employs orthogonal collocation at the shifted Gegenbauer-Gauss points combined with very accurate and stable…
We present a fully adaptive multiresolution scheme for spatially one-dimensional quasilinear strongly degenerate parabolic equations with zero-flux and periodic boundary conditions. The numerical scheme is based on a finite volume…
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…
In this paper, we introduce a higher-order multiscale method for time-dependent problems with highly oscillatory coefficients. Building on the localized orthogonal decomposition (LOD) framework, we construct enriched correction operators to…
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…
An efficient and accurate finite-element algorithm is described for the numerical solution of the incompressible Navier-Stokes (INS) equations. The new algorithm that solves the INS equations in a velocity-pressure reformulation is based on…
We describe a strategy for solving nonlinear eigenproblems numerically. Our approach is based on the approximation of a vector-valued function, defined as solution of a non-homogeneous version of the eigenproblem. This approximation step is…
In this work, we develop and analyze a higher-order finite element method for the multidimensional fragmentation equation. To the best of our knowledge, this is the first study to establish a rigorous, conforming finite element framework…
Inverse problems are in many cases solved with optimization techniques. When the underlying model is linear, first-order gradient methods are usually sufficient. With nonlinear models, due to nonconvexity, one must often resort to…
Automatic algorithms attempt to provide approximate solutions that differ from exact solutions by no more than a user-specified error tolerance. This paper describes an automatic, adaptive algorithm for approximating the solution to a…
In this paper, we consider the infinite-dimensional integration problem on weighted reproducing kernel Hilbert spaces with norms induced by an underlying function space decomposition of ANOVA-type. The weights model the relative importance…
We propose two variants of the overlapping additive Schwarz method for the finite element discretiza- tion of the elliptic problem in 3D with highly heterogeneous coefficients. The methods are efficient and simple to construct using the…
Low precision arithmetic, in particular half precision floating point arithmetic, is now available in commercial hardware. Using lower precision can offer significant savings in computation and communication costs with proportional savings…
We present a fully numerical framework for the optimization of molecule-specific quantum chemical basis functions within the quantics tensor train format using a finite-difference scheme. The optimization is driven by solving the…
In this paper, we introduce a multiscale framework based on adaptive edge basis functions to solve second-order linear elliptic PDEs with rough coefficients. One of the main results is that we prove the proposed multiscale method achieves…
We propose a new homotopy-based conditional gradient method for solving convex optimization problems with a large number of simple conic constraints. Instances of this template naturally appear in semidefinite programming problems arising…
Based on the work of Xu and Zhou [Math.Comput., 69(2000), pp.881-909], we establish new three-level and multilevel finite element discretizations by local defect-correction technique. Theoretical analysis and numerical experiments show that…
He and Yuan's prediction-correction framework [SIAM J. Numer. Anal. 50: 700-709, 2012] is able to provide convergent algorithms for solving separable convex optimization problems at a rate of $O(1/t)$ ($t$ represents iteration times) in…
We present a new rank-adaptive tensor method to compute the numerical solution of high-dimensional nonlinear PDEs. The method combines functional tensor train (FTT) series expansions, operator splitting time integration, and a new…
In this paper, we examine a number of additive and multiplicative multilevel iterative methods and preconditioners in the setting of two-dimensional local mesh refinement. While standard multilevel methods are effective for uniform…