Fast parallel solvers for elliptic problems
DOI10.1016/0898-1221(96)00103-4zbMath0857.65107OpenAlexW2036772693MaRDI QIDQ1816680
Giuseppe Fiorentino, Stefano Serra Capizzano
Publication date: 27 November 1996
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(96)00103-4
algorithmsnumerical resultsfinite difference methodmatrix algebraparallel computationpreconditionersToeplitz matricesDirichlet boundary value problemspreconditioned conjugate gradients method
Boundary value problems for higher-order elliptic equations (35J40) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Spectral and computational properties of band symmetric Toeplitz matrices
- Matrix structures in parallel matrix computations
- Multigrid methods for Toeplitz matrices
- Circulant block-factorization preconditioners for elliptic problems
- Fast transforms for tridiagonal linear equations
- Preconditioning strategies for asymptotically ill-conditioned block Toeplitz systems
- Fast parallel solvers for elliptic problems
- On parallel computations with banded matrices
- Iterative Solution Methods and Preconditioners for Block-Tridiagonal Systems of Equations
- A Family of Block Preconditioners for Block Systems
- Preconditioning of Block Toeplitz Matrices by Sine Transforms
- Multigrid Methods for Symmetric Positive Definite Block Toeplitz Matrices with Nonnegative Generating Functions
This page was built for publication: Fast parallel solvers for elliptic problems