Pages that link to "Item:Q1058849"
From MaRDI portal
The following pages link to Fast algorithms for the characteristic polynomial (Q1058849):
Displayed 14 items.
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- Constructive recognition of classical groups in odd characteristic. (Q731248) (← links)
- Dynamic matrix rank (Q843102) (← links)
- On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems (Q1091081) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
- Efficient decomposition of separable algebras. (Q1432890) (← links)
- Construction of the Jordan decomposition by means of Newton's method (Q1580527) (← links)
- Growth Functions and Automatic Groups (Q4347270) (← links)
- A Complete Implementation for Computing General Dimensional Convex Hulls (Q4513209) (← links)
- RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS (Q5322917) (← links)
- Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\) (Q5941297) (← links)