Related papers: An operator approach to multipoint Pade approximat…
We introduce an extension of interpolation theory to more than two spaces by employing a functional parameter, while retaining a fully functorial and systematic framework. This approach allows for the construction of generalized…
We consider a class of mathematical models describing multiphysics phenomena interacting through interfaces. On such interfaces, the traces of the fields lie (approximately) in the range of a weighted sum of two fractional differential…
This paper provides a general proof of a relationship theorem between nonlinear analogue polynomial equations and the corresponding Jacobian matrix, presented recently by the present author. This theorem is also verified generally effective…
Methods of Pad\'e approximation are used to analyse a multivariate Markov transform which has been recently introduced by the authors, and which is generalizing the well-known in Spectral theory Stieltjes transform (Markov function) of…
We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial…
The relation between the spectral decomposition of a self-adjoint operator which is realizable as a higher order recurrence operator and matrix-valued orthogonal polynomials is investigated. A general construction of such operators from…
In this work we present new results on the convergence of diagonal sequences of certain mixed type Hermite-Pad\'e approximants of a Nikishin system. The study is motivated by a mixed Hermite-Pad\'e approximation scheme used in the…
We give necessary and sufficient conditions for solving the spectral Nevanlinna--Pick lifting problem. This reduces the spectral Nevanlinna--Pick problem to a jet interpolation problem into the symmetrized polydisc.
We consider symmetric Jacobi operators with recurrence coefficients such that the corresponding difference equation is in the limit circle case. Equivalently, this means that the associated moment problem is indeterminate. Our main goal is…
In this paper, the concept of algebroid mappings of complex manifolds is introduced based on that a large number of complex systems of PDEs admit multi-valued solutions that can be defined by a system of independent algebraic equations over…
We present a proximal gradient method for solving convex multiobjective optimization problems, where each objective function is the sum of two convex functions, with one assumed to be continuously differentiable. The algorithm incorporates…
We leverage the connections between nonexpansive maps, monotone Lipschitz operators, and proximal mappings to obtain near-optimal (i.e., optimal up to poly-log factors in terms of iteration complexity) and parameter-free methods for solving…
This paper addresses a class of nonsmooth and nonconvex optimization problems defined on complete Riemannian manifolds. The objective function has a composite structure, combining convex, differentiable, and lower semicontinuous terms,…
Network graphs have become a popular tool to represent complex systems composed of many interacting subunits; especially in neuroscience, network graphs are increasingly used to represent and analyze functional interactions between neural…
We study spaces of reflectionless Jacobi matrices. The main theme is the following type of question: Given a reflectionless Jacobi matrix, is it possible to approximate it by other reflectionless and, typically, simpler Jacobi matrices of a…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
In this paper, we introduce a new three-step iteration process in Banach space and prove convergence results for approximating fixed points for nonexpansive mappings. Also, we show that the newly introduced iteration process converges…
In this paper, we introduce a \textit{Bi-level OPTimization} (BiOPT) framework for minimizing the sum of two convex functions, where both can be nonsmooth. The BiOPT framework involves two levels of methodologies. At the upper level of…
Hamiltonian formulation of N=3 systems is considered in general. The Jacobi equation is solved in three classes. Compatible Poisson structures in these classes are determined and explicitly given. The corresponding bi-Hamiltonian systems…
The main purpose of the paper is to present some powerful data on the advantage of the rational approximation procedure based on Hermite-Pad\'e polynomials over the Pad\'e approximation procedure. The first part of the paper is devoted to…