A study of the performance of Neville elimination using two kinds of partitioning techniques
DOI10.1016/S0024-3795(00)00187-7zbMath0984.65021OpenAlexW2146151755WikidataQ62618274 ScholiaQ62618274MaRDI QIDQ5946177
Raquel Cortina, Pedro Alonso, José Ranilla, Vicente G. Hernández
Publication date: 14 May 2002
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(00)00187-7
parallel computationdirect methodstotally positive matricescommunication costsdistributed parallel computersNeville eliminationsynchronous performance
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Backward error analysis of Neville elimination
- Complexity of dense-linear-system solution on a multiprocessor ring
- Total positivity and Neville elimination
- A matricial description of Neville elimination with applications to total positivity
- Development of block and partitioned Neville elimination
- Totally positive matrices
This page was built for publication: A study of the performance of Neville elimination using two kinds of partitioning techniques