A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery

DOI10.1007/s10958-013-1489-0zbMathNoneOpenAlexW2011996063MaRDI QIDQ376164

M. A. Cherepniov

Publication date: 4 November 2013

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

Full work available at URL: https://doi.org/10.1007/s10958-013-1489-0

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Linear and multilinear algebra; matrix theory (15-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
• A block algorithm of Lanczos type for solving sparse systems of linear equations
• Factorization of a 768-Bit RSA Modulus
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
• Asymptotically fast polynomial matrix algorithms for multivariable systems

This page was built for publication: A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery