Related papers: An Iterative Wiener--Hopf method for triangular ma…
The goal of this paper is to give a new method of constructing finite-dimensional semisimple triangular Hopf algebras, including minimal ones which are non-trivial (i.e. not group algebras). The paper shows that such Hopf algebras are quite…
We investigate the problem of approximating the matrix function $f(A)$ by $r(A)$, with $f$ a Markov function, $r$ a rational interpolant of $f$, and $A$ a symmetric Toeplitz matrix. In a first step, we obtain a new upper bound for the…
Recently we developed a new sampling methodology based on incomplete cosine expansion of the sinc function and applied it in numerical integration in order to obtain a rational approximation for the complex error function $w\left(z \right)…
We consider matrix functions with certain invariance under inversion in the unit circle. If such a function satisfies a positivity assumption on the unit circle, then only zero partial indices appear in its Riemann-Hilbert (Wiener-Hopf)…
In this paper we study the optimal stopping problem for L\'evy processes studied by Novikov and Shiryayev, Stochastics, 2007 In particular, we are interested in finding the representing measure of the value function. It is seen that that…
In this paper we extend a method for iteratively improving slow manifolds so that it also can be used to approximate the fiber directions. The extended method is applied to general finite dimensional real analytic systems where we obtain…
In this paper, we discuss adaptive approximations of an elliptic eigenvalue optimization problem in a phase-field setting by a conforming finite element method. An adaptive algorithm is proposed and implemented in several two dimensional…
We consider an inertial primal-dual fixed point algorithm (IPDFP) to compute the minimizations of the following Problem (1.1). This is a full splitting approach, in the sense that the nonsmooth functions are processed individually via their…
For a large class of polynomials, the standard method of polynomial evaluation, Horner's method, can be very inaccurate. The alternative method given here is on average 100 to 1000 times more accurate than Horner's Method. The number of…
The problem of iterated partial summations is solved for some discrete distributions defined on discrete supports. The power method, usually used as a computational approach to finding matrix eigenvalues and eigenvectors, is in some cases…
This work develops user-friendly a posteriori error estimates of finite element methods, based on smoothers of linear iterative solvers. The proposed method employs simple smoothers, such as Jacobi or Gauss-Seidel iteration, on an auxiliary…
In this work we present a low-rank algorithm for computing low-rank approximations of large-scale Lyapunov operator $\varphi$-functions. These computations play a crucial role in implementing of matrix-valued exponential integrators for…
In this short article, we state a Hopf type lemma for fractional equations and the outline of its proof. We believe that it will become a powerful tool in applying the method of moving planes on fractional equations to obtain qualitative…
Due to the explosive growth of large-scale data sets, tensors have been a vital tool to analyze and process high-dimensional data. Different from the matrix case, tensor decomposition has been defined in various formats, which can be…
We consider the problem of approximating the solution of variational problems subject to the constraint that the admissible functions must be convex. This problem is at the interface between convex analysis, convex optimization, variational…
This article is the first of a series of three presenting an alternative method to compute the one-loop scalar integrals. This novel method enjoys a couple of interesting features as compared with the method closely following 't Hooft and…
In this paper we study the auxiliary problems that appear in $p$-order tensor methods for unconstrained minimization of convex functions with $\nu$-H\"{o}lder continuous $p$th derivatives. This type of auxiliary problems corresponds to the…
To approximate solutions of a linear differential equation, we project, via trigonometric interpolation, its solution space onto a finite-dimensional space of trigonometric polynomials and construct a matrix representation of the…
Finding suitable points for multivariate polynomial interpolation and approximation is a challenging task. Yet, despite this challenge, there has been tremendous research dedicated to this singular cause. In this paper, we begin by…
The anisotropic diffusion equation is imperative in understanding cosmic ray diffusion across the Galaxy, the heliosphere, and its interplay with the ambient magnetic field. This diffusion term contributes to the highly stiff nature of the…