- Today's Editor:
- Tamara G. Kolda
- Sandia National Labs
- tgkolda@sandia.gov

- The cost of textbooks
- Scotch 5.0.4 is out - for graph and mesh/hypergraph partitioning and more
- Release of Distributed and Unified Numerics Environment (DUNE) 1.0
- Symposium on Gene Golub's Legacy, Stanford University, March 1, 2008
- Computer Algebra Systems and Their Applications CASA'2008, Jun 2008
- Scientific Computing and Applications SCA 2008 Meeting in Korea, Jun 2008
- Deadline Extension, SIAM Conference on the Life Sciences LS08, Aug 2008
- Tenure track position in applied/computational math at Kent State
- Contents, Journal of Scientific Computing
- Contents, Electronic Journal of Linear Algebram Vol 16
- Subscribe, unsubscribe, change address, or for na-digest archives:
- http://www.netlib.org/na-digest-html/faq.html

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

From: Robert van de Geijn <rvdg@cs.utexas.edu>

Date: Sat, 5 Jan 2008 13:14:59 -0600

**Subject: The cost of textbooks**

As a parent of a college student (with two more to go), I have become

painfully aware of the cost of textbooks. As a result, I have been

contemplating the irony that our community is obsessed with providing

Open Source code, but thinks nothing of producing textbooks that cost

a mint. I point to a popular undergraduate linear algebra text that

is in its nth edition that now costs close to $170, without naming it

by name. Even texts published by SIAM are in the $70+ range.

We are considering self-publishing our next book through

www.lulu.com, which means that a 200 page book will cost the consumer

somewhere in the $10-$15 range. This is close to the cost of

copying it or printing it on a laser printer, but the book will be a

paperback and will have an ISBN numbers.

I look forward to a healthy discussion on this. In particular, if

you have experience with self-publishing, please share that experience!

Robert van de Geijn

Professor of Computer Sciences

The University of Texas at Austin

rvdg@cs.utexas.edu

"Don't worry about people stealing your ideas. If your ideas are

any good, you'll have to ram them down people's throats."

-- Howard Aiken

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

From: FranoisPELLEGRINI <francois.pellegrini@labri.fr>

Date: Sun, 23 Dec 2007 14:13:43 +0100

**Subject: Scotch 5.0.4 is out - for graph and mesh/hypergraph partitioning and more**

We announce the release, as libre/free software, of revision 5.0.4 of the

SCOTCH and PT-SCOTCH software package and library for graph and

mesh/hypergraph partitioning, static mapping, and sequential and parallel

sparse matrix block ordering.

Revision 5.0.4 provides several new features :

- a new banded diffusion partitioning method is now included in the default

partitioning and mapping strategy. It provides better partitions than the

classical Kernighan-Lin or Fiduccia-Mattheyses methods, with much smoother

boundaries.

- a full-featured ParMeTiS ordering compatibility library which allows users

who are using the parallel graph ordering capabilities of ParMeTiS to try

PT-Scotch without having to modify their source code at all. An improved

interface is also provided to access the distributed elimination/separator

tree structure.

- a new algorithmically-defined weighted complete graph target architecture,

for simply computing partitions of different relative weights.

SCOTCH is a project carried out at the Laboratoire Bordelais de Recherche en

Informatique (LaBRI) of the Universite Bordeaux I.

It is part of project ScAlApplix of INRIA Bordeaux Sud-Ouest. Its goal is to

apply graph theory, with a ``divide and conquer'' approach, to scientific

computing problems such as graph partitioning, static mapping, and sparse

matrix ordering.

Scotch can be freely downloaded, under the terms of the CeCILL-C license.

To ease the development, diffusion, and circulation of information regarding

the SCOTCH project, most of its resources are now hosted on the InriaGforge

platform provided by INRIA. Please refer to the SCOTCH web page at :

http://www.labri.fr/~pelegrin/scotch/

for more information. People interested in the SCOTCH project are welcome to

subscribe to the "scotch-announces" mailing list at :

http://lists.gforge.inria.fr/mailman/listinfo/scotch-announces

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

From: Christian Engwer <christi@dune-project.org>

Date: Fri, 28 Dec 2007 22:40:03 +0100

**Subject: Release of Distributed and Unified Numerics Environment (DUNE) 1.0**

We are pleased to announce the release of Version 1.0 of the

"Distributed and Unified Numerics Environment" (DUNE).

DUNE is a modular toolbox for solving partial differential equations

(PDEs) with grid-based methods. It supports the easy implementation of

methods like Finite Elements (FE), Finite Volumes (FV), and also

Finite Differences (FD). The underlying idea of DUNE is to create slim

interfaces allowing an efficient use of legacy and/or new

libraries. These goals are achieved, using generic programming

techniques.

DUNE is free software licensed under the GPL (version 2) with a

so-called "runtime exception". This license is similar to the one

under which the libstdc++ libraries are distributed. Thus it is

possible to use DUNE even in proprietary software.

The framework consists of a number of modules which are downloadable

as separate packages.

For further information, have a look at our website

http://www.dune-project.org or contact the mailing list

dune@dune-project.org.

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

From: "Dianne O'Leary" <oleary@cs.umd.edu>

Date: Sat, 5 Jan 2008 12:01:38 -0500 (EST)

**Subject: Symposium on Gene Golub's Legacy, Stanford University, March 1, 2008**

A symposium entitled "Gene Golub's Legacy: Matrix Computations, Foundation

and Future" will take place at Stanford University on Saturday, March 1,

2008. The event is hosted by the Institute for Computational and

Mathematical Engineering (iCME) and the Department of Computer Science at

Stanford University. It is one of two Stanford events in Gene's memory, the

other being a Celebration of Gene that will take place on the afternoon of

Friday, February 29th.

Saturday speakers include:

Zhaojun Bai, University of California at Davis

Michele Benzi, Emory University

Jack Dongarra, U. Tennessee and Oak Ridge National Lab

Howard Elman, University of Maryland

Walter Gautschi, Purdue University

Sep Kamvar, Google

Tamara Kolda, Sandia National Laboratory

Lek-Heng Lim, University of Berkeley

Charles Van Loan, Cornell University

Margaret Wright, New York University

In addition, short tributes include those by:

Nancy Nichols, University of Reading

Gilbert Strang, Massachusetts Institute of Technology

James Varah, University of British Columbia

Grace Wahba, University of Wisconsin-Madison

For further information about the program and accommodations, see

http://icme.stanford.edu/golub_celebration_2008/

and

http://www.cs.umd.edu/users/oleary/golubm.html.

There is no registration fee for either the Friday or the Saturday event.

Chen Greif and Dianne O'Leary

Symposium Co-Chairs

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

From: iglesias <iglesias@unican.es>

Date: Thu, 27 Dec 2007 05:22:33 +0100

**Subject: Computer Algebra Systems and Their Applications CASA'2008, Jun 2008**

First Call for Papers

Sixth International Workshop on Computer Algebra Systems and Their

Applications, CASA'2008

University of Perugia, Perugia, Italy

Conference web site: http://personales.unican.es/iglesias/CASA2008/

Contact person: Andres Iglesias, iglesias@unican.es

Computer Algebra (also known as Symbolic Computation or

Computational Algebra) has found applications in many domains of

science such as mathematics, physics, chemistry, engineering,

computer science, computational biology, education, etc. The computer

algebra systems (CAS) such as Mathematica, Maple, MuPAD, Reduce,

Axiom, Lie, Matlab, Scilab, CoCoa, MuMATH, Derive, Pari-GP, SMP,

MathCAD, Macsyma, Scratchpad, Magma, Singular, SARAG, Risa/Asir, GAP

(and many others that have been developed so far) are becoming more

and more popular and now they are valuable tools for teaching,

research and industry.

This workshop solicits high-quality papers for presentation

describing original research results in Computer Algebra Systems and

their Applications.

The workshop is a part of ICCSA'08, the 2008 International Conference

on Computational Science and Applications to be held at the

University of Perugia, Perugia (Italy).

The conference language will be English.

TOPICS

The topics to be addressed include (but are not limited to):

* computer algebra applications to Mathematics, Physics,

Chemistry, Engineering, Biology, Computer Science, Social Sciences,

Arts, Entertainment, Architecture, etc.

* symbolic-numerical computations using computer algebra systems

* computer algebra systems and Internet

* industrial applications of computer algebra

* problem-solving environments

* symbolic-numeric interface

* computer algebra systems in Education

* computer algebra based simulations

* new computer algebra developments (packages, notebooks, etc.)

* new symbolic computation algorithms

* new issues in symbolic computation

IMPORTANT DATES

* January 27, 2008: Draft papers due

* March 31, 2008: Notification of Acceptance

* April 15, 2008: Camera Ready Papers and Pre-registration

* June 30- July 3, 2008: ICCSA 2008 conference in Perugia (Italy)

PROCEEDINGS

All accepted papers will be published by IEEE Computer Society Press.

In addition, the accepted papers will be scheduled for oral

presentation. Submission implies the willingness of at least one of

the authors to register and present the paper.

It is planned that some selected papers will be published in a

Special Issue of an international journal. More details will be given

later on.

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

From: Chang-Ock Lee <colee@kaist.edu>

Date: Sun, 6 Jan 2008 20:09:21 -0500

**Subject: Scientific Computing and Applications SCA 2008 Meeting in Korea, Jun 2008**

The 6th International Conference on Scientific Computing and Applications

June 2-5, 2008, Pusan National University, Busan, Korea

This is the sixth of a sequence of conferences on Scientific Computing and

Applications held in the Pacific Rim region. All of them have the goal of

bringing together mathematicians, scientists and engineers working in the

field of scientific computing and its applications to solve scientific and

industrially oriented problems and to provide a forum for the participants

to meet and exchange ideas of common interest in an informal atmosphere.

The focus of this particular conference will be on the problems and methods

related to

1. Image processing

2. Computational biology

3. Computational fluid dynamics

4. Domain decomposition method

The goal of the conference is twofold. The theoretical areas of interest

include fundamental methods and algorithms for solving PDEs and linear

systems of equations. On the other hand, it will try to attract the

attention of the applied community in all areas to present and discuss the

applications of scientific computing to practical problems. The theoretical

topics of interest are (but not limited to): Finite Element, Finite Volume

Element and Finite Volume Methods for PDEs, splitting techniques and

stabilized methods, iterative solvers and preconditioning techniques

for large scale systems, methods for systems with a special structure,

parallel algorithms and performance analysis.

Keynote Speakers include:

- Susanne Brenner (Louisiana State University)

- Roland Glowinski (University of Houston)*

- Max Gunzburger (Florida State University)

- Jan Mandel (University of Colorado)*

- Jacques Rappaz (EPFL)*

- Zhong-Ci Shi (Chinese Academy of Sciences)*

- Masahisa Tabata (Kyushu University)

- Vidar Thomee (Chalmers University of Technology)

- Jean-Marc Vanden-Broeck (University College London)

* Tentative

Full conference details, registration and the call for talks are available at

http://www.ksiam.org/conference/SCA2008/

Co-chairs of Organizing Committee:

- Dongwoo Sheen (Seoul National University)

- Hyung-Chun Lee (Ajou University)

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

From: "Nicole C. Jorlett" <Jorlett@siam.org>

Date: Fri, 4 Jan 2008 10:40:51 -0500

**Subject: Deadline Extension, SIAM Conference on the Life Sciences LS08, Aug 2008**

Conference Name: SIAM Conference on the Life Sciences

Location: Montreal, Quebec, Canada

Dates: August 4 - 7, 2008

SUBMISSION DEADLINES HAVE BEEN EXTENDED

February 4, 2008: Minisymposium proposals

February 4, 2008: Abstracts for contributed and minisymposium speakers

Visit http://www.siam.org/meetings/ls08/submissions.php

For more information about the conference, visit

http://www.siam.org/meetings/ls08/ or contact SIAM Conference

Department at meetings @siam.org.

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

From: Chuck Gartland <gartland@math.kent.edu>

Date: Sat, 29 Dec 2007 22:11:25 -0500

**Subject: Tenure track position in applied/computational math at Kent State**

Kent State University

Department of Mathematical Sciences

Tenure-Track Position in Applied Mathematics

We invite applications for a tenure-track position in applied

mathematics. The appointment is to begin August 17, 2008. The

conditions of employment are competitive.

Candidates are required to have a Ph.D. in the mathematical sciences.

Preference will be given to candidates with postdoctoral experience.

Candidates are expected to have strong potential in research

(including the potential to attract external funding) and in teaching.

They should also be able to contribute to the interdisciplinary

outreach of the department and to support established research

strengths.

Candidates should have a strong background in computational

mathematics, including numerical analysis and scientific computing.

Preference will be given to candidates with an application area in

biosciences or materials science. Strong applications in other areas

of applied mathematics will also receive consideration. For further

information about the department, please visit the web site

http://www.math.kent.edu

To apply for this position, candidates must first visit the Kent State

jobsite at http://jobs.kent.edu and complete an academic data form.

In addition, candidates should send a full application directly to the

department, either electronically to appl-math-search@math.kent.edu or

by mail to

Applied Mathematics Search Committee

Department of Mathematical Sciences

Kent State University

Kent, OH 44242-0001

The full application should consist of a cover letter, summary

information in the AMS standardized format (available through the

American Mathematical Society http://www.ams.org), a curriculum vitae,

and at least three letters of reference.

Questions regarding this position may be sent to

appl-math-search@math.kent.edu

Screening of applicants will begin no later than January 14, 2008 and

will continue until the position is filled.

Kent State University is an Equal Opportunity, Affirmative Action

Employer.

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

From: Chi-Wang Shu <shu@cfm.brown.edu>

Date: Fri, 28 Dec 2007 01:30:10 -0500 (EST)

**Subject: Contents, Journal of Scientific Computing**

Journal of Scientific Computing

http://www.springeronline.com/journal/10915

Volume 34, Number 1, January 2008

Mesh Redistribution Strategies and Finite Element Schemes

for Hyperbolic Conservation Laws

Christos Arvanitis, pp.1-25.

Dispersion Analysis of Discontinuous Galerkin Schemes

Applied to Poincare, Kelvin and Rossby Waves

P.-E. Bernard, E. Deleersnijder, V. Legat and J.-F. Remacle,

pp.26-47.

A Dual-Petrov-Galerkin Method for the Kawahara-Type

Equations

Juan-Ming Yuan, Jie Shen and Jiahong Wu, pp.48-63.

Second-Order Accurate Godunov Scheme for Multicomponent

Flows on Moving Triangular Meshes

Guoxian Chen, Huazhong Tang and Pingwen Zhang, pp.64-86.

Discrete Rotational Symmetry, Moment Isotropy, and Higher

Order Lattice Boltzmann Models

Hudong Chen, Isaac Goldhirsch and Steven A. Orszag,

pp.87-112.

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

From: Hershkowitz Daniel <hershkow@techunix.technion.ac.il>

Date: Sun, 6 Jan 2008 06:08:49 +0200 (IST)

**Subject: Contents, Electronic Journal of Linear Algebram Vol 16**

Volume 16 (2007) of ELA - ELECTRONIC Journal of LINEAR ALGEBRA is now

complete. It is our largest over (it is 35% larger than the previous

volume, both in paper sand in number of pages). Here is its table of

contents.

1. Ricardo L. Soto, Oscar Rojo, Julio Moro and Alberto Borobia,

Symmetric nonnegative realization of spectra, pp. 1-18.

2. A.R. Moghaddamfar, S. M. H. Pooya, S. Navid Salehy and S. Nima

Salehy, More calculations on determinant evaluations, pp. 19-29.

3. Michael S. Cavers and Kevin N. Vander Meulen, Inertially arbitrary

nonzero patterns of order 4, pp. 30-43.

4. Christian Bidard, The weak Hawkins-Simon Condition, pp. 44-59.

5. Bo Cheng and Bolian Liu, On the nullity of Graphs, pp. 60-67.

6. Zvi Lotker, Note on deleting a vertex and weak interlacing of the

Laplacian spectrum, pp. 68-72.

7. Yongge Tian and Yonghui Liu, On a group of mixed-type reverse-order

laws for generalized inverses of a triple matrix product with

applications, pp. 73-89.

8. Steve Butler, Interlacing for weighted graphs using the normalized

Laplacian, pp. 90-98.

9. David Hecker and Debotah Lurie, Using least-squares to find an

approximate eigenvector, pp. 99-110.

10. Robert E. Hartwig and Pedro Patricio, On Roth's pseudo equivalence

over rings, pp. 111-124.

11. M. Bayat, H. Teimoori and B. Mehri, A generalization of rotation

and hyperbolic matrices and its applications, pp. 125-134.

12. Marija Dodig, Controllability of series connections, pp. 135-156.

13. Lihu Berman and Arie Feuer, On perfect conditioning of Vandermonde

matrices on the unit circle, pp. 157-161.

14. Daniel Hershkowitz and Allan Pinkus, On nonnegative sign

equivalent and sign similar factorizations of matrices, pp. 162-170.

15. Yan Zhu and Ting-Zhu Huang, Subdirect sums of doubly diagonally

dominant matrices, pp. 171-182.

16. Nathan L. Chenette, Sean V. Droms, Leslie Hogben, Rana Mikkelson

and Olga Pryporova, Minimum rank of a graph over an arbitrary field,

pp. 183-186.

17. Yongge Tian and Yoshio Takane, Some algebraic and statistical

properties of WLSEs under a general growth curve model, pp. 187-203.

18. Stephen J. Kirkland, A note on a distance bound using eigenvalues

of the normalized Laplacian matrix, pp. 204-207.

19. Thomas Britz, The Moore-Penrose inverse of a free matrix, pp. 208-215.

20. Michael I. Gil, Spectrum of infinite block matrices and

pi-triangular operators, pp. 216-231.

21. Rajesh J. Pereira, Nilpotent matrices and spectrally arbitrary

sign patterns, pp. 232-236.

22. Damjana Kokol Bukovsek, Tomaz Kosir, Nika Novak and Polona Oblak,

Products of commuting nilpotent operators, pp. 237-247.

23. Leiba X. Rodman, Comparison of congruences and strict equivalences

for real, complex, and quaternionic matrix pencils with symmetries,

pp. 248-283.

24. Ravindra B. Bapat, On generalized inverses of banded matrices,

pp. 284-290.

25. Jane Day and Wasin So, Singular value inequality and graph energy

change, pp. 291-299.

26. N.P. van der Aa, H.G. ter Morsche and R.R.M. Mattheij, Computation

of eigenvalue and eigenvector derivatives for a general complex-valued

eigensystem, pp. 300-314.

27. Tsvi Tlusty, A relation between the multiplicity of the second

eigenvalue of a graph Laplacian, Courant's nodal line theorem and the

substantial dimension of tight polyhedral surfaces, pp. 315-324.

28. Fernando Szechtman, Equivalence and congruence of matrices under

the action of standard parabolic subgroups, pp. 325-333.

29. Geir Dahl, Combinatorial properties of Fourier-Motzkin

elimination, pp. 334-346.

30. Chi-Kwong Li, Edward Poon and Ashwin Rastogi, Maps preserving

spectral radius, numerical radius, spectral norm, pp. 347-365.

31. Sebastian M. Cioaba and David A. Gregory, Principal eigenvectors

of irregular graphs, pp. 366-379.

32. David A. Grundy, Charles R. Johnson, Dale D. Olesky and Pauline

van den Driessche, Products of M-matrices and nested sequences of

principal minors, pp. 380-388.

33. Kazumasa Nomura and Paul Terwilliger, Affine transformations of a

Leonard pair, pp. 389-418.

34. R. Balaji and T. Parthasarathy, The Q-property of a multiplicative

transformation in semidefinite linear complementarity problems,

pp. 419-428.

35. Lisa Wood Bradley and Ernie L. Stitzinger, Class, dimension and

length in nilpotent Lie algebras, pp. 429-434.

36. R. Balaji and Ravindra B. Bapat, Block distance matrices,

pp. 435-443.

37. Michael I. Gil, Estimates for absolute values of matrix functions,

pp. 444-450.

38. Irene Sciriha, A characterization of singular graphs, pp. 451-462.

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

End of NA Digest

**************************

-------