matrix multiplication

jenny101 asked Oct 26, 2016

1,103 views

0 votes

Algorithms
matrix
algorithms
matrix-chain-ordering

+ –

jenny101 asked Oct 26, 2016

jenny101

1.1k views

See all

1 1 comment

akash.dinkar12

commented Oct 7, 2018

what is full parenthesization?? when we do it and need of it??

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Best answer

1 votes

since A1 has dimension m*n
A2 has dimension p*q

A3 has dimension q*r

A4 has dimension r*s

A5 has dimension m*n

(A1 A2 A3 A4 A5)_m*s so it is equal to =
( ( ( ( A1*A2 )*A3 ) *A4 )*A5 )

so here we found that we need 4 pair of parenthesis for full pair of parenthesization.

Rajesh Raj answered Oct 26, 2016 • selected Oct 26, 2016 by jenny101

Rajesh Raj

See all

2 2 Comments

Lakshman Bhaiya

commented Nov 11, 2018

parenthesis for full pair of parenthesization.

What is the mean of this?

0 votes

Hira Thakur

commented Nov 12, 2019

this is the only way to solve multiplication for 5 variables? suppose I assume some random size for matrix and perform multiplications. Does it give the minimum number of multiplication?

what are the different types of orders are possible for multiplications?

0 votes

Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

3 answers

Parshu gate asked Nov 27, 2017

4,281 views

Matrix chain multiplication
Which of the following is the recurrence relation for the matrix chain multiplication problem where p[i-1]*p[i] gives the dimension of the i^th matrix? dp[i,j]=1 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]} dp[i,j]=1 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]}+p[i-1]*p[k]*p[j] dp[i,j]= ... dp[i,j]=min{dp[i,k]+dp[k+1,j]} dp[i,j]=0 if i=j dp[i,j]=min{dp[i,k]+dp[k+1,j]}+p[i-1]*p[k]*p[j]

Which of the following is the recurrence relation for the matrix chain multiplication problem where p[i-1]*p[i] gives the dimension of the i^th matrix? dp[i,j]=1 if i=jd...

Parshu gate

4.3k views

Parshu gate asked Nov 27, 2017

Algorithms
dynamic-programming
algorithms
matrix-chain-ordering

+ –

0 votes

1 answer

Rohan Mundhey asked Nov 11, 2016

1,582 views

Matrix Multiplication
Matrix multiplication is associative and matrix chain multiplication uses following matrices A1 is 30×35 A2 is 35×15 A3 is 15×5 A4 is 5×10 A5 is 10×20 A6 is 20×25 Find the minimum number of multiplications required to compute A1 A2 A3 A4A5A6

Matrix multiplication is associative and matrix chain multiplication uses following matricesA1 is 30×35A2 is 35×15A3 is 15×5A4 is 5×10A5 is 10×20A6 is 20×25Find the...

Rohan Mundhey

1.6k views

Rohan Mundhey asked Nov 11, 2016

Algorithms
algorithms
matrix-chain-ordering
dynamic-programming

+ –

2 votes

4 answers

sh!va asked Jul 12, 2016

22,165 views

Find he minimum number of scalar multiplications in matrix multiplication
Four matrices M1, M2, M3, and M4 have dimensions p x q, q x r, r x s, and s x t respectively can be multiplied in several ways with different number of total scalar multiplications. For example, when multiplied as ((M1 x M2 ... 100, r = 20, s = 5, and t = 80, then what is the minimum number of scalar multiplications needed ?

Four matrices M1, M2, M3, and M4 have dimensions p x q, q x r, r x s, and s x t respectively can be multiplied in several ways with different number of total scalar multi...

sh!va

22.2k views

sh!va asked Jul 12, 2016

Algorithms
algorithms
matrix-chain-ordering

+ –

3 votes

2 answers

Sourabh Kumar asked May 21, 2016

1,882 views

matrix multiplication

Sourabh Kumar

1.9k views

Sourabh Kumar asked May 21, 2016

Algorithms
algorithms
matrix-chain-ordering
test-series

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

1 1 comment reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

so here we found that we need 4 pair of parenthesis for full pair of parenthesization.

2 2 Comments reply

parenthesis for full pair of parenthesization.

Please log in or register to add a comment.

Related questions

1 1 comment

2 2 Comments