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