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

DOI10.1023/A:1011970023932zbMath1013.65135MaRDI 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 complexity; Dirichlet problem; discrete Fourier transform; preconditioner; domain decomposition method; Thomas method; finite-difference operator; Cholesky elimination method; fast inversion method

Mathematics Subject Classification ID

65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs

65F35: Numerical computation of matrix norms, conditioning, scaling

35J05: Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation

65T50: Numerical methods for discrete and fast Fourier transforms

65N06: Finite difference methods for boundary value problems involving PDEs

65Y20: Complexity and performance of numerical algorithms

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

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