What subtleties are there in computing the LU decomposition of a rational matrix using exact rational arithmetic?
Pivoting to avoid small but nonzero values to avoid numerical instability probably no longer matters.
Divide and conquer algorithms might be better able to take advantage of subquadratic multiplication algorithms.
Previously musing on exact QR.
No comments :
Post a Comment