URL for the World Wide Web:
From: Ali Sayed <firstname.lastname@example.org>
Date: Tue, 02 May 2000 15:31:29 -0700
Subject: New Book, Linear Estimation
New Book Anouncement
T.Kailath, A. H. Sayed, and B. Hassibi
Prentice Hall, NJ, 2000
SIAM, PA. Hardcover. xviii+854 pages.
This textbook is intended for a graduate-level course and assumes
familiarity with basic concepts from matrix theory, linear algebra,
and linear system theory. Six appendices at the end of the book
provide the reader with enough background and review material in
all these areas.
This original work offers the most comprehensive and up-to-date
treatment of the important subject of optimal linear estimation,
which is encountered in many areas of engineering such as
communications, control, and signal processing, and also in several
other fields, e.g., econometrics and statistics. The book not
only highlights the most significant contributions to this
field during the 20th century, including the works of Wiener
and Kalman, but it does so in an original and novel manner that
paves the way for further developments in the new millennium.
This book contains a large collection of problems that complement
the text and are an important part of it, in addition to numerous
sections that offer interesting historical accounts and insights.
The book also includes several results that appear in print for
the first time.
The book takes a geometric point of view with:
a) Emphasis on the numerically favored array forms of many
b) Emphasis on equivalence and duality concepts for the
solution of several related problems in adaptive
filtering, estimation, and control.
These features are generally absent in most prior treatments,
ostensibly on the grounds that they are too abstract and
complicated. It is the authors' hope that these misconceptions
will be dispelled by the presentation herein, and that the
fundamental simplicity and power of these ideas will be more
widely recognized and exploited. Among other things, these
features already yielded new insights and new results for
linear and nonlinear problems in areas such as adaptive
filtering, quadratic control, and estimation, including the recent
2. Deterministic Least-Squares Problems.
3. Stochastic Least-Squares Problems.
4. The Innovations Process.
5. State-Space Models.
6. Innovations for Stationary Processes.
7. Wiener Theory for Scalar Processes.
8. Wiener-Kalman Theory in the Vector Case.
9. The Kalman Filter.
10. Smoothed Estimators
11. Fast Algorithms.
12. Array Algorithms.
13. Fast Array Algorithms.
14. Asymptotic Behavior.
15. Duality and Equivalence in Estimation and Control.
16. Continuous-Time State-Space Estimation.
17. A Scattering Theory Approach.
A. Useful Matrix Results.
B. Unitary and J-Unitary Transformations.
C. Controllability and Observability.
D. Lyapunov Equations.
E. Algebraic Riccati Equations.
F. Displacement Structure.
About the Authors:
T. Kailath is Hitachi America Prof. of Eng., Stanford Univ.
A. H. Sayed is Associate Prof. of Electrical Eng., UCLA
B. Hassibi is with Bell Laboratories, Murray Hill, NJ.
Read the preface and download a sample chapter from
From: Panos Pardalos <email@example.com>
Date: Tue, 2 May 2000 20:22:07 -0400 (EDT)
Subject: New book, Approximation and Complexity in Numerical Optimization
Approximation and Complexity in Numerical Optimization
Continuous and Discrete Problems
edited by Panos M. Pardalos
NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 42
Kluwer Academic Publishers, Dordrecht (2000), 594 pp.
Hardbound, ISBN 0-7923-6275-6
There has been much recent progress in approximation algorithms for nonconvex
continuous and discrete problems, from both a theoretical and a practical
perspective. In discrete (or combinatorial) optimization many approaches
have been developed recently that link the discrete universe to the continuous
universe through geometric, analytic, and algebraic techniques. Such techniques
include global optimization formulations, semidefinite programming, and
spectral theory. As a result new approximate algorithms have been discovered
and many new computational approaches have been developed. Similarly, for
many continuous nonconvex optimization problems, new approximate algorithms
have been developed based on semidefinite programming and new randomization
techniques. On the other hand, computational complexity, originating from
the interactions between computer science and numerical optimization, is one
of the major theories that have revolutionized the approach to solving
optimization problems and to analyzing their intrinsic difficulty. The main
focus of complexity is the study of whether existing algorithms are efficient
for the solution of problems, and which problems are likely to be tractable.
The quest for developing efficient algorithms leads also to elegant general
approaches for solving optimization problems, and reveals surprising
connections among problems and their solutions. The two themes of approximation
and complexity pervade this book. Audience: Faculty, graduate students, and
researchers in mathematical programming, computer sciences and engineering.
Contents and Contributors:
Navigating Graph Surfaces; J. Abello, S. Krishnan.
The Steiner Ratio of Lp-planes; J. Albrecht, D. Cieslik.
Hamiltonian Cycle Problem via Markov Chains and Min-type Approaches;
M. Andramonov, et al.
Solving Large Scale Uncapacitated Facility Location Problems;
F. Barahona, F. Chudak.
A Branch - and - Bound Procedure for the Largest Clique in a Graph; E.R. Barnes.
A New `Annealed' Heuristic for the Maximum Clique Problem; I.M. Bomze, et al.
Inapproximability of some Geometric and Quadratic Optimization Problems;
A. Brieden, et al.
Convergence Rate of the P-Algorithm for Optimization of Continious Functions;
Application of Semidefinite Programming to Circuit Partitioning;
C.C. Choi, Y. Ye.
Combinatorial Problems Arising in Deregulated Electrical Power Industry:
Survey and Future Directions; D. Cook, et al.
On Approximating a Scheduling Problem; P. Crescenzi, et al. Models and
Solution for On-Demand Data Delivery Problems; M.C. Ferris, R.R. Meyer.
Complexity and Experimental Evaluation of Primal-Dual Shortest Path Tree
Algorithms; P. Festa, et al.
Machine Partitioning and Scheduling under Fault-Tolerance Constraints;
P.G. Spirakis. Finding Optimal Boolean Classifiers; J. Franco.
Tighter Bounds on the Performance of First Fit Bin Packing;
From: Boris Kvasov <firstname.lastname@example.org>
Date: Fri, 5 May 2000 19:00:27 +0700 (GMT)
Subject: New Book, Methods of Shape Preserving Spline Approximation
I am pleased to announce that the following book will appear
in the end of June or early July:
Boris I. Kvasov
METHODS OF SHAPE PRESERVING SPLINE APPROXIMATION
World Scientific Publishing Co Pte Ltd, xvi+338 p., 2000
Methods of shape-preserving spline approximation have proved to be of
practical value not only in the design of different products such as
car bodies, ship hulls, airplane fuselages and wings, etc. but also
in the description of geological, physical and even medical phenomena.
This book is a first attempt to present methods of shape-preserving
spline approximation in a systematic form.
Its primary aim is to describe some of the best techniques for solving
the shape-preserving approximation problem, by using a unified approach
based on generalized tension splines, and also to provide algorithms
of shape-preserving spline approximation with automatic selection of shape
control parameters. The book also addresses some of the current research
issues such as finite difference methods for the construction of
shape-preserving hyperbolic splines and the study of related discrete
generalized tension splines. The algorithms of shape-preserving
parametrization presented may be used to improve the quality of
representation of the shape-preserving spline curves and surfaces.
The emphasis is on efficient numerical algorithms and their
computer implementation. Our aim is to provide a mathematical
technique which will enable the readers to develop their own software for
generating, describing, modifying, and rendering shape-preserving curves
Chapter 1. Interpolation by Polynomials and Lagrange Splines 7
Chapter 2. Cubic Spline Interpolation 37
Chapter 3. Algorithms for Computing 1-D and 2-D Polynomial
Chapter 4. Methods of Monotone and Convex Spline Interpolation 97
Chapter 5. Methods of Shape-Preserving Spline Interpolation 127
Chapter 6. Local Bases for Generalized Tension Splines 155
Chapter 7. GB-Splines of Arbitrary Order 185
Chapter 8. Methods of Shape-Preserving Local Spline
Chapter 9. Difference Method for Construction Hyperbolic
Tension Splines 239
Chapter 10. Discrete Generalized Tension Splines 265
Chapter 11. Methods of Shape-Preserving Parametrization 293
Appendix A. Example: Reconstruction of a Ship Surface 325
Appendix B. Computer Programs for Shape-Preserving Surface
From: Jean-Claude Yakoubsohn <email@example.com>
Date: Tue, 2 May 100 14:53:42 +0200 (MET DST)
Subject: Workshop SEA 2000
This workshop will be held in Toulouse (FRANCE) on June, 14-15-16 2000.
This workshop is devoted to symbolic and numerical methods for solving
systems of equations, to related topics and applications. More precisely
we want to focus on the following themes:
- algorithms and their applications
- Diophantine approximation
- iterative methods
- problems on Riemannian manifolds
- the nonlinear eigenvalue problem
This workshop is organized by:
Luca Amodei, Universite Paul Sabatier, Laboratoire MIP, Toulouse
Xavier Buff, Universite Paul Sabatier, Laboratoire Emile Picard, Toulouse
Jean-Pierre Dedieu, Universite Paul Sabatier, Laboratoire MIP, Toulouse
Philippe Guillaume, INSA, Laboratoire MIP, Toulouse
Luis Miguel Pardo, Universidad de Cantabria, Santander
Didier Pinchon, Laboratoire MIP, Toulouse
Jean-Claude Yakoubsohn, Universite Paul Sabatier, Laboratoire MIP, Toulouse
Marc Giusti (Polytechnique, Palaiseau)
Joos Heintz (Buenos Aires and Santander)
Nick Higham (Manchester)
Jean-Pierre Merlet (INRIA, Sophia)
Luis Miguel Pardo (Santander)
Mike Shub (IBM, New York)
Francoise Tisseur (Manchester)
Contact: Workshop email : firstname.lastname@example.org
From: Hannah Blubaugh <email@example.com>
Date: Tue, 2 May 2000 10:07:51 -0400
Subject: Conference OptiCON2000
October 26-27, 2000
Hyatt Newporter, Newport Beach, CA
OptiCON2000, the third annual optimization software, methods, and
applications conference, will be held in Newport Beach,
California October 26th-27th 2000. Hosted by Altair Engineering
and sponsored in part by Hewlett Packard, OptiCON brings
you the latest advancements in the field of optimization
in an interactive and educational environment. The conference
offers an advanced technical forum in which to exchange
concepts, ideas, and methods with industry experts, academic
researchers, and leading software developers in the field of
If you would like to submit an abstract for consideration in
this year's conference, please email firstname.lastname@example.org for
abstract submission information.
Abstract Deadline May 31
Notification of Acceptance June 14
Camera-ready Papers Due September 13
Early Registration Deadline September 15
Conference Day 1 October 26
Conference Day 2 October 27
For more information, visit the official OptiCON2000 website:
www.altair.com/Events/OptiCon/ or e-mail email@example.com
From: Mac Hyman <firstname.lastname@example.org>
Date: Tue, 2 May 2000 13:31:04 -0600 (MDT)
Subject: Conference on Sciences Impacting Our Future
Center for Nonlinear Studies (CNLS) 20th Annual International Conference
SCIENCES IMPACTING OUR FUTURE
5-8 June, 2000
J.R. Oppenheimer Study Center
Los Alamos National Laboratory
Los Alamos, New Mexico
To celebrate the CNLS 20th anniversary, and the dawning of the new
millennium, we invite you to attend our annual international
conference. This conference will focus on sciences that are bound to
affect our future: biosciences, nanosciences, earth sciences and
computational sciences. Our speakers, who include four Nobel Prize
winners, are drawn from a wide variety of fields. To make the
lectures accessible to a broad audience, the speakers will combine an
overview of the current status of their field with a speculative
outlook on what is to come.
Invited Speakers Include:
D Ceperly (Illinois) Computational Physics
R Chowdhury (Einstein Med.) Gene Therapy
J Deisenhofer (SW Texas Med.) Proteins
D Divincenzo (IBM) Quantum Computing
M Ghil (UCLA) Oceanography
D Glaser (UC Berkeley) Neurobiology
L Knopoff (UCLA) Earthquakes
R Laughlin (Stanford) Condensed Matter
W Lipscomb (Harvard) Functional Genomics
C Murray (Bell Labs) Condensed Matter
P Moore (Yale) Complex Biosystems
W Press (Los Alamos) Scientific Computing
M Reed (Yale) Quantum Devices
M Roukes (Caltech) Nanostructures
O Sporns (Neurosci. Inst.) Neurobiology
J Tour (Rice) Molecular Electronics
M Turner (Chicago) Astrophysics
D Weitz (Harvard) Soft Matter
G Whitesides (Harvard) Self-Assembly
P Wolynes (Illinois) Biomolecules
E. Ben-Naim, A. Bishop, G. Doolen, R. Ecke,
H. Frauenfelder, R. Mainieri, L.Margolin, D. Pines.
Limited funds are available to support junior scientists
Online Information & Registration:
For Further Information Please Contact:
Mr. Roderick Garcia
Center for Nonlinear Studies, MSB258
Los Alamos National Laboratory
Los Alamos, NM 87545
Ph: (505) 667-1444
Fax: (505) 665-2659
From: Ruey-Lin Sheu <email@example.com>
Date: Wed, 3 May 2000 09:35:42 +0800
Subject: Conference on Optimization and Optimal Control
International Conference on Optimization and Optimal Control
June 1-4, 2001
National Cheng Kung University, Tainan, Taiwan
( First Announcement )
This conference provides a forum for Chinese and international researchers
to report and exchange their latest works on optimization and optimal
control. Contributed papers are solicited.
Linear and nonlinear programming, Variational Inequality,
Semi-infinite and infinite programming, Convex Programming,
Set-valued analysis, Game theory,
Scheduling, Optimal control,
Convex analysis, Fuzzy Optimization
A. R. Conn (Thomas J. Wastson Research Center, IBM),
B. Datta (Northern Illinois University),
S.C. Fang (North Carolina State University),
W. Kuo (Texas A&M University),
H.C. Lai (I-Shou University),
D. Pallaschke (Universitat Karlsruhe),
P. M. Pardalos (University of Florida),
L. Qi (The Hong Kong Polytechnic University),
R. T. Rockafellar (University of Washington),
S. Schaible (University of California, Riverside),
M.H. Shih (Chung Yuan University),
T. Tanaka (Hirosaki University),
P. Tseng (University of Washington)
X.Q. Cai (The Hong Kong Chinese University),
K.L. Teo (The Hong Kong Polytechnical University),
J. Zhang (The Hong Kong City University)
S.Y. Wu (National Cheng Kung University)
W.W. Lin, Chair (National Tsing Hua University),
Q.H. Ansari (National Sun Yat-Sen University),
M.S. Chern (National Tsing Hua University),
C. Chang (National Tsing Hua University),
C. Kao (National Cheng Kung University),
L.J. Lin (National Changhua University of Education),
H.F. Wang (National Tsing Hua University ),
C.D. Yang (National Cheng Kung University),
J.C. Yao (National Sun Yat-Sen University)
R.L. Sheu, Chair (National Cheng Kung University),
William Ferng (National Chiao Tung University),
C.F. Hu (I-Shou University),
C.S. Wang (National Cheng Kung University),
W. Wang (National Tainan Teachers College),
P. Wu (I-Shuo University)
For more information, please contact Chair of the conference,
Professor S.Y. Wu (firstname.lastname@example.org).
From: Chantal Pic <chantal@CERCA.UMontreal.CA>
Date: Thu, 4 May 2000 15:31:55 -0400 (EDT)
Subject: Computational Fluid Dynamics Conference
CFD2K: New Frontiers in CFD (Computational Fluid Dynamics)
8th Annual Conference of the CFD Society of Canada
Montreal, Quebec, Canada
June 11-14, 2000
CERCA (Centre for Research on Computation and its Applications) is
organizing the 8th Annual Conference of the CFD Society of Canada, which
will be held at Montreal, on June 11-14, 2000.
Programme (see http://www.cerca.umontreal.ca/cfd2ke/programme.html)
- 6 invited and special speakers
- More than 150 papers presented by CFD researchers from 14 countries
- CFD Challenge
- Hardware and software exhibits from commercial vendors
- Short Course: Control and Optimal Design of Flow Systems with CFD
by Max Gunzburger, Department of Mathematics, Iowa State University
Early registration has been extended to May 15. Full registration is
CAN$405, and student registration is CAN$170.
For more details, please visit our web site:
Chantal Pic, CERCA 514-369-5204
From: Michael Berry <email@example.com>
Date: Thu, 04 May 2000 17:17:14 -0400
Subject: Computational Information Retrieval Workshop
Computational Information Retrieval Workshop
Sunday, October 22, 2000
Jane S. McKimmon Center, NC State University
Organizer: Michael W. Berry, Tennessee
This is the third announcement of the first "Computational Information
Retrieval Workshop" (CIR00) to be held on Sunday, October 22,
2000 in Raleigh, NC. This workshop, which precedes the Seventh
SIAM Conference on Applied Linear Algebra (LA00), features talks
from applied mathematicians and computer scientists on the development
of algorithms, models, and software for information retrieval
and management. This workshop is co-sponsored by SIAM, National
Science Foundation, Boeing, and Telcordia Technologies, Inc.
One particular goal of this workshop is to present a taxonomy of current
algorithms used in IR systems and WWW-based search engines. In
addition to the distinguished invited speakers listed below, we encourage
all LA00 attendees to register for this important workshop which can
facilitate an open discussion on the future development of automated
Invited speakers for CIR00 include:
Inderjit Dhillon, Texas
Chris Ding, NERSC
Kyle Gallivan, Florida State
Liz Jessup, Colorado
Jim Martin, Colorado
Haesun Park, Minnesota
Bill Pottenger, Lehigh
Padma Raghavan, Tennessee
Axel Ruhe, Chalmers (Sweden)
Jason Wu, Boeing
with a special luncheon talk by Baruch Rumshisky, Northern Light.
Titles of Talks:
I. Dhillon, "Concept Decompositions for Large-Scale Information Retrieval"
C. Ding, "A Probabilistic Model for LSI/SVD in Information Retrieval"
K. Gallivan, "Applications of Incremental Dominant Singular Subspaces"
L. Jessup and "Applications of Orthogonal Decomposition in Information
J. Martin, Retrieval"
H. Park, "Dimension Reduction in Vector Space Based Information Retrieval
Using Least Norm"
B. Pottenger, "Detecting Emerging Conceptual Contexts in Data Mining"
P. Raghavan, "Symbolic Preprocessing Techniques for Information Retrieval Using
Vector Space Models"
J. Wu, "Text Mining at Boeing"
The workshop will be held at the Jane S. McKimmon Center on the
campus of North Carolina State University (also the site of LA00)
on Sunday, October 22, 2000 from 8:00am to 5:00pm. In addition
to the invited talks there will be a "Contributed Talks" session
and a "Panel Discussion" in the afternoon. You may register
for the workshop at the CIR00 website
and provide a title/abstract of any contributed talk. Selected
contributed talks for CIR00 will be posted on the website and
the authors will be notified by email no later than August 1.
All submissions for contributed talks must be received by July
15 for full consideration. An edited volume of survey-based papers
Based on the talks presented in this workshop is anticipated.
The early registration fee of $30.00 (covers all handouts, breakfast,
lunch, and breaks) should be sent in the form of cash or check
(payable to the "University of Tennessee") to:
Michael W. Berry, Organizer
Department of Computer Science
Ayres Hall 107
University of Tennessee
Knoxville, TN 37996-1301
The on-site registration fee (or after September 1) will be $35.00.
For further information about CIR00, please see the workshop website
(http://www.cs.utk.edu/cir00) or contact Michael W. Berry via
email (firstname.lastname@example.org), phone (865-974-3838), or fax (865-974-4404).
A block of 50 and 25 rooms for workshop attendees are being held for
Saturday (October 21) and Sunday (October 22), respectively, at the
Brownestone Hotel, 1707 Hillsborough Street, Raleigh, NC 27605-1696.
For more information about hotel reservations and van transportation,
From: Ivan Graham <email@example.com.EDU.AU>
Date: Fri, 5 May 2000 14:41:40 +1000 (EST)
Subject: Boundary Integral Methods Conference
BOUNDARY INTEGRAL METHODS CONFERENCE
GRADUATE STUDENT BURSARIES
2nd IMA International Conference on
Boundary Integral Methods, Theory and Applications
University of Bath, Sept 12 - 16, 2000
Co-sponsored by the Institute of Acoustics and the Institute of
Incorporating a Workshop on Innovative Boundary Element Methods in
Computational Acoustics and Electromagnetics
(supported by UK Engineering and Physical Sciences Research Council)
LONDON MATHEMATICAL SOCIETY:
FINANCIAL SUPPORT FOR RESEARCH STUDENTS
Thanks to the support of the London Mathematical Society for this meeting,
we are able to offer financial support for research students at UK
universities to attend.
For such students, we are able to offer support of at leas 150 pounds towards
travel and subsistence costs. Applicants are also warmly encouraged to submit
an abstract for a contributed talk of 20 minutes duration, although this is
Students wishing to apply for this funding should in the first instance
send an email to Ivan Graham at firstname.lastname@example.org, stating
1.Their name, postal address and email address.
2.Research degree registered for and title of research project.
3.Title of talk which they would like to give (if applicable).
The total number of students who can be supported by this scheme is
limited and, in order to maximise their chances of obtaining the financial
support, interested students should apply as soon as possible and
preferably by 31st May 2000.
Full details of the conference can be found at the web page:
From: Folkmar Bornemann <email@example.com>
Date: Thu, 4 May 2000 13:54:40 +0200
Subject: Faculty Position at Munich University of Technology
A U S S C H R E I B U N G
einer C3-Professur f=FCr Numerik / Wissenschaftliches Rechnen
An der Technischen Universit=E4t M=FCnchen ist in der Fakult=E4t
f=FCr Mathematik eine Professur f=FCr Numerik / Wissenschaftliches
Rechnen (Universit=E4tsprofessur C3) zum 01.08.2000 zu besetzen.
Es wird erwartet, da=DF Bewerberinnen / Bewerber durch Arbeiten
in Numerischer Mathematik / Wissenschaftliches Rechnen international
ausgewiesen sind und da=DF sie =FCber die F=E4higkeit zur Umsetzung
mathematischer Modelle bei Fragestellungen aus Ingenieur- oder
Zu den Aufgaben der Stelleninhaberin / des Stelleninhabers geh=F6rt
die Vertretung des Fachs in Forschung und Lehre, die Beteiligung
an der Ausbildung in den mathematischen Studieng=E4ngen, insbesondere
im Studiengang Technomathematik, sowie eine angemessene Beteiligung
an den Serviceveranstaltungen f=FCr andere Fakult=E4ten. Erwartet wird
die aktive Zusammenarbeit mit Anwendern und Forschungstr=E4gern innerhalb
und au=DFerhalb der Hochschule.
Einstellungsvoraussetzungen sind ein abgeschlossenes Studium an
einer wissenschaftlichen Hochschule, p=E4dagogische Eignung, Promotion
und Habilitation oder der Nachweis gleichwertiger wissenschaftlicher
Leistungen, die auch au=DFerhalb der Hochschule erbracht worden sein
Die Bewerberin / der Bewerber darf das 52. Lebensjahr zum Zeitpunkt
der Ernennung noch nicht vollendet haben.
Schwerbehinderte werden bei gleicher Eignung bevorzugt ber=FCcksichtigt.
Die Technische Universit=E4t M=FCnchen strebt eine Erh=F6hung des Anteils
von Frauen in der Forschung und Lehre an und fordert deshalb qualifizierte
Wissenschaftlerinnen nachdr=FCcklich auf, sich zu bewerben.
Bewerbungen sind mit den =FCblichen Unterlagen (Lebenslauf, Zeugnisse,
Urkunden, Schriftenverzeichnis) beim
Dekanat der Fakult=E4t f=FCr Mathematik
der Technischen Universit=E4t M=FCnchen
Arcisstr. 21, D-80290 M=FCnchen
bis zum 9.6.2000 einzureichen.
From: Prabir Daripa <Prabir.Daripa@math.tamu.edu>
Date: Wed, 3 May 2000 00:19:51 -0500 (CDT)
Subject: Postdoctoral Postion at Texas A&M University
Subject to approval of funding, one postdoctoral position will be open
with Dr. Prabir Daripa starting September'2000 in the area of Scientific
Computation and Applied Mathematics at Texas A&M University. Selection
process may begin as early as June. Status of your application may not be
known until late July.
The project requires a sound knowledge of numerical analysis, various
numerical methods, in particular integral equation methods including boundary
integral method, finite difference/element methods, and spectral methods.
Knowledge of fluid dynamics is also desirable. Implementation of algorithms
on serial as well as parallel machines will be required. The applicant
should have expertise in programming on serial and parallel machines using
C/C++/Fortran90 in a Unix environment.
The position initially will be for 10-12 month period with full or part time
research, depending on the candidate and some other factors. Appointment
may be extended further depending upon performance and the funding situation.
A recent Ph.D. in Engineering Sciences/Numerical Mathematics/Applied
Mathematics/Scientific Computing is required. Post-Ph.D experience in a
research environment is a plus.
Applications should be in the form of a full curriculum vitae together with
the names of three referees and copies of relevant publications.
For recent Ph.Ds, please also email me the title of your Ph.D. thesis,
name of your advisor, and how to access to your thesis over the Internet.
These should be sent either by e-mail or airmail at the appropriate
addresses given below. PLEASE DO NOT SEND ANY MSWORD files. Send plain
ascii text or postscript files as attachments.
or by airmail to:
Department of Mathematics
Texas A&M University
Phone (409) 845-1204
Fax (409) 862-4190
Texas A&M University is an Equal Opportunity Employer.
From: George Anastassiou <firstname.lastname@example.org>
Date: Tue, 02 May 2000 10:22:52 -0500
Subject: Contents, Journal of Computational Analysis And Applications
Table of Contents:JoCAAA,Vol.2,No.2,April 2000
1)"Lanczos-Like s-Factors for reducing the Gibbs Phenomenon in
general Orthogonal Expansions and other Representations",A.J.Jerri, 111
2)"Weighted convergence of Lagrange interpolation based on Gauss-
Kronrod nodes",S.Ehrich and G.Mastroianni,........129
3)"Lebesgue Constants for an Orthogonal Polynomial Schauder basis",
R.Girgensohn and J.Prestin,......159
4)"Simultaneous preservation of orthogonality of polynomials by linear
operators arising from dilation of orthogonal polynomial systems",
F.Filbir,R.Girgensohn,A.Saxena,A.I.Singh and R.Szwarc,...177.
End of NA Digest