Information via e-mail about NA-NET: Mail to email@example.com.
From: Seema Khan <firstname.lastname@example.org>
Date: Mon, 22 Dec 2003 16:27:54 +0100
Subject: New Version of FEMLAB
Today we announce the release of FEMLAB 3 -- the next generation
of the popular multiphysics modeling software. Visit our web pages for more
about FEMLAB 3. Take this opportunity to order a free copy of the new product
catalog and a free copy of the Spring Tour CD:
FEMLAB is used in research, product development and teaching,
in such fields as:
- Chemical reactions
- Environmental science
- Fluid dynamics
- Fuel cells
- Heat transfer
- Math/Applied PDEs
- Microwave engineering
- Optics and photonics
- Porous media flow
- Quantum mechanics
- Radio frequency components
- Semiconductor devices
- Structural mechanics
- Transport phenomena
- Wave propagation
- Any combination of the above
From: R. Clint Whaley <email@example.com>
Date: Tue, 23 Dec 2003 10:36:33 -0500 (EST)
Subject: New Release of ATLAS
I am pleased to announce the release of ATLAS 3.6.0, the new ATLAS stable.
The ATLAS (Automatically Tuned Linear Algebra Software) project is an
ongoing effort focusing on applying empirical techniques in order
to provide portable performance. At present, it provides C and Fortran77
interfaces to a portably efficient BLAS implementation, as well as a few
routines from LAPACK.
It's been two years since the last stable, so there have been a large number
of changes. I will provide a few highlights here, and you can examine the
ChangeLog for full details (the ChangeLog can be found on SourceFourge
download page or in ATLAS/doc/ChangeLog).
The first thing is, of course, speedups. ATLAS 3.6 is *much* faster than 3.4
for most common architectures. In particular, Opteron, Athlon-64, Itanium 2,
Pentium 4, Pentium 3, UltraSparc II/III are all significantly faster in 3.6
than they were under 3.4. To give a flavor of this speedup, I have posted
a few initial timings at:
ATLAS also supports arch defaults for several new architectures. In addition
to the machines mentioned above, ATLAS has defaults for IBM Power 4, and
you can also build ATLAS using Intel's compiler on most Intel platforms.
Another new feature in 3.6 is an improved SYRK/HERK implementation, with
associated Cholesky speedup.
For further details, see ATLAS's homepage on SourceForge:
The tarfile may also be downloaded from ATLAS's netlib homepage:
From: Michael Shub <firstname.lastname@example.org>
Date: Sat, 20 Dec 2003 17:30:23 -0500
Subject: Change of Address for Michael Shub
Please change my professional mailing and email addresses to:
Department of Mathematics
University of Toronto
100 St George Street
Toronto, ON M5S 3G3
Phone: 416 946 0323
From: Ron Boisvert <email@example.com>
Date: Mon, 22 Dec 2003 17:37:30 -0500
Subject: Postdoctoral Fellowship Opportunities at NIST
The National Research Council Associateship Programs are accepting
applications for awards for postdoctoral research to be conducted in
residence at the National Institute of Standards and Technology (NIST)
in Gaithersburg, Maryland and Boulder, Colorado. Among the topic areas
of interest are applied mechanics, computational fluid dynamics,
computational biology, materials science, algorithm development for
modeling communication systems, image analysis, applied optimization,
combinatorial and discrete algorithms, mathematical software, scientific
data mining, and quantum information. For details see
The deadline for applications is February 1. The NRC program at NIST
is restricted to US citizens.
From: John Stockie <firstname.lastname@example.org>
Date: Fri, 26 Dec 2003 11:58:38 -0800
Subject: Postdoctoral Position at Simon Fraser University
Postdoctoral Position in Applied and Industrial Mathematics
Simon Fraser University (Burnaby, British Columbia, Canada)
Applications are invited for a postdoctoral position in Applied and
Industrial Mathematics beginning September 1, 2004 (the start date is
negotiable). The position will be held within the "Mathematical
Modeling and Scientific Computing (MMSC)" project, which is part of the
Mathematics of Information Technology and Complex Systems (MITACS)
Network of Centres of Excellence. Information about the project can be
found at the MMSC website (http://www.math.ubc.ca/~wetton/mmsc/). The
salary is $45,000 (Canadian) plus benefits.
The successful candidate will have opportunities for collaboration with
researchers at both Simon Fraser University and the University of
British Columbia in nearby Vancouver. No teaching is required for this
position, although limited teaching duties could be arranged (with
stipend) if desired. The candidate will work half time on industrial
problems from the group's sponsor, Ballard Power Systems, a world leader
in hydrogen fuel cell technology. Depending on interest and skills,
there is also potential for involvement with the "Computational Fuel
Cell Dynamics Lab," a new tightly-integrated high performance computing
and visualization facility located at SFU.
This position is for one year with expected renewal for an additional
year and is subject to the availability of funds. Candidates must
possess a recent Ph.D. in Mathematics or a related discipline, and have
proven ability, or potential, for excellent research. Experience in
scientific computing and industrial mathematical modeling are definite
Applications should include: a cover letter, curriculum vitae, 2 or 3
selected preprints/reprints, and names and contact information for three
references. All application materials should be sent to:
Dr. John Stockie
c/o Tina Jewkes
MITACS Head Office
Simon Fraser University
8888 University Drive
Burnaby, BC V5A 1S6
Fax: +1 604 268 6657
The deadline for applications is April 1, 2004. Hiring decisions are
made on the basis of merit, and all qualified persons are encouraged to
From: Jacob White <white@MIT.EDU>
Date: Wed, 17 Dec 2003 21:03:28 -0500
Subject: Postdoctoral Position at MIT
The Computational Prototyping Group (http://www.rle.mit.edu/cpg) at the
Research Laboratory of Electronics invites applications for a postdoctoral
research position, available immediately, in computational techniques and
software for problems in electromagnetics, with opportunities to work in
applications associated with micromachined devices, integrated circuits,
and drug design. Applicants should have a strong background in numerical
analysis and some background in numerical software. It would also be
helpful to have a background in methods for integral equations, model-order
reduction, fast solvers, or electromagnetics. If interested, please submit
a resume electronically to
Professor Jacob White
Research Laboratory of Electronics
Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology
From: Peter Matus <email@example.com>
Date: Tue, 23 Dec 2003 15:47:11 +0200
Subject: Contents, Computational Methods in Applied Mathematics
Topic: Contents Comp. Meth. Appl. Math., Vol. 3 (2003), No. 4
Volume 4 (2003)
Computational Methods in Applied Mathematics
All abstracts of the papers are available at our web-site
Parametrized Newton's iteration for computing an eigenpair of a real
symmetric matrix in an interval
K. Datta (USA), Y.Hong (USA), and R.B. Lee (Korea)
On fast domain decomposition solving procedures for hp-discretizations of
3-d elliptic problems
V.G. Korneev (Russia), U. Langer (Austria), and L. Xanthis (UK)
Solution of some differential equations of quantum physics by the numerical
functional integration method
Yu.Yu. Lobanov and E.P. Zhidkov (Russia)
Accuracy estimates of difference schemes for quasi-linear parabolic equations
taking into account the initial-boundary effect
V.L. Makarov and L.I. Demkiv (Ukraine)
A priori} error analysis for the hp-version of the discontinuous Galerkin
finite element method for the biharmonic equation
I. Mozolevski (Brazil) and E. Suli (USA)
Transformation of Chebyshev-Bernstein polynomial basis
A. Rababah (Jordan)
A highly accurate modified method of characteristics for convection-dominated
A. Machmoum (Morocco) and M. Seaid (Germany)
Solution of linear equation systems with a dominant skew-symmetric part
using the product triangular iterative method
L.G. Chikina and B.L. Krukier (Russia)
From: Maya Neytcheva <firstname.lastname@example.org>
Date: Mon, 22 Dec 2003 17:14:30 +0100 (MET)
Subject: Contents, Numerical Linear Algebra with Applications
NLA Volume 10, Issue 5-6, 2003
Special issue: Preconditioning 2001
A robust incomplete factorization preconditioner for positive definite matrices
M. Benzi and M. Tuma, pp 385-400
An unstructured multigrid method based on geometric smoothness
E. Chow, pp 401-421
Schur complement preconditioning for elliptic systems of partial
D. Loghin and A. J. Wathen, pp 423-443
Effects of problem decomposition(partitioning) on the rate of convergence
of parallel numerical algorithms
J. K. Cullum, K. Johnson and M. Tuma, pp 445-465
Grid transfer operators for highly variable coefficient problems
in two-level non-overlapping domain decomposition methods
L. Giraud, F. Guevara Vasquez and R.S. Tuminaro, pp 467-484
pARMS: a parallel version of the algebraic recursive multilevel solver
Z. Li, Y. Saad and M. Sosonkina, pp 485-509
An iterated tangential filtering decomposition
Y. Achdou and F. Nataf, pp 511-539
A latency tolerant hybrid sparse solver using Incomplete Cholesky Factorization
P. Raghavan, K. Teranishi, and E.G. Ng, pp 541-560
NLA Volume 10, Issue 7, 2003
Special issue: Dedicated to the 70th birthday of Ivo Marek
An improvement on perturbation bounds for the Drazin inverse
Y. Wei and X. Li, pp 563-575
Irreversible Markov Processes for phylogenetic models
P. Lancaster and E. Bohl, pp 577-593
The spectral diameter as a function of the diagonal entries
B. Parlett, pp 595-602
On the stability of the computation of the stationary probabilities of
Markov chains using Perron complements
M. Neumann and J. Xu, pp 603-618
Nested tetrahedral grids and strengthened CBS inequality
R. Blaheta, pp 619-637
Convergence of a balanced domain decomposition by constraints and
J. Mandel and C.R. Dohrmann, pp 639-659
Numerical validation of solutions of saddle point matrix equations
Xiaojun Chen and Kouji Hashimoto, pp 661-672
NLA Volume 10, Issue 8, 2003
Indefinitely preconditioned conjugate gradient method for large sparse
equality and inequality constrained quadratic problems
C. Durazzi and V. Ruggiero, pp 673-688
Consistency adjustments for pairwise comparison matrices
A. Farkas, P. Lancaster, P. Rozsa, pp 689-700
A centrosymmetric matrix based technique for the interpolation of
a Hermitian signal
M. Tawfik Hanna, S. Ahmed Mansoori, pp 701-720
AMLI-preconditioner for the p-version of the FEM
Sven Beuchler, pp 721-732
From: Hershkowitz Daniel <email@example.com>
Date: Thu, 25 Dec 2003 08:46:01 +0200 (IST)
Subject: Contents, Electronic Journal of Linear Algebra
Volume 10 (2003)
ELA - The ELECTRONIC Journal of LINEAR ALGEBRA
1. Stephen J. Kirkland, Conditioning properties of the stationary
distribution for a Markov chain, pp. 1-15.
2. Ravindra B. Bapat and Bing Zheng, Generalized inverses of bordered
matrices, pp. 16-30.
3. Tedja Santanoe Oepomo, A contribution to Collatz's eigenvalue inclusion
theorem for nonnegative irreducible matrices, pp. 31-45.
4. Ji Young Choi, Luz Maria DeAlba, Leslie Hogben, Benard M. Kivunge,
Sandra K. Nordstrom and Mike Shedenhelm, The nonnegative P_0-matrix
completion problem, pp. 46-59.
5. Hari Bercovici, Spectral versus classical Nevanlinna-Pick interpolation
in dimension two, pp. 60-64.
6. Zewen Zhu, Daniel C. Coster and Leroy R. Beasley, Properties of a
covariance matrix with an application to D-optimal design, pp. 65-76.
7. Geir Dahl, A note on linear discrepancy, pp. 77-80.
8. Daniel Hershkowitz and Hans Schneider, One-sided simultaneous
inequalities and sandwich theorems for diagonal similarity and diagonal
equivalence of nonnegative matrices, pp. 81-101.
9. Walter D. Morris, Recognition of hidden positive row diagonally
dominant matrices, pp. 102-105.
10. D. Steven Mackey, Niloufer Mackey and Francoise Tisseur, Structured
tools for structured matrices, pp. 106-145.
11. Masaya Matsuura, A generalization of Moore-Penrose biorthogonal
systems, pp. 146-154.
12. C.M. da Fonseca, The path polynomial of a complete graph, pp. 155-162.
13. Michael Neumann and Nic Ormes, Bounds for graph expansions via
elasticity, pp. 163-178.
14. Jan Snellman, The maximal spectral radius of a digraph with (m+1)^2-s
edges, pp. 179-189.
15. Charles R. Johnson, Yonatan Harel, Christopher J. Hillar, Jonathan M.
Groves and Patrick X. Rault, Absolutely flat idempotents, pp. 190-200.
16. Jean-Daniel Rolle, Optimal subspaces and constrained principal
component analysis, pp. 201-211.
17. Felix Goldberg and Gregory Shapiro, The Merris index of a graph, pp.
18. Michael Marks, Rick Norwood and George Poole, The maximum number of
2X2 odd submatrices in (0,1)-matrices, pp. 223-231.
19. Randall J. Elzinga, Strongly regular graphs: Values of lambda and mu
for which there are only finitely many feasible (v,k,lambda,mu), pp.
20. Gilbert J. Groenewald and Mark A. Petersen, J-spectral factorization
for rational matrix functions with alternative realization, pp. 240-256.
21. Luz Maria DeAlba, Timothy L. Hardy, Leslie Hogben and Amy Wangsness,
The (weakly) sign symmetric P-matrix completion problems, pp. 257-271.
22. K.A.M. Sayyed, M.S. Metwally and Raed S. Batahan, On generalized
Hermite matrix polynomials, pp. 272-279.
23. S.W. Drury, J.K. Merikoski, V. Laakso and T. Tossavainen, On
nonnegative matrices with given row and column sums, pp. 280-290.
24. Robert M. Guralnick, Chi-Kwong Li and Leiba X. Rodman, Multiplicative
maps on invertible matrices that preserve matricial properties, pp.
25. Dragomir Z. Djokovic, F. Szechtman and K. Zhao, An algorithm that
carries a square matrix into its transpose by an involutory congruence
transformation, pp. 320-340.
End of NA Digest