1. Introduction into Matlab: entering variables, vectors and matrixes, administration of variables, graphical output and creation of scripts.
2. Basic of algorithmisation: features of algorithms and elemental algorithms.
3. Calculation of functions: Calculating polynomial values, function tabulation and graphs, determining of extreme points in a discretised function.
4. Solutions to non-linear algebraic equations: iterations, iteration methods and solutions to non-linear algebraic equations.
5. Methods used in sorting of element sets: bubble sorting, sorting by direct selection of a minimum, sorting by direct entering, fast sorting, Shell’s sorting.
6. Solutions to systems of linear equations: direct methods used in solutions to linear equations – a triangle system solution, Gauss and Gauss-Jordan elimination methods, LU and Cholesky decomposition.
7. Solutions to systems of linear equations: iteration methods used in solutions to linear equations – Jacobi iteration, Gauss-Seidel iteration, sparse and band matrixes, conjugate gradient method.
8. Numerical integration of a definite integral: rectangular, trapezoidal, Simpson and Romberg methods for numerical integration, adaptive integration and Gauss method.
9. Numerical differentiation. Solution to simple differential equations.
10. Algorithmisation of building mechanics tasks by means of a network method. Application for a beam on elastic subsoil.
11. A planar problem: algorithmisation by means of a network method.
12. Supporting plate: algorithmisation by means of a network method.
13. Stability of rods and rod structures: available methods and algorithmisation of certain tasks.
Exercises
1. Introducing to the Matlab user environment. Definition and administration of variables. Function graphs. Creating an elemental algorithm using a logical decision-making process.
2. Calculating the value of a polynomial. Function tabulation. Determination of a bending line for a statically uncertain beam.
3. Calculating the function using Taylor development. A recurrent formula. Completion condition for iteration.
4. Determining the biggest deflection in a statically uncertain beam subject to bending.
5. Stability solution to a direct rod – numerical solution.
6. Sorting a random field. Working with text files.
7. Direct solutions to systems of linear equations. Inversion matrix. Determining reactions and internal forces in a lattice beam.
8. Iteration methods used in solutions to linear equations. Solving systems of linear equations with sparse and band matrixes.
9. Numerical integration of a definite integral. Determining the centre of gravity for an arch.
10. Numerical differentiation and solution to s simple differential equation.
11. Applying the beam solution on elastic subsoil using the network method.
12. Applying the carrying wall solution using the network method.
13. Applying the supporting slab solution using the network method.
2. Basic of algorithmisation: features of algorithms and elemental algorithms.
3. Calculation of functions: Calculating polynomial values, function tabulation and graphs, determining of extreme points in a discretised function.
4. Solutions to non-linear algebraic equations: iterations, iteration methods and solutions to non-linear algebraic equations.
5. Methods used in sorting of element sets: bubble sorting, sorting by direct selection of a minimum, sorting by direct entering, fast sorting, Shell’s sorting.
6. Solutions to systems of linear equations: direct methods used in solutions to linear equations – a triangle system solution, Gauss and Gauss-Jordan elimination methods, LU and Cholesky decomposition.
7. Solutions to systems of linear equations: iteration methods used in solutions to linear equations – Jacobi iteration, Gauss-Seidel iteration, sparse and band matrixes, conjugate gradient method.
8. Numerical integration of a definite integral: rectangular, trapezoidal, Simpson and Romberg methods for numerical integration, adaptive integration and Gauss method.
9. Numerical differentiation. Solution to simple differential equations.
10. Algorithmisation of building mechanics tasks by means of a network method. Application for a beam on elastic subsoil.
11. A planar problem: algorithmisation by means of a network method.
12. Supporting plate: algorithmisation by means of a network method.
13. Stability of rods and rod structures: available methods and algorithmisation of certain tasks.
Exercises
1. Introducing to the Matlab user environment. Definition and administration of variables. Function graphs. Creating an elemental algorithm using a logical decision-making process.
2. Calculating the value of a polynomial. Function tabulation. Determination of a bending line for a statically uncertain beam.
3. Calculating the function using Taylor development. A recurrent formula. Completion condition for iteration.
4. Determining the biggest deflection in a statically uncertain beam subject to bending.
5. Stability solution to a direct rod – numerical solution.
6. Sorting a random field. Working with text files.
7. Direct solutions to systems of linear equations. Inversion matrix. Determining reactions and internal forces in a lattice beam.
8. Iteration methods used in solutions to linear equations. Solving systems of linear equations with sparse and band matrixes.
9. Numerical integration of a definite integral. Determining the centre of gravity for an arch.
10. Numerical differentiation and solution to s simple differential equation.
11. Applying the beam solution on elastic subsoil using the network method.
12. Applying the carrying wall solution using the network method.
13. Applying the supporting slab solution using the network method.