A fast algorithm for index of annihilation computations
From MaRDI portal
Publication:1807796
DOI10.1016/S0377-0427(99)00103-XzbMATH Open0952.93039MaRDI QIDQ1807796FDOQ1807796
Authors: Yanyan Li
Publication date: 11 January 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
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
- Rang revealing QR factorizations
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Some Applications of the Rank Revealing QR Factorization
- The dimension of matrices (matrix pencils) with given Jordan (Kronecker) canonical forms
- Error analysis of QR decompositions by Givens transformations
- Title not available (Why is that?)
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)