Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x]
From MaRDI portal
Publication:412209
Recommendations
- On approximate linearized triangular decompositions
- Randomized numerical linear algebra: Foundations and algorithms
- scientific article; zbMATH DE number 4030822
- Randomized algorithms in numerical linear algebra
- A randomized algorithm for the decomposition of matrices
- An exact correspondence of linear problems and randomizing linear algorithms
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations
- Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations
- Randomization and the parallel solution of linear algebra problems
- Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)
Cites work
- scientific article; zbMATH DE number 3679047 (Why is no real title available?)
- scientific article; zbMATH DE number 1254241 (Why is no real title available?)
- scientific article; zbMATH DE number 1305088 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 2151192 (Why is no real title available?)
- scientific article; zbMATH DE number 2151242 (Why is no real title available?)
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- A generalization of the fast LUP matrix decomposition algorithm and applications
- A local construction of the Smith normal form of a matrix polynomial
- Asymptotically Fast Triangularization of Matrices over Rings
- Asymptotically fast polynomial matrix algorithms for multivariable systems
- Certified dense linear system solving
- Elementary Divisors and Modules
- Exact solution of linear equations using p-adic expansions
- Fast projection methods for minimal design problems in linear system theory
- Generalized subresultants for computing the Smith normal form of polynomial matrices
- High-order lifting and integrality certification
- Normal forms for general polynomial matrices
- Normalization of row reduced matrices
- On lattice reduction for polynomial matrices
- Parallel algorithms for matrix normal forms
- Rational solutions of singular linear systems
- Recursiveness in matrix rational interpolation problems
- Spans in the module (Zm)s
- The shifted number system for fast linear algebra on integer matrices
Cited in
(12)- Deterministic reduction of integer nonsingular linear system solving to matrix multiplication
- A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
- Verification protocols with sub-linear communication for polynomial matrix operations
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- Computing minimal interpolation bases
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication
- Deterministic APSP, Orthogonal Vectors, and More
- Algorithms for simultaneous Hermite-Padé approximations
- Triangular decomposition of matrices in a domain
- High-order lifting and integrality certification
- A deterministic algorithm for inverting a polynomial matrix
- Power decoding Reed-Solomon codes up to the Johnson radius
This page was built for publication: Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412209)
