-------------------------------------------------------
From: Gene H Golub <golub@stanford.edu>
Date: Sat, 10 Nov 2007 23:40:40 -0800 (PST)
Subject: Election of Michael Saunders to Royal Society of New Zealand
Dear Colleagues,
I am very pleased to note that Michael Saunders has been elected an
Honorary Fellow of the Royal Society of New Zealand. The citation is given
below. Michael is not only a first-rate scientist, he is a very charming,
helpful and friendly fellow. He is a wonderful example of his native
country.
Congratulations, Mike. It is a well deserved honor.
Gene Golub
-------------------------------------------------------
From: Andrei Bourchtein <burstein@terra.com.br>
Date: Mon, 5 Nov 2007 00:44:37 -0500
Subject: Question regarding hard boundary conditions
Dear Colleagues,
I am searching for approximate solution (numerical, analytical,
numerical-analytical) to the following problem:
$u_{xx}+u_{yy}=0$ in $D=[a,b] \times [c,d]$
(that is, 2D Laplace equation in the rectangle),
$(u_x)^2+(u_y)^2 =(\cosh u)^2$ on $\delta D$
(that is, a complex combination of the partial derivatives and
function values on the rectangle boundary).
Any help (suggestion of a method of solution, indication of a
reference or numerical algorithm) is greatly appreciated.
Sincerely,
Andrei Bourchtein
Pelotas State University, Brazil
burstein@terra.com.br
-------------------------------------------------------
From: "Hochstenbach, M.E." <M.E.Hochstenbach@tue.nl>
Date: Fri, 9 Nov 2007 21:47:08 +0100
Subject: Jacobi-Davidson Gateway
Dear colleagues,
The Jacobi-Davidson method, proposed by Gerard Sleijpen and
Henk van der Vorst in 1996, is often a competitive eigensolver,
in particular when interior eigenvalues are sought, a
preconditioner for the matrix is available, or generalized
eigenproblems are considered.
I am pleased to announce:
The Jacobi-Davidson Gateway
http://www.win.tue.nl/casa/research/topics/jd/
a web site that presents
- a one-page overview of the method;
- a bibliography with links to papers;
- a list of researchers active in this field;
- a catalog of publicly available Jacobi-Davidson software; and
- a list of applications where the JD method has been used.
I welcome your comments and suggestions on the Jacobi-Davidson Gateway.
Michiel Hochstenbach
TU Eindhoven
-------------------------------------------------------
From: "J. M. Littleton" <Littleton@siam.org>
Date: Fri, 9 Nov 2007 11:09:10 -0500
Subject: Call for Nominations - SIAM Activity Group on Optimization Prize
CALL FOR NOMINATIONS
SIAM Activity Group on Optimization Prize
The SIAM Activity Group on Optimization Prize (SIAG/OPT Prize) will be
awarded at the SIAM Conference on Optimization (OP08) to be held May
10-13, 2008, in Boston, Massachusetts. The SIAG/OPT Prize is awarded to
the author(s) of the most outstanding paper on a topic in optimization
published in English in a peer-reviewed journal. The eligibility period
is the four calendar years preceding the year of the conference.
Candidate papers must bear a publication date in the 2004-2007 calendar
years and must contain significant research contributions to the field
of optimization, as commonly defined in the mathematical literature,
with direct or potential applications.
The award will consist of a plaque and a certificate containing the
citation. At least one of the prize recipients is expected to attend
the award ceremony and present the paper at the conference.
Nominations, including a letter of nomination and a bibliographic
citation of the paper, should be addressed to Professor Robert
Vanderbei, Chair, SIAG/OPT Prize Committee and sent by JANUARY 15, 2008,
to J. M. Littleton at littleton@siam.org. Inquiries should be addressed
to littleton@siam.org. Complete calls for nominations for SIAM prizes
can be found at http://www.siam.org/prizes/nominations.php.
-------------------------------------------------------
From: "J. M. Littleton" <Littleton@siam.org>
Date: Fri, 9 Nov 2007 11:01:14 -0500
Subject: Call for Nominations - Denes Konig Prize- deadline November 30
CALL FOR NOMINATIONS - Denes Konig Prize - deadline November 30
The SIAM Activity Group on Discrete Mathematics (SIAG/DM) Denes Konig
Prize will be awarded to a junior researcher or junior researchers for
outstanding research in an area of discrete mathematics, based on a
publication by the candidate(s) in a peer-reviewed journal published in
the three calendar years prior to the year of the award.
The prize was established in 2007. The first award will be presented at
the SIAM Conference on Discrete Mathematics (DM08), to be held June
16-19, 2008, at the University of Vermont in Burlington, Vermont.
Nominations should be addressed to Professor Lenore Cowen, Chair, Denes
Konig Prize Committee and sent BY NOVEMBER 30, 2007, to J. M. Littleton
at littleton@siam.org. Inquiries should be addressed to
littleton@siam.org. The complete call for nominations can be found at
http://www.siam.org/prizes/nominations.php.
-------------------------------------------------------
From: gerhardwilhelm weber <gweber@metu.edu.tr>
Date: Thu, 08 Nov 2007 13:20:21 +0200
Subject: EngOpt 2008, International Conf. on Engineering Optimization, Jun 2008
EngOpt 2008 - International Conference on Engineering Optimization.
Rio de Janeiro, Brazil, June 1-5, 2008.
http://www.engopt.org
A forum for Engineers, Mathematicians and Computer Scientists
to share research and innovations, promoting interdisciplinary
activities in all fields of Engineering Optimization.
Abstracts submission is open. 15th December 2007: DEADLINE FOR SHORT
ABSTRACTS, to be included in the proceedings book of the conference
(Up to 300 words, written in plain text, without mathematical
formulas). Abstracts are uploaded in: www.engopt.org
ACCOMMODATION: The organizers have arranged limited number of block
reservations at Rio Othon Palace Hotel and Savoy Othon Travel Hotel,
offering special rates to EngOpt 2008 participants. It is highly
encouraged that you book your rooms as soon as possible, since Rio de
Janeiro is major touristic destination and usually hosts an important
number events. Cancellations before 15th February 2008 have not
penalties. Complete informations and instructions for booking:
www.engopt.org
JOURNALS: Special issues dedicated to EngOpt 2008 will be published
by: "OPTIMIZATION AND ENGINEERING" and "INVERSE PROBLEMS IN SCIENCE
AND ENGINEERING". In addition, the editorial board of "STRUCTURAL AND
MULTIDISCIPLINARY OPTIMIZATION" plans to invite some selected speakers
of the Conference, to submit a contribution related with the aims and
scope of the journal, for publication in normal issues of the journal.
Complete details in our website.
Contacts:
Prof. Jose Herskovits
COPPE/Mechanical Engineering Program
Federal University of Rio de Janeiro
engopt@optimize.ufrj.br
-------------------------------------------------------
From: ISSAC 2008 <issac2008@risc.uni-linz.ac.at>
Date: Thu, 8 Nov 2007 16:18:28 +0100
Subject: ISSAC 2008, Intl. Symp. on Symbolic and Algebraic Computation, Jul 2008
SECOND CALL FOR PAPERS
ISSAC 2008
International Symposium on Symbolic and Algebraic Computation
Hagenberg, Austria, July 20-23, 2008
http://www.risc.uni-linz.ac.at/issac2008/
The International Symposium on Symbolic and Algebraic Computation (ISSAC)
is the premier annual conference to present and discuss new developments
and original research results in all areas of symbolic mathematical
computation. Planned activities include invited presentations, research
papers, poster sessions, tutorial courses, vendor exhibits and software
demonstrations.
IMPORTANT DATES
ISSAC 2008 will be held July 20 to 23, 2008 in Hagenberg near Linz, Austria
Deadline for submissions: January 14, 2008 (Midnight [24:00 EST])
INSTRUCTIONS TO AUTHORS
Original research results and insightful analyses of current concerns are
solicited for submission. Submissions must not duplicate work published or
submitted for publication elsewhere. Papers will be reviewed by the program
committee and additional referees. Proceedings will be distributed at the
symposium. Papers must be in English and should not exceed 8 pages in the
standard format for ACM proceedings, or 20 to 22 pages of text in LaTeX
12pt article style.
To submit your contribution, please visit the paper submission page at
http://www.easychair.org/ISSAC2008/. Authors of accepted papers are expected
to present their work at the symposium.
General Chair Program Committee Chair Local Arrangements Chair
J. Rafael Sendra Laureano González-Vega Franz Winkler
-------------------------------------------------------
From: Ke Chen <K.Chen@liverpool.ac.uk>
Date: Sat, 10 Nov 2007 14:41:53 +0000 (GMT)
Subject: Workshop on Image Processing Techniques at Liverpool on 28 Nov
A Multidisciplinary Workshop on "Image Processing Techniques and
Applications" is to be held in Liverpool
(9:30am-5:20pm, Wed, 28 November 2007)
with 14 invited talks, covering topics from
- Mathematics
- Biology
- Physics
- Computer Science
- Engineering
- Medical Imaging
The event is supported by the University and hence is free to all.
Lunch will be provided. For details, see
http://www.liv.ac.uk/~cmchenke/imagew/
All are welcome.
Organisers:
Ke Chen (Math Sciences), University of Liverpool
Colin Baker (Health Sciences), University of Liverpool
Andrew Cossins (Bio Sciences), University of Liverpool
-------------------------------------------------------
From: "Pham Tran Vu" <ptvu@cse.hcmut.edu.vn>
Date: Fri, 9 Nov 2007 15:06:22 +0700
Subject: Intl. Workshop on Advanced Computing and Applications, Mar 2008
CALL FOR PAPERS
International Workshop on Advanced Computing and Applications (ACOMP 2008)
March 12-14, 2008
Ho Chi Minh City, Vietnam
http://www.cse.hcmut.edu.vn/ACOMP2008
AIMS AND SCOPES: ACOMP is an annual forum for the exchange of ideas,
techniques, and state-of-the-art applications in the field of advanced
computing among scientists, engineers, and practitioners. For ACOMP
2008, we encourage the submission of work in progress. Work carried
out by research students are also very much appreciated. We will
provide a friendly environment where researchers can discuss current
and future trends in their research areas.
TOPICS OF INTEREST: Topics of interest include, but are not limited to:
- Grid and cluster computing
- Internet, mobile and pervasive computing
- Service-oriented architecture
- Parallel/distributed algorithms
- High performance scientific and engineering applications
- Network protocols
- Computer aided modeling, design, simulation, and optimization
- Advanced information systems and applications
Authors are invited to submit extended abstracts of 4 to 10 pages in LaTeX
or MS-Word format. The templates are available at the ACOMP 2008 website.
The abstract must be written in English.
IMPORTANT DATES
Abstract submission deadline: December 10, 2007
Notification: January 9, 2008
Camera-ready: January 18, 2008
Registration open: December 10, 2007
CONTACT ADDRESS
Dr. Tran Vu Pham
Faculty of Computer Science and Engineering
Ho Chi Minh City University of Technology
Building A3, 268 Ly Thuong Kiet street
District 10, Ho Chi Minh City, Vietnam
Phone: (+84-8) 8647256 (ext.: 5840)
Fax: (+84-8) 8645137
E-mail: acomp2008@cse.hcmut.edu.vn
http://www.cse.hcmut.edu.vn/ACOMP2008
-------------------------------------------------------
From: Jinchao Xu <xu@math.psu.edu>
Date: Sun, 11 Nov 2007 13:41:13 -0500
Subject: Faculty position in numerical analysis at Penn State
Subject to availability of funding, the Penn State Mathematics
Department is seeking to fill openings for tenure and tenure track
faculty positions; dependent on the qualifications and experience of
the appointee, these may be at the assistant, associate or full
professor level. One position is preferably to be filled in the area
of numerical analysis and computation, another in the area of
probability theory or mathematical physics. However, candidates from
all areas of mathematics will be considered. A Ph.D. degree or its
equivalent is required.
Online application via www.mathjobs.org is strongly preferred.
Review of applications will begin November 19 and will continue until
positions are filled. Required application materials include:
--Online application
--3 Reference Letters
--1 of the above letters should address in detail the candidate's
abilities as a teacher
--Curriculum Vitae
--Publication List
--Research Statement
--Teaching Statement
Persons who are unable to apply using the mathjobs.org website or who
do not wish to do so may send application materials to:
Search Committee
Department of Mathematics
The Pennsylvania State University
107 McAllister Building
University Park, PA 16802 U.S.A.
Applications from women and members of underrepresented groups are
welcomed. Penn State is committed to affirmative action, equal
opportunity, and the diversity of its workforce.
-------------------------------------------------------
From: Computational Mathemetician Hiring <comphire@math.unm.edu>
Date: Mon, 5 Nov 2007 23:52:56 -0700 (MST)
Subject: Assistant Professor in Computational Math at UNM
The Department anticipates appointment of an Assistant Professor in
computational mathematics beginning Fall, 2008. This is a probationary
appointment leading to a tenure decision. Minimal qualifications are a Ph.D. in
mathematics, applied mathematics, or a related field and postdoctoral
experience. We seek candidates carrying out cutting-edge research on the
development and analysis of novel numerical algorithms and in the application
of high-performance computing to problems in the physical, biological, or
engineering sciences. We expect the person hired to contribute to our
educational offerings in this area and possibly to develop new ties with other
units on campus. The department houses an active group of applied
mathematicians with research interests in physics, mechanics, electromagnetics,
biology, and medicine. Albuquerque boasts a vibrant scientific environment. The
University houses centers for High-Performance Computing and High Technology
Materials and is located in close proximity to Sandia National Laboratories and
the Air Force Research Laboratory. In addition there are formal ties with Los
Alamos National Laboratory, located in northern New Mexico. The state is
committed to the development of a new center for high-performance computing in
Albuquerque, the New Mexico Computing Applications Center, which will be
accessible to University researchers.
For more information visit www.math.unm.edu. Application materials,
including a curriculum vitae, a description of research interests, and a
teaching statement clearly outlining the candidate's experience, should be
submitted online at: https://wws.math.unm.edu/hiring/computational.php
Candidates must list contact information for a minimum of three
individuals who will provide letters of recommendation. These individuals
will be contacted via email and given information on how to submit their
recommendations. For best consideration applications should be received by
January 7, 2008. Position will remain open until filled. UNM is an EOE/AA
University.
-------------------------------------------------------
From: Leslie Foster <foster@math.sjsu.edu>
Date: Tue, 06 Nov 2007 20:59:02 -0800
Subject: Faculty Positions at San Jose State University
The Mathematics Department at San Jose State University invites
applications for two full time tenure track faculty positions in Applied
Mathematics. Candidates must have a Ph.D. in Applied Math or closely
related field by August 2008. An interest in numerical analysis,
mathematical modeling, mathematical biology, financial math, partial
differential equations, optimization, dynamical systems, applied
discrete math, or operations research would be desirable.
The faculty member is expected to supervise graduate students on their
masters theses and student teams working on industrial research
projects, to teach a variety of undergraduate and graduate courses in
the Department of Mathematics, to maintain a program of scholarly
activity, to work on curriculum development, and be involved in
departmental governance.
For consideration by the first screening date, apply through
MathJobs.org or send a letter of application, curriculum vitae,
statement of teaching interests/philosophy and research plans, and at
least three original letters of reference with contact information by
December 12, 2007 to:
Dr. Brad Jackson
Chair, Dept. of Mathematics
San Jose State University
San Jose, CA 95192-0103.
See www.math.sjsu.edu/faculty_position/ for more information.
-------------------------------------------------------
From: "Zha, Hongyuan" <zha@cc.gatech.edu>
Date: Fri, 9 Nov 2007 09:25:37 -0500
Subject: Faculty positions in computional science and engineering at Georgia Tech
Georgia Institute of Technology
College of Computing
Computational Science and Engineering Division
The Computational Science and Engineering division within the College
of Computing at the Georgia Institute of Technology invites
applications for tenure-track faculty positions. Applications at all
levels of service will be considered. Applicants must have an
outstanding record of research, a sincere commitment to teaching, and
interest in engaging in substantive interdisciplinary research with
collaborators in other disciplines. We encourage applications from
any areas of computational science and engineering. Applicants with
expertise in high-performance computing (HPC), modeling, simulation
and numerical computing, bioinformatics and computational biology, and
large-scale data analysis and visualization are especially encouraged
to apply.
To receive full consideration, applications should be submitted online
through https://recruiting.cc.gatech.edu/ by January 11, 2008. The
application material should include a full academic CV, teaching and
research statements, a list of at least three references and up to
three publications. Applicants are encouraged to clearly identify in
their cover letter the area(s) that best describe their research
interests.
Georgia Tech is an Affirmative Action/Equal Opportunity Employer.
Applications from women and under-represented minorities are strongly
encouraged.
-------------------------------------------------------
From: "Veronica Graves" <Veronica.Graves@is.mines.edu>
Date: Wed, 7 Nov 2007 09:02:18 -0700
Subject: Assistant Professor - Applied & Comp. Math. - Colorado School of Mines
Applications are invited for an anticipated tenure-track Assistant
Professor position in applied and computational mathematics beginning in
August 2008.
Faculty research interests in applied and computational mathematics
include numerical analysis and scientific computing, symbolic computing,
nonlinear PDEs, wave theory, integral equations and inverse problems.
Applicants in areas of applied and computational mathematics compatible
with these areas are encouraged to apply. More information about the
department can be obtained from the department's home page at
http://www.mines.edu/Academic/macs.
An earned Ph.D. in mathematics or a closely related field by the time of
appointment is required. Evidence of interest or successful involvement
in interdisciplinary collaborative research and one or more years of
postdoctoral experience is desirable. Candidates must provide evidence
of teaching competence and research accomplishments. The successful
candidate will be expected to have strong interpersonal and
communications skills and have the potential to become an excellent
teacher and scholar.
Interested individuals are asked to visit our web page to obtain a
complete job announcement and further information on how to apply:
http://www.is.mines.edu/hr/Faculty_Jobs.shtm.
CSM is an EEO/AA employer.
-------------------------------------------------------
From: Gwendolyn McKeller <gjmckel@sandia.gov>
Date: Mon, 5 Nov 2007 12:19:09 -0500
Subject: John Von Neumann Research Fellowship
John Von Neumann Post-Doctoral Research Fellowship
The Computational Sciences, Computer Sciences and Mathematics Center and the
Computer Sciences and Information Technologies Center at Sandia National
Laboratories invite outstanding candidates to apply for the 2008 John von
Neumann Post-Doctoral Research Fellowship in Computational Science. This
prestigious fellowship is supported by the Applied Mathematics Research
Program at the U.S. Department of Energy's Office of Advanced Scientific
Computing and Research. The fellowship provides an exceptional opportunity
for innovative research in computational mathematics and scientific
computing on advanced computing architectures with application to a broad
range of science and engineering applications of national importance.
Applicant must have or soon receive a PhD degree in applied/computational
mathematics or related computational science and computational engineering
disciplines. Applicant must have less than three-years post-doctoral
experience. This appointment is for a period of one year with a possible
renewal for a second year and includes a highly competitive salary, moving
expenses and a generous professional travel allowance.
Sandia is one of the countrys largest research facilities employing 8,700
people at major facilities in Albuquerque, New Mexico and Livermore,
California. Sandia maintains research programs in a variety of areas,
including computational and discrete mathematics, computational physics and
engineering, systems software and tools. Sandia is a world leader in large-
scale parallel computer systems, algorithms, software and applications, and
provides a collaborative and highly multidisciplinary environment for
computational problems at extreme scales. Sandia has a state-of-the-art
parallel-computing environment, including the newly deployed Red Storm
machine with over 10,000 nodes in addition to numerous large-scale clusters
and visualization servers. For more details about the John von Neumann
Fellowship, visit our website at www.cs.sandia.gov/VN_Web_Page.
Please apply online at http://www.sandia.gov, under Employment/ Career
Opportunities/Sandia internet Careers site, reference Job Requisition
Number: 58851, and please submit a CV/resume, statement of research goals,
and three letters of recommendation to Pavel Bochev via electronic mail at
pbboche@sandia.gov. Please reference: 58851 (Von Neumann). All
applications received before January 25, 2008 will be considered; the
position will remain open until filled.
U.S. Citizenship Normally Required. Equal Opportunity Employer. M/F/D/V.
-------------------------------------------------------
From: Jose Castillo <castillo@myth.sdsu.edu>
Date: Tue, 6 Nov 2007 14:10:03 -0800
Subject: Ph.D. Studies in San Diego
The Computational Science Research Center at San Diego State
University is looking for qualified applicants for its
interdisciplinary Ph.D. program (joint with Claremont Graduate
University) in Computational Science.
We have financial support in the form of Teaching, Graduate and
Research Assistantships and Fellowships. Areas of interest include
Nonlinear Dynamics, Biomathematics, Soft Condensed Matter Physics,
Relativistic Astrophysics, General Relativity, Scientific Computing,
Material Sciences, Geophysics, Nuclear Physics and Physical Oceanography.
Please see our web page (www.csrc.sdsu.edu) for details about our
program including application process, deadlines and faculty research
interest.
http://www.csrc.sdsu.edu/csrc/education/graduate_programs/phd/
-------------------------------------------------------
From: Hans De Sterck <hdesterck@uwaterloo.ca>
Date: Mon, 5 Nov 2007 12:25:58 -0500
Subject: New Masters in Computational Mathematics at University of Waterloo
NEW MASTERS PROGRAM IN COMPUTATIONAL MATHEMATICS AT THE UNIVERSITY
OF WATERLOO, ONTARIO, CANADA
The Faculty of Mathematics of the University of Waterloo announces a
new one-year Masters program in Computational Mathematics. The
program comprises courses in both the theory and applications of the
interdisciplinary field of Computational Mathematics, and culminates
in a one-term supervised research project. Core areas include
discrete computational mathematics, numerical methods, computational
statistics and machine learning, scientific computing, and
computational optimization.
With more than 200 faculty members, the Faculty of Mathematics of the
University of Waterloo contains one of the largest concentrations of
research in the mathematical and computer sciences in North America.
Waterloo is located in the heart of Southern Ontario, one hour west
of Toronto.
APPLICATION DEADLINE IS FEBRUARY 1ST FOR ENTRY IN SEPTEMBER 2008.
The program is targeted to students with a bachelors degree in
mathematics, statistics, or computer science, or in another program
with a strong mathematical component, including economics,
engineering and any of the physical sciences.
Funding is available for qualifying applicants.
More information about the Waterloo Computational Mathematics
Masters program is available online at
http://www.math.uwaterloo.ca/navigation/CompMath/Masters .
-------------------------------------------------------
From: "Stacey Beggs" <sbeggs@ipam.ucla.edu>
Date: Thu, 8 Nov 2007 15:11:35 -0800
Subject: "Research in Industrial Projects for Students" (RIPS) at IPAM-UCLA
Research in Industrial Projects for Students (RIPS), sponsored by the
Institute for Pure and Applied Mathematics (IPAM) at UCLA, is a unique
summer program for undergraduate students. RIPS provides an
opportunity for exceptional students in math and related disciplines
to work in teams on real-world research projects proposed by a sponsor
from industry or a national lab. Sponsors have included Pixar,
Microsoft, Symantec, Los Alamos, Lawrence Livermore, and JPL. The RIPS
web site at http://www.ipam.ucla.edu/programs/rips2008/ gives the full
details including a link to the online application. The deadline for
applications is February 15. Please refer your students to the site
and encourage them to apply. (Note: graduating seniors and
international students are eligible!) To request copies of posters and
for more information on RIPS, please email rips2008@ipam.ucla.edu or
call 310-825-4755.
-------------------------------------------------------
From: Claude Brezinski <claude.brezinski@univ-lille1.fr>
Date: Mon, 05 Nov 2007 09:28:15 +0100
Subject: Contents, Numerical Algorithms
Volume 45 Number 1-4 of Numerical Algorithms is now available
on the SpringerLink web site at http://springerlink.comwww.
This volume, edited by S. de Marchi, M. Redivo-Zaglia and M. Vianello,
contains the proceedings of the congress
First Dolomites Workshop on Constructive Approximation Theory and Applications
dedicated to Walter Gautschi.
Preface
Stefano Marchi, Michela Redivo-Zaglia, Marco Vianello
pp. 1-9
A guided tour through my bibliography
Walter Gautschi
pp. 11-35
Some remarks on the numerical computation of integrals on an unbounded
interval
M. R. Capobianco, G. Criscuolo
pp. 37 - 48
Three-pencil lattices on triangulations
G. Jaklic, Jernej Kozak, Marjeta Krajnc, Vito Vitrih, Emil Zagar
pp. 49 - 60
A comparison of numerical integration rules for the meshless local
PetrovGalerkin method
Annamaria Mazzia, Massimiliano Ferronato, Giorgio Pini, Giuseppe Gambolati
pp. 61 - 74
Positive weight quadrature on the sphere and monotonicities of Jacobi
polynomials
Paul C. Leopardi
pp. 75 - 87
Eigenvalue problems to compute almost optimal points for rational
interpolation with prescribed poles
Joris Deun
pp. 89 - 99
An extended doubly-adaptive quadrature method based on the combination
of the Ninomiya and the FLR schemes
Takemitsu Hasegawa, Susumu Hibino, Yohsuke Hosoda, Ichizo Ninomiya
pp. 101 - 112
Multivariate polynomial interpolation: conjectures concerning GC-sets
Carl de Boor
pp. 113 - 125
On an approach to the study of the JaynesCummings sum in quantum optics
Ekatherina A. Karatsuba
pp. 127 - 137
Calculation of RadauKronrod and LobattoKronrod quadrature formulas
Dirk Laurie
pp. 139 - 152
On differential properties for bivariate orthogonal polynomials
María Alvarez de Morales, Lidia Fernandez, Teresa E. Perez, Miguel A. Pinar
pp. 153 - 166
Thin plate spline interpolation on the unit interval
Simon Hubbert, Stefan Mueller
pp. 167 - 177
Image reconstruction by OPED algorithm with averaging
Yuan Xu, Oleg Tischenko, Christoph Hoeschen
pp. 179 - 193
Structured eigenvalue problems for rational gauss quadrature
Dario Fasino, Luca Gemignani
pp. 195 - 204
Approximate solution of singular integro- differential equations in
generalized Hoelder spaces
Iurie Nicolae Caraus, Feras M. Faqih
pp. 205 - 215
Conjectured inequalities for Jacobi polynomials and their largest zeros
Walter Gautschi, Paul Leopardi
pp. 217 - 230
Hermite polynomials on the plane
Shayne Waldron
pp. 231 - 238
The estimation of moments of an unknown error distribution in the
discrete pulse transform
Carl Heinrich Rohwer
pp. 239 - 251
New embedded boundary-type quadrature formulas for the simplex
F. A. Costabile, F. DellAccio
pp. 253 - 267
Fractal measures and polynomial sampling: I.F.S.Gaussian integration
Giorgio Mantica
pp. 269 - 281
New spline basis functions for sampling approximations
Toshihide Ueno, Simon Truscott, Masami Okada
pp. 283 - 293
Approximate varieties, approximate ideals and dimension reduction
Tomas Sauer
pp. 295 - 313
On the use of kernel-based methods in sound synthesis by physical modeling
Carlo Drioli, Davide Rocchesso
pp. 315 - 329
An approach to the Gummel map by vector extrapolation methods
Roberto Bertelle, Maria Rosaria Russo
pp. 331 - 343
On choosing optimal shape parameters for RBF approximation
Gregory E. Fasshauer, Jack G. Zhang
pp. 345 - 368
A formula for the error of finite sinc-interpolation over a finite interval
Jean-Paul Berrut
pp. 369 - 374
Rational approximation of vertical segments
Oliver Salazar Celis, Annie Cuyt, Brigitte Verdonk
pp. 375 - 388
Stable simulation of fluid flow with high-Reynolds number using
Ehrenfests steps
R. Brownlee, A. N. Gorban, J. Levesley
pp. 389 - 408
-------------------------------------------------------
From: Tim Davis <davis@cise.ufl.edu>
Date: Wed, 07 Nov 2007 12:56:13 -0500
Subject: One third of a 100-digit challenge (poem)
Nick Trefethen defines a ten-digit algorithm as
"Ten digits, Five seconds, And just one page", in his essay:
http://web.comlab.ox.ac.uk/oucl/work/nick.trefethen/ten_digit_algs.htm ,
which compares code to poetry. Thus, the following "code"
"computes" pi to 33 digits (1/3 of a 100-digit challenge),
can be read in about 40 seconds, and fits on half a page.
Each line has a number of syllables equal to a digit
of pi. The angst comes when the poem itself wonders
what to do with the first zero digit ...
3.14159265358979323846264338327950, by T. D.
3 The number,
1 pi.
4 I wonder why
1 I
5 watch the digits fly?
9 Do digits to the infinite tend?
2 Or end
6 at bottom of page ten?
5 Stop I know not when.
3 A circle,
5 pi the number shall
8 encompass all from head to tail.
9 The diameter times pi shall tell
7 not the area, oh swell,
9 but circumference of circles all.
3 pi r square?
2 oh where?
3 Look around,
8 can you find any pie not round?
4 Yet pi r square
6 gives you the area
2 all fine
6 circles you chance to find.
4 e to i pi?
3 (this is fun):
3 minus one.
8 Alas a zed comes up ahead.
3 It cannot
2 be wrought:
7 a poem or stanza taught
9 whose syllables all add up to naught,
5 and so I must stop.
0 [ ]
------------------------------
End of NA Digest
**************************
-------