Related papers: An Iterative Wiener--Hopf method for triangular ma…
The theory of matrix splitting is a useful tool for finding solution of rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit theory of weak regular splittings for rectangular…
In this paper, a class of smoothing modulus-based iterative method was presented for solving implicit complementarity problems. The main idea was to transform the implicit complementarity problem into an equivalent implicit fixed-point…
In general, matrix or tensor-valued functions are approximated using the method developed for vector-valued functions by transforming the matrix-valued function into vector form. This paper proposes a tensor-based interpolation method to…
We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…
Several applied problems are characterized by the need to numerically solve equations with an operator function (matrix function). In particular, in the last decade, mathematical models with a fractional power of an elliptic operator and…
While the theory of operator approximation with any given accuracy is well elaborated, the theory of {best constrained} constructive operator approximation is still not so well developed. Despite increasing demands from applications this…
In this paper we consider the computation of approximate solutions for inverse problems in Hilbert spaces. In order to capture the special feature of solutions, non-smooth convex functions are introduced as penalty terms. By exploiting the…
As in the paper [G. Groenewald, M.A. Kaashoek, A.C.M. Ran, Wiener-Hopf indices of unitary functions on the unit circle in terms of realizations and related results on Toeplitz operators. \emph{Indag. Math.} 28 (2017) 694--710] our aim is to…
In this article we apply proper splittings of matrices to develop an iterative process to approximate solutions of matrix equations of the form TX = W. Moreover, by using the partial order induced by positive semidefinite matrices, we…
This paper presents a probabilistic perspective on iterative methods for approximating the solution $\mathbf{x}_* \in \mathbb{R}^d$ of a nonsingular linear system $\mathbf{A} \mathbf{x}_* = \mathbf{b}$. In the approach a standard iterative…
We study randomized sketching methods for approximately solving least-squares problem with a general convex constraint. The quality of a least-squares approximation can be assessed in different ways: either in terms of the value of the…
In this paper we propose a novel algorithm, factored value iteration (FVI), for the approximate solution of factored Markov decision processes (fMDPs). The traditional approximate value iteration algorithm is modified in two ways. For one,…
We show, that the Complex Step approximation to the Fr\'echet derivative of real matrix functions is applicable to the matrix sign, square root and polar mapping using iterative schemes. While this property was already discovered for the…
We propose an iterative estimating equations procedure for analysis of longitudinal data. We show that, under very mild conditions, the probability that the procedure converges at an exponential rate tends to one as the sample size…
Some variants of the numerical Picard iterations method are presented to solve an IVP for an ordinary differential system. The term numerical emphasizes that a numerical solution is computed. The method consists in replacing the right hand…
We proposed an iterate scheme for solving convex-concave saddle-point problems associated with general convex-concave functions. We demonstrated that when our iterate scheme is applied to a special class of convex-concave functions, which…
We develop the Akhiezer iteration, a generalization of the classical Chebyshev iteration, for the inner product-free, iterative solution of indefinite linear systems using orthogonal polynomials for measures supported on multiple, disjoint…
We describe a strategy for solving nonlinear eigenproblems numerically. Our approach is based on the approximation of a vector-valued function, defined as solution of a non-homogeneous version of the eigenproblem. This approximation step is…
Motivated principally by the low-rank matrix completion problem, we present an extension of the Frank-Wolfe method that is designed to induce near-optimal solutions on low-dimensional faces of the feasible region. This is accomplished by a…
This article is concerned with the numerical solution of convex variational problems. More precisely, we develop an iterative minimisation technique which allows for the successive enrichment of an underlying discrete approximation space in…