Subject: NA Digest, V. 96, # 37 NA Digest Sunday, September 29, 1996 Volume 96 : Issue 37 Today's Editor: Cleve Moler The MathWorks, Inc. moler@mathworks.com Today's Topics: NA-Digest Subscribers Spammed SIAM Student Paper Prizes Fox Prize Change of Address for Per Christian Hansen Web Site for Problem Solving Environments Integration Question Solved, Thanks! Conference on Optimization and Optimal Control Workshop on Iterative Methods in Czech Republic Symposium on Computer Arithmetic and Validated Numerics Session on Fast Algorithms and Computational Complexities Conference on Theory and Applications of Multiwavelets Postdoctoral Postion at Rutgers University Positions at Umea University, Sweden Contents, SIAM Discrete Mathematics Contents, SIAM Optimization Contents, Approximation Theory Contents, Computational and Applied Mathematics Submissions for NA Digest: Mail to na.digest@na-net.ornl.gov. Information about NA-NET: Mail to na.help@na-net.ornl.gov. URL for the World Wide Web: http://www.netlib.org/na-net/na_home.html ------------------------------------------------------- From: Keith Moore Date: Thu, 26 Sep 1996 20:48:03 -0400 Subject: NA-Digest Subscribers Spammed Last weekend, many NA-Digest subscribers were "spammed" -- that is, unsolicited and inappropriate advertisements were sent to their electronic mail addresses. Two different messages were sent. The first one was an advertisement for a web page which "may cause you to lose 10-15 lbs". The second was made to look like a reply to the first one from an na-digest subscriber, but it actually came from the same source as the first one, and contained several additional advertisements. Both messages originated from host oak.visc.com. I noticed the spamming while it was in progress, and removed the offending messages from the mail queue before they could be delivered to everyone. According to the logs, 4029 total messages were sent. As a result, the following actions have been taken: 1. NA-NET's "sendlist" command (which allowed anyone to obtain a list of every na-digest subscriber) has been disabled. Disabling sendlist will not prevent future abuse by these people, but it might prevent future abuse by others. 2. The NA-NET server machine, has had a "black hole" route installed to prevent its exchanging any network traffic with oak.visc.com. This is a short-term measure which was taken because the spammers were sending multiple messages. 3. A complaint has been sent to oak.visc.com's Internet Service Provider. Keith Moore postmaster@na-net.ornl.gov ------------------------------ From: Allison Bogardo Date: Wed, 25 Sep 96 12:38:34 EST Subject: SIAM Student Paper Prizes The annual SIAM Student Paper Prizes will be awarded during the 1997 SIAM Annual Meeting. If you are a student or know of a student who would like to take part in the competition, here are the details: The authors of the three best papers in applied and computational mathematics written by students and submitted to SIAM will be invited to attend the 1997 annual meeting in Stanford, California, July 14-18. Each winner must present his/her paper at the meeting and will receive a $750 cash award as well as gratis registration for the meeting. Winners will be awarded calligraphed certificates at a special prize ceremony at the meeting. Papers must be singly authored and not previously published or submitted for publication to be eligible for consideration. To qualify, authors must be students in good standing who have not received their PhDs at the time of submission. In submitting their work for publication, authors are asked to consider SIAM journals. However, student paper prize winners are not guaranteed publication in any SIAM journal; all papers submitted to SIAM journals are subject to the same refereeing process and standards. Submissions must be received by SIAM on or before March 15, 1997. Submissions, which must be in English, can be sent by regular mail or fax. Each submission must include (1) an extended abstract NOT LONGER THAN 5 PAGES (including bibliography); (2) the complete paper, which will be used solely for clarification of any questions; (3) a statement by the student's faculty advisor that the paper has been prepared by the author indicated and that the author is a student in good standing; (4) a letter by the student's faculty advisor describing and evaluating the paper's contribution; and (5) a short biography of the student. Submissions will be judged on originality, significance, and quality of exposition. The winners will be notified by June 1, 1997. If you have any questions, please contact A. Bogardo at SIAM, 3600 University City Science Center, Philadelphia, PA 19104-2688; telephone: (215) 382-9800; e-mail to bogardo@siam.org; fax to (215) 386-7999. ------------------------------ From: C. T. H. Baker Date: Sat, 28 Sep 1996 20:24:50 +0100 Subject: Fox Prize FOX PRIZE: CALL FOR ENTRIES LESLIE FOX PRIZE, 23rd JUNE 1997 The following announcement, and additional links, may be obtained on the world wide web by accessing the URL ftp://fs2.ma.man.ac.uk/anon/cthbaker/foxprize.htm The Eighth Leslie Fox Prize meeting will take place on June 23rd, 1997 at the University of Dundee, prior to the 17th Dundee Biennial Conference on Numerical Analysis. Entries for the Eighth Leslie Fox Prize competition are now requested. Any person who is less than 31 years old on January 1st 1997 and has not already won a first prize is eligible. Each entry should consist of three copies of a paper, describing some of the candidate's research, that is suitable for a 40 minute lecture at a numerical analysis symposium. Whether or not the work has been published or accepted for publication is irrelevant, but no person may submit more than one paper. Unsuccessful candidates from previous competitions are encouraged to enter. The entries will be considered by an Adjudicating Committee: its members are Prof. C.T.H. Baker (Manchester), Prof. I.S. Duff (RAL), and Professor L.N. Trefethen (Cornell). Particular attention will be given to the originality and quality of each paper, and to the suitability of the material for a 40 minute talk to a general audience of numerical analysts. Papers will be selected by the Committee by the end of March, for presentation at the Leslie Fox Prize meeting. Only the papers that are presented at the symposium will be eligible for awards but, subject to this restriction, the Adjudicating Committee may award any number of first and secondary prizes. Entries should be received by February 28th, 1997. Each candidate should include a statement of her/his year of birth and should indicate that she/he would be available to present her/his paper at the symposium. A joint paper may be submitted by an individual candidate if accompanied by a statement from the co-authors agreeing to the submission and detailing the contribution of the candidate to the paper. Travel funds are not generally available to assist candidates who attend the symposium. The receipt of all entries will be acknowledged. Any question on this notice should be addressed to a member of the Adjudicating Committee. TO ENTER: One printed copy of each entry should be sent by mail to the Chairman: Professor Christopher T H Baker Chairman, Fox Prize Adjudicators Department of Mathematics The Victoria University of Manchester Oxford Road Manchester M13 9PL ENGLAND as well as EITHER a postscript file of the entry (to be sent by email) to EACH of the adjudicators: head@ma.man.ac.uk, I.Duff@rl.ac.uk, lnt@cs.cornell.edu OR ELSE TWO ADDITIONAL PRINTED COPIES (to be sent with the first printed copy), mailed to Professor Christopher Baker as above. Any E-mail should have the expression `FOX PRIZE' in the subject line. [A printed copy is needed in case difficulty is found processing the postscript files, but it saves postage and delay if the adjudicators are each sent postsript files.] ------------------------------ From: Per Christian Hansen Date: Mon, 23 Sep 1996 11:09:19 +0200 Subject: Change of Address for Per Christian Hansen Dear colleagues, I have accepted a full professorship in scientific computing with the Department of Mathematical Modelling at the Technical University of Denmark. My new coordinates are: Per Christian Hansen, Professor Department of Mathematical Modelling Section for Numerical Analysis Building 321, Technical University of Denmark DK-2800 Lyngby, Denmark Tel. +45 45.88.14.33 ext. 3097 Tel. +45 45.25.30.97 (direct) Fax +45 45.93.23.73 Email: pch@imm.dtu.dk URL: http://www.imm.dtu.dk/documents/users/pch/homepage.html ------------------------------ From: John R. Rice Date: Mon, 23 Sep 1996 12:21:54 -0500 Subject: Web Site for Problem Solving Environments PROBLEM SOLVING ENVIRONMENTS - Web Site I am pleased to announce that a web site has been established for information about PSEs. It is structured as follows: * Homepage: Definition of a PSE http://www.cs.purdue.edu/research/cse/pses/ * Reading list (a short historical set of references) * Projects, Applications & Tools A list of pointers, brief descriptions and (sometimes) contact points for 40+ PSE oriented web sites * Purdue publications about PSEs * Related Information This site was developed in cooperation with Karsten Decker of the Swiss Center for Scientific Computing. We plan to expand the coverage of this site and to maintain mirror images in the U.S. and Switzerland. Comments and additions are invited. ------------------------------ From: Owen Kelly Date: Wed, 25 Sep 96 10:04:01 -0500 Subject: Integration Question Solved, Thanks! The response to my question (NA Digest 9/15/96) has been very generous. The result is Integrate[( ((1-x)*(1-y))^(-1/2) ) / (x+y), {x,0,1}, {y,0,1}] = 3.663862376708876060 = 4*Catalan and that has been found by a few researchers. Many thanks to all who contributed. You are Frank Jones, Sue Minkoff, Colin Rose, Frank Stenger, Valentin I. Vangelov, Garry J. Tee, Pierre Verlinden, Walter Gautschi, Chris Nex, Victor Adamchik, Norm Fuchs, Knut Petras, Thomas Dehn, Greg Gaspari, Ron Keam, Jin Ma, Wei-Chi Yang, Peter Kaps, Norbert Ortner, Prof. Wagner, and Alan Cohen. The question was a special case of a more general integral. Victor Adamchik of Wolfram Research also solved the more general problem. When I have written the resulting research note, I will put it on the web and notify the people on this list. Sincerely, Owen Kelly ------------------------------ From: Michael Breitner Date: Mon, 23 Sep 1996 14:04:29 +0200 (DFT) Subject: Conference on Optimization and Optimal Control Second Announcement & Call for Registration INTERNATIONAL CONFERENCE ON OPTIMIZATION AND OPTIMAL CONTROL organized by SIGOPT Special Interest Group in Optimization of the German Society of Mathematicians (DMV). Pfalzakademie, Lambrecht , February 24-28,1997 The special interest group for optimization (in German ''Fachgruppe Optimierung'') was created in 1993 under the auspices of the Deutsche Mathematiker Vereinigung (DMV) with the purpose of encouraging cooperation among its members, and of facilitating communication between them.It is primarily intended to meet the needs of those interested in mathematical optimization, both theory and pratice. SIGOPT provides a forum for discussing actual and future developments in a broad variety of disciplines associated with optimization, and actively supports interdisciplinary research and applications to industry. In particular, SIGOPT encourages students and younger scientists to become involved in research in optimization. The topics of this conference are: <> Linear and Nonlinear Programming <> Combinatorial Programming <> Stochastic Programming <> Control Theory <> Applications Scientific committee: H.Th. Jongen (Aachen), W. Krabs (Darmstadt), K. Marti (Neubiberg), D. Pallaschke (Karlsruhe), U. Rieder (Ulm), E. Sachs (Trier), S. Scholtes (Cambridge), U. Zimmermann (Braunschweig). What was most important: <> Final registration: Please register until October 14, 1996 <> Deadline for abstracts: Please send your abstract until November 30, 1996 <> For preparing the abstract, please use "\LaTeX". <> Registration and reception of abstracts via e-mail are appreciated. <> Wednesday afternoon: Annual meeting of the SIGOPT group, <> Wednesday evening: All participants are invited for the conference dinner. <> There will be no conference fees. <> The cost of accomodation at the Pfalzakademie is DM 410,00 (per person in a double room with full board, including the conference dinner). For registration and information please contact: Diethard Pallaschke Institut f"ur Statistik und Mathem. Wirtschaftstheorie Universit"at Karlsruhe Geb. 11.40 Kaiserstr. 12 D-76128 Karlsruhe , Germany e-mail: lh09@rz.uni-karlsruhe.de phone: (+49 721) 608-3951 fax: (+49 721) 35 81 50 ------------------------------ From: Michal Krizek Date: Mon, 23 Sep 96 16:38:27 CET Subject: Workshop on Iterative Methods in Czech Republic Dear colleague: We are writing to you to announce an International Workshop on Iterative Methods and Parallel Computing, to be held in the Czech Republic. We hope you will be able to participate. The tentative dates are June 16-21, 1997, to be confirmed in the next couple of months, once all funding has been secured. The Workshop will take place at the hotel Devet Skal in Milovy (literally "Nine Rocks"). Milovy is a small village located in the Bohemian-Moravian Highlands (Central part of the Czech Republic) at about 100 kilometers (65 miles) from Prague. We are planning to charter buses to take the participants from Prague to Milovy and back. There is also a regular scheduled bus from Brno to the Hotel. Brno is on the Southeastern corner of the Czech Republic not too far from Vienna. The cost will be around $250-300 (U.S. dollars) for the whole week, including accomodation, meals, conference fee and the bus from and to Prague. We expect about 100-150 participants, so the emphasis will be on a "workshop", i.e., on work among the pariticipants, with periods of free time for unstructured discussions (as well as swimming, hiking, etc.) So, please mark your calendar, and let us know if you are interested in participating by sending a message to IMPC97@UIVT.CAS.CZ . Dates for abstract submissions will be sent once the Workshop date is definite. Please feel free to resend this message to your immediate collaborators and students, if you think they would be interested in participating in the Workshop. We hope to see you in Milovy. Michal Krizek (Academy of Sciences of the Czech Rep.) Ivo Marek (Charles Univeristy) Karel Segeth (Academy of Sciences of the Czech Rep.) Zdenek Strakos (Academy of Sciences of the Czech Rep.) Miroslav Tuma (Academy of Sciences of the Czech Rep.) Anne Greenbaum (Courant Institute, NYU) Roland Freund (Bell Laboratories, Murray Hill) Howard Elman (Univ. Of Maryland, College Park) Daniel Szyld (Temple Univ., Philadelphia) ------------------------------ From: Jean-Michel Muller Date: Tue, 24 Sep 1996 16:12:41 +0200 (MET DST) Subject: Symposium on Computer Arithmetic and Validated Numerics CALL FOR PAPERS SCAN-97 GAMM/IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics September 10-12, 1997 Ecole Normale Superieure de Lyon France The conference continues the series of SCAN-Symposia which have previously been held at Karlsruhe, Basel, Albena, Oldenburg, Vienna and Wuppertal under the joint sponsorship of GAMM and IMACS. These conferences have traditionally covered the numerical and algorithmic aspects of Scientific Computing, with a strong emphasis on the algorithmic validation of results and on algorithmic and arithmetic tools for this purpose. SCAN-97 will provide a forum for presentation of the latest research and developments in theory, algorithmic and arithmetic design for Validated Numerics; demonstration of new software available for Validated Numerics; reports of interesting case studies in industrial and scientific application of Validated Numerics; and discussion of new directions in research and development suggested by other advances in Scientific Computing. Potential new directions are the use of parallel architectures for the implementation of validation algorithms and the use of validation ideas in Computer Algebra. You are kindly invited to submit a paper for presentation at the conference. Extended abstract of 1-4 pages must be submitted by e-mail to SCAN97@lip.ens-lyon.fr preferably in LaTeX. Please request a pattern LaTeX file from the above address. If you cannot use LaTeX, please send a plain text file without special editing. The head of the abstract must contain the name, affiliation, postal address, and e-mail and fax addresses of the author presenting the paper. If there are several authors, the names of the other authors must be in parentheses. Deadline for extended abstracts: April 1, 1997 All communications regarding SCAN97 should be directed to: - e-mail: SCAN97@lip.ens-lyon.fr - fax: (+33) 4 72 72 80 30 or (+33) 4 72 72 80 80, attn. ``V. Roger-Ubeda, SCAN'97'' - surface mail: V. Roger-Ubeda, SCAN'97, Laboratoire LIP, ENS-Lyon, 46 Allee d'Italie, F-69364 Lyon Cedex 07, France Please, use e-mail or fax whenever possible. To be included in the mailing list of the conference, please send an e-mail to the above address. More information (including scientific committee, proceedings, transportation and accommodation) can be found in our web page: www.ens-lyon.fr/LIP/SCAN-97 ------------------------------ From: Li Lei Date: Wed, 25 Sep 96 17:04:50 +0900 Subject: Session on Fast Algorithms and Computational Complexities Call for Papers IMACS'97, Special Session " Fast Algorithms and Computational Complexities " The 15th IMACS World Congress on Scientific Computing, Modelling and Applied Mathematics, will be held from August 24-29, 1997 in Berlin, and will feature the latest advances in applied mathematics and scientific computation. A special session entitled " Fast Algorithms and Computational Complexities " is being organized, and papers are being solicited. All areas are of potential interest, but the work submitted should include the design and analysis of fast algorithms for numerical problems or non- numerical problems. Authors wishing to present a paper in this special session should submit a 1-2 pages abstract containing : Title of presentation, Authors' name(s), affiliation, address, telephone number, fax number and e-mail address, Abstract describing work. This abstract must be submitted, AT THE VERY LATEST, by November 30, 1996, to ( by the airmail, Fax, or e-mail ) Professor Lei Li Dept. of Inform. Syst. Engin., Aomori University, Kobata, 2-3-1 Aomori 030 Japan Tel. +81-177-382004 Fax. +81-177-382030 E-mail: lilei@auvax.aomori-u.ac.jp lilei@rikyu.aomori-u.ac.jp ------------------------------ From: Wasin So Date: Wed, 25 Sep 96 12:27:51 PDT Subject: Postdoctoral Postion at Rutgers University Postdoc Position Available We are seeking a post-doc for a two-year project on numerical analyses of piezoelectric surface acoustic wave resonators and filters. There is a possibility that the project will be extended if good progress was achieved. Candidates with excellent programming skills in Fortran and academic backgrounds in applied mechanics and stress waves in solids should apply. Knowledge of surface acoustic waves and piezoelectricity is a plus. Salary is 25k to 30k, depending upon qualifications. Please send a resume along with a telephone number and email address to Prof. Yook-Kong Yong Dept. of Civil and Environmental Engineering Rutgers University P.O. Box 909 Piscataway, NJ 08855-0909 yong@jove.rutgers.edu ------------------------------ From: Bo Kagstrom Date: Fri, 27 Sep 1996 09:20:17 +0200 (MET DST) Subject: Positions at Umea University, Sweden Job Positions at HPC2N, Umea University, Sweden High-Performance Computing Center North (HPC2N) is a national center for Scientific and Parallel Computing. The partners of HPC2N are Umea University, Technical University of Lulea, The Swedish Institute of Space Physics (IRF) in Kiruna, Swedish University of Agricultural Sciences (SLU) in Umea, Mid-Sweden University in Sundsvall, Harnosand and Ostersund. This collaboration and coordination between universities and research institutes in HPC2N form a strong focal point for High Performance Computing in Northern Sweden. HPC2N is one of three national centers that is funded by the Swedish Council for High Performance Computing (HPDR). HPC2N has been selected by HPDR for a national commission - a competence development program regarding the efficient use of, and operation environments for, scalable parallel computer systems. One objective of the center is to contribute in raising the national level of competence in high-performance computing and in transferring knowledge in this area to new users in academia and industry. HPC2N has obtained funding from the Knut and Alice Wallenberg Foundation for the procurement of a scalable high-performance MIMD computer system. The choice of vendor is soon to be decided. HPC2N is announcing the following job positions: Advanced consultants in high performance computing and scientific visualization (Ref nr 3171-1638-96) (Six 50% positions that can be combined to 100%) The positions include competence development, teaching, advanced user support and method development in the following areas: (1) Algorithms, programs and user environments; (2) Porting applications to parallel environments; (3) Development of computational models, numerical methods and algorithms for parallel computing; (4) Visualization of different types of data and computational results; (5) Interactive simulation, VR technology and data mining. The applicant should have good qualifications in at least two of the listed areas and large experience in using parallel computer systems. Masters degree or equivalent is required. Ph D degree is a merit. System engineer, (Ref nr 3171-1635-96) (Two 50% positions that can be combined to 100%) The positions include responsibility for the operation and system administration of the computer resources at HPC2N. Coordinator, (Ref nr 3171-1636-96) (100% position that possibly can be split) The position includes responsibility for HPC2N's information and marketing programs. The coordinator is the official secretary of the HPC2N Board and the Scientific Council, contact person towards HPDR and the partners of HPC2N, and coordinates the HPC2N external relations. Contact person: Professor Bo Kagstrom, Director of HPC2N, Department of Computing Science, Umea University, S-901 87 Umea, Sweden. Email: bo.kagstrom@cs.umu.se A paper copy of the application (with enclosures) must be received by: Registrator, Umea University, S-901 87 Umea, Sweden no later than October 10, 1996. In addition, you can also send an email version to "bo.kagstrom@cs.umu.se". Notice, the application must be marked with the name of the position and the reference number (Ref nr). You are most welcome with your application! ------------------------------ From: SIAM Date: Mon, 23 Sep 96 15:49:21 EST Subject: Contents, SIAM Discrete Mathematics CONTENTS SIAM Journal on Discrete Mathematics November 1996, Volume 9, Number 4 Graph Algorithms for Conformance Testing Using the Rural Chinese Postman Tour Yinan N. Shen and Fabrizio Lombardi Multipartition Series David G. Wagner Valuated Matroid Intersection I: Optimality Criteria Kazuo Murota Valuated Matroid Intersection II: Algorithms Kazuo Murota Plane Embeddings of 2-Trees and Biconnected Partial 2-Trees Andrzej Proskurowski, Maciej M. Syslo, and Pawel Winter On the Trellis Complexity of the Densest Lattice Packings in R^n Ian F. Blake and Vahid Tarokh The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities Sunil Chopra and Giovanni Rinaldi Cayley Graphs with Neighbor Connectivity One L. L. Doty, R. J. Goldstone, and C. L. Suffel IIS-Hypergraphs Jennifer Ryan A Gray Code for Necklaces of Fixed Density Terry Min Yih Wang and Carla D. Savage Finding Independent Sets in Triangle-Free Graphs Kathryn Fraughnaugh and Stephen C. Locke Author Index ------------------------------ From: SIAM Date: Wed, 25 Sep 96 13:30:06 EST Subject: Contents, SIAM Optimization SIAM Journal on Optimization November 1996, Volume 6, Number 4 CONTENTS Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method James Renegar An Interior Point Method for Bordered Block Diagonal Linear Programs Michael D. Grigoriadis and Leonid G. Khachiyan Solving LP Problems via Weighted Centers Aiping Liao and Michael J. Todd Parallel Decomposition: Results for Staircase Linear Programs Robert Entriken On the Superlinear Convergence of an O(n3L) Interior-Point Algorithm for the Monotone LCP Kevin A. McShane Algorithms for the Generalized Linear Complementarity Problem with a Vertical Block Z-Matrix S. R. Mohan and S. K. Neogy Semidefinite Programming: A Path-Following Algorithm for a Linear-Quadratic Functional Leonid Faybusovich Analysis of a Symmetric Rank-One Trust Region Method Richard H. Byrd, Humaid Fayez Khalfan, and Robert B. Schnabel A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables Thomas F. Coleman and Yuying Li Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region A. R. Conn, Nick Gould, A. Sartenaer, and Ph. L. Toint Characterizations of Strong Regularity for Variational Inequalities Over Polyhedral Convex Sets A. L. Dontchev and R. T. Rockafellar A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization Masao Fukushima and Liqun Qi Generalized Hessian Properties of Regularized Nonsmooth Functions R. A. Poliquin and R. T. Rockafellar Rates of Convergence in Stochastic Programs with Complete Integer Recourse Rudiger Schultz Optimality of Nested Partitions and Its Application to Cluster Analysis E. Boros and F. K. Hwang Author Index ------------------------------ From: Edit Kurali Date: Sat, 28 Sep 1996 19:46:21 -0400 (EDT) Subject: Contents, Approximation Theory Table of Contents: J. Approx. Theory, Volume 86, Number 2, August 1996 Georg Isac and Lars-Erik Persson On an inequality related to the isotonicity of the projection operator 129--143 Nataly Chistyakova and Vladimir Logvinenko Polynomial approximation on varying sets 144--178 Zhongkai Li Conjugate Jacobi series and conjugate functions 179--196 Inna Bashmakova and Semyon Rafaelson On the approximation of continuous functions by Fourier--Legendre sums 197--215 J. Abouir, A. Cuyt, P. Gonzalez-Vera, and R. Orive On the convergence of general order multivariate Pad\'e-type approximants 216--228 Ying Guang Shi The generalized Markov-Stieltjes inequality for Birkhoff quadrature formulas 229--239 Qiyu Sun Refinable functions with compact support 240--252 ------------------------------ From: Carlos A. de Moura Date: Fri, 27 Sep 1996 16:54:20 -0300 Subject: Contents, Computational and Applied Mathematics Matematica Aplicada e Computacional Computational and Applied Mathematics VOLUME 15 (1996), #2 "Special Issue on Wavelets - Theory and Applications" Edited by Birkhauser-Boston and SBMAC- Brazilian Soc for Computational and Applied Mathematics Gomes,SM; Moura,CA de : FOREWORD. Bergeaud,F; Mallat,S : MATCHING PURSUIT: ADAPTIVE REPRESENTATIONS OF IMAGES AND SOUNDS. Malvar,HS : EXTENDED COSINE BASES AND APPLICATIONS TO AUDIO CODING. Lemarie-Rieusset,PG : SOME REMARKS ON ORTHOGONAL AND BI-ORTHOGONAL WAVELETS. Charton,P; Perrier,V : A PSEUDO-WAVELET SCHEME FOR THE TWO-DIMENSIONAL NAVIER-STOKES EQUATION. Strang,G : CONDITION NUMBERS FOR WAVELETS AND FILTER BANKS. ------------------------------ End of NA Digest ************************** -------