Comparative analysis of marching algorithms for separable elliptic problems

DOI10.1007/3-540-45262-1_10MaRDI QIDQ2724477zbMATH OpenFDO

Authors Gergana Bencheva

Publication date 12 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45262-1_10

zbMATH Keywords

computational complexityfast elliptic solversfinite difference methodfinite element methodmarching algorithmsnumerical experimentssecond-order elliptic problemsstability

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Direct numerical methods for linear systems and matrix inversion (65F05) Finite difference methods for boundary value problems involving PDEs (65N06) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• scientific article; zbMATH DE number 4064412
• Symmetric marching technique for the numerical solution of nonseparable elliptic equations
• Matrix decomposition algorithms for separable elliptic boundary value problems in two space dimensions
• scientific article; zbMATH DE number 58734
• scientific article; zbMATH DE number 893958

Cited in

(4)

• Symmetric marching technique for the numerical solution of nonseparable elliptic equations
• scientific article; zbMATH DE number 4064412 (Why is no real title available?)
• scientific article; zbMATH DE number 781221 (Why is no real title available?)
• scientific article; zbMATH DE number 870557 (Why is no real title available?)

This page was built for publication: Comparative analysis of marching algorithms for separable elliptic problems

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