اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRectangular maximum-volume submatrices and their applications
43
0
0.0
(
0
)
نشر من قبل
Alexander Mikhalev Dr
تاريخ النشر
2015
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce a definition of the volume for a general rectangular matrix, which for square matrices is equivalent to the absolute value of the determinant. We generalize results for square maximum-volume submatrices to the case of rectangular maximal-volume submatrices, show connection of the rectangular volume with optimal experimental design and provide estimates for the growth of the coefficients and approximation error in spectral and Chebyshev norms. Three promising applications of such submatrices are presented: recommender systems, finding maximal elements in low-rank matrices and preconditioning of overdetermined linear systems. The code is available online.
قيم البحث
اقرأ أيضاً
We present a (partial) historical summary of the mathematical analysis of finite differences and finite volumes methods, paying a special attention to the Lax-Richtmyer and Lax-Wendroff theorems. We then state a Lax-Wendroff consistency result for co
nvection operators on staggered grids (often used in fluid flow simulations), which illustrates a recent generalization of the flux consistency notion designed to cope with general discrete functions.
This paper presents a two-dimensional Fourier Continuation method (2D-FC) for construction of bi-periodic extensions of smooth non-periodic functions defined over general two-dimensional smooth domains. The approach can be directly generalized to dom
ains of any given dimensionality, and even to non-smooth domains, but such generalizations are not considered here. The 2D-FC extensions are produced in a two-step procedure. In the first step the one-dimensional Fourier Continuation method is applied along a discrete set of outward boundary-normal directions to produce, along such directions, continuations that vanish outside a narrow interval beyond the boundary. Thus, the first step of the algorithm produces blending-to-zero along normals for the given function values. In the second step, the extended function values are evaluated on an underlying Cartesian grid by means of an efficient, high-order boundary-normal interpolation scheme. A Fourier Continuation expansion of the given function can then be obtained by a direct application of the two-dimensional FFT algorithm. Algorithms of arbitrarily high order of accuracy can be obtained by this method. The usefulness and performance of the proposed two-dimensional Fourier Continuation method are illustrated with applications to the Poisson equation and the time-domain wave equation within a bounded domain. As part of these examples the novel Fourier Forwarding solver is introduced which, propagating plane waves as they would in free space and relying on certain boundary corrections, can solve the time-domain wave equation and other hyperbolic partial differential equations within general domains at computing costs that grow sublinearly with the size of the spatial discretization.
Minimization of a stochastic cost function is commonly used for approximate sampling in high-dimensional Bayesian inverse problems with Gaussian prior distributions and multimodal posterior distributions. The density of the samples generated by minim
ization is not the desired target density, unless the observation operator is linear, but the distribution of samples is useful as a proposal density for importance sampling or for Markov chain Monte Carlo methods. In this paper, we focus on applications to sampling from multimodal posterior distributions in high dimensions. We first show that sampling from multimodal distributions is improved by computing all critical points instead of only minimizers of the objective function. For applications to high-dimensional geoscience problems, we demonstrate an efficient approximate weighting that uses a low-rank Gauss-Newton approximation of the determinant of the Jacobian. The method is applied to two toy problems with known posterior distributions and a Darcy flow problem with multiple modes in the posterior.
The moment-of-fluid (MOF) method is an extension of the volume-of-fluid method with piecewise linear interface construction (VOF-PLIC). By minimizing the least square error of the centroid of the cutting polyhedron, the MOF method reconstructs the li
near interface without using any neighboring information. Traditional MOF involves iteration while finding the optimized linear reconstruction. Here, we propose an alternative approach based on a machine learning algorithm: Decision Tree algorithm. A training data set is generated from a list of random cuts of a unit cube by plane. The Decision Tree algorithm extracts the input-output relationship from the training data, so that the resulting function determines the normal vector of the reconstruction plane directly, without any iteration. The present method is tested on a range of popular interface advection test problems. Numerical results show that our approach is much faster than the iteration-based MOF method while provides compatible accuracy with the conventional MOF method.
This paper addresses the three concepts of textit{ consistency, stability and convergence } in the context of compact finite volume schemes for systems of nonlinear hyperbolic conservation laws. The treatment utilizes the framework of balance laws. S
uch laws express the relevant physical conservation laws in the presence of discontinuities. Finite volume approximations employ this viewpoint, and the present paper can be regarded as being in this category. It is first shown that under very mild conditions a weak solution is indeed a solution to the balance law. The schemes considered here allow the computation of several quantities per mesh cell (e.g., slopes) and the notion of consistency must be extended to this framework. Then a suitable convergence theorem is established, generalizing the classical convergence theorem of Lax and Wendroff. Finally, the limit functions are shown to be entropy solutions by using a notion of Godunov compatibility, which serves as a substitute to the entropy condition.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
