The following pages link to Gilles Villard (Q540326):
Displaying 50 items.
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- On efficient sparse integer matrix Smith normal form computations (Q597114) (← links)
- Efficient matrix preconditioners for black box linear algebra (Q1348088) (← links)
- Fast parallel algorithms for matrix reduction to normal forms (Q1392668) (← 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)
- On the complexity of computing determinants (Q1766817) (← links)
- Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors (Q1823615) (← links)
- A rank theorem for Vandermonde matrices (Q1826719) (← links)
- Generalized subresultants for computing the Smith normal form of polynomial matrices (Q1914162) (← links)
- Fast computation of approximant bases in canonical form (Q2284957) (← links)
- Normal forms for general polynomial matrices (Q2457359) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- (Q2702027) (← links)
- H-LLL: using Householder inside LLL (Q2883828) (← links)
- Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction (Q2894516) (← links)
- Solving sparse rational linear systems (Q2958972) (← links)
- A new view on HJLS and PSLQ (Q2963228) (← links)
- Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations (Q2978612) (← links)
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix (Q2985828) (← links)
- Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts (Q2985840) (← links)
- LLL reducing with the most significant bits (Q3452418) (← links)
- Integer Smith form via the valence (Q3454749) (← links)
- Computer algebra on MIMD machine (Q4206392) (← links)
- (Q4226935) (← links)
- (Q4227300) (← links)
- (Q4227350) (← links)
- (Q4234198) (← links)
- (Q4234250) (← links)
- (Q4234329) (← links)
- (Q4237426) (← links)
- Matrix rank certification (Q4450708) (← links)
- (Q4520739) (← links)
- (Q4550785) (← links)
- (Q4660659) (← links)
- (Q4790434) (← links)
- Block solution of sparse linear systems over GF (q) (Q4810150) (← links)
- (Q4888753) (← links)
- Processor Efficient Parallel Solution of Linear Systems of Equations (Q4953249) (← links)
- Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits (Q5119931) (← links)
- Computing an LLL-reduced Basis of the Orthogonal Latice (Q5120187) (← links)
- On Computing the Resultant of Generic Bivariate Polynomials (Q5120221) (← links)
- Computing the rank and a small nullspace basis of a polynomial matrix (Q5262779) (← links)
- (Q5301663) (← links)
- (Q5301693) (← links)
- (Q5301698) (← links)
- An LLL-reduction algorithm with quasi-linear time complexity (Q5419110) (← links)
- Asymptotically fast polynomial matrix algorithms for multivariable systems (Q5423851) (← links)
- (Q5753518) (← links)
- High-order lifting for polynomial Sylvester matrices (Q6149161) (← links)
