What is the overall cost (in terms of number of operations) for applying backward substitution?

Consider a set of equations in a matrix form Ax = 6 where A is a upper triangular matrix with non - zero diagonal elements the equation can be air 21 on solving the equations , we get ax + ax , + . . + ain x me = by so you have 1 division = 1 on flop ann by-1 - a ( m - 1 )nim 0/10 a(n-1) (n-1 ) by - apt ... + aintm which is the overall cost ( in terms of operations ) for applying backward substitutionConsider a set of equations in a matrix form Ax = 6 where A is a upper triangular matrix with non - zero diagonal elements the equation can be a on solving the equations , we get ,, + arzt , ter + ain * ne - by bn ann Also, you have 1 division, 1 by-1 - a ( m- 1 )nin 0/10 subtract , and 1 multiple, then 1+1+1= 3 flops acn- 1) ( n - 1 ) by - apt .. . + ain*n . which is the overall cost ( in terms of operations ) for applying backward substitution.Consider a set of equations in a matrix form Ax = 6 where A is a upper triangular matrix with non - zero diagonal elements the equation can be ain by on solving the equations , we get on ann on - 1 - a ( m -1 )nin 0/10 acn- 1) ( n-1 ) think about this one, then by - apt, t ... + aintm add all the flops of x_n , x_n-1, ...., x_1 together such as [1+3+.....+?] to find the total cost. which is the overall cost ( in terms of operations ) for applying backward substitution