Pages that link to "Item:Q1342512"
From MaRDI portal
The following pages link to Fast algorithms with preprocessing for matrix-vector multiplication problems (Q1342512):
Displaying 31 items.
- Fast multiplication of a recursive block Toeplitz matrix by a vector and its application (Q578851) (← links)
- Matrix structure and loss-resilient encoding/decoding (Q597244) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- DFT representations of Toeplitz-plus-Hankel Bézoutians with application to fast matrix-vector multiplication (Q1124769) (← links)
- Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication (Q1307205) (← links)
- Complexity of multiplication with vectors for structured matrices (Q1329930) (← links)
- Pivoting and backward stability of fast algorithms for solving Cauchy linear equations (Q1348084) (← links)
- Displacement-structure approach to polynomial Vandermonde and related matrices (Q1362652) (← links)
- The fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices (Q1368833) (← links)
- Factorizations of Cauchy matrices (Q1378995) (← links)
- New transformations of Cauchy matrices and Trummer's problem (Q1608424) (← links)
- An efficient solution for Cauchy-like systems of linear equations (Q1767958) (← links)
- Algebras of higher dimension for displacement decompositions and computations with Toeplitz plus Hankel matrices (Q1904050) (← links)
- Superfast algorithms for Cauchy-like matrix computations and extensions (Q1978119) (← links)
- M-positive semi-definiteness and M-positive definiteness of fourth-order partially symmetric Cauchy tensors (Q2067739) (← links)
- An efficient, memory-saving approach for the Loewner framework (Q2144964) (← links)
- Fast commutative matrix algorithms (Q2156374) (← links)
- Positive definiteness and semi-definiteness of even order symmetric Cauchy tensors (Q2351283) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Fast hybrid matrix multiplication algorithms (Q2452754) (← links)
- Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices (Q2501234) (← links)
- Direct inversion of the three-dimensional pseudo-polar Fourier transform (Q2800441) (← links)
- (Q3711657) (← links)
- Fast algorithms for discrete polynomial transforms (Q4210958) (← links)
- Fast Multiresolution Algorithms for Matrix-Vector Multiplication (Q4307039) (← links)
- (Q4316719) (← links)
- (Q4340242) (← links)
- Faster Online Matrix-Vector Multiplication (Q4575890) (← links)
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions (Q4631411) (← links)
- Automatic generation of fast algorithms for matrix–vector multiplication (Q4641573) (← links)
- On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms (Q5348227) (← links)
