16:15
16:15
14:30
Solving large sparse symmetric linear systems out of core
Abstract
Direct methods for solving large sparse linear systems of equations are popular because of their generality and robustness. As the requirements of computational scientists for more accurate models increases, so inevitably do the sizes of the systems that must be solved and the amount of memory needed by direct solvers.
For many users, the option of using a computer with a sufficiently large memory is either not available or is too expensive. Using a preconditioned iterative solver may be possible but for the "tough" systems that arise from many practical applications, the difficulties involved in finding and computing a good preconditioner can make iterative methods infeasible. An alternative is to use a direct solver that is able to hold its data structures on disk, that is, an out-of-core solver.
In this talk, we will explain the multifrontal algorithm and discuss the design and development of a new HSL sparse symmetric out-of-core solver that uses it. Both the system matrix A and its factors are stored externally. For the indefinite case, numerical pivoting using 1x1 and 2x2 pivots is incorporated. To minimise storage for the system data, a reverse communication interface is used. Input of A is either by rows or by elements.
An important feature of the package is that all input and output to disk is performed through a set of Fortran subroutines that manage a virtual memory system so that actual i/o occurs only when really necessary. Also important is to design in-core data structures that avoid expensive searches. All these aspects will be discussed.
At the time of writing, we are tuning the code for the positive-definite case and have performance figures for real problems. By the time of the seminar, we hope to have developed the indefinite case, too.
17:00
11:00
The saddle-node Hopf bifurcation with global reinjection
17:00
17:00
Divergence-Measure Fields, Geometric Measures,
and Conservation Laws
Abstract
In this talk we will discuss a theory of divergence-measure fields and related
geometric measures, developed recently, and its applications to some fundamental
issues in mathematical continuum physics and nonlinear conservation laws whose
solutions have very weak regularity, including hyperbolic conservation laws,
degenerate parabolic equations, degenerate elliptic equations, among others.
15:45
Laplace method for heat processes on loop spaces via rough paths
14:15
14:15
Invariant Measure of Numerical Solutions of SDE with Markovian Switching
Abstract
Stochastic differential equations with Markovian switching (SDEwMSs), one of the important classes of hybrid systems, have been used to model many physical systems that are subject to frequent unpredictable structural changes. The research in this area has been both theoretical and applied. Although the numerical methods for stochastic differential equations (SDEs) have been well studied, there are few results on the numerical solutions for SDEwMSs. The main aim of this talk is to investigate the invariant measure of numerical solutions of SDEwMSs and discuss their convergence.
12:00
15:15
14:00
Computational Techniques in Biomedical Engineering: From Cell to Vessel
16:30
Compact Source and Dipole Representation of Solutions of the Wave Equation in Irregular Regions
Abstract
Moving hydrodynamic boundaries (waves and bubbles, for example) produce acoustic signatures.
16:00
On p-adic L-functions and main conjectures in non-commutative Iwasawa theory
Optimization on matrix manifolds
Abstract
It is well known that the computation of a few extreme eigenvalues, and the corresponding eigenvectors, of a symmetric matrix A can be rewritten as computing extrema of the Rayleigh quotient of A. However, since the Rayleigh quotient is a homogeneous function of degree zero, its extremizers are not isolated. This difficulty can be remedied by restricting the search space to a well-chosen manifold, which brings the extreme eigenvalue problem into the realm of optimization on manifolds. In this presentation, I will show how a recently-proposed generalization of trust-region methods to Riemannian manifolds applies to this problem, and how the resulting algorithms compare with existing ones.
I will also show how the Joint Diagonalization problem (that is, approximately diagonalizing a collection of symmetric matrices via a congruence transformation) can be tackled by a differential geometric approach. This problem has an important application in Independent Component Analysis.