Logarithmically convergent relaxation computation

MaRDI QIDQ2455288zbMATH OpenFDO

Authors A. A. Boltnev, N. N. Kalitkin, O. A. Kacher

Publication date 22 October 2007

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergenceboundary value problemelliptic operatorfactorizationthree-point difference approximation

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Finite difference methods for boundary value problems involving PDEs (65N06) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12)

Recommendations

• Convergence properties of relaxation algorithms
• Convergence acceleration of logarithmic fixed point sequences
• Convergence of the relaxed Newton's method
• Convergence of relaxation algorithms by averaging
• Publication:4867024
• On combined relaxation methods' convergence rates
• Computation of logarithmic capacity
• scientific article; zbMATH DE number 5005
• Computational aspects of relaxation complexity
• Approximation in (poly-) logarithmic space

Cited in

(5)

• scientific article; zbMATH DE number 5877344 (Why is no real title available?)
• Analogue of the Richardson method for logarithmically converging time marching
• Speculatively Redundant Continued Logarithm Representation
• Evolutional factorization and super fast relaxation count
• Regressive computations characterize logarithmic space

This page was built for publication: Logarithmically convergent relaxation computation

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