On the optimal computation of a set of symmetric and persymmetric bilinear forms
From MaRDI portal
Publication:1257950
DOI10.1016/0024-3795(79)90096-XzbMath0407.15022MaRDI QIDQ1257950
Publication date: 1979
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Toeplitz operators, Hankel operators, Wiener-Hopf operators (47B35) Multilinear algebra, tensor calculus (15A69) Basic linear algebra (15A99)
Related Items (10)
Matrix decompositions using displacement rank and classes of commutative matrix algebras ⋮ How to determine the eigenvalues of g-circulant matrices ⋮ Structure of algebras of commutative matrices ⋮ On some properties of positive definite Toeplitz matrices and their possible applications ⋮ Matrix displacement decompositions and applications to Toeplitz linear systems ⋮ \(h\)-space structure in matrix displacement formulas ⋮ Matrix algebras in optimal preconditioning ⋮ On some properties of circulant matrices ⋮ Closure, commutativity and minimal complexity of some spaces of matrices ⋮ Algebraic and computational properties of a set of (0,1) matrices with prescribed sum
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(n\)-commutative matrices
- Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications
- Optimum computation of p bilinear forms
- Some elementary proofs of lower bounds in complexity theory
- Sur le calcul des produits de matrices. (Calculation of the product of matrices.)
- Properties of a five-band matrix and its application to boundary value problems
- The Computational Complexity of Continued Fractions
- Roots and Canonical Forms for Circulant Matrices
- On Obtaining Upper Bounds on the Complexity of Matrix Multiplication
- Properties of Some Tridiagonal Matrices and Their Application to Boundary Value Problems
- On the number of multiplications necessary to compute certain functions
- The Pseudoinverse of an r-Circulant Matrix
- Explicit Inverses and Condition Numbers of Certain Circulants
This page was built for publication: On the optimal computation of a set of symmetric and persymmetric bilinear forms
