Pages that link to "Item:Q1058849"
From MaRDI portal
The following pages link to Fast algorithms for the characteristic polynomial (Q1058849):
Displaying 43 items.
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- Efficient computation of the characteristic polynomial of a tree and related tasks (Q528854) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- Constructive recognition of classical groups in odd characteristic. (Q731248) (← links)
- Reflections on termination of linear loops (Q832249) (← links)
- Dynamic matrix rank (Q843102) (← links)
- Improvements to the deformation method for counting points on smooth projective hypersurfaces (Q895704) (← 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)
- Determinisability of unary weighted automata over the rational numbers (Q2055977) (← links)
- Subset selection for matrices with fixed blocks (Q2066125) (← links)
- Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← links)
- Interlacing families. III: Sharper restricted invertibility estimates (Q2143246) (← links)
- Computing syzygies in finite dimension using fast linear algebra (Q2192678) (← links)
- Computational complexity of \(k\)-block conjugacy (Q2219057) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- A deterministic algorithm for inverting a polynomial matrix (Q2254681) (← links)
- Construction of the irreducible modular representations of a finite group (Q2282982) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- Graph homomorphisms via vector colorings (Q2422244) (← links)
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition (Q2437224) (← links)
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition (Q2628319) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- ALGORITHMS TO IDENTIFY ABUNDANT<i>p</i>-SINGULAR ELEMENTS IN FINITE CLASSICAL GROUPS (Q2907021) (← links)
- Computational schemes for two exponential servers where the first has a finite buffer (Q3016174) (← links)
- Computing Minimal Polynomials of Matrices (Q3091965) (← links)
- Efficient Computation of the Characteristic Polynomial of a Threshold Graph (Q3452551) (← links)
- Growth Functions and Automatic Groups (Q4347270) (← links)
- A Complete Implementation for Computing General Dimensional Convex Hulls (Q4513209) (← links)
- (Q4638054) (← links)
- The complexity of error-correcting codes (Q5055921) (← links)
- RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS (Q5322917) (← links)
- (Q5857015) (← links)
- Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\) (Q5941297) (← links)
- Skew-polynomial-sparse matrix multiplication (Q6051113) (← links)
- High-order lifting for polynomial Sylvester matrices (Q6149161) (← links)
- Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond (Q6172035) (← links)
