The modified Hermitian and skew-Hermitian splitting (MHSS) iteration method and preconditioned MHSS (PMHSS) iteration method were introduced respectively. In the paper, on the basis of the MHSS iteration method, we present a PMHSS iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and complex symmetric positive definite/semi-definite matrices. Under suit...

A generalization of Halpern’s iteration is investigated on a compact convex subset of a smooth Banach space. The modified iteration process consists of a combination of a viscosity term, an external sequence, and a continuous nondecreasing function of a distance of points of an external sequence, which is not necessarily related to the solution of Halpern’s iteration, a contractive mapping, and...

The purpose of this paper is to employ an alternative approach to reconstruct the standard variational iteration algorithm II proposed by He, including Lagrange multiplier, and to give a simpler formulation of Adomian decomposition and modified Adomian decomposition method in terms of newly proposed variational iteration method-II (VIM). Through careful investigation of the earlier variational ...

Lipman Halpern was born in 1902 into a family of Grand Rabbis who lived in Bialystok from the mid-nineteenth century. Inspired by his son's decision to study medicine, Halpern's father authored a comprehensive and innovative book on medicine according to Rabbinic Law. After completing his initial medical studies in Königsberg, Halpern went on to specialize in neuropsychiatry in Berlin and then ...

We consider the stochastic shortest path problem, a classical finite-state Markovian decision problem with a termination state, and we propose new convergent Q-learning algorithms that combine elements of policy iteration and classical Q-learning/value iteration. These algorithms are related to the ones introduced by the authors for discounted problems in Bertsekas and Yu (Math. Oper. Res. 37(1...