Related papers: Subresultants, Sylvester sums and the rational int…
We construct spectral decomposition of 1D Fokker - Planck differential operator. This reveal solution of Cauchy problem. We develop fundamental solution of Cauchy problem and compare it with one obtained by other means in our former work…
We propose a new approach to construct the eigenvalue expansion in a weighted Hilbert space of the solution to the Cauchy problem associated to Gauss-Laguerre invariant Markov semigroups that we introduce. Their generators turn out to be…
Given any solution $u$ of the Euler equations which is assumed to have some regularity in space - in terms of Besov norms, natural in this context - we show by interpolation methods that it enjoys a corresponding regularity in time and that…
Subresultant is a powerful tool for developing various algorithms in computer algebra. Subresultants for polynomials in standard basis (i.e., power basis) have been well studied so far. With the popularity of basis-preserving algorithms,…
The Cauchy problem for harmonic maps from Minkowski space with its standard flat metric to a certain non-constant curvature Lorentzian 2-metric is studied. The target manifold is distinguished by the fact that the Euler-Lagrange equation…
In this paper, we use some Fourier analysis techniques to find an exact solution to the Cauchy problem for the $n$-dimensional biwave equation in the upper half-space $\mathbb{R}^n\times [0,+\infty)$.
We study certain generalized Cauchy integral formulas for gradients of solutions to second order divergence form elliptic systems, which appeared in recent work by P. Auscher and A. Ros\'en. These are constructed through functional calculus…
The interrelation between analytic functions and real-valued functions is formulated in the work. It is shown such an interrelation realizes nonlinear representations for real-valued functions that allows to develop new methods of…
Linear interpolation inequalities that combine Hardy's inequality with sharp Sobolev embedding are obtained using classical arguments of Hardy and Littlewood (Bliss lemma). Such results are equivalent to Caffarelli-Kohn-Nirenberg…
We consider Lagrange interpolation on the set of finitely many intervals. This problem is closely related to the least deviating polynomial from zero on such sets. We will obtain lower and upper estimates for the corresponding Lebesgue…
A novel tensor-based formula for solving the linear systems involving Kronecker sum is proposed. Such systems are directly related to the matrix and tensor forms of Sylvester equation. The new tensor-based formula demonstrates the…
Simulating quantum systems with their environments often requires non-unitary operations, and mapping these to quantum devices often involves expensive dilations or prohibitive measurement costs to achieve desired precisions. Building on…
To the best of our knowledge this paper is the first attempt to introduce and study polynomial interpolation of the polynomial data given on arbitrary varieties. In the first part of the paper we present results on the solvability of such…
We study in this paper the function approximation error of linear interpolation and extrapolation. Several upper bounds are presented along with the conditions under which they are sharp. All results are under the assumptions that the…
Following the approach of Rota and Taylor \cite{SIAM}, we present an innovative theory of Sheffer sequences in which the main properties are encoded by using umbrae. This syntax allows us noteworthy computational simplifications and…
The rational covariance extension problem to determine a rational spectral density given a finite number of covariance lags can be seen as a matrix completion problem to construct an infinite-dimensional positive-definite Toeplitz matrix…
In this paper, we study the Cauchy problem for the focusing nonlinear short-pluse equation by using $\overline\partial$ steepest descent method. \begin{align} &u_{xt}=u+\frac{1}{6}(u^3)_{xx}, \nonumber\\ &u(x,0)=u_0(x)\in…
The object of this paper is to introduce a new and fascinating method of solving large linear equations, based on Cramer's rule or Gaussian elimination but employing Sylvester's determinant identity in its computation process. In addition,…
It is possible to generalize the fruitful interaction between (real or complex) Jacobi matrices, orthogonal polynomials and Pade approximants at infinity by considering rational interpolants, (bi-)orthogonal rational functions and linear…
Inverse Vandermonde matrix calculation is a long-standing problem to solve nonsingular linear system $Vc=b$ where the rows of a square matrix $V$ are constructed by progression of the power polynomials. It has many applications in…