New parallel symmetric SOR preconditioners by multi-type partitioning

DOI10.1080/00207160801965313MaRDI QIDQ3603603zbMATH OpenOpenAlexFDO

Authors Dexuan Xie

Publication date 18 February 2009

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160801965313

zbMATH Keywords

convergencenumerical examplesdomain decompositionparallel computingpreconditioned conjugate gradientsuccessive over-relaxationgeneral block linear systemmulti-type partitionSSOR preconditioner

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Recommendations

• Additive polynomial preconditions for parallel computers
• Improved SSOR and incomplete Cholesky solution of linear equations on shared memory and distributed memory parallel computers
• Parallel SSOR preconditioning for lattice QCD
• SOR as a preconditioner. II
• Parallel block preconditioning based on SSOR and MILU

Cites work

• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A New Block Parallel SOR Method and Its Analysis
• Block colouring schemes for the SOR method on local memory parallel computers
• Iterative solution of large sparse systems of equations. Transl. from the German
• Large tridiagonal and block tridiagonal linear systems on vector and parallel computers
• New Parallel SOR Method by Domain Partitioning
• On Vectorizing Incomplete Factorization and SSOR Preconditioners
• Orderings for Parallel Conjugate Gradient Preconditioners
• Parallel SSOR preconditioning for lattice QCD

Cited in

(1)

• Additive polynomial preconditions for parallel computers

This page was built for publication: New parallel symmetric SOR preconditioners by multi-type partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603603)