From: Louis Komzsik <firstname.lastname@example.org>
Date: Mon, 2 Mar 2009 14:32:20 -0500
Subject: Engineering Computing: Model Reduction case study
As someone who spent the better part of four decades in engineering
computing, I very much appreciate the posting on the topic. We in the
industry are very much aware of the important distinction between what the
academia calls Scientific Computing and what we practitioners do every day
in engineering computing. I must, however, take exception to the message
contained in the posting in two aspects.
First, describing the model reduction as being a sort of new scientific
computing concept of the past decade aptly demonstrates the gap between
academic fads and industry trends. Model reduction techniques (static
condensation and dynamic reduction) have been used in the engineering
community to counter the meager resources of computational tools for at
least a half a century. Papers by Guyan, Craig, Bampton, Benfield, Hruda and
others in the 1960-s described such methods and have been used in industrial
finite element analysis since then.
Secondly, the representation of the ANSYS tool as bringing something
generally valuable to the topic is blatantly incorrect. In fact, NASTRAN has
way superior facilities to work with such reduction techniques. NASTRAN’s
DMAP (Direct Matrix Abstraction Programming) has been around for about 40
years and is the original concept upon which MATLAB was funded. ANSYS has no
equivalent capability to DMAP, this is why there is a need to involve the
use of a compiled language in point 2 of the posting. NASTRAN’s DMAP can do
this in its entirety without that.
It appears that this posting a veiled product plug, related to the
affiliation of the author of the posting. I am especially baffled by the
last sentence of the original posting. While a conversation on the topic may
be worthwhile, it has been long since we had any discussion type exchange in
the digest apart from the usual advertisements and academic position
posting, but it should be kept product agnostic and balanced, and definitely
From: Arnold Neumaier <Arnold.Neumaier@univie.ac.at>
Date: Wed, 4 Mar 2009 12:47:48 -0500
Subject: Automatic mathematical assistant
Recently, I had asked in this forum questions on the current state of
projects for formalized mathematics, and what you would want from
an automatic mathematical research assistant.
As part of my new web site
FMathL - Formal mathematical language
I prepared from the responses I got (from friends, collegues, mailing
lists and newsgroups) the web page
What would you want from an automatic mathematical research assistant?
containing both questions and (slightly edited) replies received.
I'd be happy to receive (at Arnold.Neumaier@univie.ac.at)
and add further responses, especially if the contents complements what
is already there.
If you already replied and would like to have your contribution
changed or deleted, please write me (at the same address).
From: Luke Olson <email@example.com>
Date: Thu, 5 Mar 2009 14:36:44 -0500
Subject: PyAMG: Algebraic Multigrid Solvers in Python
We are pleased to announce the first release of PyAMG: Algebraic Multigrid
Solvers in Python (http://www.pyamg.org). With a user-friendly interface and
efficient implementation, PyAMG addresses the growing demand for scalable
solvers by non-expert users. Our goal with the PyAMG project is to provide a
framework for existing AMG methods and to allow for quick testing and
prototyping of additional functionality and algorithms.
PyAMG features implementations of
* Ruge-Stuben (RS) or Classical AMG
* AMG based on Smoothed Aggregation (SA)
and experimental support for
* Adaptive Smoothed Aggregation (aSA)
* Compatible Relaxation (CR) along with many tunable options for
coarsening, interpolation, relaxation, prolongator smoothing
For more information see
Nathan Bell (http://graphics.cs.uiuc.edu/~wnbell/)
Luke Olson (http://www.cs.uiuc.edu/homes/lukeo/)
Jacob Schroder (http://www.cse.uiuc.edu/~jschrod3/)
From: Gilbert Strang <firstname.lastname@example.org>
Date: Sat, 7 Mar 2009 09:08:13 -0500
Subject: New edition of Introduction to Linear Algebra by Gilbert Strang
This is the text that accompanies Gilbert Strang's video lectures on the
OpenCourseWare site ocw.mit.edu. The whole approach to learning linear
algebra has moved from abstract vector spaces to specific examples of the
Four Fundamental Subspaces: the column space and nullspace of A and A'.
Linear algebra is too important to be a course for practicing proofs.
Teachers who read NA Digest will know what this course can be -- please
write to request a desk copy when needed (or suggest the right person
by email to email@example.com). The new edition includes Challenge Problems
to complement the review problems that have been highly praised.
Thousands of teachers in universities and colleges have chosen this book
for its clear explanation of this crucial subject. Review materials and
exams - all the help we can give - are on the course page web.mit.edu/18.06.
The Fourth Edition is distributed by SIAM and Wellesley-Cambridge Press.
This keeps its cost below book prices from large commercial publishers.
From: Graham Robertson <firstname.lastname@example.org>
Date: Tue, 3 Mar 2009 06:25:32 -0500
Subject: New edition of First Course in Numerical Analysis of Differential Equations
The second edition of the classic book by Arieh Iserles is now available
from Cambridge University Press.
About the 1st edition:
‘A well written and exciting book …the exposition throughout is clear and very
lively. The author’s enthusiasm and wit are obvious on almost every page and I
recommend the text very strongly indeed.’
Proceedings of the Edinburgh Mathematical Society
Preface to the first edition; Preface to the second edition; Flowchart of
contents; Part I. Ordinary differential equations: 1. Euler’s method and beyond;
2. Multistep methods; 3. Runge–Kutta methods; 4. Stiff equations; 5. Geometric
numerical integration; 6. Error control; 7. Nonlinear algebraic systems; Part
II. The Poisson equation: 8. Finite difference schemes; 9. The finite element
method; 10. Spectral methods; 11. Gaussian elimination for sparse linear
equations; 12. Classical iterative methods for sparse linear equations; 13.
Multigrid techniques; 14. Conjugate gradients; 15. Fast Poisson solvers; Part
III. Partial differential equations of evolution: 16. The diffusion equation;
17. Hyperbolic equations; Appendix. Bluffer’s guide to useful mathematics: A.1.
Linear algebra; A.2. Analysis; Bibliography; Index.
For more information, please visit http://www.cambridge.org/9780521734905
From: "Gal Sorin" <email@example.com>
Date: Thu, 5 Mar 2009 20:10:25 +0200 (EET)
Subject: New Book, Shape-preserving Approx. by Real and Complex Polynomials
SHAPE-PRESERVING APPROXIMATION BY REAL AND COMPLEX POLYNOMIALS
by Gal, Sorin G.
This monograph presents the first comprehensive treatment in book form of
shape-preserving approximation by real or complex polynomials in one or
several variables. Such approximation methods are useful in many problems
that arise in science and engineering and require an optimal mathematical
representation of physical reality. The main topics are structured in four
chapters, followed by an appendix: shape-preserving approximation and
interpolation of real functions of one real variable by real polynomials;
shape-preserving approximation of real functions of several real variables by
multivariate real polynomials; shape-preserving approximation of analytic
functions of one complex variable by complex polynomials in the unit disk;
and shape-preserving approximation of analytic functions of several complex
variables on the unit ball or the unit polydisk by polynomials of several
complex variables. The appendix treats related results of non-polynomial and
non-spline approximations preserving shape including those by complexified
operators with applications to complex partial differential equations.
Shape-Preserving Approximation by Real and Complex Polynomials contains
many open problems at the end of each chapter to stimulate future research
along with a rich and updated bibliography surveying the vast literature.
The text will be useful to graduate students and researchers interested in
approximation theory, mathematical analysis, numerical analysis, computer
aided geometric design, robotics, data fitting, chemistry, fluid
mechanics, and engineering.
Prof. dr. Sorin G. Gal, firstname.lastname@example.org, http://webhost.uoradea.ro/galso
From: Fatih Celiker <email@example.com>
Date: Wed, 4 Mar 2009 21:13:02 -0500
Subject: Midwest NA Day/SIAM Great Lakes Spring Conference, Apr 2009
The 2009 Midwest Numerical Analysis Day in conjunction with the SIAM Great
Lakes Numerical PDEs 2009 Spring Conference will take place on April 17-18,
2009 at Wayne State University in Detroit. The meeting will start at 13:30
on Friday April 17 and end in the afternoon of Saturday April 18.
The purpose of the conference is to provide a forum for researchers and
practitioners at all stages of their careers, mainly from the Midwest, to
exchange ideas in numerical analysis, scientific computing and related
application areas. Participation of graduate students is strongly encouraged.
The organizers are currently calling for participants and contributed papers.
The deadline for submitting abstracts is Tuesday, March 31, 2009. Please
submit your request to present a lecture or intent to participate at the web
site registration page, or Prof. Fatih Celiker (firstname.lastname@example.org).
Detailed information: http://www.math.wayne.edu/~celiker/mwna_glsiam.
The conference is free of charge. However, registration is required.
Plenary speakers: Gang Bao (Michigan State U.); John Boyd (U. Michigan);
Bernardo Cockburn (U. Minnesota); Robert Krasny (U. Michigan);
Jie Shen (Purdue U.); Yin, George, IEEE Fellow (Wayne State U.)
Steering Committee: Mihai Anitescu, Kendall Atkinson, Greg Fasshauer, Jie Shen,
Patrick Van Fleet, David Voss, Bruce Wade, Zhimin Zhang
Local Organization Committee: Fatih Celiker, Daniel Frohardt, Jing Shi,
Catherine Lebiedzik, Sheng Zhang, Wen Zhang, and Zhimin Zhang (Chair).
Please pass this message to your colleagues and students who may
be interested in the conference.
From: Thomas Fries <email@example.com>
Date: Mon, 02 Mar 2009 14:48:59 +0100
Subject: Extended Finite Element Method (XFEM) seminar, Germany, May 2009
The Extended Finite Element Method (XFEM): From basic theory to advanced apps.
3-day seminar on the XFEM from 11.05.2009 to 13.05.2009 in Braunschweig,
Germany. Lectures are given by Prof. Dr.-Ing. Andreas Zilian from TU
Braunschweig and Dr.-Ing. Thomas-Peter Fries from RWTH Aachen. This seminar is
designed for graduate and doctoral students as well as developers from
industry with interest in the XFEM and its wide range of application. This is
the third XFEM seminar after the successful seminars given in Braunschweig,
2007 and Aachen, 2008.
Further informations and online registration until 01.04.2009 on the
seminar webpage: www.xfem.rwth-aachen.de/
*** Online-registration until 01.04.2009 ***
- 3-day seminar with lectures, discussions & tutorials
- From basic introduction to advanced aspects of the XFEM and its applications
- Practical realization of the XFEM in MATLAB
- Comprehensive written course material & recent publications
- Overview of the state of the art in XFEM
- MATLAB source code for all tutorials
Abstract: The extended finite element method (XFEM)
Standard numerical methods like the FEM and FVM are widely established in
today's engineering practice. In contrast to standard numerical methods, the
XFEM enables the approximation of non-smooth solutions with optimal accuracy.
This is achieved by a local enrichment of the approximation space such that
the special solution properties are considered appropriately. The XFEM is in
the focus of intensive research activities and has been realized in several
commercial finite element software tools.
From: Priscilla Tse <firstname.lastname@example.org>
Date: Mon, 2 Mar 2009 01:16:56 -0500
Subject: Deadline extended: Sci. Comp. and Diff. Eq. (SciCADE09), China, May 2009
Inter. Conf. on Scientific Computation and Differential Equations (SciCADE09)
Beijing Friendship Hotel, Beijing, China
May 25-29, 2009.
REGISTRATION AND ACCOMMODATION (EXTENDED deadline March 15)
The registration and accommodation booking deadline has been EXTENDED to
March 15, 2009. More information can be found on our website.
PARTICIPANTS AND MINISYMPOSIUM SESSIONS
A list of confirmed participants, their submitted abstracts and new
minisymposia information are now displayed on-line. Please check our website
CONTRIBUTED TALKS (deadline March 15)
We invite abstract submissions for SciCADE09 contributed talks. Each
contributed talk is around 30 minutes. The local organizing committee will
screen the submissions and notify authors of submission outcome.
BUTCHER PRIZE (EXTENDED deadline April 20)
The deadline for the Butcher Prize has been extended to April 20. This prize
is awarded for the best student talk at SciCADE09. We strongly encourage all
students who plan to present to apply for this award. Questions concerning
the Butcher Prize should be addressed to Priscilla Tse (email@example.com).
CALL FOR BID FOR SciCADE13 (deadline April 20)
We invite applications from those wishing to organize the SciCADE conference
in 2013. Please address all enquiries concerning the open bid to Jialin Hong
From: Pietro Belotti <firstname.lastname@example.org>
Date: Tue, 3 Mar 2009 19:36:39 -0500
Subject: Deadline extended: Bound Reduction in CP and MINLP (BR-OPT), May 2009
Note: abstract submission deadline extended to March 20, 2009.
BR-OPT: A workshop on Bound Reduction techniques for Constraint Programming
and Mixed-Integer Nonlinear Programming.
Carnegie Mellon University, Pittsburgh PA, 28 May 2009
This workshop aims at bringing together people in both Constraint Programming
(CP) and Mixed-Integer Nonlinear Programming (MINLP), to exchange ideas on
current trends and developments in techniques for bound reduction (also known
as domain reduction) and their implementation in exact and heuristic solvers.
The workshop is organized within the CPAIOR conference, which will take place
at Carnegie Mellon University, Pittsburgh, PA, from May 27 to May 31, 2009.
See also https://wpweb2.tepper.cmu.edu/rlang/CPAIOR09/index.html
The organizing committee invites application of extended abstracts of maximum
5 pages describing work on bound reduction in the context of CP and/or MINLP.
Abstracts should be emailed to email@example.com in PDF or Postscript format.
Possible topics for the extended abstract comprise, but are not restricted to:
Interval analysis; Bound reduction in global optimization; Preprocessing
techniques in MINLP and CP; Consistency techniques; Integration of global
constraints in MINLP solvers; Solver architectures.
- Mar 20, 2009: deadline for the submission of extended abstracts;
- Apr 15, 2009: notification of acceptance;
- May 15, 2009: final version of extended abstract due.
Date: Wed, 04 Mar 2009 06:48:26 -0500
Subject: Appl. of Math. in Technical and Natural Sciences, Bulgaria, Jun 2009
The Euro-American Consortium for Promotion of the Application of Mathematics
in Technical and Natural Sciences is pleased to announce its
First Conference AMiTaNS'09 to be held in Sozopol, Bulgaria, June 22-27, 2009.
Papers on all subjects of application of Mathematics in Mechanics, Physics,
Biology, Chemistry and different Engineering fields are invited.
Presentations in the following sections are by invitation:
Nonlinear Waves and Solitons; Computational Fluid Dynamics; Biomathematics;
Difference and Spectral Methods.
Four special sessions are announced so far. One or more sessions will be
organized for the contributed papers.
Currently confirmed plenary and keynote speakers:
Azmy Ackleh (USA), Bernard Beauzamy (France), Francois Feuillebois (France),
Vladimir Gerdjikov (Bulgaria), Lyubomir Kovachev (Bulgaria),
Andrei Ludu (USA), Peter Minev (Canada), Reinaldo Rosa (Brazil),
Katsuhiro Sakai (Japan), Sanichiro Yoshida (USA).
Deadline for electronic registration, abstract submission is March 31, 2009.
Conference website http://www.eac4amitans.org
Contact at firstname.lastname@example.org
Euro-American Consortium for Promoting the Application of Mathematics in
Technical and Natural Sciences
From: Gerhard-Wilhelm Weber <email@example.com>
Date: Mon, 2 Mar 2009 01:49:13 -0500
Subject: Deadline extended: EURO 2009 (Operations Research), Germany, Jul 2009
ABSTRACT SUBMISSION DEADLINE EXTENDED until MARCH 20, 2009
In the previous days we received a really huge number of abstracts and very
many requests for an extension of the abstract submission deadline. Therefore
we decided to shift the deadline for submissions of abstracts until
March 20th, 2009.
23RD EUROPEAN CONFERENCE ON OPERATIONAL RESEARCH
Bonn, Germany, July 5 - 8, 2009
3rd CALL FOR PAPERS: http://www.euro-2009.de/
The 23rd European Conference on Operational Research, EURO XXIII, is organized
by the Gesellschaft fuer Operations Research (GOR) e.V. in co-operation with
the University of Siegen and will be held in the Gustav-Stresemann Institute
and the Maritim Hotel in Bonn. The Programme and Organizing Committee are
preparing a high quality academic programme of the Conference. In addition to
this, you will have an excellent opportunity to exploit the city and vicinity
of Bonn! A history of more than 2000 years has given the city most appealing
and memorable facets. Bonn is an international center of science, arts and
politics. You will enjoy the picturesque impressions along the romantic Rhine,
Bonn's international and political life or the magnificent Ahr wine region.
Culture is inseparably linked to the works of Ludwig van Beethoven, but also
of Robert Schumann, August Macke and Ernst Moritz Arndt.
On behalf of all organizers, we wish you will have a pleasant stay in Bonn,
with many unforgettable memories to take back home.
Gerhard Woeginger, Chair, Programme Committee
Erwin Pesch, Chair, Organizing Committee
From: Edward Mellon <firstname.lastname@example.org>
Date: Sat, 7 Mar 2009 14:43:00 -0500
Subject: MULTICONF-09 paper submission extended, Jul 2009
Draft paper submission is extended (will not be extended further):
The deadline for draft paper submission at the 2009 Multi Conference in
Computer Science, Information Technology and Control systems and
Computational Science and Computer Engineering (MULTICONF-09) (website:
http://www.PromoteResearch.org <http://www.promoteresearch.org/>) is
The conference will be held during July 13-16 2009 in Orlando, FL, USA. We
invite draft paper submissions. The event consists of the following
* Inter. Conf. on Artificial Intelligence and Pattern Recognition (AIPR-09)
* Inter. Conf. on Automation, Robotics and Control Systems (ARCS-09)
* Inter. Conf. on Bioinformatics, Computational Biology, Genomics and
* Inter. Conf. on Enterprise Information Systems and Web Technologies
* Inter. Conf. on High Performance Computing, Networking and Communication
* Inter. Conf. on Information Security and Privacy (ISP-09)
* Inter. Conf. on Recent Advances in Information Technology and Applications
* Inter. Conf. on Software Engineering Theory and Practice (SETP-09)
* Inter. Conf. on Theory and Applications of Computational Science (TACS-09)
* Inter. Conf. on Theoretical and Mathematical Foundations of Computer
Edward Mellon, Publicity committee
From: "Craig C. Douglas" <email@example.com>
Date: Sun, 8 Mar 2009 13:11:46 -0600
Subject: High Performance Comp. and Appl. (HPCA 2009), Shanghai, Aug 2009
2nd HPCA2009 in Shanghai, August 10-12, 2009.
The Second International Conference on High Performance Computing and
Applications 2009 (HPCA2009) will serve as a forum to present current work by
researchers and software developers from around the world as well as to
highlight activities in the high performance computing area. It aims to bring
together research scientists, application pioneers, and software developers to
discuss problems and solutions and to identify new issues in this area. The
topics of interest include
1. Numerical algorithms and solutions
2. Parallel computing
3. High performance and grid computing
4. Mass data storage and processing
Proceedings of presented and refereed papers will be published with Springer
as a volume of Lecture Notes in Computer Science (LNCS). In addition, selected
papers will be asked to be revised and extended for publication in Springer's
journal Computing and the International Journal of Numerical Analysis and
Modeling. Participants wishing to present a paper on a topic related to the
conference themes are invited to submit no more than 6-pages in English to
firstname.lastname@example.org. Please include the address, telephone, fax, and
e-mail address of the primary contact person. For the updated or more
information, please visit the conference web page
http://hpca.shu.edu.cn or email the secretariat at email@example.com.
Paper submission April 30, 2009
Acceptance May 20, 2009
Final paper submission June 10, 2009
From: Jerzy Wasniewski <firstname.lastname@example.org>
Date: Sun, 1 Mar 2009 20:31:06 +0100 (CET)
Subject: Novel Data Formats & Algorithms for Lin. Alg. Comp., Poland, Sep 2009
Workshop on Novel Data Formats and Algorithms for Linear Algebra Computations
Fred Gustavson (email@example.com) and Jerzy Wasniewski (firstname.lastname@example.org)
Recently, several novel data formats for matrices were introduced into the
area of Linear Algebra with the intent of producing new algorithms as well as
improving its existing algorithms. Recursion, via the divide-and-conquer
paradigm, introduced variable blocking to complement the standard fixed block
algorithms. In particular, new data structures for dense linear algebra became
an active research area. This Workshop will focus on both new data structures
and/or new or existing algorithms for high performing dense and sparse linear
To be held at the PPAM 2009 PARALLEL PROCESSING and APPLIED MATHEMATICS
Location: Wroclaw, Poland
Date: September 13-16, 2009
A limited number of contributed, 20 minute talks will be selected for this
workshop. Extended abstracts no more than two pages should be sent before
April 10, 2009. The text can be in Latex, Postscript, PDF or pure ASCII.
The acceptance of this abstract will be sent no later than April 15, 2009.
Summary, Important Dates and Notes:
April 10, 2009 -- Abstracts maximum two pages
April 15, 2009 -- Acceptance for the conference
May 15, 2009 -- Paper submission and after the papers go for referees
August 15, 2009 -- The papers go back to authors for corrections
September 9-12, 2009 -- The conference
October 31, 2009 -- Camera ready papers
From: Michael Bader <email@example.com>
Date: Fri, 6 Mar 2009 17:12:34 -0500
Subject: Memory Issues on Multi- and Manycore Platforms, Poland, Sep 2009
Call for Papers: Workshop on Memory Issues on Multi- and Manycore Platforms
Held at the PPAM 2009, in Wroclaw, Poland, September 13-16
Modern microprocessors rapidly evolve towards multi- and manycore
architectures, and the respective processor performance will keep doubling
every 18 months as it has done for years according to Moore's Law. However,
both memory latency and memory bandwidth have not been able to keep up with
this breakneck speed, nor are they likely to do so in the imminent future. As
a consequence the already existing gap between processor and memory
performance will keep growing. In addition, the increasingly hybrid and
hierarchical design of memory, with multi-level caches that can be exclusive
to or are shared between the processor cores, as well as NUMA-style memory
access will pose further roadblocks to achieving high performance on modern
Areas of interest include, but are not limited to:
- Hardware-aware, compute- and memory-intensive simulations
- Multi- and manycore-aware approaches in implementation and algorithm design
- Tools for performance and cache behavior analysis for multicore systems
- Parallelization with appropriate programming models and tool support
- Performance studies and first experiences on the latest multicore processors
Deadline for submission: April 10, 2009
Notification of Acceptance: May 31, 2009
Conference: September 13-16, 2009
Michael Bader, Technische Universität München, Germany (firstname.lastname@example.org)
Carsten Trinits, Technische Universität München, Germany (email@example.com)
From: Rita Le Mon <firstname.lastname@example.org>
Date: Fri, 6 Mar 2009 12:54:29 -0500
Subject: Faculty Positions in Comp. Sci. and Appl. Math., KAUST, Saudi Arabia
King Abdullah University of Science and Technology (KAUST)
Faculty Openings in Computer Science and Applied Mathematics
King Abdullah University of Science and Technology (KAUST) is being
established in Saudi Arabia as an international graduate-level research
university dedicated to inspiring a new age of scientific achievement that
will benefit the region and the world. As an independent and merit-based
institution and one of the best endowed universities in the world, KAUST
intends to become a major new contributor to the global network of
collaborative research. It will enable researchers from around the globe to
work together to solve challenging scientific and technological problems.
The admission of students, the appointment, promotion and retention of
faculty and staff, and all the educational, administrative and other
activities of the University shall be conducted on the basis of equality,
without regard to race, color, religion or gender.
KAUST is located on the Red Sea at Thuwal (80km north of Jeddah). Opening in
September 2009, KAUST welcomes exceptional researchers, faculty and students
from around the world. To be competitive, KAUST will offer very attractive
base salaries and a wide range of benefits. Further information about KAUST
can be found at http://www.kaust.edu.sa/.
KAUST invites applications for faculty position at all ranks (Assistant,
Associate, Full) in Applied Mathematics (with domain applications in the
modeling of biological, physical, engineering, and financial systems) and
Computer Science, including areas such as Computational Mathematics, High-
Performance Scientific Computing, Operations Research, Optimization,
Probability, Statistics, Computer Systems, Software Engineering, Algorithms
and Computing Theory, Artificial Intelligence, Graphics, Databases, Human-
Computer Interaction, Computer Vision and Perception, Robotics, and Bio-
Informatics (this list is not exhaustive). KAUST is also interested in
applicants doing research at the interface of Computer Science and Applied
Mathematics with other science and engineering disciplines. High priority
will be given to the overall originality and promise of the candidate’s work
rather than the candidate’s sub-area of specialization within Applied
Mathematics and Computer Science.
An earned Ph.D. in Applied Mathematics, Computer Science, Computational
Mathematics, Computational Science and Engineering, Operations Research,
Statistics, or a related field, evidence of the ability to pursue a program
of research, and a strong commitment to graduate teaching are required. A
successful candidate will be expected to teach courses at the graduate level
and to build and lead a team of graduate students in Master’s and Ph.D.
Applications should be submitted in a pdf format and include a curriculum
vita, brief statements of research and teaching interests, and the names of
at least 3 references for an Assistant Professor position, 6 references for
an Associate Professor position, and 9 references for a Full Professor
position. Candidates are requested to ask references to send their letters
directly to the search committee. Applications and letters should be sent
via electronic mail to email@example.com. The review of
applications will begin immediately, and applicants are strongly encouraged
to submit applications as soon as possible; however, applications will
continue to be accepted until December 2009, or all 10 available positions
have been filled.
In 2008 and 2009, as part of an Academic Excellence Alliance agreement
between KAUST and Stanford University, the KAUST faculty search committee
consisting of professors from the Computer Science Department and the
Institute of Computational and Mathematical Engineering at Stanford
University, will evaluate applicants for the faculty positions at KAUST.
However, KAUST will be responsible for all hiring decisions, appointment
offers, recruiting, and explanations of employment benefits. The recruited
faculty will be employed by KAUST, not by Stanford. Faculty members in
Applied Mathematics and Computer Science recruited by KAUST before September
2009 will be hosted at Stanford University as Visiting Fellows until KAUST
opens in September 2009.
From: "James Blowey" <J.F.Blowey@durham.ac.uk>
Date: Mon, 2 Mar 2009 13:08:47 -0000 (UTC)
Subject: Lectureship Position in Computational Math., Durham University, UK
Durham University, UK
Department of Mathematical Sciences
Lectureship in Computational Mathematics
Salary: £29704 - £35,469 per annum
Closing date: Monday 6th April 2009
Applications are invited for a two-year temporary Lectureship in
Computational Mathematics, from September 2009. You must have, or be about
to complete, a PhD in a relevant area of Classical Applied Mathematics, in
particular Computational Applied Mathematics, Partial Differential
Equations, Continuum Mechanics, Fluid Mechanics, Applied Analysis,
Numerical Analysis, Mathematical Biology or Mathematical Finance. The post
will carry a reduced teaching load, and the holder will be encouraged to
develop their research profile.
For the job description and further particulars see
For informal enquiries contact Professor Brian Straughan
From: Melanie Moser <firstname.lastname@example.org>
Date: Thu, 5 Mar 2009 09:01:35 -0500
Subject: Postdoc Position in Appl. Math and Sci. Comp., University of Graz, Austria
The following opening is expected:
Institute for Mathematics and Scientific Computing
Karl-Franzens-University of Graz, Austria
Applications are invited for a 1-year postdoctoral Research Position at the
Institute for Mathematics and Scientific Computing of the University of Graz,
Austria. There is the possibility of extension to at least the end of
The position is related to the SFB Research Center "Mathematical Optimization
and Applications in Biomedical Sciences" located at the University of Graz,
the Graz University of Technology and the Medical University Graz, see
We are looking for an ambitious researcher with programming skills holding a
doctoral degree in Applied Mathematics or Scientific Computing with distinct
interests in inverse problems and continuous optimal control. The salary
follows the rules of FWF - Austrian National Science Foundation (approximate
gross salary EUR 54.000,- / year).
Your application should contain the following information:
# the Curriculum Vitae (CV),
# a short description of your qualifications and experience (i.e. list of
publications, PhD thesis),
# a statement describing your scientific interests,
# names and email-addresses of at least two scientists willing to provide a
For further details, please contact:
Prof. Dr. Karl Kunisch
Institute of Mathematics and Scientific Computing
University of Graz
A-8010 Graz, Austria
Tel.: + 43 316 380 5162
Fax: + 43 316 380 9815
From: Miguel Anjos <email@example.com>
Date: Mon, 2 Mar 2009 23:19:05 -0500
Subject: Postdoc Positions in Optimization, University of Waterloo, Canada
Applications are invited for one or more postdoctoral positions to carry out
research in the development of novel optimization methodologies for solving
hard combinatorial problems arising in real-world applications.
The positions may be based at either the University of Waterloo
(http://www.uwaterloo.ca) or the University of Guelph
(http://www.uoguelph.ca). The lead investigators are Professors
Miguel Anjos (Waterloo, Management Sciences),
Anthony Vannelli (Guelph, Engineering),
Stephen Vavasis (Waterloo, Combinatorics & Optimization), and
Henry Wolkowicz (Waterloo, Combinatorics & Optimization).
The successful applicant will have completed (or be very near completion of)
a PhD in Operations Research, Electrical Engineering, Computer Science,
or a related field. Preference will be given to candidates with documented
expertise in mathematical programming techniques.
The starting date will be determined by mutual agreement. The initial contract
will be for 6 to 12 months, with a possibility of extensions up to a maximum
of 2 years in total.
Applicants should send a CV and list of referees to Professor Miguel Anjos
(firstname.lastname@example.org) as a PDF (preferred) or Word file. Applications will
be accepted until all positions are filled.
Further information can be obtained from:
Professor Miguel Anjos
+1-519-888-4567 ext 32521
From: Bartosz Protas <email@example.com>
Date: Tue, 3 Mar 2009 13:53:18 -0500
Subject: Postdoc Position in Comp. Fluid Dyn./Optimization, McMaster U., Canada
POST-DOCTORAL POSITION IN COMPUTATIONAL FLUID DYNAMICS AND OPTIMIZATION
An opening for a Post-Doctoral Fellow is anticipated in the Department of
Mathematics & Statistics at McMaster University. The fellow will work in the
research group of Dr. Protas, and the focus of this industry-funded position
will be continued research on integration of Optimization Theory and
Computational Fluid Dynamics with the goal to develop strategies for
optimization of multi-physics fluid systems. In addition to substantial
experience in scientific computing, an ideal candidate would also have
background in Computational / Theoretical Fluid Dynamics and Optimization /
Control Theory. This position will also involve some teaching responsibilities.
The fellowship is open to candidates of any nationality and selection will be
based upon the candidate's research potential. Pending approval of funding,
the tentative start date of the position is September 1, 2009 and the
anticipated duration of the position will be two years with an annual salary
of $42,000. Candidates are required to apply for this fellowship by using the
MathJobs website; see our advertisement at www.mathjobs.org. We will begin to
review applications on April 10, 2009, however, applications will continue to
be accepted until the position is filled. Applicants should provide at least
three letters of recommendation. Preferably these letters will be submitted
through the MathJobs website (see above); they may also be sent directly to:
Dr. Bartosz Protas
Department of Mathematics & Statistics
Hamilton, Ontario, CANADA L8S 4K1
Phone: +1 (905) 525 9140 ext. 24116
Fax: +1 (905) 522 0935
We appreciate all replies to this advertisement, but applications will not be
acknowledged. McMaster is committed to Employment Equity and encourages
applications from all qualified candidates, including aboriginal peoples,
persons with disabilities, members of visible minorities and women.
From: Oleg Burdakov <firstname.lastname@example.org>
Date: Tue, 3 Mar 2009 14:00:58 -0500
Subject: Contents, Optimization Methods and Software
Table of Contents
Optimization Methods and Software (OMS), Volume 24, Number 2 (April, 2009)
Special issue: the Joint EUROPT-OMS Conference on Optimization,
July 4-7, 2007, Prague, Czech Republic
Guest Editors: Regina Burachik, Joerg Fliege and Michal Kocvara
Timo Aittokoski, Sami Ayramo and Kaisa Miettinen
Clustering aided approach for decision making in computationally expensive
multiobjective optimization, 157-174
Robin C. Gilbert and Theodore B. Trafalis
Quadratic programming formulations for classification and regression, 175-185
Pablo Guerrero-Garcia and Angel Santos-Palomo
A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides'
primal-dual simplex-type algorithm, 187-204
Ronald H.W. Hoppe and Svetozara I. Petrova
Path-following methods for shape optimal design of periodic microstructural
Maria Macconi, Benedetta Morini and Margherita Porcelli
A Gauss-Newton method for solving bound-constrained underdetermined nonlinear
Andreas Potschka, Hans Georg Bock and Johannes P. Schloeder
A minima tracking variant of semi-infinite programming for the treatment of
path constraints within direct solution of optimal control problems, 237-252
Ana Maria A.C. Rocha and Edite M.G.P. Fernandes
Modified movement force vector in a electromagnetism-like mechanism for global
Georgi V. Smirnov and Vera Sa
On the linear convergence of Newton-Krylov methods, 271-283
Nadezda Sukhorukova, Julien Ugon and John Yearwood
Workload coverage through nonsmooth optimisation, 285-298
Ph. L. Toint, D. Tomanos and M. Weber-Mendonca
A multilevel algorithm for solving the trust-region subproblem, 299-311
Forthcoming papers and complete table of contents for the journal OMS:
Instructions for Authors and Online sample copy:
Discounted individual subscription:
End of NA Digest