Send mail to:  mgnet@cs.yale.edu             for the digests or bakeoff
               mgnet-requests@cs.yale.edu    for comments or help
 
Anonymous ftp repository:  www.mgnet.org (128.163.209.19)
 
Current editor:  Craig Douglas douglas-craig@cs.yale.edu
 

World Wide Web:  http://www.mgnet.org or
                 http://casper.cs.yale.edu/mgnet/www/mgnet.html or
                 http://www.cerfacs.fr/~douglas/mgnet.html or
                 http://phase.etl.go.jp/mgnet or
                 http://www.nchc.gov.tw/RESEARCH/Math/mgnet/www/mgnet.html

Today's editor:  Craig Douglas (douglas-craig@cs.yale.edu)

Volume 10, Number 2 (approximately February 29, 2000)

Today's topics:

     Important Date
     ETNA Special Issue on Multilevel Methods
     CFD and Multigrid
     Locally Optimal Block Preconditioned Conjugate Gradient Method for
         Symmetric Eigenproblems
     4 Papers by Andrew Knyazev et al
     Preprints Available (Jun Zhang et al)
     Books Announcement: Using MPI and MPI-2
     Mesh Interpolations
     Electronic Transactions on Numerical Analysis (ETNA) vol. 8-9
     Conference Announcement: SCEE-2000
     Conference Announcement: Multiscale Chemistry

-------------------------------------------------------

Date: Fri, 03 Mar 2000 10:15:12 +0500
From: Craig Douglas 
Subject: Important Date

March 19    Hotel reservations cutoff for the Colorado Conference on Iterative
            Methods.
            See http://amath-www.colorado.edu/appm/faculty/copper/2000.

-------------------------------------------------------

Date: Tue, 29 Feb 2000 10:15:12 +0500
From: Craig Douglas 
Subject: ETNA Special Issue on Multilevel Methods

Electronic Transactions on Numerical Analysis (ETNA)
Volume 10, 2000

                    Special Issue on Multilevel Methods

The Ninth Copper Mountain Conference on Multigrid Methods was held April
11-16, 1999, at Copper Mountain, Colorado, U.S.A. The major theme of this
meeting was "General Scalable Multigrid Methods: Algebraic Algorithms and
Parallel Techniques". The seven papers in this volume were presented there
and selected for publication in this dedicated issue. The range of topics
covered by these papers demonstrates the breadth and strength of this still
vibrant area of research.

The Conference was organized by the University of Colorado, the Society for
Industrial and Applied Mathematics, the Center for Applied Scientific
Computation at LLNL, the Institute for Algorithms and Scientific Computing
of the GMD, and Front Range Scientific Computations, Inc. In addition, the
conference was supported by the Department of Energy, the National Science
Foundation, and IBM Corporation.

The Program Committee for this conference consisted of Joel Dendy, Craig
Douglas, Paul Frederickson, Van Henson, Jim Jones, Kirk Jordan, Jan Mandel,
Daune Melson, Seymour Parter, Joseph Pasciak, John Ruge, Klaus Stüben,
Ulrich Trottenberg, Panayot Vassilevski, Pieter Wesseling, Olof Widlund, and
Irad Yaneh. These members of the Program Committee acted as the Guest
Editors for this special issue.

Cathy Lee, Conference Coordinator, made sure that the conference and its
program ran smoothly and justly earns our deepest gratitude. Finally, we
want to thank Arden Ruttan and ETNA for making this special issue possible.

Seymour Parter, Guest Editor
Tom Manteuffel and Steve McCormick, Conference Co-Chairs

                                  * * * * *

General highly accurate algebraic coarsening.
 Achi Brandt.
 pp. 1-20.

Cache optimization for structured and unstructured grid multigrid.
 Craig C. Douglas, Jonathan Hu, Markus Kowarschik, Ulrich Ruede, Christian
 Weiss.
 pp. 21-40.

A parallel AMG for overlapping and non-overlapping domain decomposition.
 Gundolf Haase.
 pp. 41-55.

Multilevel projection methods for nonlinear least-squares finite element
computations.
 Johannes Korsawe and Gerhard Starke.
 pp. 56-73.

A hybrid multigrid method for the steady-state incompressible Navier-Stokes
equations.
 Michael Pernice.
 pp. 74-91.

Behavior of plane relaxation methods as multigrid smoothers.
 Ignacio M. Llorente and N. Duane Melson.
 pp. 92-114.

On preconditioning schur complement and schur complement preconditioning.
 Jun Zhang.
 pp. 115-130.

    Editor's Note: See http://etna.mcs.kent.edu and click on Vol. 10 (2000).
    -------------

-------------------------------------------------------

Date: Mon, 28 Feb 2000 11:13:55 +0000 (GMT)
From: "John Buckley" 
Subject: CFD and Multigrid

I have been working on a 2-D explicit CFD code, based on Jameson's 4 stage
Runge-Kutta technique, for almost 3 years now.  Our main reason for this work
is to model the flow of wet steam through turbines.  Recently we decided to
try using a multigrid method to improve the convergence rate.  I have
successfully implemented a 1D multigrid code (using the same algorithms as the
2D code) and get an improvement in convergence of between 10 and 40 times.
However the 2D code has been more of a challenge.  I believe that the problems
are due to the solid boundaries interfering with the multigrid process.  One
solution would be to freeze the solid boundary variables at the fine grid
values on the coarser levels.

I just wondered whether you know of a resource or person who might be able to
give me some expert advice in this area?  I have looked elsewhere for help but
haven't come up anything too useful yet.

Thanks in advance

John Buckley MEng
Research Associate in Wet Steam Flow,
University of Birmingham, UK
email:  jrbuckley@os2warp.freeserve.co.uk
tel:    +44 (0)121 414 4214

-------------------------------------------------------

Date: Sun, 06 Feb 2000 00:16:55 -0700
From: Andrew Knyazev 
Subject:  Locally Optimal Block Preconditioned Conjugate Gradient Method for
          Large Symmetric Eigenproblems

The most recent MATLAB revision (currently 3.2.8, 2000/2/4) of my LOBPCG
(Locally Optimal Block Preconditioned Conjugate Gradient) Method is now
publicly available at

    http://www-math.cudenver.edu/~aknyazev/software/CG/

Main features:  a matrix-free iterative method for computing several extreme
eigenpairs of large symmetric positive generalized eigenproblems; a
user-defined symmetric positive preconditioner (a good preconditioner for a
stiffness matrix works well for the corresponding eigenvalue problem, too!);
robustness with respect to random initial approximations, variable
preconditioners, and ill-conditioning (up to 10^15) of the stiffness matrix of
the eigenproblem; apparently optimal convergence speed.

Numerical comparisons suggest that LOBPCG is a genuine analog for
eigenproblems of the standard preconditioned conjugate gradient method for
symmetric linear systems.

The algorithm of LOBPCG is described in

Andrew Knyazev, Toward the Optimal Preconditioned Eigensolver: Locally
Optimal Block Preconditioned Conjugate Gradient Method, Tech. Report,
UCD-CCM 149, Jan. 2000, see

    http://www-math.cudenver.edu/ccmreports/rep149.ps.gz

The paper above also introduces Preconditioned Eigensolvers Benchmarking and
presents some benchmarking results for LOBPCG.  All benchmarking m-files are
available at

    http://www-math.cudenver.edu/~aknyazev/software/CG/

The LOBPCG code is supported.  Please contact me ASAP if you find any bugs, or
have any suggestions on further numerical testing.  Feel free to email
directly, or to use an Interactive HyperNews group on eigensolvers at

    http://www-math.cudenver.edu/cgi-bin/HyperNews/get/eigensolvers.html

Best regards, Andrew Knyazev
Director, Center for Computational Mathematics
P.O. Box 173364, Campus Box 170, Denver, CO 80217-3364.
Street Address: 1250 14th St.., Room 644, Denver CO 80202
Phone: (303) 556-8442. Fax: (303) 556-8550

-------------------------------------------------------

Date: Wed, 26 Jan 2000 20:50:35 -0700
From: Andrew Knyazev 
Subject: 4 Papers by Andrew Knyazev et al

  An Efficient Iterative Method for Stokes equations and Lame equations for
      nearly incompressible media with highly discontinuous coefficients

             N. S. Bakhvalov, A. V. Knyazev and R. R. Parashkevov
                               December 1, 1997
                    URN = ncstrl.cudenver_ccm/UCD-CCM-120
http://cs-tr.cs.cornell.edu:80/Dienst/UI/1.0/Display/ncstrl.cudenver_ccm/UCD-CCM-120

Abstract:  We consider an efficient iterative solution technique for the
isotropic linear elasticity (Lam\'{e}) equations for nearly incompressible
media and Stokes equations with highly discontinuous coefficients.  The
iterative method involves a special choice for an initial guess and a
preconditioner based on solving a constant coefficient problem.  For
simplicity, we only analyze a periodic boundary value problem.  Some other
standard boundary value problems can be treated similarly, or can be reduced
to the periodic case by using the fictitious domain method.  For the Lam\'{e}
equations, we also discuss the case of absolutely compressible media.

    Editor's Note: See http://www.mgnet.org/mgnet-papers.html or
    -------------  http://www.mgnet.org/mgnet/papers/Bakhvalov-Knyazev-Parashkevov/rep120.ps.gz

                             * * * * * * * * * *

Lavrentiev Regularization + Ritz Approximation Uniform Finite Element
Error Estimates for Differential Equations with Rough Coefficients

Andrew Knyazev and Olof Widlund
May 1, 1998
URN = ncstrl.cudenver_ccm/UCD-CCM-132
http://cs-tr.cs.cornell.edu:80/Dienst/UI/1.0/Display/ncstrl.cudenver_ccm/UCD-CCM-132

Abstract:  We consider a parametric family of boundary va= lue problems for
the diffusion equation with the diffusion coefficient eq= ual to a small
constant in a subdomain.  Such problems are not uniformly w= ell-posed when
the constant gets small.  However, in a series of papers, B= akhvalov and
Knyazev have suggested a natural splitting of the problem in= to two
well-posed problems.  Using this idea, we prove a uniform finite el= ement
error estimate for our model problem in the standard parameter-inde= pendent
Sobolev norm.  We consider a traditional finite element method wit= h only one
additional assumption, namely, that the boundary of the subdom= ain with the
small coefficient does not cut any finite element.  One inter= pretation of
our main theorem is in terms of regularization.  Our FEM prob= lem can be
viewed as resulting from a Lavrentiev regularization and a Rit= z--Galerkin
approximation of a symmetric ill-posed problem.  Our error est= imate can then
be used to find an optimal regularization parameter togeth= er with the
optimal dimension of the approximation subspace.

    Editor's Note: See http://www.mgnet.org/mgnet-papers.html or
    -------------  http://www.mgnet.org/mgnet/papers/Knyazev-Widlund/rep132.ps.gz

                             * * * * * * * * * *

              Preconditioned Eigensolvers: Practical Algorithms

                          Andrew V. Knyazev
                                June 15, 1999
                    URN = ncstrl.cudenver_ccm/UCD-CCM-143
http://cs-tr.cs.cornell.edu:80/Dienst/UI/1.0/Display/ncstrl.cudenver_ccm/UCD-CCM-143

Abstract:  We propose a systematic review of preconditioned iterative methods
for symmetric eigenvalue problems, separating the choice of the preconditioner
and the choice of the iterative scheme.  We describe several known methods,
concentrating on algorithms and with just brief references to existing theory.
We discuss, in some details, the algorithm of the recently suggested by the
author Optimal Block Conjugate Gradient Method.  We present numerical results
showing that the method converges linearly with the optimal convergence rate.
Numerical comparison establishes that our method is much faster than the Block
Steepest Ascent Method when the same preconditioner is used in both methods.
We discuss peculiarities of locking for preconditioned iterative eigensolvers.

    Editor's Note: See http://www.mgnet.org/mgnet-papers.html or
    -------------  http://www.mgnet.org/mgnet/papers/Knyazev/rep143.ps.gz

                             * * * * * * * * * *

               Toward the Optimal Preconditioned Eigensolver:

       Locally Optimal Block Preconditioned Conjugate Gradient Method

                                A. V. Knyazev
                               January, 2000
                   URN = ncstrl.cudenver_ccm/UCD-CCM-149
http://cs-tr.cs.cornell.edu:80/Dienst/UI/1.0/Display/ncstrl.cudenver_ccm/UCD-CCM-149

Abstract:  We describe new algorithms of the Locally Optimal Block
Preconditioned Conjugate Gradient (LOBPCG) Method for symmetric eigenvalue
problems, based on a local optimization of a three-term recurrence.  To be
able to compare numerically different methods in the class, with different
preconditioners, we suggest a common system of model tests, using random
preconditioners and initial guesses.  As the ``ideal'' control algorithm, we
propose the standard preconditioned conjugate gradient method for finding an
eigenvector as an element of the null--space of the corresponding homogeneous
system of linear equations under the assumption that the eigenvalue is known.
We recommend that every new preconditioned eigensolver be compared with this
``ideal'' algorithm on our model test problems in terms of the speed of
convergence, costs of every iterations and memory requirements.  We provide
such comparison for our LOBPCG Method.  Numerical results establish that our
algorithm is practically as efficient as the ``ideal'' algorithm when the same
preconditioner is used in both methods.  We also show numerically that the
LOBPCG Method provides approximations to first eigenpairs of about the same
quality as those by the much more expensive global optimization method on the
same generalized block Krylov subspace.  Finally, direct numerical comparisons
with the Jacobi--Davidson method show that our method is more robust and
converges almost two times faster.

    Editor's Note: See http://www.mgnet.org/mgnet-papers.html or
    -------------  http://www.mgnet.org/mgnet/papers/Knyazev/rep149.ps.gz

-------------------------------------------------------

Date: Mon, 7 Feb 2000 10:36:41 -0500 (EST)
From: Jun Zhang 
Subject: Preprints Available (Jun Zhang et al)

The following preprints are available from downloaded from

   http://www.cs.uky.edu/~jzhang

Thank you for your interest.

Jun Zhang

                             * * * * * * * * * *

                 High Accuracy Stable Numerical Solution of 
                    1D Microscale Heat Transport Equation

                                  Jun Zhang
           Department of Computer Science, University of Kentucky  
               773 Anderson Hall, Lexington, KY 40506-0046, USA

                               Jennifer J. Zhao
                   Department of Mathematics and Statistics
                     University of Michigan at Dearborn 
                         Dearborn, MI 48128-1491, USA

                                   ABSTRACT

We investigate the use of a fourth order compact finite difference scheme for
solving an one dimensional heat transport equation at the microscale.  The
fourth order compact scheme is used with a Crank-Nicholson type integrator by
introducing an intermediate function for the heat transport equation.  The new
scheme is proved to be unconditionally stable with respect to initial values.
Numerical experiments are conducted to compare the new scheme with the
existing scheme based on second order spatial discretization.  It is shown
that the new scheme is computationally more efficient and more accurate than
the second order scheme.

                             * * * * * * * * * *

          Fourth Order Compact Difference Scheme for 3D Convection 
         Diffusion Equation with Boundary Layers on Nonuniform Grids

                                  Jun Zhang
            Department of Computer Science, University of Kentucky
               773 Anderson Hall, Lexington, KY 40506-0046, USA

                                   Lixin Ge
          Center for Computational Sciences, University of Kentucky
                        Lexington, KY 40506-0045, USA

                                Murli M. Gupta
         Department of Mathematics, The George Washington University
                          Washington, DC 20052, USA


                                   ABSTRACT

We present a fourth order compact finite difference scheme for a general three
dimensional convection diffusion equation with variable coefficients on a
uniform cubic grid.  This high order compact difference scheme is used to
solve convection diffusion equation with boundary layers on a three
dimensional nonuniform grid.  We compare the computed accuracy and
computational efficiency of the fourth order compact difference scheme with
that of the standard central difference scheme and the first order upwind
difference scheme.  Several convection diffusion problems are solved
numerically to validate the proposed fourth order compact scheme.

                             * * * * * * * * * *

              On Cyclic Reduction and Finite Difference Schemes

                                  Jun Zhang
            Department of Computer Science, University of Kentucky
               773 Anderson Hall, Lexington, KY 40506-0046, USA

                               Jules Kouatchou
               School of Engineering, Morgan State University 
                           Baltimore, MD 21251, USA

                                Mohamed Othman
         Department of Computer Science, University Putra Malaysia, 
                  43400 UPM Serdang, Selangor D.E., Malaysia

                                   ABSTRACT

We investigate a family of finite difference schemes for discretizing the two
dimensional Poisson equation on both the standard and the reduced grids.  We
study the relation between the cyclic reduction method and the discretization
schemes on different grids.  The spectral radii of the Jacobi iteration
matrices, and the truncation errors of, different discretization schemes are
compared analytically and numerically.

                             * * * * * * * * * *

              Accuracy, Robustness, and Efficiency Comparison in
            Iterative Computation of Convection Diffusion Equation
                             with Boundary Layers

                            Lixin Ge and Jun Zhang
           Department of Computer Science, University of Kentucky,
               773 Anderson Hall, Lexington, KY 40506-0046, USA

                                   ABSTRACT

Nine point fourth order compact finite difference scheme, central difference
scheme, and upwind difference scheme are compared for solving the two
dimensional convection diffusion equations with boundary layers.  The domain
is discretized with a stretched nonuniform grid.  A grid transformation
technique maps the nonuniform grid to a uniform one, on which the difference
schemes are applied.  A multigrid method and a multilevel preconditioning
technique are used to solve the resulting sparse linear systems.  We compare
the accuracy of the computed solutions from different discretization schemes,
and demonstrate the relative efficiency of each scheme.  Comparisons of
maximum absolute errors, iteration counts, CPU timings, and memory cost are
made with respect to the two solution strategies.

Jun Zhang                      * E-mail: jzhang@cs.uky.edu
Department of Computer Science * URL:http://www.cs.uky.edu/~jzhang
University of Kentucky         * Tel:(606)257-3892
773 Anderson Hall              * Fax:(606)323-1971
Lexington, Kentucky 40506-0046, USA

-------------------------------------------------------

Date: Fri, 18 Feb 2000 14:13:23 -0400
From: Jud Wolfskill 
Subject: Books Announcement: Using MPI and MPI-2

The following are books which readers of this list might find of interest.
For more information please visit

    http://mitpress.mit.edu/promotions/books/GROUP2F99 and
    http://mitpress.mit.edu/promotions/books/GROSPF99

Using MPI
Portable Parallel Programming with the Message Passing Interface
second edition
William Gropp, Ewing Lusk, and Anthony Skjellum

Using MPI-2
Advanced Features of the Message Passing Interface
William Gropp, Ewing Lusk, and Rajeev Thakur

The Message Passing Interface (MPI) specification is widely used for
solving significant scientific and engineering problems on parallel
computers. There exist more than a dozen implementations on computer
platforms ranging from IBM SP-2 supercomputers to clusters of PCs
running Windows NT or Linux ("Beowulf" machines). The initial MPI
Standard document, MPI-1, was recently updated by the MPI Forum. The
new version, MPI-2, contains both significant enhancements to the
existing MPI core and new features.

Using MPI is a completely up-to-date version of the authors' 1994
introduction to the core functions of MPI. It adds material on the new
C++ and Fortran 90 bindings for MPI throughout the book. It contains
greater discussion of datatype extents, the most frequently
misunderstood feature of MPI-1, as well as material on the new
extensions to basic MPI functionality added by the MPI-2 Forum in the
area of MPI datatypes and collective operations.

Using MPI-2 covers the new extensions to basic MPI. These include
parallel I/O, remote memory access operations, and dynamic process
management. The volume also includes material on tuning MPI
applications for high performance on modern MPI implementations.

William Gropp and Ewing Lusk are Senior Computer Scientists in the
Mathematics and Computer Science Division at Argonne National
Laboratory. Anthony Skjellum is Associate Professor of Computer Science
and Director of the High Performance Computing Laboratory at
Mississippi State University. Rajeev Thakur is an Assistant Computer
Scientist in the Mathematics and Computer Science Division at Argonne
National Laboratory.

Using MPI, second edition
8 x 9, 350 pp., paper ISBN 0-262-57132-3

Using MPI-2
8 x 9, 275 pp., paper ISBN 0-262-57133-1

two-volume set ISBN 0-262-57134-X
Scientific and Engineering Computation series

Jud Wolfskill               
Associate Publicist         Phone:  (617) 253-2079
MIT Press                   Fax:    (617) 253-1709
Five Cambridge Center       E-mail: wolfskil@mit.edu 
Cambridge, MA  02142-1493   http://mitpress.mit.edu

-------------------------------------------------------

Date: Mon, 21 Feb 2000 09:41:42 +0800
From: Gordon German 
Subject: Mesh Interpolations

I was wondering if you know of any internet resource site that may have
algorithms for the efficient interpolation of "gaussian" (centroid) variables
to gridpoint variables, for large 3D grids/meshes?  I am currently trying to
move data between one mesh package (which has centroid data) into another
(which doesn't) as quickly as possible.

Many thanks for your time,
Gordon German

Division of Exploration and Mining
Commonwealth Scientific and Industrial Research Organisation
Nedlands Laboratory
39 Fairway, Nedlands
Western Australia 6009
phone : +618 9389 8421
email: gordon@cs.curtin.edu.au

-------------------------------------------------------

Date: Wed, 9 Feb 2000 13:56:55 -0500 (EST)
From: Lothar Reichel 
Subject: Electronic Transactions on Numerical Analysis (ETNA) vol. 8-9

vol. 8, 1999:

L. F. Pavarino, 
Domain decomposition algorithms for first-order system least squares methods 

R. S. Varga and A. Krautstengl,
On Gersgorin-type problems and ovals of Cassini. 

A. A. Dubrulle, 
An optimum iteration for the matrix polar decomposition. 

A. Bjorck and J. Y. Yuan,
Preconditioners for least squares problems by LU factorization. 

M. Dobrowolski, S. Graf and C. Pflaum,
On a posteriori error estimators in the finite element method on anisotropic
meshes.

I. Presson, K. Samuelsson and A. Szepessy,
On the convergence of multigrid methods for flow problems. 

M. Benzi, W. Joubert and G. Mateescu,
Numerical experiments with parallel orderings for ILU preconditioners. 

P. Benner, V. Mehrmann and H. Xu,
A note on the numerical solution of complex Hamiltonian and skew-Hamiltonian
eigenvalue problems.

K. Chen,
Discrete wavelet transforms accelerated sparse preconditioners for dense
boundary element systems.

V. Gradinaru and R. Hiptmair,
Whitney Elements on pyramids. 

                             * * * * * * * * * *

vol. 9, 1999: 

This volume contains the Proceedings of the International Workshop on
Orthogonal Polynomials held at University Carlos III de Madrid in Leganes,
Spain, 1998, organized by M. Alfaro, R. Alvarez-Nodarse, J. Arvesz and F.
Marcellan (Chair).  The proceedings were edited by R. Alvarez-Nodarse and F.
Marcellan.

M. Alvarez de Morales, T. E. Pirez, M. A. Piqar and A. Ronveaux,
Non-standard orthogonality for Meixner polynomials. 

G. S. Ammar, D. Calvetti and L. Reichel,
Computation of Gauss-Kronrod quadrature rules with non-positive weights. 

F. Cala Rodriguez, P. Gonzalez-Vera, and M. Jimenez Paiz,
Quadrature formulas for rational functions. 

C. Costa and R. Serodio,
A footnote on quaternion block-tridiagonal systems. 

E. M. Garcma-Caballero, T. E. Pirez and M. A. Piqar,
Sobolev orthogonal polynomials: interpolation and approximation. 

W. Gautschi,
Orthogonal polynomials and quadrature.

W. Koepf,
Software for the algorithmic work with orthogonal polynomials and special
functions. 

M. Lorente,
Creation and annihilation operators for orthogonal polynomials of continuous
and discrete variables.

F. Marcellan and J. C. Medem,
q-Classical orthogonal polynomials: a very classical approach.

P. Natalini, S. Noschese and P. E. Ricci,
An iterative method for computing the eigenvalues of second kind Fredholm
operators and applications.

J. Segura and A. Gil,
Evaluation of associated Legendre functions off the cut and parabolic cylinder
functions.

Doron Zeilberger,
Proof of a conjecture of Chan, Robbins, and Yuen. 

-------------------------------------------------------

Date: Tue, 25 Jan 2000 12:50:57 MEST
From: "Ursula van Rienen" 
Subject: Conference Announcement: SCEE-2000

                         Third International Workshop
                SCIENTIFIC COMPUTING IN ELECTRICAL ENGINEERING
                                  SCEE-2000
                              August 20-23, 2000
                             Warnemunde, Germany

                    FIRST ANNOUNCEMENT AND CALL FOR PAPERS

The third International Workshop "Scientific Computing in Electrical
Engineering" SCEE-2000 with the main subjects Computational Electrodynamics
and Circuit Design will be held August 20-23, 2000 in Warnemunde, Germany.
The aim of this workshop is to bring together scientists from universities and
industry with the goal of intensive discussions about modelling and numerical
simulation of electronic circuits and electromagnetic fields.  The workshop is
mainly directed at mathematicians and electrical engineers.  Developers of
algorithms and programs shall come to know recent advances on the other fields
as well as open problems coming from industry; industry shall come to know new
program tools and mathematical methods.

This meeting continues a small series of earlier workshops,
held in Darmstadt (1997) and Berlin (1998), Germany, under the
auspices of the DMV.

MGNet readers are especially invited to participate in the Workshop.


      Program Committee:

Dr. Michael Gunther, Universitat Karlsruhe (TU), Germany
Prof. Dr. Ulrich Langer, Universitat Linz, Austria
Prof. Dr. Ursula van Rienen, Universitat Rostock, Germany
Dr. E. Jan W. ter Maten, Prof. Dr. Wil H. A. Schilders
Philips Research Laboratories, Eindhoven, The Netherlands
Dr. Uwe Feldmann, Infineon Technologies, Germany 


      Advisory Committee:

Prof. Dr. Marcello Anile, Universita di Catania, Italy 
Dr. Andreas Blaszczyk, ABB, Heidelberg, Germany 
Dr. Alain Bossavit, EDF, France 
Prof. Dr. Peter Deuflhard, Konrad-Zuse-Zentrum fur
Informationstechnik (ZIB) Berlin, Germany
Prof. Dr. Hartmut Ewald, Fachhochschule Wismar, Germany Prof. Dr.
Albert Gilg, Siemens, Germany Prof. Dr. Kay Hameyer, Katholieke
Universiteit Leuven, Belgium Prof. Dr. Volkert Hansen, Universitat
Wuppertal, Germany Dr. Georg Hebermehl, Weierstrass Institute for
Applied Analysis and Stochastics, Berlin, Germany 
Prof. Dr. Lauri Kettunen, Tampere University of Technology, Finland
Prof. Dr. Roswitha Marz, Humboldt-Universitat Berlin, Germany Prof.
Dr. Irina Munteanu, Politehnica University of Bukarest, Romania Prof.
Dr. Peter Rentrop, Universitat Karlsruhe (TH), Germany Dr. Peter
Thoma, CST GmbH, Darmstadt, Germany Prof. Dr. Dirk Timmermann,
Universitat Rostock, Germany Prof. Dr. Thomas Weiland, Technische
Universitat Darmstadt, Germany 

      Local Organising Committee:

Prof. Dr. Ursula van Rienen, (Chairman)
Dr. Hans-Walter Glock, 
Dr. Dirk Hecht,
    Universitat Rostock, 
    Fakultat fur Ingenieurwissenschaften
    Fachbereich Elektrotechnik und Informationstechnik
    Institut fur Allgemeine Elektrotechnik
    D-18051 Rostock
    Germany

**** Important Dates ****

Deadline for the receipt of abstracts: 20.04.2000
Deadline for early registration (reduced fee): 15.06.2000

    Contacts and further information

For all items concerning the conference please contact:

    scee-2000@etechnik.uni-rostock.de

For up-to-date information about the conference see:

    http://www.SCEE-2000.uni-rostock.de

Mit freundlichen Grußen
Ulla van Rienen

Prof. Dr. Ursula van Rienen
Universitat Rostock
Fachbereich Elektrotechnik und Informationstechnik
18051 Rostock
Tel. 0381 / 498-3494
Fax  0381 / 498-3479
e-mail: van.rienen@e-technik1.uni-rostock.de
        ulla.van.rienen@t-online.de
http://www.e-technik1.uni-rostock.de/ae/home/rienen/rienen.html

-------------------------------------------------------

Date: Wed, 26 Jan 2000 09:17:47 +0200 (IST)
From: Carol Weintraub 
Subject: Conference Announcement: Multiscale Chemistry

                           Eilat Workshops on

              MULTISCALE COMPUTATIONAL METHODS IN CHEMISTRY

                            April 5-11, 2000




  * Interdisciplinary forum of computational mathematicians, physicists
    and chemists, to study basic computational obstacles in chemistry
    and advanced multiscale approaches for treating them.

  * Review lectures for non-specialists and extended tutorials.

  * Two adjacent workshops and social activity in between:
    (1) Expert Workshop on Multiscale Computation in Chemistry
        and Biology: April 5-7 (possibly sponsored by NATO).
    (2) Excursion in the Eilat area: April 8.
    (3) Research Workshop of the Israeli Science Foundation on 
        Multiscale Computational Methods in Chemistry: April 9-11.

  * Scientific background, general information, current participant
    list and registration forms, see:

      http://www.wisdom.weizmann.ac.il/~achi/conf00/index.html


  Scientific Committee:
  --------------------

  - Jerry Bernholc, No. Carolina State University, USA
  - Kurt Binder, Univ. Mainz, Germany
  - Achi Brandt, Weizmann Institute of Science, Israel
  - David Ceperley, Univ. of Illinois, USA
  - Tamar Schlick, New York University, USA
  - Klaus Schulten, Univ. of Illinois, USA
  - Moshe Shapiro, Weizmann Institute of Science, Israel

------------------------------

End of MGNet Digest
**************************