Computing Krylov iterates in the time of matrix multiplication
From MaRDI portal
Cites work
- A deterministic algorithm for inverting a polynomial matrix
- Computing canonical bases of modules of univariate relations
- Computing column bases of polynomial matrices
- Computing minimal interpolation bases
- Computing minimal nullspace bases
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Fast algorithms for the characteristic polynomial
- Fast parallel algorithms for matrix reduction to normal forms
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- Faster algorithms for the characteristic polynomial
- Faster matrix multiplication via asymmetric hashing
- High-order lifting and integrality certification
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 3887879 (Why is no real title available?)
- scientific article; zbMATH DE number 3679047 (Why is no real title available?)
- scientific article; zbMATH DE number 3711820 (Why is no real title available?)
- Mathematical Description of Linear Dynamical Systems
- Modern computer algebra
- Nearly Optimal Algorithms for Canonical Matrix Forms
- New bounds for matrix multiplication: from alpha to omega
- Normal forms for general polynomial matrices
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
Cited in
(2)
This page was built for publication: Computing Krylov iterates in the time of matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033515)
