Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems (Q4846019): Difference between revisions

← Older edit

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2307/2153451
@@ Property / full work available at URL: https://doi.org/10.2307/2153451 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2059454546
@@ Property / OpenAlex ID: W2059454546 / rank @@
+Normal rank
@@ Property / Recommended article @@
+Q4279567
@@ Property / Recommended article: Q4279567 / rank @@
+Normal rank
@@ Property / Recommended article: Q4279567 / qualifier @@
+Similarity Score: 0.8171417Amount 0.8171417
Unit 1
-Amount
+.8171417
 Unit
@@ Property / Recommended article: Q4279567 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4226935
@@ Property / Recommended article: Q4226935 / rank @@
+Normal rank
@@ Property / Recommended article: Q4226935 / qualifier @@
+Similarity Score: 0.80550647Amount 0.80550647
Unit 1
-Amount
+.80550647
 Unit
@@ Property / Recommended article: Q4226935 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+The universal block Lanczos-Padé method for linear systems over large prime fields
+Normal rank
+Similarity Score: 0.7969187Amount 0.7969187
Unit 1
-Amount
+.7969187
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Solving sparse linear equations over finite fields
+Normal rank
+Similarity Score: 0.78615695Amount 0.78615695
Unit 1
-Amount
+.78615695
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Reliable Krylov-based algorithms for matrix null space and rank
+Normal rank
+Similarity Score: 0.78612185Amount 0.78612185
Unit 1
-Amount
+.78612185
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4279517
@@ Property / Recommended article: Q4279517 / rank @@
+Normal rank
@@ Property / Recommended article: Q4279517 / qualifier @@
+Similarity Score: 0.7826341Amount 0.7826341
Unit 1
-Amount
+.7826341
 Unit
@@ Property / Recommended article: Q4279517 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
+Normal rank
+Similarity Score: 0.7795582Amount 0.7795582
Unit 1
-Amount
+.7795582
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Nearly sparse linear algebra and application to discrete logarithms computations
+Normal rank
+Similarity Score: 0.7737903Amount 0.7737903
Unit 1
-Amount
+.7737903
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Parallel hybrid iteration methods for block bordered linear systems
+Normal rank
+Similarity Score: 0.7714938Amount 0.7714938
Unit 1
-Amount
+.7714938
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Solving linear equations over GF(2): Block Lanczos algorithm
+Normal rank
+Similarity Score: 0.7594844Amount 0.7594844
Unit 1
-Amount
+.7594844
 Unit
+Recommender Run: Recommender Run 2

Latest revision as of 18:53, 27 January 2025

scientific article; zbMATH DE number 788625

Language	Label	Description	Also known as
English	Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems	scientific article; zbMATH DE number 788625