相关论文: A Posteriori Error Estimate for Computing $\mathrm…
Previous results pertaining to algebraic state and parameter estimation of linear systems based on a special construction of a forward-backward kernel representation of linear differential invariants are extended to handle large noise in…
The aim of this work is to develop a fast algorithm for approximating the matrix function $f(A)$ of a square matrix $A$ that is symmetric and has hierarchically semiseparable (HSS) structure. Appearing in a wide variety of applications,…
The binary Mumford-Shah model is a widespread tool for image segmentation and can be considered as a basic model in shape optimization with a broad range of applications in computer vision, ranging from basic segmentation and labeling to…
Randomized matrix sparsification has proven to be a fruitful technique for producing faster algorithms in applications ranging from graph partitioning to semidefinite programming. In the decade or so of research into this technique, the…
In this paper, we give a new type of a posteriori error estimators suitable for moving finite element methods under anisotropic meshes for general second-order elliptic problems. The computation of estimators is simple once corresponding…
An a posteriori error bound for the pointwise error of the quadratic discontinuous Galerkin method for the unilateral contact problem on polygonal domain is presented. The pointwise a posteriori error analysis is based on the direct use of…
Random Fourier Features (RFF) is among the most popular and broadly applicable approaches for scaling up kernel methods. In essence, RFF allows the user to avoid costly computations on a large kernel matrix via a fast randomized…
We present a successive constraint approach that makes it possible to cheaply solve large-scale linear matrix inequalities for a large number of parameter values. The efficiency of our method is made possible by an offline/online…
Low-rank approximation of a matrix function, $f(A)$, is an important task in computational mathematics. Most methods require direct access to $f(A)$, which is often considerably more expensive than accessing $A$. Persson and Kressner (SIMAX…
We study the problem of estimating the trace of a matrix $A$ that can only be accessed through matrix-vector multiplication. We introduce a new randomized algorithm, Hutch++, which computes a $(1 \pm \epsilon)$ approximation to $tr(A)$ for…
We propose a penalized likelihood framework for estimating multiple precision matrices from different classes. Most existing methods either incorporate no information on relationships between the precision matrices, or require this…
Computationally efficient numerical methods for high-order approximations of convolution integrals involving weakly singular kernels find many practical applications including those in the development of fast quadrature methods for…
The unfolding problem in particle physics is to make inferences about the true particle spectrum based on smeared observations from a detector. This is an ill-posed inverse problem, where small changes in the smeared distribution can lead…
This work deals with the a posteriori error estimates for the Darcy-Forchheimer problem. We introduce the corresponding variational formulation and discretize it by using the finite-element method. A posteriori error estimate with two types…
A second order accurate, linear numerical method is analyzed for the Landau-Lifshitz equation with large damping parameters. This equation describes the dynamics of magnetization, with a non-convexity constraint of unit length of the…
Fully coupled McKean-Vlasov forward-backward stochastic differential equations (MV-FBSDEs) arise naturally from large population optimization problems. Judging the quality of given numerical solutions for MV-FBSDEs, which usually require…
We consider elliptic problems with complicated, discontinuous diffusion tensor $A_{\scriptscriptstyle 0} $. One of the standard approaches to numerically treat such problems is to simplify the coefficient by some approximation, say…
We introduce quantitative and robust tools to control the numerical accuracy in simulations performed using the Multiscale Finite Element Method (MsFEM). First, we propose a guaranteed and fully computable a posteriori error estimate for…
We devise a posteriori error estimators for quasi-optimal nonconforming finite element methods approximating symmetric elliptic problems of second and fourth order. These estimators are defined for all source terms that are admissible to…
For a linear matrix function $f$ in $X \in \R^{m\times n}$ we consider inhomogeneous linear matrix equations $f(X) = E$ for $E \neq 0$ that have or do not have solutions. For such systems we compute optimal norm constrained solutions…