AbstractThis paper proceeds in two directions of attack for finding (iteratively) solutions for linear systems on Hilbert space. First, we consider scalar-dependent Overrelaxation as a special case of operator-dependent overrelaxations. Secondly, we study “finer” splittings than the conventional two-part splittings and show where, in some cases, these new splittings can either accelerate convergence of approximating sequences derived from two-part splittings or else turn divergent sequences into convergent ones
AbstractWe extend the convergence theory of the extrapolated successive overrelaxation method by con...
AbstractA subproper splitting of a matrix A is a decomposition A = B − C such that the kernel of A i...
Monotone Inklusionen kommen oft und in natürlicher Weise vor, wenn Optimierungsprobleme oder Differe...
AbstractThis paper proceeds in two directions of attack for finding (iteratively) solutions for line...
summary:We study the convergence of the iterations in a Hilbert space $V,x_{k+1}=W(P)x_k, W(P)z=w=T(...
AbstractGiven a linear system with an H-matrix, a splitting of Varga's type is considered, and a con...
AbstractThe symmetric successive overrelaxation (SSOR) iterative method is applied to the solution o...
AbstractWe explore iterative schemes for obtaining a solution to the linear system (∗) Ax = b, A ϵ C...
AbstractNecessary and sufficient convergence conditions are studied for splitting iteration methods ...
AbstractWe study convergence conditions for the additive and the multiplicative splitting iteration ...
AbstractThe modified overrelaxation (MSOR) method is applied to a linear system Ax=b, where A has pr...
AbstractRecently, Lee et al. [Young-ju Lee, Jinbiao Wu, Jinchao Xu, Ludmil Zikatanov, On the converg...
AbstractCovering the last half of the 20th century, we present some of the basic and well-known resu...
Let Ax = b be a rectricted rectangular and consistent linear system, where A is an m by n matrix and...
This thesis is concerned with the design and analysis of algorithms that solve nonsmooth convex opti...
AbstractWe extend the convergence theory of the extrapolated successive overrelaxation method by con...
AbstractA subproper splitting of a matrix A is a decomposition A = B − C such that the kernel of A i...
Monotone Inklusionen kommen oft und in natürlicher Weise vor, wenn Optimierungsprobleme oder Differe...
AbstractThis paper proceeds in two directions of attack for finding (iteratively) solutions for line...
summary:We study the convergence of the iterations in a Hilbert space $V,x_{k+1}=W(P)x_k, W(P)z=w=T(...
AbstractGiven a linear system with an H-matrix, a splitting of Varga's type is considered, and a con...
AbstractThe symmetric successive overrelaxation (SSOR) iterative method is applied to the solution o...
AbstractWe explore iterative schemes for obtaining a solution to the linear system (∗) Ax = b, A ϵ C...
AbstractNecessary and sufficient convergence conditions are studied for splitting iteration methods ...
AbstractWe study convergence conditions for the additive and the multiplicative splitting iteration ...
AbstractThe modified overrelaxation (MSOR) method is applied to a linear system Ax=b, where A has pr...
AbstractRecently, Lee et al. [Young-ju Lee, Jinbiao Wu, Jinchao Xu, Ludmil Zikatanov, On the converg...
AbstractCovering the last half of the 20th century, we present some of the basic and well-known resu...
Let Ax = b be a rectricted rectangular and consistent linear system, where A is an m by n matrix and...
This thesis is concerned with the design and analysis of algorithms that solve nonsmooth convex opti...
AbstractWe extend the convergence theory of the extrapolated successive overrelaxation method by con...
AbstractA subproper splitting of a matrix A is a decomposition A = B − C such that the kernel of A i...
Monotone Inklusionen kommen oft und in natürlicher Weise vor, wenn Optimierungsprobleme oder Differe...