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

DOI10.1002/NLA.527zbMATH Open1199.65098DBLPjournals/nla/CaiNT07OpenAlexW2035892225WikidataQ58210470 ScholiaQ58210470MaRDI QIDQ3392848FDOQ3392848

Authors: Xing Cai, Bjørn Fredrik Nielsen, Aslak Tveito 

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

Recommendations

• Publication:3471625
• Conjugate gradient algorithms and the Galerkin boundary element method
• Using preconditioned conjugate gradient for solving consecutive linear systems
• scientific article; zbMATH DE number 4039123
• Differentiating the method of conjugate gradients

zbMATH Keywords

numerical experimentsparabolic equationspreconditionerconjugate gradient methodKrylov subspacemultigrid methodsparse symmetric positive definite matrix

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (1)

• Iterative accelerating algorithms with Krylov subspaces for the solution to large-scale nonlinear problems

Uses Software

• Diffpack

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

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