Pages that link to "Item:Q4016917"
From MaRDI portal
The following pages link to Complexity of Computations with Matrices and Polynomials (Q4016917):
Displaying 30 items.
- A fast algorithm for computing the determinants of banded circulant matrices (Q530029) (← links)
- On similarity of polynomial configurations (Q688225) (← links)
- Complexity measures of sign matrices (Q949752) (← links)
- Complexities of special matrix multiplication problems (Q1108742) (← links)
- Modular arithmetic for linear algebra computations in the real field (Q1264434) (← links)
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation (Q1311327) (← links)
- Displacement structure of pseudoinverses (Q1320009) (← links)
- Improved parallel solution of a triangular linear system (Q1328830) (← links)
- Average errors for zero finding: Lower bounds for smooth or monotone functions (Q1339671) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Matrix displacement decompositions and applications to Toeplitz linear systems (Q1375094) (← links)
- On the extension of Sarrus' rule to \(n \times n\) (\(n > 3\)) matrices: development of new method for the computation of the determinant of \(4 \times 4\) matrix (Q1653536) (← links)
- Solution algorithms for regional interactions in large-scale integrated assessment models of climate change (Q1699069) (← links)
- Remarks on complexity of polynomial and special matrix computations (Q1824347) (← links)
- Identifying complexity by means of matrices (Q1850374) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- An algebraic approach to approximate evaluation of a polynomial on a set of real points (Q1899278) (← links)
- Matrix decompositions using displacement rank and classes of commutative matrix algebras (Q1902113) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- Estimation of carrier frequency offset and channel state information of generalize frequency division multiplexing systems by using a Zadoff-Chu sequence (Q2068333) (← links)
- Complexity of computing interval matrix powers for special classes of matrices. (Q2216226) (← links)
- Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
- Binary segmentation for matrix and vector operations (Q2365929) (← links)
- Schur aggregation for linear systems and determinants (Q2378504) (← links)
- A new Gröbner basis conversion method based on stabilization techniques (Q2378509) (← links)
- A solution to certain polynomial equations with applications to nonlinear fitting (Q4821050) (← links)
- Exact Simulation of Integrate-and-Fire Models with Exponential Currents (Q5441311) (← links)
- Efficient Preconditioning for Time Fractional Diffusion Inverse Source Problems (Q5854653) (← links)
- Survey number theoretic transform algorithm over a polynomial ring and its application (Q6610523) (← links)
