article

Addition requirements for matrix and transposed matrix products

Authors:

Michael Kaminski,

David G. Kirkpatrick,

Nader H. BshoutyAuthors Info & Claims

Journal of Algorithms, Volume 9, Issue 3

Pages 354 - 364

https://doi.org/10.1016/0196-6774(88)90026-0

Published: 01 September 1988 Publication History

Abstract

No abstract available.

Cited By

View all

Dumas JGrenet B(2024)In-place accumulation of fast multiplication formulaeProceedings of the 2024 International Symposium on Symbolic and Algebraic Computation10.1145/3666000.3669671(16-25)Online publication date: 16-Jul-2024
https://dl.acm.org/doi/10.1145/3666000.3669671
Giesbrecht MJamshidpey ASchost É(2021)Subquadratic-Time Algorithms for Normal Bases Computational Complexity10.1007/s00037-020-00204-930:1Online publication date: 2-Mar-2021
https://dl.acm.org/doi/10.1007/s00037-020-00204-9
Bootle JChiesa AGroth J(2020)Linear-Time Arguments with Sublinear Verification from Tensor CodesTheory of Cryptography10.1007/978-3-030-64378-2_2(19-46)Online publication date: 16-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-64378-2_2
Show More Cited By

Index Terms

Addition requirements for matrix and transposed matrix products

Recommendations

Additional Requirements for Matrix \& Transposed Matrix Products
A note on computing matrix-vector products with generalized centrosymmetric (centrohermitian) matrices

To reduce the costs of computing matrix-vector product Ax related to a centrosymmetric matrix A as compared to the case of an arbitrary matrix A, two algorithms were proposed recently, one was designed by Melman [A. Melman, Symmetric centrosymmetric ...
Product or sum with transposed matrix: what is best for unsymmetric sparse matrix compression

Object-oriented software for sparse matrix compression is briefly presented. Two approaches to unsymmetric sparse matrix compression are investigated. The first determines row reordering using the sum of original and transposed matrix. The second method ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Journal of Algorithms Volume 9, Issue 3

September 1988

146 pages

ISSN:0196-6774

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 September 1988

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dumas JGrenet B(2024)In-place accumulation of fast multiplication formulaeProceedings of the 2024 International Symposium on Symbolic and Algebraic Computation10.1145/3666000.3669671(16-25)Online publication date: 16-Jul-2024
https://dl.acm.org/doi/10.1145/3666000.3669671
Giesbrecht MJamshidpey ASchost É(2021)Subquadratic-Time Algorithms for Normal Bases Computational Complexity10.1007/s00037-020-00204-930:1Online publication date: 2-Mar-2021
https://dl.acm.org/doi/10.1007/s00037-020-00204-9
Bootle JChiesa AGroth J(2020)Linear-Time Arguments with Sublinear Verification from Tensor CodesTheory of Cryptography10.1007/978-3-030-64378-2_2(19-46)Online publication date: 16-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-64378-2_2
Hyun SNeiger VSchost ÉDavenport JWang DKauers MBradford R(2019)Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate ResultantsProceedings of the 2019 International Symposium on Symbolic and Algebraic Computation10.1145/3326229.3326272(235-242)Online publication date: 8-Jul-2019
https://dl.acm.org/doi/10.1145/3326229.3326272
Hyun SMelczer SSchost ÉSt-Pierre CDavenport JWang DKauers MBradford R(2019)Change of Basis for m-primary Ideals in One and Two VariablesProceedings of the 2019 International Symposium on Symbolic and Algebraic Computation10.1145/3326229.3326268(227-234)Online publication date: 8-Jul-2019
https://dl.acm.org/doi/10.1145/3326229.3326268
Giesbrecht MJamshidpey ASchost ÉDavenport JWang DKauers MBradford R(2019)Quadratic-Time Algorithms for Normal ElementsProceedings of the 2019 International Symposium on Symbolic and Algebraic Computation10.1145/3326229.3326260(179-186)Online publication date: 8-Jul-2019
https://dl.acm.org/doi/10.1145/3326229.3326260
Musleh YSchost ÉDavenport JWang DKauers MBradford R(2019)Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld ModuleProceedings of the 2019 International Symposium on Symbolic and Algebraic Computation10.1145/3326229.3326256(307-314)Online publication date: 8-Jul-2019
https://dl.acm.org/doi/10.1145/3326229.3326256
Bodrato MKoepf W(2010)A Strassen-like matrix multiplication suited for squaring and higher power computationProceedings of the 2010 International Symposium on Symbolic and Algebraic Computation10.1145/1837934.1837987(273-280)Online publication date: 25-Jul-2010
https://dl.acm.org/doi/10.1145/1837934.1837987
Hanrot GQuercia MZimmermann P(2004)The Middle Product Algorithm IApplicable Algebra in Engineering, Communication and Computing10.1007/s00200-003-0144-214:6(415-438)Online publication date: 1-Mar-2004
https://dl.acm.org/doi/10.1007/s00200-003-0144-2
Bostan ALecerf GSchost ÉHong H(2003)Tellegen's principle into practiceProceedings of the 2003 international symposium on Symbolic and algebraic computation10.1145/860854.860870(37-44)Online publication date: 3-Aug-2003
https://dl.acm.org/doi/10.1145/860854.860870
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Additional Requirements for Matrix \& Transposed Matrix Products

A note on computing matrix-vector products with generalized centrosymmetric (centrohermitian) matrices

Product or sum with transposed matrix: what is best for unsymmetric sparse matrix compression

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations