Pages that link to "Item:Q4846019"

The following pages link to Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems (Q4846019):

Displaying 8 items.

• A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery (Q376164) (← links)
• On efficient sparse integer matrix Smith normal form computations (Q597114) (← links)
• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm (Q697496) (← links)
• Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation (Q898244) (← links)
• Solving structured linear systems with large displacement rank (Q954988) (← links)
• Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
• Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
• Factoring polynomials over finite fields: A survey (Q5928877) (← links)