Given a Hilbert space $\mathcal H$ and a finite measure space $Ω$, the approximation of a vector-valued function $f: Ω\to \mathcal H$ by a $k$-dimensional subspace $\mathcal U \subset \mathcal H$ plays an important role in dimension reduction techniques, such as reduced basis methods for solving parameter-dependent partial differential equations. For functions in the Lebesgue-Bochner space $L^2(Ω;\mathcal H)$, the best possible subspace approximation error $d_k^{(2)}$ is characterized by the singular values of $f$. However, for practical reasons, $\mathcal U$ is often restricted to be spanned by point samples of $f$. We show that this restriction only has a mild impact on the attainable error; there always exist $k$ samples such that the resulting error is not larger than $\sqrt{k+1} \cdot d_k^{(2)}$. Our work extends existing results by Binev at al. (SIAM J. Math. Anal., 43(3):1457-1472, 2011) on approximation in supremum norm and by Deshpande et al. (Theory Comput., 2:225-247, 2006) on column subset selection for matrices.
In this paper, we resolve the ever-present confusion over the QUICK scheme: it is a second-order scheme or a third-order scheme. The QUICK scheme, as proposed in the original reference [B. P. Leonard, Comput. Methods. Appl. Mech. Eng., 19, (1979), 59-98], is a third-order (not second-order) finite-volume scheme for the integral form of a general nonlinear conservation law with point-valued solutions stored at cell centers as numerical solutions. Third-order accuracy is proved by a careful and detailed truncation error analysis and demonstrated by a series of thorough numerical tests. The QUICK…
We propose a two-stage algorithm for generating Delaunay triangulations in 2D and Delaunay tetrahedra in 3D that employs near maximal Poisson-disk sampling. The method generates a variable resolution mesh in 2- and 3-dimensions in linear run time. The effectiveness of the algorithm is demonstrated by generating an unstructured 3D mesh on a discrete fracture network (DFN). Even though Poisson-disk sampling methods do not provide triangulation quality bounds in more than two-dimensions, we found that low quality tetrahedra are infrequent enough and could be successfully removed to obtain high qu…
Convergence Analysis of a Finite-Volume Scheme for a Microglia--Amyloid Chemotaxis Model with Measure-Valued Vascular Boundary Sources
Laboratoire Mathématiques, Informatique et Modélisation des Systèmes Complexes(数学、计算机与复杂系统建模实验室);École Supérieure de Technologie d’Essaouira, Université Cadi Ayyad(阿西迪·艾亚德大学埃苏维拉高等技术学院)
Marchuk Institute of Numerical Mathematics of Russian Academy of Sciences(俄罗斯科学院马丘克数值数学研究所);Moscow Institute of Physics and Technology(莫斯科物理技术学院);Skolkovo Institute of Science and Technology(斯科尔科沃科学技术学院)
Finite Volume Convergence for a Heat Equation with a Measure-Valued Source
University of Maryland, Baltimore County(马里兰大学巴尔的摩县分校);Czech Academy of Sciences, Institute of Information Theory and Automation(捷克科学院信息与自动化研究所);Czech Technical University, Faculty of Civil Engineering(捷克理工大学土木工程学院)
Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve systems with such a matrix can be very costly. A core idea to reduce computational complexity is to approximate the matrix by one with a low rank. The optimal and well understood choice is based on the eigenvalue decomposition of the matrix. Unfortunately, this is computationally very expensive. Cheaper methods are based on Gaussian elimination but they require p…
Convergence of a finite volume scheme for the compressible Navier--Stokes system
Institute of Mathematics of the Academy of Sciences of the Czech Republic(捷克科学院数学研究所);Institute of Mathematics, Johannes Gutenberg-University Mainz(美因茨约翰内斯·古腾堡大学数学研究所);Department of Mathematical Analysis and Numerical Mathematics Faculty of Mathematics, Physics and Informatics of the Comenius University(布拉迪斯拉发康斯坦丁尼乌斯大学数学、物理与信息学学院数学分析与数值数学系)
Sampling recovery in Bochner spaces and applications to parametric PDEs
Mathematisch-Geographische Fakultät, KU Eichstätt-Ingolstadt(凯泽大学艾希施泰特-因戈尔施塔特数学地理学院);Information Technology Institute, Vietnam National University, Hanoi(越南国家大学河内信息技术研究所)
A fundamental task in kernel methods is to pick nodes and weights, so as to approximate a given function from an RKHS by the weighted sum of kernel translates located at the nodes. This is the crux of kernel density estimation, kernel quadrature, or interpolation from discrete samples. Furthermore, RKHSs offer a convenient mathematical and computational framework. We introduce and analyse continuous volume sampling (VS), the continuous counterpart -- for choosing node locations -- of a discrete distribution introduced in (Deshpande & Vempala, 2006). Our contribution is theoretical: we prove al…
Arnoldi-Enhanced Multivariate Hermite Interpolation of Manifold-Valued Data
School of Mathematics and Physics, Xi’an Jiaotong-Liverpool University(西交利物浦大学数理学院);Department of Mathematical Sciences, University of Liverpool(利物浦大学数学科学系)
In this paper, we analyze a semi-discrete finite volume scheme for the three-dimensional barotropic compressible Euler equations driven by a multiplicative Brownian noise. We derive necessary a priori estimates for numerical approximations, and show that the Young measure generated by the numerical approximations converge to a dissipative measure--valued martingale solution to the stochastic compressible Euler system. These solutions are probabilistically weak in the sense that the driving noise and associated filtration are integral part of the solution. Moreover, we demonstrate strong conver…
Many methods for processing scalar and vector valued images, volumes and other data in the context of inverse problems are based on variational formulations. Such formulations require appropriate regularization functionals that model expected properties of the object to reconstruct. Prominent examples of regularization functionals in a vector-space context are the total variation (TV) and the Mumford-Shah functional, as well as higher-order schemes such as total generalized variation models. Driven by applications where the signals or data live in nonlinear manifolds, there has been quite some…