ﻻ يوجد ملخص باللغة العربية
A new fast algebraic method for obtaining an $mathcal{H}^2$-approximation of a matrix from its entries is presented. The main idea behind the method is based on the nested representation and the maximum-volume principle to select submatrices in low-rank matrices. A special iterative approach for the computation of so-called representing sets is established. The main advantage of the method is that it uses only the hierarchical partitioning of the matrix and does not require special proxy surfaces to be selected in advance. The numerical experiments for the electrostatic problem and for the boundary integral operator confirm the effectiveness and robustness of the approach. The complexity is linear in the matrix size and polynomial in the ranks. The algorithm is implemented as an open-source Python package that is available online.
Gaussian processes are powerful, yet analytically tractable models for supervised learning. A Gaussian process is characterized by a mean function and a covariance function (kernel), which are determined by a model selection criterion. The functions
We propose to differentiate a general curvature functional with two different approaches. In the first one we compute the derivative with the tools of shape optimization and in the second one we compute the derivative of a volumic approximation of th
The analysis of linear ill-posed problems often is carried out in function spaces using tools from functional analysis. However, the numerical solution of these problems typically is computed by first discretizing the problem and then applying tools
In this work we analyze an optimized artificial fixed-stress iteration scheme for the numerical approximation of the Biot system modelling fluid flow in deformable porous media. The iteration is based on a prescribed constant artificial volumetric me
We propose a new cross-conv algorithm for approximate computation of convolution in different low-rank tensor formats (tensor train, Tucker, Hierarchical Tucker). It has better complexity with respect to the tensor rank than previous approaches. The