Cache Optimized Solution for Sparse Linear System over Large Order Finite Field

DOI10.1007/978-981-10-4642-1_8zbMath1455.65047OpenAlexW2605589869MaRDI QIDQ5114989

Vaishnavi Kannan, A. K. Bhateja

Publication date: 29 June 2020

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-10-4642-1_8

zbMATH Keywords

finite fieldsparse matricesLanczos algorithmWiedemann algorithmperformant implementations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20)

Uses Software

• gmp
• JDQR
• JDQZ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative solutions to matrix equations of the form \(A_{i}XB_{i}=F_{i}\)
• Efficient approximate solution of sparse linear systems
• Fast and efficient parallel solution of dense linear systems
• Krylov Subspace Methods on Supercomputers
• Solving sparse linear equations over finite fields
• Templates for the Solution of Algebraic Eigenvalue Problems
• Algebraic Coding Theory

This page was built for publication: Cache Optimized Solution for Sparse Linear System over Large Order Finite Field