Related papers: Universal algorithms for generalized discrete matr…
This paper is a survey on universal algorithms for solving the matrix Bellman equations over semirings and especially tropical and idempotent semirings. However, original algorithms are also presented. Some applications and software…
Solving the Toeplitz systems, which is to find the vector $x$ such that $T_nx = b$ given an $n\times n$ Toeplitz matrix $T_n$ and a vector $b$, has a variety of applications in mathematics and engineering. In this paper, we present a…
The generalized symmetry method is applied to a class of completely discrete equations including the Adler-Bobenko-Suris list. Assuming the existence of a generalized symmetry, we derive a few integrability conditions suitable for testing…
In this paper, we propose new algorithms for finding a common point of the solution set of a pseudomonotone equilibrium problem and the set of fixed points of a symmetric generalized hybrid mapping in a real Hilbert space. The convergence…
This is a survey paper on applications of mathematics of semirings to numerical analysis and computing. Concepts of universal algorithm and generic program are discussed. Relations between these concepts and mathematics of semirings are…
An approach to the construction of index formulas for elliptic operators on singular manifolds is suggested on the basis of K-theory of algebras and cyclic cohomology. The equivalence of Toeplitz and pseudodifferential quantizations, well…
We focus on the linear convergence of generalized proximal point algorithms for solving monotone inclusion problems. Under the assumption that the associated monotone operator is metrically subregular or that the inverse of the monotone…
The concept of a universal algorithm is discussed. Examples of this kind of algorithms are presented. Software implementations of such algorithms in C++ type languages are discussed together with means that provide for computations with an…
We study Toeplitz operators with uniformly continuous symbols on generalized harmonic Bergman spaces of the unit ball in $\mathbb{R}^n$. We describe their essential spectra and establish a short exact sequence associated with the…
We investigate the joint convergence of independent random Toeplitz matrices with complex input entries that have a pair-correlation structure, along with deterministic Toeplitz matrices and the backward identity permutation matrix.…
In this paper we derive a Toeplitz-structured closed form of the unique positive semi-definite stabilizing solution for the discrete-time algebraic Riccati equations, especially for the case that the state matrix is not stable. Based on the…
An infinite dimensional algebra, which is useful for deriving exact solutions of the generalized pairing problem, is introduced. A formalism for diagonalizing the corresponding Hamiltonian is also proposed. The theory is illustrated with…
In this paper we derive new uniform convergence estimates for the V-cycle MGM applied to symmetric positive definite Toeplitz block tridiagonal matrices, by also discussing few connections with previous results. More concretely, the…
Under binary matrices we mean matrices whose entries take one of two values. In this paper, explicit formulae for calculating the determinant of some type of binary Toeplitz matrices are obtained. Examples of the application of the…
We propose a high precision algorithm for solving the Gelfand-Levitan-Marchenko equation. The algorithm is based on the block version of the Toeplitz Inner-Bordering algorithm of Levinson's type. To approximate integrals, we use the…
In [7], a new iterative method for solving linear system of equations was presented which can be considered as a modification of the Gauss-Seidel method. Then in [4] a different approach, say 2D-DSPM, and more effective one was introduced.…
A generalized exponential matrix based on the construction of kernel operators for generalized summability is defined and analyzing its main properties, generalizing the classical exponential matrix and fractional exponential matrix. This…
The randomized Kaczmarz algorithm is one of the most popular approaches for solving large-scale linear systems due to its simplicity and efficiency. In this paper, we propose two classes of global randomized Kaczmarz methods for solving…
We consider continuous linear programs over a continuous finite time horizon $T$, with a constant coefficient matrix, linear right hand side functions and linear cost coefficient functions, where we search for optimal solutions in the space…
Basing on a modification of the "Dichotomy Algorithm" (Terekhov, 2010), we propose a parallel procedure for solving tridiagonal systems of equations with Toeplitz matrices. Taking the structure of the Toeplitz matrices, we may substantially…