Effective numerical algorithms for the solution of algebraic systems arising in spectral methods

DOI10.1016/0168-9274(92)90033-AzbMath0754.65031MaRDI QIDQ1196758

Claudio Carlenzoli, Paola Gervasio

Publication date: 16 January 1993

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

iterationdomain decompositionpreconditioningGMRES methodvectorizationcomparisonsspectral collocation methodCGS methodBI-CGSTAB methodCRAY X/MP-EACRAY Y-MP 8/432IBM 3090/200S VFNCUBE2Richarson methodunsymmetric spectral matrices

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical algorithms for specific classes of architectures (65Y10)

Related Items

Spectral multidomain approximation of elliptic problems with mixed conditions on the interfaces, A weak Legendre collocation spectral method for the solution of the incompressible Navier-Stokes equations in unstructured quadrilateral subdomains., Unsteady fluid flow and temperature fields in a horizontal enclosure with an adiabatic body, Pseudospectral solution of linear evolution equations of second order in space and time on unstructured quadrilateral subdomain topologies

Uses Software

• CGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chebyshev pseudospectral solution of second-order elliptic equations with finite element preconditioning
• Parallel algorithms for the capacitance matrix method in domain decompositions
• Spectral methods for problems in complex geometries
• Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
• Finite-Element Preconditioning for Pseudospectral Solutions of Elliptic Problems
• A Variational Formulation for the Chebyshev Pseudospectral Approximation of Neumann Problems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Parallel Computers 2