Some features of modern computational mathematics: problems and new generation of algorithms

MaRDI QIDQ3366119zbMATH OpenFDO

Authors Y. M. Laevsky

Publication date 13 February 2006

zbMATH Keywords

algorithmsdomain decompositionfinite element methodheat equationmathematical physicspreconditionersiterative solutionmultigrid methodmultilevel methodssecond-order elliptic equationsnon-stationary problemslarge-size problems

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Boundary value problems for second-order elliptic equations (35J25) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Recommendations

• scientific article; zbMATH DE number 1979681
• Editorial: Efficient algorithms for large scale scientific computations: introduction
• scientific article; zbMATH DE number 733797
• Iterative preconditioned methods in Krylov spaces: trends of the 21st century
• scientific article; zbMATH DE number 1535645

Cited in

(3)

• Numerical algorithms for high-performance computational science
• scientific article; zbMATH DE number 733797 (Why is no real title available?)
• Methods of evaluation and scale of functional spaces

This page was built for publication: Some features of modern computational mathematics: problems and new generation of algorithms

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