What is the most efficient algorithm for multiplying a square matrix by an upper triangular matrix
显示 更早的评论
If A and B are square matrix, and B is an upper triangular matrix, then what is the most efficient algorithm to calculate C = A x B?
回答（1 个）
Walter Roberson
2020-9-19
1 个投票
No-one knows yet what the most efficient algorithm is. This is a topic of sustained theoretical research.
For the current best algorithm that gets to 
"the constant coefficient hidden by the Big O notation is so large that these algorithms are only worthwhile for matrices that are too large to handle on present-day computers". But you didn't ask about present day computers, you asked about the most efficient algorithm -- an algorithm that does not start being cost efficient until the matrix sizes are larger than the number of elementary particles in the universe would still potentially be the most efficient algorithm, even though it might be impractical for any purpose at all.
"the constant coefficient hidden by the Big O notation is so large that these algorithms are only worthwhile for matrices that are too large to handle on present-day computers". But you didn't ask about present day computers, you asked about the most efficient algorithm -- an algorithm that does not start being cost efficient until the matrix sizes are larger than the number of elementary particles in the universe would still potentially be the most efficient algorithm, even though it might be impractical for any purpose at all.类别
在 帮助中心 和 File Exchange 中查找有关 Creating and Concatenating Matrices 的更多信息
2020-9-19
2020-9-19
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
