School
Modeling with Wolfram Mathematica
Időpont: 2022.03.03 10:00 - 2022.03.04 17:00
Helyszín: On-line, Bolyai Institute, University of Szeged
Green-field" introductory online training, where even complete beginners will learn the most important tools and applications of Mathematica (representations, calculations, dynamic operations, simple programming techniques...) in different fields of science, starting from a blank screen to nice applications. After the training, participants will be able to create and use simple applications on their own.
Participation is free of charge but registration is required.
Language is English.
Application via Email: karsai.janosmath.u-szeged.hu (deadline: February 27, 2022)
The application form can be downloaded from here!
Web: http://www.model.u-szeged.hu
Applicants will receive Mathematica access for the duration of the course, the installer, connectivity to the online conference system, and handouts. The installation will be done by the participants themselves.
The first 10 applicant-participant will receive a gift after the training.
Planned programme
| Thursday, 3 March 2022 | |
| 08.40 – 09.00 | Registration, check-in. |
| 09.00 – 10.00 | Mathematica overview. |
| 10.00 – 12.00 with Coffee break |
Elementary modeling problems. Data and functions. Intuitive use of Wolfram Alpha and Mathematica. Numerical and symbolic computations, using variables and functions; handling lists, substitution rules. Algebraic operations, solving equations. Simple visualizations. |
| 12.00 – 13.00 | Lunch break. |
| 13.00 – 16.00 with Coffee break |
Visualization, dynamic applications, analysis of changes. |
| 16.00 – 17.00 | Questions and problems. |
| Friday, 4 March 2022 | |
| 09.00 – 12.00 with Coffee break |
3D graphics, Lin. algebra applications, functions of 2-3 variables.Data - models: representation, data transformations, curve fitting. |
| 12.00 – 13.00 | Lunch break |
| 13.00 – 16.00 with Coffee break |
Elements of Mathematica programming: data structures; using substitution rules, pattern recognition; list programming; graphics: structures and programming; iterations, recursions. |
| 16.00 – 17.00 | Questions and problems; Summary. |
