Optimal and efficient parallel tridiagonal solvers using direct methods

DOI10.1023/B:SUPE.0000040615.60545.C6zbMATH Open1076.65029OpenAlexW1970702024MaRDI QIDQ2386702FDOQ2386702

Authors: Eunice E. Santos 

Publication date: 25 August 2005

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:supe.0000040615.60545.c6

Recommendations

• scientific article; zbMATH DE number 1760070
• Parallel Factorizations for Tridiagonal Matrices
• A parallel algorithm for solving tridiagonal linear systems
• scientific article; zbMATH DE number 1302611
• Optimized cyclic reduction for the solution of linear tridiagonal systems on parallel computers

zbMATH Keywords

direct methodsparallel algorithmstridiagonal linear systemsprefix summing\(\log P\) modelodd-even cyclic reduction

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Cited In (9)

• Optimal Bounds for Solving Tridiagonal Systems with Preconditioning
• Generalized scans and tridiagonal systems
• Title not available (Why is that?)
• A direct incomplete factorization method for parallel solution of tridiagonal linear systems
• A cost-optimal parallel tridiagonal system solver
• Title not available (Why is that?)
• On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver
• Revisiting parallel cyclic reduction and parallel prefix-based algorithms for block tridiagonal systems of equations
• Manycore algorithms for batch scalar and block tridiagonal solvers

This page was built for publication: Optimal and efficient parallel tridiagonal solvers using direct methods

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