Newton’s method is well known as a root finder locally near the roots. It is often “not recommended” as a global root finder because of its “chaotic” properties. We give a very efficient theoretical upper bound on its speed of convergence: all roots…
Categoria evento: Seminar on Numerical Analysis
Optimization & Numerical Analysis seminars”- Numerical methods for computing the steady-state distribution of a G-network. – Tommaso Nesti (University of Pisa) (Il Seminario si svolgerà nella Sala Seminari Est, Dipartimento Informatica.)
G-networks are a class of queueing networks introduced by E. Gelembe in 1989, which are characterized by the presence of positive and negative customers. Unlike classical queueing networks, the equations yielding the steady-state distribution of a…
Optimization & Numerical Analysis seminar – “Krylov subspace methods for the solution of linear systems”” – Francesco Romani – Dipartimento di Informatica – Università di Pisa (Il seminario si svolgerà nella Sala Seminari Ovest al Dipartimento di Informatica)
Krylov subspace methods are iterative methods for the solution of linear systems which operate by multiplying the system matrix (sometimes also its transpose) by a vector. They are recommended when the system matrix is large and sparse or with a…
Optimization & Numerical Analysis seminar – “Optimizing Green Wireless LANs” – Maria Grazia Scutellà – Dipartimento di Informatica, Università di Pisa (Il seminario si svolgerà nella Sala Seminari Ovest al Dipartimento di Informatica)
We consider problems arising in the design of Green (or energy-saving) Wireless Local Area Networks (GWLANs). In this context, decisions on powering-on a set of access points, and decisions on the assignment of the user terminals to the opened…
Optimization & numerical Analysis seminar – Methods for accurate invariant subspace computations – Federico Poloni – Dipartimento di Informatica, Univ. Pisa (Il Seminario si svolgerà al Dipartimento di Informatica – Sala Riunioni Est)
We consider two modelling problems, one arising in control theory (linear-quadratic regulator) and one arising in the modelling of queues (or buffers) under a continuous-time Markov model. The solution of both can be reduced to finding the invariant…
Optimization & numerical analysis seminars – Iterative approaches for graph-structured linear systems arising in optimization – Antonio Frangioni – Università di Pisa (Al Dipartimento di Informatica – Sala Seminari Ovest)
When applying Interior Point (IP) algorithm to the solution of linear or convex separable optimization problems with strong graph structure, like the Min Cost Flow (MCF) problem, one has to repeatedly solve linear systems with strong graph…