An almost optimal method for Dirichlet problems on decomposition subdomains of the hierarchical \(hp\)-version

DOI10.1023/A:1011970023932zbMath1013.65135OpenAlexW334763611MaRDI QIDQ1603186

V. G. Korneev

Publication date: 17 June 2003

Published in: Differential Equations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011970023932

zbMATH Keywords

computational complexityDirichlet problemdiscrete Fourier transformpreconditionerdomain decomposition methodThomas methodfinite-difference operatorCholesky elimination methodfast inversion method

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical computation of matrix norms, conditioning, scaling (65F35) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Numerical methods for discrete and fast Fourier transforms (65T50) Finite difference methods for boundary value problems involving PDEs (65N06) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

Fast domain decomposition algorithm discretizations of 3-d elliptic equations by spectral elements ⋮ A domain decomposition preconditioner for \(p\)-FEM discretizations of two-dimensional elliptic problems ⋮ Overlapping additive Schwarz preconditioners for isotropic elliptic problems with degenerate coefficients

This page was built for publication: An almost optimal method for Dirichlet problems on decomposition subdomains of the hierarchical \(hp\)-version