Arbeitsgemeinschaft NUMERIK: MPI MIS


13.07.2009	Aram Khachatryan (MPI MiS, Leipzig) Data-sparse approximation of singular functions

13.07.2009

Aram Khachatryan (MPI MiS, Leipzig)

Data-sparse approximation of singular functions


18.06.2008	Jan Schneider (MPI MiS, Leipzig) s-numbers and Eigenvalues no abstract available

18.06.2008

Jan Schneider (MPI MiS, Leipzig)

s-numbers and Eigenvalues

no abstract available


28.02.2007	Stephan Schwinger (MPI MiS, Leipzig) Minimal Finite Element Spaces for $2m-$th Order Partial Differential Equations in $\mathbb{R}^n$ (by Wang M., Xu J.) In their 2006 paper, Wang and Xu develop a convergence theory for nonconforming finite element methods. Moreover, they explicitly construct consistent FE spaces of minimal polynomial degree for the discretization of the Sobolev spaces $H^m(\mathbb{R}^n)$ for $n\ge m$ on simplicial meshes. Their main results will be presented in this talk.

28.02.2007

Stephan Schwinger (MPI MiS, Leipzig)

Minimal Finite Element Spaces for $2m-$th Order Partial Differential Equations in $\mathbb{R}^n$ (by Wang M., Xu J.)

In their 2006 paper, Wang and Xu develop a convergence theory for nonconforming finite element methods. Moreover, they explicitly construct consistent FE spaces of minimal polynomial degree for the discretization of the Sobolev spaces $H^m(\mathbb{R}^n)$ for $n\ge m$ on simplicial meshes. Their main results will be presented in this talk.


30.11.2006	Reinhold Schneider (Christian-Albrechts-Universität zu Kiel) Boundary Value Problem with Stochastic Parameters
27.09.2006	Ulf Kähler (MPI MiS, Leipzig) Wavelet radiosity
23.08.2006	Wolfgang Hackbusch Efficient convolution for functions on refined grids
05.07.2006	Wolfgang Hackbusch (MPI MiS, Leipzig) On the Efficient Evaluation of Coalescence Integrals in Population Balance Models
31.05.2006	Sambasiva Rao Chinnamsetty (MPI MiS, Leipzig) Kronecker Tensor Product Approximation in Electronic Structure Calculations
17.05.2006	Petya Staykova (MPI MiS, Leipzig) Design and Development of GUI for Interactive Modelling of Hierarchical Data Structures
03.05.2006	Lars Grasedyck (MPI MiS, Leipzig) Domain-Decomposition based H-Matrices
26.04.2006	Boris Khoromskij (MPI MiS, Leipzig) Tensor Decomposition to the Classical Potentials
19.04.2006	Tino Eibner (Technische Universität Chemnitz) Boundary concentrated and adaptive hp-FEM
12.04.2006	Steffen Börm (Max-Planck-Institut für Mathematik) Adaptive Variable-Order H^2-Matrices
05.04.2006	Jelena Djokic Update of Hierarchical Matrices. Part III.
22.03.2006	Florian Drechsler Optimierung von Clusterbäumen zu H-Matrix Strukturen bei Randelementmethoden
10.01.2006	Katharina Benkert (High Performance Computing Center Stuttgart) Vector computers At first, I will explain the reason why vector computers have the ability to outperform scalar architectures and what prerequisites are needed to make this possible. If these prerequisites are full-filled, one speaks of vectorizing code. In the main part of the talk, I will show code segments of the three possible types of code (non-vectorizing, vectorizing, and code that has to be transformed by the compiler to be vectorized). I will also explain the right way to access main memory on a vector system. After that, some of the changes that have to be applied to a simple FEM program to obtain vectorizing code are presented.

30.11.2006

Reinhold Schneider (Christian-Albrechts-Universität zu Kiel)

Boundary Value Problem with Stochastic Parameters

27.09.2006

Ulf Kähler (MPI MiS, Leipzig)

Wavelet radiosity

23.08.2006

Wolfgang Hackbusch

Efficient convolution for functions on refined grids

05.07.2006

Wolfgang Hackbusch (MPI MiS, Leipzig)

On the Efficient Evaluation of Coalescence Integrals in Population Balance Models

31.05.2006

Sambasiva Rao Chinnamsetty (MPI MiS, Leipzig)

Kronecker Tensor Product Approximation in Electronic Structure Calculations

17.05.2006

Petya Staykova (MPI MiS, Leipzig)

Design and Development of GUI for Interactive Modelling of Hierarchical Data Structures

03.05.2006

Lars Grasedyck (MPI MiS, Leipzig)

Domain-Decomposition based H-Matrices

26.04.2006

Boris Khoromskij (MPI MiS, Leipzig)

Tensor Decomposition to the Classical Potentials

19.04.2006

Tino Eibner (Technische Universität Chemnitz)

Boundary concentrated and adaptive hp-FEM

12.04.2006

Steffen Börm (Max-Planck-Institut für Mathematik)

Adaptive Variable-Order H^2-Matrices

05.04.2006

Jelena Djokic

Update of Hierarchical Matrices. Part III.

22.03.2006

Florian Drechsler

Optimierung von Clusterbäumen zu H-Matrix Strukturen bei Randelementmethoden

10.01.2006

Katharina Benkert (High Performance Computing Center Stuttgart)

Vector computers

At first, I will explain the reason why vector computers have the ability to outperform scalar architectures and what prerequisites are needed to make this possible. If these prerequisites are full-filled, one speaks of vectorizing code. In the main part of the talk, I will show code segments of the three possible types of code (non-vectorizing, vectorizing, and code that has to be transformed by the compiler to be vectorized). I will also explain the right way to access main memory on a vector system. After that, some of the changes that have to be applied to a simple FEM program to obtain vectorizing code are presented.


25.11.2004	Jeffrey Ovall (MPI MiS, Leipzig) Dual Functions for Parallel Adaptive Algorithms

25.11.2004

Jeffrey Ovall (MPI MiS, Leipzig)

Dual Functions for Parallel Adaptive Algorithms


09.04.2003	Alexander Litvinenko (MPI MiS, Leipzig) The Influence of Prior Knowledge on the Expected Performance of a Classifier In this talk, we study probabilistic properties of pattern classifiers in discrete feature space. The principle of Bayesian averaging of recognition performance is used for the analysis. We consider two cases: a) prior probabilities of classes are unknown, and b) prior probabilities of classes are known. The misclassification probability is represented as a random value, for which the characteristic function (expressed via Kummer hypergeometric function) and absolute moments are analytically derived. For the case of unknown priors, an approximate formula for calculation of sufficient learning sample size is obtained. The comparison between the performances for two considered cases is made. As an example, we consider the problem of mutational hotspots classification in genetic sequences.
02.04.2003	Eugene Tyrtyshnikov (Russian Academy of Science, Moscow) to be announced

09.04.2003

Alexander Litvinenko (MPI MiS, Leipzig)

The Influence of Prior Knowledge on the Expected Performance of a Classifier

In this talk, we study probabilistic properties of pattern classifiers in discrete feature space. The principle of Bayesian averaging of recognition performance is used for the analysis. We consider two cases: a) prior probabilities of classes are unknown, and b) prior probabilities of classes are known. The misclassification probability is represented as a random value, for which the characteristic function (expressed via Kummer hypergeometric function) and absolute moments are analytically derived. For the case of unknown priors, an approximate formula for calculation of sufficient learning sample size is obtained. The comparison between the performances for two considered cases is made. As an example, we consider the problem of mutational hotspots classification in genetic sequences.

02.04.2003

Eugene Tyrtyshnikov (Russian Academy of Science, Moscow)

to be announced


06.11.2002	Beate Paulus (MPI für Physik komplexer Systeme, Dresden, Germany) Ab-initio incremental correlation treatment for metals
19.09.2002	Steffen Börm (MPI MiS, Leipzig) H²-matrices
18.09.2002	Lars Grasedyck (MPI MiS, Leipzig) A multigrid method to solve large scale Sylvester equations
13.03.2002	Steffen Börm (MPI MiS, Leipzig) Hierarchische Quadratur
27.02.2002	Jürgen Koch (MPI MiS, Leipzig) Populationsdynamische Modelle: Effiziente Behandlung der bei Kristallisationsprozessen auftretenden Integraloperatoren
20.02.2002	Michael Kuhn (Bruker Saxonia Analytik GmbH, Leipzig) Numerical Methods in Chemometrics Basic principles of mass spectroscopy are introduced. Starting with simple problems of spectrum analysis, we present challanging problems which are directly related to the solution of first kind integral equations.

06.11.2002

Beate Paulus (MPI für Physik komplexer Systeme, Dresden, Germany)

Ab-initio incremental correlation treatment for metals

19.09.2002

Steffen Börm (MPI MiS, Leipzig)

H²-matrices

18.09.2002

Lars Grasedyck (MPI MiS, Leipzig)

A multigrid method to solve large scale Sylvester equations

13.03.2002

Steffen Börm (MPI MiS, Leipzig)

Hierarchische Quadratur

27.02.2002

Jürgen Koch (MPI MiS, Leipzig)

Populationsdynamische Modelle: Effiziente Behandlung der bei Kristallisationsprozessen auftretenden Integraloperatoren

20.02.2002

Michael Kuhn (Bruker Saxonia Analytik GmbH, Leipzig)

Numerical Methods in Chemometrics

Basic principles of mass spectroscopy are introduced. Starting with simple problems of spectrum analysis, we present challanging problems which are directly related to the solution of first kind integral equations.

Arbeitsgemeinschaft NUMERIK

Previous Events

Administrative Contact

Katharina Matschke