Related papers: $S$-nodes, factorisation of spectral matrix functi…
Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…
In every dimension $d \geq 2$, we give an explicit formula that expresses the values of any Schwartz function on $\mathbb{R}^d$ only in terms of its restrictions, and the restrictions of its Fourier transform, to all origin-centered spheres…
A fast and reliable algorithm for the optimal interpolation of scattered data on the torus by multivariate trigonometric polynomials is presented. The algorithm is based on a variant of the conjugate gradient method in combination with the…
The scattering problems arising when considering the contribution of the topologically inequivalent configurations of the spinors on Reissner-Nordstr\"{o}m black holes to the Hawking radiation are correctly stated. The corresponding…
Spatial field correlation functions represent a key quantity for the description of mesoscopic phenomena in disordered media and the optical characterization of complex materials. Yet many aspects related to the vector nature of light waves…
Scattering-type scanning near-field optical microscope (s-SNOM) has become an essential tool to study polaritons - quasiparticles of light coupled to collective charge oscillations - via direct probing of their near field with a spatial…
In astrophysical and cosmological analyses, the increasing quality and volume of astronomical data demand efficient and precise computational tools. This work introduces a novel adaptive algorithm for automatic knots (AutoKnots) allocation…
We consider the Sobolev norms of the pointwise product of two functions, and estimate from above and below the constants appearing in two related inequalities.
The nonnegative matrix factorization is a widely used, flexible matrix decomposition, finding applications in biology, image and signal processing and information retrieval, among other areas. Here we present a related matrix factorization.…
Let $A_p(\C)$ be the space of entire functions such that $| f(z)|\le Ae^{Bp(z)}$ for some $A,B>0$ and let $V$ be a discrete sequence of complex numbers which is not a uniqueness set for $A_p(\C)$. We use $L^2$ estimates for the…
By constructing a new coupling, the log-Harnack inequality is established for the functional solution of a delay stochastic differential equation with multiplicative noise. As applications, the strong Feller property and heat kernel…
We consider the isomorphism problem for formal matrix rings over a given ring. Principal factor matrices of such rings play an important role in this case. The work is supported by Russian Scientific Foundation, project 23-21-00375 (P.A.…
Decomposition of large matrix inequalities for matrices with chordal sparsity graph has been recently used by Kojima et al.\ \cite{kim2011exploiting} to reduce problem size of large scale semidefinite optimization (SDO) problems and thus…
Branes and defects in topological Landau-Ginzburg models are described by matrix factorisations. We revisit the problem of deforming them and discuss various deformation methods as well as their relations. We have implemented these…
In this paper, we tackle two important problems in low-rank learning, which are partial singular value decomposition and numerical rank estimation of huge matrices. By using the concepts of Krylov subspaces such as Golub-Kahan…
We study the number of ways of factoring elements in the complex reflection groups G(r,s,n) as products of reflections. We prove a result that compares factorization numbers in G(r,s,n) to those in the symmetric group on n letters, and we…
This note discusses an interesting matrix factorization called the CUR Decomposition. We illustrate various viewpoints of this method by comparing and contrasting them in different situations. Additionally, we offer a new characterization…
We consider the interpolation problem with the inverse multiquadric radial basis function. The problem usually produces a large dense linear system that has to be solved by iterative methods. The efficiency of such methods is strictly…
We introduce a Generalized Randomized QR-decomposition that may be applied to arbitrary products of matrices and their inverses, without needing to explicitly compute the products or inverses. This factorization is a critical part of a…
The present paper concerns filtered de la Vall\'ee Poussin (VP) interpolation at the Chebyshev nodes of the four kinds. This approximation model is interesting for applications because it combines the advantages of the classical Lagrange…