Lecturers and Courses
There follow the list of the main lecturers of the school and the subject they will talk about. By clicking on "Show Detalis" some further informations will appear.
1 lecture = about 1 hour and a half
Prof. D. Bertaccini (Italy, Rome, Univ. "Tor Vergata")
"Time dependent PDEs, structures and preconditioning"
Show Details
5 lectures
Background.
Basic multivariable calculus and basic numerical analysis/scientific
computing with error analysis, norms, numerical solution of algebraic
linear systems with direct and iterative solvers, basics on numerical
solution of nonlinear algebraic systems and ordinary differential
equations.
Program.
A brief introduction to linear diffusion, advection and
advection-diffusion problems and their discretization. Using the
scructures (even if no apparent structure is present) to solve the
discretized problems. Some hints for the multi-iterative solution of
nonlinear systems. The course will include lab.
Prof. C. Di Fiore (Italy, Rome, Univ. "Tor Vergata")
"Basics in Power method, Perron-Frobenius theory, Page-Rank computation"
Show Details
Prof. S. Fanelli (Italy, Rome, Univ. "Tor Vergata")
"Matrix structures in optimization: algebras, fast
transforms and BFGS methods"
"Gradient-type methods: finite convergence criteria"
Show Details
Prof. D. Fasino (Italy, Udine, Univ. degli Studi di Udine)
"Spectral graph analysis: a network-oriented introduction"
"Numerical linear algebra with quasiseparable matrices"
Show Details
5 lectures - Moscow part
4 lectures - Rome part
References:
Vandebril, Van Barel, Mastronardi, A note on the representation and definition of semiseparable matrices, 2003
Dario Fasino, Numerical Linear Algebra with Applications, 2005
D. Fasino, A brief introduction to quasiseparable matrices. Lecture course notes.
Some references:
Mark E. J Newman, Networks - An introduction
A Bonato, A course on the web graph
Meyer, Langville, Google search engine and beyond
Free Preprints:
M. Newman, the structure and function of complex networks
S. Fortunato, comuntity detection in graphs
Prof. S. A. Goreinov (Russia, Moscow, INM RAS)
"Chebyshev's ideas in matrix approximation problems"
Show Details
4 lectures - Moscow Part
4 lectures - Rome Part
The slides of the lecures and the problems proposed can be found
here.
Prof. B. Khoromskij (Germany, Leipzig, MIS MPG)
"Introduction to tensor numerical methods in high-dimensional applications"
Show Details
Prof. K. Ikramov (Russia, Moscow, Lomonosov State Univ.)
"Introduction to Matrix Equations"
Show Details
Prof. D. Logofet (Russia, Moscow, IFA RAN)
"Ecological Applications of Matrices and Graphs"
Show Details
Prof. M. Olshanskii (Russia, Moscow, Lomonosov State Univ.)
"Introduction to multilevel/multigrid methods"
Show Details
Prof. M. A. Picardello (Italy, Rome, Univ. "Tor Vergata")
"Signals reconstruction from samples"
Show Details
5 lectures - Moscow part
Main References:
- Nikolskij, Course of Mathematical Analisys, 1975:
Chapters 15 and 16 (perhaps also 14)
- Massimo A. Picardello,
Note di Analisi di Fourier e trattamento dei segnali (in italian), Chapters 8, 9, 10, 11 and, mainly, 13 (This notes can be found
here)
- Aldroubi and Grochenig, Nonuniform sampling and reconstruction in shift-invariant
spaces, (
download)
Prof. E. E. Tyrtyshnikov (Russia, Moscow, INM RAS)
"Topics in Algebraic Equations"
Show Details
3 lectures - Moscow part
5 lectures - Rome part
Foreword.
Applications do not necessarily mean practical computations. In these notes, in particular, we can see some very useful applications of linear algebra
to ancient problems of construction by compasses and ruler and then to the problem
of solvability of algebraic equations by radicals.
In this lecture course we go straightforwardly to some famous results of algebra
in the hope that a concise and rigorous exposition may help to make difficult topics
more friendly and less difficult. The notes produce the whole picture of the course
and contain all basic steps and fundamental theorems. However, the proofs are not
in the notes and will be presented during the school.
Please be aware that next to none of the steps evolved in these notes is trivial.
So the proofs are essential part of the course. I hope we can enjoy them together as
the ideas and even details of the proofs are deep, ingenious and beautiful.
Background knowledge.
Groups, cyclic groups, subgroups, normal sub-groups, quotient (factor) groups, symmetric groups, alternating groups, abelian groups,
conjugate elements, isomorphisms, homomorphisms. Fields, subfields, extension fields.
Algebraic equations, fundamental theorem of algebra. Symmetric polynomials, elementary symmetric polynomials.
Download the notes of this lecture course
Prof. Yu. Vassilevski (Russia, Moscow, INM RAS)
"A brief introduction to approximate solution of boundary value problems (BVP's)"
Show Details
6 lectures - Moscow Part
1. Unstructured mesh generation technologies
Lecture: 2 hours. Practicum: 2 hours.
Download the presentation of the first lecture
2. Discretization of BVP's on unstructured meshes
Lecture: 2 hours. Practicum: 2 hours.
3. Computational techniques for solving sparse linear systems
Lecture: 2 hours. Practicum: 2 hours.
Prof. N. Zamarashkin (Russia, Moscow, INM RAS)
"Design and analysis of error-correcting codes"
Show Details
Prof. P. Zellini (Italy, Rome, Univ. "Tor Vergata")
"Complexity of matrix computations"
Show Details