A fast algorithm for index of annihilation computations
From MaRDI portal
Recommendations
- Accelerating an Iterative Process by Explicit Annihilation
- scientific article; zbMATH DE number 647772
- scientific article; zbMATH DE number 7536575
- Faster combinatorial algorithms for determinant and Pfaffian
- Faster Combinatorial Algorithms for Determinant and Pfaffian
- Fast algorithms for direct enclosures and direct dominances
- An algorithmic approach to the Conley index theory
- A fast algorithm for calculating \(s\)-invariants
- A Fast Algorithm for Trummer’s Problem
- Efficient algorithms for the scaled indexing problem
Cites work
- scientific article; zbMATH DE number 192975 (Why is no real title available?)
- scientific article; zbMATH DE number 1234596 (Why is no real title available?)
- scientific article; zbMATH DE number 3296351 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
- An algorithm for numerical determination of the structure of a general matrix
- Error analysis of QR decompositions by Givens transformations
- Rang revealing QR factorizations
- Some Applications of the Rank Revealing QR Factorization
- The dimension of matrices (matrix pencils) with given Jordan (Kronecker) canonical forms
Cited in
(3)
This page was built for publication: A fast algorithm for index of annihilation computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807796)
