University of Basel

Jacob Bernoulli is known for his studies of the curves, infinitesimal math- ematics and statistics. However, before being a professor in mathematics, he taught experimental physics at the University of Basel. This explains his high interest in solving physical problems with newly developed Leibnizian calculus. In his scientific notebook, Meditationes, there are more than thirty notes about various mechanical problems for solving of which Bernoulli has applied Leibnizian calculus and has advanced this method along the way. A discussion with a craftsman brought Bernoulli’s attention to the problem of the strength of a beam early in his career and occupied his mind until his death. The craftsman’s narration based on his experience highlighted the flaws in Galilean-Leibnizian theory of the strength of a beam. This was the starting point of Bernoulli’s quest to mathematically find the profile of a bent beam (the Elastica Problem) and the physical laws governing it. He started a challenge to encourage other mathematicians of the time to study the problem, providing a hint hidden in an anagram. Although he published his solution of the Elastica Problem in 1694, that was not the end of the quest for him. Studying his unpublished notes in Meditationes reveals that over the last decade of his life, Bernoulli has reconsidered the problem. In my project, I demonstrate that he has found remarkable concepts such as mean tensile stress, and the notion of local stress-strain relation, etc.

Let L be a lattice in R^n and let Z in R^(m+n) a parameterized family of subsets Z_T of R^n. Starting from an old result of Davenport and using O-minimal structures, together with Martin Widmer, we proved for fairly general families Z an estimate for the number of points of L in Z_T, which is essentially best possible.
After introducing the problem and stating the result, we will present applications to counting algebraic integers of bounded height and to Manin’s Conjecture.

Let ${\cal E}$ be a family of elliptic curves over a base variety defined over $\mathbb C$. An additive extension ${\cal G}$ of ${\cal E}$ is a family of algebraic groups which fits into an exact sequence of group schemes $0\rightarrow {\mathbb G}_{\rm a}\rightarrow {\cal G}\rightarrow {\cal E}\rightarrow 0$. We can define the special subvarieties of ${\cal G}$ to be families of algebraic groups over the same base contained in ${\cal G}$. The relative Manin-Mumford conjecture suggests that the intersection of a curve in ${\cal G}$ with the special subvarieties of dimension 0 is contained in a finite union of special subvarieties.

To prove this we can assume that the family ${\cal E}$ is the Legendre family and then follow the strategy employed by Masser-Zannier for their proof of the relative Manin-Mumford conjecture for the fibred product of two legendre families. This has applications to classical problems such as the theory of elementary integration and Pell's equation in polynomials.

The use of weighted matchings is becoming increasingly standard in the

solution of sparse linear systems. While non-symmetric permutations based on these

matchings have been the state-of-the-art for

several years (especially for direct solvers), approaches for symmetric

matrices have only recently gained attention.

\\

In this talk we discuss results of our work on using weighted matchings in

the preconditioning of symmetric indefinite linear systems, following ideas

introduced by Duff and Gilbert. In order to maintain symmetry,

the weighted matching is symmetrized and the cycle structure of the

resulting matching is used to build reorderings that form small diagonal

blocks from the matched entries.

\\

For the preconditioning we investigated two approaches. One is an

incomplete $LDL^{T}$ preconditioning, that chooses 1x1 or 2x2 diagonal pivots

based on a simple tridiagonal pivoting criterion. The second approach

targets distributed computing, and is based on factorized sparse approximate

inverses, whose existence, in turn, is based on the existence of an $LDL^{T}$

factorization. Results for a number of comprehensive test sets are given,

including comparisons with sparse direct solvers and other preconditioning

approaches.