Complexity of Computations with Matrices and Polynomials
From MaRDI portal
Recommendations
Cited in
(33)- Complexities of special matrix multiplication problems
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
- Displacement structure of pseudoinverses
- Improved parallel solution of a triangular linear system
- Average errors for zero finding: Lower bounds for smooth or monotone functions
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Algebraic and numerical techniques for the computation of matrix determinants
- Matrix displacement decompositions and applications to Toeplitz linear systems
- 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
- Solution algorithms for regional interactions in large-scale integrated assessment models of climate change
- Remarks on complexity of polynomial and special matrix computations
- Identifying complexity by means of matrices
- Computation of approximate polynomial GCDs and an extension
- An algebraic approach to approximate evaluation of a polynomial on a set of real points
- Matrix decompositions using displacement rank and classes of commutative matrix algebras
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Estimation of carrier frequency offset and channel state information of generalize frequency division multiplexing systems by using a Zadoff-Chu sequence
- Complexity of computing interval matrix powers for special classes of matrices.
- Real polynomial root-finding by means of matrix and polynomial iterations
- Binary segmentation for matrix and vector operations
- Schur aggregation for linear systems and determinants
- A new Gröbner basis conversion method based on stabilization techniques
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- A solution to certain polynomial equations with applications to nonlinear fitting
- Ultimate complexity for numerical algorithms
- A fast algorithm for computing the determinants of banded circulant matrices
- Computational complexity of computing polynomials over the fields of real and complex numbers
- Exact Simulation of Integrate-and-Fire Models with Exponential Currents
- Efficient preconditioning for time fractional diffusion inverse source problems
- Survey number theoretic transform algorithm over a polynomial ring and its application
- On similarity of polynomial configurations
- A space efficient algorithm for multiset multicover with multiplicity constraints problem via algebraic method
- Complexity measures of sign matrices
This page was built for publication: Complexity of Computations with Matrices and Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016917)
