URL for the World Wide Web:
http://www.netlib.org/na-net/na_home.html
-------------------------------------------------------
From: Petr Prikryl <prikryl@beba.cesnet.cz>
Date: Fri, 20 Dec 1996 15:29:24 +0100 (MET)
Subject: Babuska Prizes Awarded
1996 BABUSKA PRIZES AWARDED
In December 1996, the Czech Association for Mechanics and the Union of
Czech Mathematicians and Physicists again awarded the I. Babuska Prize
for the best work in computer science submitted by students and young
scientists.
The Prize winner for 1996 is Dr Petr Knobloch. The work honored was his
PhD thesis Solvability and finite element discretization of a
mathematical model related to Czochralski crystal growth defended at the
Otto-von-Guericke Universitaet Magdeburg in Germany.
Further winners on the second and third places who were delivered
diplomas of honor were Dr Miroslav Rozloznik from the Institute of
Computer Science of the Academy of Sciences in Prague with his PhD
thesis Numerical stability of the GMRES method nad Dr Tomas Vampola from
the Faculty of Machine Engineering of the Czech Technical University in
Prague with his PhD thesis Efficient algorithm for the assembly of
equations of motion for a system of many bodies considering the
yielding.
The fourth position was taken by Pavel Solin from the Faculty of
Mathematics and Physics of the Charles University in Prague with his
diploma work Three-dimensional Euler equations and their numerical
solution.
The prize as well as the diplomas will be awarded every year and they
are connected with a financial support.
The prize was established in 1994 by an outstanding Czech mathematician
Ivo Babuska. He was born in Prague in 1926 and after graduating from the
Faculty of Civil Engineering of the Czech Technical University in Prague
he started his work in the Mathematical Institute of the Academy of
Sciences. He was appointed professor in Prague in 1968 and since fall
1968 he has been working in the United States. Since 1995 he works at
the Texas Institute for Computational and Applied Mathematics,
University of Texas, Austin, TX.
His scientific work is focused on numerical and applied mathematics and
computational mechanics, and their use in practice. His results in the
finite element method belong to the fundamentals of the method. He is
the author of several monographs and has initiated several famous
scientific meetings both in Europe and the United States. He established
the journal Applications of Mathematics (formerly Aplikace matematiky)
in 1956. Last year he was awarded the Bernard Bolzano Medal by the
Academy of Sciences of the Czech Republic. The world mathematical
community remembered the 70th birthdays of Prof. Ivo Babuska, and also
Prof. Miroslav Fiedler, Prof. Jaroslav Kurzweil and Prof. Vlastimil Ptak
at the Prague Mathematical Conference in Prague in July 1996.
Karel Segeth
segeth@beba.cesnet.cz
------------------------------
From: V. P. Stokes <virgil.stokes@neuro.ki.se>
Date: Tue, 17 Dec 1996 07:56:26 +0100
Subject: A 3D Tracking Problem
Suppose we have K-landmarks (K > 2) on a rigid-body which is moving
through space. We measure the 3D coordinates of each of these
landmarks at times t = 1,2,...M. The measurements give us noisy 3D
trajectories for each of these landmarks at M-points.
Problem: Find smoothed trajectories for all landmarks if the distances
between the landmarks are unchanged when: 1) the distances are known
precisely, and 2) the distances are unknown.
Any pointers would be appreciated.
V. P. Stokes
BMC, Neuroscience
Karolinska Institute
Box 5626
S-114 86 Stockholm
SWEDEN
------------------------------
From: Mohsen Maesumi <maesumi@math.lamar.edu>
Date: Tue, 17 Dec 96 15:47:09 CST
Subject: Program for Convex Hull Sought
I like to get information about publicly available programs (preferably in
MATLAB) for finding the convex hull of a set of points in an n-dimensional
space. (The points are symmetric with respect to origin.)
The ability of the software to analyze and modify the convex hull to include
a new point (or set) is of special interest.
Thanks
Maesumi
maesumi@math.lamar.edu
------------------------------
From: Brenton LeMesurier <lemesur@maths.math.cofc.edu>
Date: Tue, 17 Dec 1996 17:17:13 -0500
Subject: Change of Address for Brenton LeMesurier
My new contact details are:
Brenton LeMesurier
Department of Mathematics
College of Charleston
66 George Street
Charleston SC 29424-0001
phone: 803-953-5728
email: lemesur@math.cofc.edu
home page: http://math.cofc.edu:8080/~lemesur
fax: 803-953-1410
------------------------------
From: Craig Douglas <douglas-craig@cs.yale.edu>
Date: Sun, 22 Dec 1996 20:20:53 -0500 (EST)
Subject: Change of Address for Craig C. Douglas
I will be leaving IBM's Research Division on December 31. The next day I will
become a faculty member at the University of Kentucky with 3 appointments:
professor of mathematics, professor of mechanical engineering, and associate
director of the center for computational sciences. My primary appointment is
in mathematics.
My new mailing address will be
Department of Mathematics
University of Kentucky
715 Patterson Office Tower
Lexington, KY 40506-0027
USA
Here are a few points for finding me (e-mail will probably be the only way,
however):
offices 761 POT (math)
321A McVey Hall (ccs)
phones +1-606-257-6792 (math)
+1-606-257-2326 (ccs)
faxes +1-606-257-4078 (math)
+1-323-1029 (ccs)
email ccd@ms.uky.edu
url http://www.ms.uky.edu/~ccd
Stay tuned for an additional MGNet site in addition to
http://casper.cs.yale.edu/mgnet/www/mgnet.html
http://www.cerfacs.fr/~douglas/mgnet.html
I will be commuting from Greenwich, Connecticut for the spring semester, so I
can be reached on weekends at +1-203-625-9449. I will still be in New Haven
on Fridays (douglas-craig@cs.yale.edu or +1-203-432-1221). Delta and United
Air Lines are thrilled.
Cheers,
Craig Douglas
------------------------------
From: Allison Bogardo <bogardo@siam.org>
Date: Mon, 23 Dec 96 10:41:52 EST
Subject: SIAG/LA Prize Announcement
CALL FOR NOMINATIONS
SIAM Activity Group on Linear Algebra Prize
The SIAG/LA Prize:
The SIAM Activity Group on Linear Algebra will present the award at
its Sixth Conference on Applied Linear Algebra at Snowbird in
October 1997. The prize, the fourth to be given, is awarded to the
author(s) of the most outstanding paper on a topic in applicable
linear algebra published in a peer-reviewed journal.
Nominations:
Nominations, along with an electronic* AND hard copy of the paper,
should be sent by April 15, 1997 to the chair of the selection
committee:
Biswa Nath Datta
Department of Mathematical Sciences
Northern Illinois University
DeKalb, Illinois 60115
Telephone: 815-753-6759
Fax: 815-753-1112
E-mail: dattab@math.niu.edu
* If not available electronically, please send five hard
copies for distribution to the committee.
Other members of the selection committee are Tony Chan (UCLA),
Ludwig Elsner (University of Bielefeld), Anne Greenbaum
(NYU-Courant), and Jim Varah (University of British Columbia).
Eligibility:
Candidate papers must be published in English in a peer-reviewed
journal bearing a publication date between January 1, 1993 through
December 31, 1996. The papers must contain significant research
contributions to the field of linear algebra, as commonly defined
in the mathematical literature, with direct or potential
applications. Nominations should include a full bibliographic
citation for the paper and a brief statement outlining the
justification for the nomination in terms of its importance and
impact.
Description of Award:
The award consists of a plaque and a certificate containing the
citation. If the selected paper has multiple authors, each author
will receive a plaque and certificate. At least one of the
awardees is expected to attend the award ceremony to present the
paper.
------------------------------
From: Stephen Wright <wright@mcs.anl.gov>
Date: Mon, 23 Dec 1996 11:09:24 -0600
Subject: New Book on Interior-Point Methods
I'm pleased to announce that my new book is now available:
PRIMAL-DUAL INTERIOR-POINT METHODS by Stephen J. Wright
SIAM 1997 / xx+289 pages / Softcover / ISBN 0-89871-382-X / Order Code OT54
For more information please see
http://www.siam.org/books/swright/
Contents:
Preface
Notation
Chapter 1: Introduction
Chapter 2: Background: Linear Programming and Interior-Point Methods
Chapter 3: Complexity Theory
Chapter 4: Potential-Reduction Methods
Chapter 5: Path-Following Algorithms
Chapter 6: Infeasible-Interior-Point Algorithms
Chapter 7: Superlinear Convergence and Finite Termination
Chapter 8: Extensions
Chapter 9: Detecting Infeasibility
Chapter 10: Practical Aspects of Primal-Dual Algorithms
Chapter 11: Implementations
Appendix A: Basic Concepts and Results
Appendix B: Software Packages
Bibliography
Index
In the past decade, primal-dual algorithms have emerged as the most
important and useful algorithms from the interior-point class. This
book presents the major primal-dual algorithms for linear programming
in straightforward terms. A thorough description of the theoretical
properties of these methods is given, as are a discussion of practical
and computational aspects and a summary of current software.
------------------------------
From: Yuesheng Xu <xu@plains.nodak.edu>
Date: Mon, 23 Dec 1996 15:36:49 -0600 (CST)
Subject: Guangzhou Symposium on Computational Mathematics
Guangzhou International Symposium on Computational Mathematics
will take place at Zhongshan University, Guangzhou, People's Republic
of China, from Aug. 11 - 15, 1997. Information about this conference
can be found by ftp/hammilton.math.ndsu.nodak.edu/a2
------------------------------
From: Jaap Hollenberg <sondjaap@horus.sara.nl>
Date: Tue, 17 Dec 1996 05:42:41 +0100
Subject: Technology Demonstrators on HPCN Europe
Technology Demonstrators Display Call for Participation
The Technology Demonstrators Display is aimed at demonstrating real-world
applications that are running live on HPCN Europe, in 1997 this will be in
Vienna, Austria (see also http://www.wins.uva.nl/hpcn/). Typical demonstrators
show that HPCN is not just a research topic, but a leading technology with
important applications.
The focus on will be on applications collaboration between research institutes
and industry, but also other leading-edge applications are welcome. We expect
participation typically to come from "vertical chains", collaborations between
HPCN knowledge centres, hard and/or software vendors and end-users in industry.
We request proposals for Technology Demonstrators in the following areas:
1 Demonstrators of real working applications.
2 Demonstrators of new emerging applications.
3 Demonstrators of technology transfer.
Participants are expected to pay a small participation fee.
Proposals should be submitted to:
Jaap Hollenberg
TDD 1997 secretariat
SARA
PO Box 94613
1090 GP Amsterdam
The Netherlands
hollenberg@sara.nl
Time schedule:
Deadline for submitting proposals: January 20, 1997.
Decision by the Steering Board before February 24, 1997.
TDD in Vienna April 28-30, 1997.
------------------------------
From: Afonso Ferreira <ferreira@turing.scs.carleton.ca>
Date: Tue, 17 Dec 1996 15:12:50 -0500
Subject: Solving Combinatorial Optimization Problems in Parallel
C A L L F O R P A P E R S
WORKSHOP ON
SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS IN PARALLEL
--- SCOOP ---
April 5, 1997 - Geneva, Switzerland
To be held in conjunction with IPPS'97
Deadline for submission: January 10, 1997
(http://www.ens-lyon.fr/LIP/SCOOP)
The solution of optimization problems in real world applications
usually involves an enormous amount of work in which the use of
parallel computers may be of great value. Through parallel computing,
not only problems may be solved faster, but also large-sized problems
may become tractable.
The SCOOP workshop is aimed to bring together experts in the field of
parallel combinatorial computing. It will address both exact and
approximate methods for scientific and practical hard optimization
problems. The workshop will be the final meeting of the Human Capital
and Mobility project SCOOP of the European Union. It will be held on
the last day of the IPPS symposium (April 1--5, 1997), in Geneva,
Switzerland.
The program will consist of a key-note lecture, and a number of short
(25 minute) contributed presentations.
The key-note lecture will be the following.
Stavros A. Zenios
School of Economics and Management
University of Cyprus
High Performance Computing for Financial Applications
Program Committee
A. Ferreira (Chair) -- Lyon
A. de Bruin -- Rotterdam
J. Clausen -- Copenhagen
P. Crescenzi -- Rome
J. Eckstein -- New Jersey
M. Gengler -- Lyon
G. Megson -- Reading
V. Kumar -- Minnesota
S. Migdalas -- Linkoping
B. Monien -- Paderborn
P. Panagiotopoulos -- Thessaloniki
P. Pardalos -- Florida
J. Rolim -- Geneva
C. Roucairol -- Versailles
Organizing Committee
G. Kindervater (Chair) -- Rotterdam
P. Rebreyend -- Lyon
S. Ubeda -- Lyon
For further information please contact
Gerard Kindervater
Department of Computer Science
Erasmus University
P.O. BOX 1738
3000 DR Rotterdam
The Netherlands
email: gapk@cs.few.eur.nl
FAX: + 31 10 4526177
VOX: + 31 10 4081316
------------------------------
From: Cindy A. Phillips <caphill@cs.sandia.gov>
Date: Wed, 18 Dec 96 09:35:43 MST
Subject: Euro-Par'97 Workshop Parallel Discrete Algorithms
Euro-Par'97
Announcing a Euro-Par'97 Workshop
Parallel Discrete Algorithms
Program Committee:
* Cynthia Phillips, Sandia National Laboratories, USA, Chair
* Michael Kaufmann, University of T\"ubingen, Germany, Local Chair
* Paul Spirakis, Computer Technology Institute, Greece, Vice-Chair
* Shang-Hua Teng, University of Minnesota, USA, Vice-Chair
Deadline:
20 January 1997 (paper) 1 February 1997 (electronic)
General Description:
Euro-Par is the annual European conference in Parallel Processing. Like
the 1996 conference in Lyon, the 1997 version will consist of a number
of highly focussed workshops on all aspects of parallel processing,
from theory to practice, from academy to industry. The workshops will
present the latest advances in their respective domains. In addition,
there will be a number of high-level tutorials of general interest plus
a series of invited talks. Calls for papers for 20 workshops are being
launched. All accepted papers will appear in the proceedings published
by Springer-Verlag in the LNCS Series.
Workshop Description:
Workshop #08: Parallel Discrete Algorithms
The goal of this workshop is to provide a forum for advances
in the state of the art in parallel discrete algorithms. Parallel
algorithms from all discrete areas are appropriate, including discrete
optimization (for both specific problems and more generic methods such
as parallel search), pattern recognition and image processing,
discrete simulation, computational geometry, and graph theory.
Special consideration will be given to scalable, practical algorithms.
Algorithmic strategies for abstract parallel models such as
LogP, BSP, or PRAMs are encouraged, as well as algorithmic tuning for
specific architectures, and experimental analysis which provides
insight into algorithmic choice. There is a strong relation to workshop
#13, but we focus on specific algorithms rather than on models and methods.
Topics of interest include:
* discrete optimization
* graph algorithms
* computational geometry
* discrete simulation methods
* comparative experimental analysis
Further information is available at URL http://www.uni-passau.de/europar97/.
It includes the list of all workshops. Please send all information requests
and comments to europar97@fmi.uni-passau.de. Register today on the Euro-Par'97
mailing list by sending us a mail! See below for additional information.
Official Address:
Euro-Par'97, Universitaet Passau, D-94030 Passau, Germany
Phone: (+49) (851) 509-3071; Fax: (+49) (851) 509-3092
E-mail: europar97@fmi.uni-passau.de
URL: http://www.uni-passau.de/europar97/
------------------------------
From: Michael Guenther <guenther@mathematik.th-darmstadt.de>
Date: Fri, 20 Dec 1996 14:14:03 MEZ
Subject: GAMM Session on Numerical treatment of ODEs and DAEs
Annual GAMM Meeting 1997
Session 20: Numerical treatment of ordinary and
differential-algebraic equations
March 24 - 27 1997 in Regensburg, Bavaria, Germany
Chairs: Alexander Ostermann, University of Innsbruck, Austria
Michael Guenther, Technical University of Darmstadt, Germany
Invited speakers:
Martin Arnold, Univ. Rostock:
Singularitaeten in differentiell-algebraischen Systemen mit einseitigen
Beschraenkungen
Georg Denk, Siemens AG Muenchen:
Noise analysis in circuit simulation with stochastic differential equations
Christian Engstler and Christian Lubich, Univ. Tuebingen:
Multirate methods with automatic partitioning for ODE systems with
different time scales
Marlis Hochbruck and Christian Lubich, Univ. Tuebingen:
Exponential integrators for large systems of differential equations
Martin Kiehl, TU Muenchen:
Partitionierungsstrategien bei der Simulation reaktionskinetischer Systeme
Oskar von Stryk, TU Muenchen:
Optimal Control of Multibody Systems in Minimal Coordinates
All NA-NET readers are invited to present a short communication in this
session. Deadline for submission is Jan, 10 1997.
For more information, please contact
Michael Guenther, TH Darmstadt, FB Mathematik, Schlossgartenstr. 7,
D-64289 Darmstadt. E-Mail: guenther@mathematik.th-darmstadt.de
Alexander Ostermann, Universitaet Innsbruck, Institut fuer Mathematik
und Geometrie, Technikerstrasse 13, A-6020 Innsbruck.
E-Mail: alex@mat1.uibk.ac.at
------------------------------
From: Don Goldfarb <gold@ieor.columbia.edu>
Date: Tue, 17 Dec 96 13:58:50 EST
Subject: Faculty Positions at Columbia University
TWO FACULTY POSITIONS IN THE IEOR DEPARTMENT AT COLUMBIA UNIVERSITY
Columbia University
Industrial Engineering and
Operations Research Department
The Department of Industrial Engineering and Operations Research
invites applications for TWO tenure-track faculty appointments
starting July 1, 1997.
We seek individuals with a Ph.D. in Industrial Engineering, Operations
Research, or a related field with outstanding research ability and
potential. Candidates with research and teaching interests in
optimization, stochastic systems, applications of operations research
in finance, information systems, logisitics, and manufacturing systems
are particularly encouraged to apply; however, applicants with research and
teaching interests in all areas of industrial engineering and operations
research will be considered. Senior candidates must have a distinguished
record of achievement.
The appointees are expected to teach both graduate and undergraduate courses,
be actively involved in research, and supervise doctoral students.
Columbia University is an equal opportunity/affirmative action employer and
especially welcomes applications from qualified women and minorities.
Interested individuals should send a current resume, letters from at least
two references, and copies of publications by January 15, 1997 to:
Chairman, Search Committee
Department of Industrial Engineering and Operations Research
331 S.W.Mudd, MC 7404
Columbia University
New York, NY 10027
------------------------------
From: Peter Castro <ltzb00@markov.kodak.com>
Date: Thu, 19 Dec 1996 16:59:25 -0500
Subject: Position at Eastman Kodak
The Computational Science Laboratory of the Eastman Kodak Company is
seeking an applied mathematician at the Ph.D. level. The successful
candidate will have a strong background in applied mathematics,
particularly analysis (ODEs, PDEs, probability and stochastic
processes), good computational skills, a working knowledge of
statistics, be particularly interested in and adept at creating and
analyzing mathematical models of physical/chemical/technological
processes and systems, and be a good communicator and team worker.
The Computational Science Laboratory is a group of highly skilled
mathematicians and scientists working with other scientists and
engineers to model problems of interest to the business of the Eastman
Kodak Company. The scope of interaction is company-wide with
opportunity for project work in virtually any application field.
Principal efforts at the moment are in fundamental understanding of
silver halide materials; light scattering in complex media; diffusion
of reacting species in complex, random systems; and others.
Qualified candidates should send CV to:
Dr. Kathryn Nass
Computational Science Laboratory
9/83/RL 02208
Eastman Kodak Company
Rochester, NY 14650-2208
e-mail: knass@kodak.com
------------------------------
From: SIAM <thomas@siam.org>
Date: Wed, 18 Dec 96 09:57:09 EST
Subject: Contents, SIAM Applied Mathematics
SIAM JOURNAL ON Applied Mathematics
FEBRUARY 1997 Volume 57, Number 1
CONTENTS
Impulsive Stretching of a Surface in a Viscous Fluid
C. Y. Wang, Q. Du, M. Miklavcic, and C. C. Chang
On the Approximation of the Solution of the Pressure Equation by Changing the
Domain
Bjorn Fredrik Nielsen and Aslak Tveito
Solution Behavior of the Transient Heat Transfer Problem in Thermoelectric Shape
Memory Alloy Actuators
Zhonghai Ding and Dimitris C. Lagoudas
A Crystalline Motion: Uniqueness and Geometric Properties
Piotr Rybka
On the Propagation of Calcium Waves in an Inhomogeneous Medium
James Sneyd and Jonathan Sherratt
Homogenization in a Periodic and Time-Dependent Potential
Josselin Garnier
Pattern Formation in Systems with Slowly Varying Geometry
Wiktor Eckhaus and Rachel Kuske
Image Quantization Using Reaction-Diffusion Equations
Luis Alvarez and Julio Esclarin
Invariant Geometric Evolutions of Surfaces and Volumetric Smoothing
Peter J. Olver, Guillermo Sapiro, and Allen Tannenbaum
On Uniqueness of an Inverse Problem for a 1-D Wave Equation from Transmission
Data
Liu Jijun and Wang Yuanming
Pulse Dynamics in an Unstable Medium
N. J. Balmforth, G. R. Ierley, and R. Worthing
Partial Synchronization in a Network of Neural Oscillators
David Terman and Euiwoo Lee
Dynamics in a Chain of Overdamped Pendula Driven by Constant Torques
Min Qian, Shu Zhu, and Wen-Xin Qin
------------------------------
From: SIAM <tschoban@siam.org>
Date: Wed, 18 Dec 96 11:20:31 EST
Subject: Contents, SIAM Matrix Analysis and Applications
SIAM Journal on Matrix Analysis and Applications
January 1997, Volume 18, Number 1
CONTENTS
The Restarted Arnoldi Method Applied to Iterative Linear System Solvers for the
Computation of Rightmost Eigenvalues
Karl Meerbergen and Dirk Roose
Relative Residual Bounds for the Eigenvalues of a Hermitian Semidefinite Matrix
Zlatko Drmac and Vjeran Hari
GMRES vs. Ideal GMRES
Kim-Chuan Toh
GMRES on (Nearly) Singular Systems
Peter N. Brown and Homer F. Walker
Stability of the Diagonal Pivoting Method with Partial Pivoting
Nicholas J. Higham
Estimating the Support of a Scaling Vector
Wasin So and Jianzhong Wang
Determinant of the Sum of a Symmetric and a Skew-Symmetric Matrix
Natalia Bebiano, Chi-Kwong Li, and Joao da Providencia
Bounds for the Componentwise Distance to the Nearest Singular Matrix
S. M. Rump
Stability Issues in the Factorization of Structured Matrices
Michael Stewart and Paul Van Dooren
Bounds for the Differences of Matrix Means
M. Alic, B. Mond, J. Pecaric, and V. Volenec
A Constrained Procrustes Problem
Lars-Erik Andersson and Tommy Elfving
An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
Timothy A. Davis and Iain S. Duff
Sparse Multifrontal Rank Revealing QR Factorization
Daniel J. Pierce and John G. Lewis
Vertical Block Hidden Z-Matrices and the Generalized Linear Complementarity
Problem
S. R. Mohan and S. K. Neogy
Stability of Augmented System Factorizations in Interior-Point Methods
Stephen Wright
On Episodic Queues
Qi-Ming He and Marcel F. Neuts
Approximability by Weighted Norms of the Structured and Volumetric Singular
Values of a Class of Nonnegative Matrices
Daniel Hershkowitz, Wenchao Huang, Hans Schneider, and Hans Weinberger
Some Inequalities for Norms of Commutators
Rajendra Bhatia and Fuad Kittaneh
Addendum: Is the Polar Decomposition Finitely Computable?
Alan George and Kh. Ikramov
------------------------------
From: SIAM <tschoban@siam.org>
Date: Fri, 20 Dec 96 11:30:02 EST
Subject: Contents, SIAM Numerical Analysis
SIAM Journal on Numerical Analysis
FEBRUARY 1997, Volume 34, Number 1
CONTENTS
Computing Hopf Bifurcations I
John Guckenheimer, Mark Myers, and Bernd Sturmfels
Highly Continuous Interpolants for One-Step ODE Solvers and their Application
to Runge-Kutta Methods
S. N. Papakostas and Ch. Tsitouras
Analysis of a Minimum Perturbation Algorithm for Nonsymmetric Linear Systems
Ebrahim M. Kasenally and Valeria Simoncini
A Geometrical-Mechanical Interpretation of Gradient-Weighted Moving Finite
Elements
Keith Miller
Sequential and Parallel Splitting Methods for Bilinear Control Problems in
Hilbert Spaces
K. Kunisch and X.-C. Tai
Global Dissipativity for A-Stable Methods
A. T. Hill
Qualitative and Numerical Analysis of Quasi-Static Problems in Elastoplasticity
Weimin Han, B. Daya Reddy, and Gregory C. Schroeder
Multigrid Methods for Nearly Singular Linear Equations and Eigenvalue Problems
Zhiqiang Cai, Jan Mandel, and Steve McCormick
Finite Element Approximation of the Transport of Reactive Solutes in Porous
Media. Part I: Error Estimates for Nonequilibrium Adsorption Processes
John W. Barrett and Peter Knabner
A Posteriori Error Estimators for the Stokes and Oseen Equations
Mark Ainsworth and J. Tinsley Oden
Uniformly Accurate Schemes for Hyperbolic Systems with Relaxation
Russel E. Caflisch, Shi Jin, and Giovanni Russo
Polynomial Liftings on a Tetrahedron and Applications to the h-p Version of the
Finite Element Method in Three Dimensions
Rafael Munoz-Sola
Finite Element Solution of the Helmholtz Equation with High Wave Number. Part
II: The h-p Version of the FEM
Frank Ihlenburg and Ivo Babuska
Multistep Numerical Methods Based on the Scheifele G-Functions with Application
to Satellite Dynamics
Pablo Martin and Jose M. Ferrandiz
Stability Analysis of an Odd-Even-Line Hopscotch Method for Three-Dimensional
Advection-Diffusion Problems
J. G. Verwer and B. P. Sommeijer
On the Stability of the Discontinuous Galerkin Method for the Heat Equation
Ch. G. Makridakis and I. Babuska
On the Computation of Lyapunov Exponents for Continuous Dynamical Systems
Luca Dieci, Robert D. Russell, and Erik S. Van Vleck
------------------------------
End of NA Digest
**************************
-------