Related papers: On parallel multisplitting block iterative methods…
In this paper we develop random block coordinate gradient descent methods for minimizing large scale linearly constrained separable convex problems over networks. Since we have coupled constraints in the problem, we devise an algorithm that…
In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone…
We consider the generalized successive overrelaxation (GSOR) method for solving a class of block three-by-three saddle-point problems. Based on the necessary and sufficient conditions for all roots of a real cubic polynomial to have modulus…
In this paper we consider a fully third order nonlinear boundary value problem which is of great interest of many researchers. First we establish the existence, uniqueness of solution. Next, we propose simple iterative methods on both…
The aim of this article is to present two different primal-dual methods for solving structured monotone inclusions involving parallel sums of compositions of maximally monotone operators with linear bounded operators. By employing some…
In this paper, we consider a numerical method to solve scattering problems with multi-periodic layers with different periodicities. The main tool applied in this paper is the Bloch transform. With this method, the problem is written into an…
This paper deals with speeding up the convergence of a class of two-step iterative methods for solving linear systems of equations. To implement the acceleration technique, the residual norm associated with computed approximations for each…
We study the convergence of iterative linear solvers for discontinuous Galerkin discretizations of systems of hyperbolic conservation laws with polygonal mesh elements compared with that of traditional triangular elements. We solve the…
Iterative refinement (IR) is a popular scheme for solving a linear system of equations based on gradually improving the accuracy of an initial approximation. Originally developed to improve upon the accuracy of Gaussian elimination,…
This paper presents an iteration method for solving linear particle transport problems in binary stochastic mixtures. It is based on nonlinear projection approach. The method is defined by a hierarchy of equations consisting of the…
The efficient solution of moderately large-scale linear systems arising from the KKT conditions in optimal control problems (OCPs) is a critical challenge in robotics. With the stagnation of Moore's law, there is growing interest in…
In this paper, we provide a unified iteration complexity analysis for a family of general block coordinate descent (BCD) methods, covering popular methods such as the block coordinate gradient descent (BCGD) and the block coordinate…
We use the local orthogonal decomposition technique to derive a generalized finite element method for linear and semilinear parabolic equations with spatial multiscale diffusion coefficient. We consider nonsmooth initial data and a backward…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
The main computational cost of algorithms for computing reduced-order models of parametric dynamical systems is in solving sequences of very large and sparse linear systems. We focus on efficiently solving these linear systems, arising…
We present new algorithms for the parallelization of Eulerian-Lagrangian interaction operations in the immersed boundary method. Our algorithms rely on two well-studied parallel primitives: key-value sort and segmented reduce. The use of…
The least square solution of minimum norm of a rectangular linear system of equations can be found out iteratively by using matrix splittings. However, the convergence of such an iteration scheme arising out of a matrix splitting is…
We prove first-order convergence of the semi-explicit Euler scheme combined with a finite element discretization in space for elliptic-parabolic problems which are weakly coupled. This setting includes poroelasticity, thermoelasticity, as…
The main goal of this paper is to generalize Jacobi and Gauss-Seidel methods for solving non-square linear system. Towards this goal, we present iterative procedures to obtain an approximate solution for non-square linear system. We derive…
Consider the problem of minimizing the sum of a smooth convex function and a separable nonsmooth convex function subject to linear coupling constraints. Problems of this form arise in many contemporary applications including signal…