Seminar Archive - 2009

Our regular seminar program covers a broad range of topics from applied mathematics, pure mathematics and statistics. All staff and students are welcome. A complete list of past seminars can be accessed via the left-hand menu.

The spanning tree packing number of a graph G, denoted s(G), is the largest number of edge-disjoint spanning trees in G. An obvious upper bound on s(G) is the edge-connectivity of G. We consider those graphs for which these two parameters are equal...

Talk on the lumped mass finite element method for parabolic problems.

The main result we will discuss is the following: the square function inequality holds in an rearrangement invariant space X for all sequences of independent mean zero random variables from X if and only if X has the Kruglov property. The same...

Matrices of large size arise in particular from elliptic partial differential equations and integral equations. In the former case one make use of the sparsity, in the latter case a standard treatment of the matrices leads already to storage...

We consider h-step-ahead prediction for a time series process satisfying a Markov assumption. Our aim is to find an upper 1-a prediction limit that covers the h-step-ahead value of the time series with probability 1-a; conditional on the appropriate...

We consider the hybrid approach to scattered data approximation on the sphere S2 with radial basis functions plus a polynomial. If the given data of the unknown function contain noise, then we need to use smoothing approximation, rather than...

Motivated by the importance of maximum principles in the theory of partial differential equations and in the numerical analysis, we establish simple maximum principles for basic partial dynamic operators on multidimensional time scales. As in the...

I am going to speak about recent joint results with A. B. Aleksandrov. It is well known that a Lipschitz function does not have to be operator Lipschitz. In other words, the inequality |f(x)-f(y)| = const |x-y| does not imply that ||f(A)-f(B)|| =...