The universal block Lanczos-Padé method for linear systems over large prime fields

DOI10.1007/s10958-017-3238-2zbMath1404.65038OpenAlexW2580259408MaRDI QIDQ1708252

M. A. Cherepniov, Nikolai L. Zamarashkin

Publication date: 5 April 2018

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-017-3238-2

zbMATH Keywords

algorithmic complexityparallel complexitylarge sparse linear systemsblock Lanczos-Padé method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Padé approximation (41A21) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Solving linear equations over GF(2): Block Lanczos algorithm
• \(\mathbb F _2 \) Lanczos revisited
• A block algorithm of Lanczos type for solving sparse systems of linear equations
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
• Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле
• Unnamed Item
• Unnamed Item

This page was built for publication: The universal block Lanczos-Padé method for linear systems over large prime fields