A Markov chain-based multi-elimination preconditioner for elliptic PDE problems

DOI10.1016/j.cam.2019.05.020zbMath1416.65420OpenAlexW2946867226WikidataQ127819490 ScholiaQ127819490MaRDI QIDQ2315871

Yu-Tse Chien, Feng-Nan Hwang

Publication date: 26 July 2019

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2019.05.020

zbMATH Keywords

Markov chainNeumann seriesrandom walkparallel processingGPUmulti-elimination preconditioner

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (1)

Preconditioned iterative method for boundary value method discretizations of a parabolic optimal control problem

Uses Software

• CUDA
• PETSc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel preconditioned conjugate gradient algorithm on GPU
• M-matrix characterizations. I: nonsingular M-matrices
• Preconditioning techniques for large linear systems: A survey
• Random walk method for the two‐ and three‐dimensional Laplace, Poisson and Helmholtz's equations
• Stochastic Preconditioning for Diagonally Dominant Matrices
• Decay Rates for Inverses of Band Matrices
• Solution of partial differential equations by a modified random walk

This page was built for publication: A Markov chain-based multi-elimination preconditioner for elliptic PDE problems