in this paper‎, ‎we study convergence behavior of the global fom (gl-fom) and global gmres (gl-gmres) methods for solving the matrix equation $axb=c$ where $a$ and $b$ are symmetric positive definite (spd)‎. ‎we present some new theoretical results of these methods such as computable exact expressions and upper bounds for the norm of the error and residual‎. ‎in particular‎, ‎the obtained upper...

There exist efficient algorithms to project a point onto the intersection of a convex cone and an affine subspace. Those conic projections are in turn the work-horse of a range of algorithms in conic optimization, having a variety of applications in science, finance and engineering. This chapter reviews some of these algorithms, emphasizing the so-called regularization algorithms for linear con...

Local projection methods which yield c'm_1) piecewise polynomials of order m + k as approximate solutions of a boundary value problem for an mth order ordinary differential equation are determined by the k linear functional at which the residual error in each partition interval is required to vanish on. We develop a condition on these k f unctionals which implies breakpoint superconvergence (of...