FFLAS-FFPACK
From MaRDI portal
Cited in
(42)- Givaro
- LinBox
- M4RI
- NTL
- Postulation of general quintuple fat point schemes in \(\mathbb P^3\)
- Almost all subgeneric third-order Chow decompositions are identifiable
- New ways to multiply \(3 \times 3\)-matrices
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- M4RIE
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- KoszulDivisorOnPic14M8
- OpenBLAS
- GotoBLAS
- Fast matrix decomposition in F₂
- Some fast algorithms multiplying a matrix by its adjoint
- A practical implementation of a modular algorithm for ore polynomial matrices
- Simultaneous computation of the row and column rank profiles
- Solving very sparse rational systems of equations
- Algorithm 898
- On the arithmetic complexity of Strassen-like matrix multiplications
- GF2toolkit
- Rationality of Moduli Spaces of Plane Curves of Small Degree
- Schreyer.lib
- ClebschGordan
- smallDegree
- rationality
- Simultaneous conversions with the residue number system using linear algebra
- Most secant varieties of tangential varieties to Veronese varieties are nondefective
- Fast matrix multiplication and its algebraic neighbourhood
- FFPACK
- scientific article; zbMATH DE number 2118488 (Why is no real title available?)
- All secant varieties of the Chow variety are nondefective for cubics and quaternary forms
- Arithmetic software libraries
- Algorithms for structured linear systems solving and their implementation
- Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
- A linear algebra method to decompose forms whose length is lower than the number of variables into weighted sum of squares
- Simultaneous modular reduction and Kronecker substitution for small finite fields
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- Algorithm 529
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction
- Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation
- Refined algorithms to compute syzygies
This page was built for software: FFLAS-FFPACK
