Harrison, Gavin; Johnson, Jeremy; Saunders, B. David Probabilistic analysis of block Wiedemann for leading invariant factors. (English) Zbl 1478.15050 J. Symb. Comput. 108, 98-116 (2022). Reviewer: Viktor Ohanyan (Erevan) MSC: 15B52 15B33 15A20 15A15 60D05 PDFBibTeX XMLCite \textit{G. Harrison} et al., J. Symb. Comput. 108, 98--116 (2022; Zbl 1478.15050) Full Text: DOI arXiv
Bouman, Niek J.; de Vreede, Niels A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals. (English) Zbl 07314293 Conti, Mauro (ed.) et al., Applied cryptography and network security. 18th international conference, ACNS 2020, Rome, Italy, October 19–22, 2020. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12146, 398-417 (2020). MSC: 68M25 94A60 PDFBibTeX XMLCite \textit{N. J. Bouman} and \textit{N. de Vreede}, Lect. Notes Comput. Sci. 12146, 398--417 (2020; Zbl 07314293) Full Text: DOI
Eberly, Wayne Automating algorithm selection: checking for matrix properties that can simplify computations. (English) Zbl 1423.68616 J. Symb. Comput. 94, 1-29 (2019). MSC: 68W30 15A15 15B33 PDFBibTeX XMLCite \textit{W. Eberly}, J. Symb. Comput. 94, 1--29 (2019; Zbl 1423.68616) Full Text: DOI
Qin, Xiaolin; Sun, Zhi; Leng, Tuo; Feng, Yong Computing the determinant of a matrix with polynomial entries by approximation. (English) Zbl 1402.65036 J. Syst. Sci. Complex. 31, No. 2, 508-526 (2018). MSC: 65F40 68W30 PDFBibTeX XMLCite \textit{X. Qin} et al., J. Syst. Sci. Complex. 31, No. 2, 508--526 (2018; Zbl 1402.65036) Full Text: DOI arXiv
Harrison, Gavin; Johnson, Jeremy; Saunders, B. David Probabilistic analysis of Wiedemann’s algorithm for minimal polynomial computation. (English) Zbl 1375.15022 J. Symb. Comput. 74, 55-69 (2016). MSC: 15A21 11C08 65F99 PDFBibTeX XMLCite \textit{G. Harrison} et al., J. Symb. Comput. 74, 55--69 (2016; Zbl 1375.15022) Full Text: DOI
Villard, Gilles Kaltofen’s division-free determinant algorithm differentiated for matrix adjoint computation. (English) Zbl 1220.15004 J. Symb. Comput. 46, No. 7, 773-790 (2011). MSC: 15-04 PDFBibTeX XMLCite \textit{G. Villard}, J. Symb. Comput. 46, No. 7, 773--790 (2011; Zbl 1220.15004) Full Text: DOI
Lecerf, Grégoire Improved dense multivariate polynomial factorization algorithms. (English) Zbl 1127.13021 J. Symb. Comput. 42, No. 4, 477-494 (2007). Reviewer: Didier Henrion (Toulouse) MSC: 13P05 68W30 PDFBibTeX XMLCite \textit{G. Lecerf}, J. Symb. Comput. 42, No. 4, 477--494 (2007; Zbl 1127.13021) Full Text: DOI
Mulders, Thom Certified sparse linear system solving. (English) Zbl 1137.65345 J. Symb. Comput. 38, No. 5, 1343-1373 (2004). MSC: 65F50 PDFBibTeX XMLCite \textit{T. Mulders}, J. Symb. Comput. 38, No. 5, 1343--1373 (2005; Zbl 1137.65345) Full Text: DOI
Kaltofen, Erich; Villard, Gilles Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (English) Zbl 1037.65044 J. Comput. Appl. Math. 162, No. 1, 133-146 (2004). MSC: 65F40 65Y20 15B36 PDFBibTeX XMLCite \textit{E. Kaltofen} and \textit{G. Villard}, J. Comput. Appl. Math. 162, No. 1, 133--146 (2004; Zbl 1037.65044) Full Text: DOI