2010
DOI: 10.1016/j.parco.2010.05.004
|View full text |Cite
|
Sign up to set email alerts
|

CARP-CG: A robust and efficient parallel solver for linear systems, applied to strongly convection dominated PDEs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
41
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 37 publications
(42 citation statements)
references
References 23 publications
1
41
0
Order By: Relevance
“…CARP-CG is a CG acceleration of CARP (component-averaged row projections) [11], which is a block-parallel extension of KACZ -the Kaczmarz algorithm [17]. KACZ is inherently sequential: starting from an arbitrary initial point, it sweeps through the equations by successively projecting the current iterate towards the hyperplane defined by the next equation.…”
Section: Solvermentioning
confidence: 99%
“…CARP-CG is a CG acceleration of CARP (component-averaged row projections) [11], which is a block-parallel extension of KACZ -the Kaczmarz algorithm [17]. KACZ is inherently sequential: starting from an arbitrary initial point, it sweeps through the equations by successively projecting the current iterate towards the hyperplane defined by the next equation.…”
Section: Solvermentioning
confidence: 99%
“…This algorithm is mainly suitable for parallel architectures. Further advancement in increasing the rate of convergence was achieved by the Component Average Row Projection (CARP) method introduced by Gordon and Gordon (2005). From all the above methods, CARP is more generalized and places no restriction on the system matrix or the selection of blocks.…”
Section: Distributed Tomography Algorithmsmentioning
confidence: 99%
“…This algorithm also contains landlords; however, information in these landlords differs from those of DMET as we are performing row partitioning. Few iterations of stable KACZ for inconsistent systems are run on each landlord and the intermediate results are later combined with others using a technique called component average (Gordon & Gordon, 2005). The information exchanged at each iteration is less compared to what is required to transfer the raw data, and for this reason we use a treebased aggregation scheme similar to the one used in the OASIS project.…”
Section: Component-average Distributed Multiresolution Evolving Tomogmentioning
confidence: 99%
“…The latter does not make these approaches very attractive for inversion since the medium parameters will change from one iteration to the next, possibly requiring the tuning parameters to be changed as well. Instead, we use CARP-CG [14,15], a generic, iterative solution technique for sparse linear systems based on the CGMN method [5]. Convergence of this method is guaranteed, making it an attractive solver for inversion purposes.…”
Section: Iterative Solvermentioning
confidence: 99%
“…As such, its implementation resembles an additive Schwarz approach, however, CARP-CG is guaranteed to converge. For details we refer the reader to [14,15]. The use of CARP-CG to solve the Helmholtz equation specifically is described by [16,17].…”
Section: Cgmnmentioning
confidence: 99%