A note on the efficiency of the conjugate gradient method for a class of time-dependent problems

DOI10.1002/nla.527zbMath1199.65098OpenAlexW2035892225WikidataQ58210470 ScholiaQ58210470MaRDI QIDQ3392848

Aslak Tveito, Bjørn Fredrik Nielsen, Xing Cai

Publication date: 17 August 2009

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.527

zbMATH Keywords

numerical experimentsconjugate gradient methodmultigrid methodpreconditionerparabolic equationsKrylov subspacesparse symmetric positive definite matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Initial-boundary value problems for second-order parabolic equations (35K20) Iterative numerical methods for linear systems (65F10) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Preconditioners for iterative methods (65F08)

Uses Software

• Diffpack

Cites Work

• Unnamed Item

This page was built for publication: A note on the efficiency of the conjugate gradient method for a class of time-dependent problems