## Develop a function to perform Gaussian elimination with complete pivoting.

Develop a function to perform Gaussian elimination with complete pivoting. Name your function as gauss_cp.m. Use two permutation vectors to keep track of the row and column interchanges so that you do not need to do any actual row and column interchanges on the coefficient matrix (to reduce memory traffic). You may refer to gauss_pp.m on Canvas for the use of permutation vectors. (a) Attach the printed code to your report. Include sufficient comments. Find a small matrix to test your function and make sure it is delivering the correct answers. (b) We have learned how to compute the number of floating point operations in an algorithm (or code). Following the same idea, set up a formula for the number of comparisons in your code. For a linear system with an n x n coefficient matrix, how many comparisons does your code need? How does it compare with partial pivoting?

### fill in the following table as you create each piece.

A train travels from St. George, Utah to Las Vegas, Nevada carrying passengers on a leisure ride. In the dessert, the winds can get pretty strong, making the train able….

### What is the maximum burst size ?

1.       For the following flows and a GCRA(100, 500), give the conformant and non-conformant cells. Times are in cell slots at the link rate. (a)    0, 100, 110, 12, 130,….

### What are the (P, B) parameters in b/s and bits for each case ?

For a CBR connection, here are some values from an ATM operator: peak cell rate (cells/s)                           100 1000 10000 100000 CDVT (microseconds)                             2900 1200 400 135   1. What are….