From surfer.EPM.ORNL.GOV!nacomb Mon Apr 8 00:23:36 0400 1991 Received: by pyxis; Mon Apr 8 00:23 EDT 1991 To: pyxis!ehg Received: by inet.att.com; Mon Apr 8 00:23 EDT 1991 Received: by surfer.EPM.ORNL.GOV (5.61/1.34) id AA03666; Mon, 8 Apr 91 00:23:36 -0400 Date: Mon, 8 Apr 91 00:23:36 -0400 From: nacomb@surfer.EPM.ORNL.GOV (NA-NET) Message-Id: <9104080423.AA03666@surfer.EPM.ORNL.GOV> Subject: NA Digest, V. 91, # 14 Comment: Submissions for NA News Digest, mail to na.digest@na-net.ornl.gov. Comment: Information about NA-NET, mail to na.help@na-net.ornl.gov. Comment: Comments about the NA-NET, mail to nanet@na-net.ornl.gov. Apparently-To: ehg@research.att.com NA Digest Sunday, April 7, 1991 Volume 91 : Issue 14 Today's Editor: Cleve Moler Today's Topics: NA Enhancements of Application Packages Software to Visualize Stability Regions Eigenvalues for Banded Non-symmetric Matrices Real Applications of Numerical Analysis Sought Virginia Computer Users' Conference Announcement The Electronic Software Library eLib New Soviet Journal Contents: Linear Algebra and Applications Contents: SIAM Scientific and Statistical Computing Contents: SIAM Computing ------------------------------------------------------- From: J. C. T. Pool Date: Fri, 5 Apr 91 10:43:05 EST Subject: NA Enhancements of Application Packages I am seeking examples where the numerical analysis community has contributed to enhancing the performance of large application packages, e.g., finite element packages or fluid dynamics packages or circuit simulation, on vector and/or parallel computers. Ideally, the examples would be proprietary packages used widely in the science and/or engineering community and could be documented by references in published literature. Realistically, I would welcome any good examples! Please send information to jpool@mcs.drexel.edu Thanks, Jim Pool James C. T. Pool, Head Telephone: 215-895-2668 Mathematics and Computer Science FAX: 215-895-4999 206 Korman Center DREXEL UNIVERSITY Email: jpool@mcs.drexel.edu Philadelphia, PA 19104-2884 ------------------------------ From: Gabriela KIRLINGER Date: Thu, 04 Apr 91 16:15:57 MEZ Subject: Software to Visualize Stability Regions For a given (k,m)-Pade approximation P_k(z)/Q_m(z) interpreted as rational stability function R(z) of a certain numerical method I am interested in (a graphical representation of) the A(alpha)-stability regions of the underlying numerical method. Does anyone have or know available software? Many thanks, Gabriela Kirlinger ------------------------------ From: Roger Ghanem Date: 5 Apr 91 15:46:54 GMT Subject: Eigenvalues for Banded Non-symmetric Matrices I am looking for a package that can find the eigenvalues for non-symmetric banded matrices. Roger Ghanem, ghanem@venus.eng.buffalo.edu SUNY Buffalo, Academic Computing Services ------------------------------ From: Gordon F. Royle Date: 1 Apr 91 15:04:26 GMT Subject: Real Applications of Numerical Analysis Sought Hello to all numerical analysts. I am currently teaching a beginning numerical analysis course to a group of juniors/seniors. Trouble is, no matter what I do in class, they refuse to be excited by numerical integration, cubic splines etc. I thought that it would be nice if I could find a REAL application that we could work through in some detail - i.e to get away from the questions about "Suppose we want to approximate e^x using the points x=0.01,0.02 blah blah blah" But I can't find a suitable one. Does anyone have any suggestions (with references). For example, I just happened to notice in an unrelated magazine article that CD players use some sort of interpolation when the error rate gets too high. Does anyone know what sort of interpolation? (as long as its not piecewise linear I'll be happy). Where can I find a rigorous mathematical description of this? By the way, I have no objections to covering a reasonable amount of other material to get to the numerical analysis part. As long as its mathematics, I can teach it in the course without the sky falling. Cheers Gordon Royle gfroyle@athena.cas.vanderbilt.edu Mathematics, Vanderbilt University, Nashville ------------------------------ From: Layne Watson Date: Mon, 1 Apr 91 10:31:25 -0500 Subject: Virginia Computer Users' Conference Announcement 21st Annual Virginia Computer Users Conference CALL for PAPERS Dear Colleague: As you should already know, Virginia Computer Users Conference (VCUC) is the oldest run student conference in the nation. The VCUC committee has already started planning for the twenty first annual conference, which will be held this fall on September 27-29. This year, the overall theme of the conference is UNIX. Original papers are solicited in the following areas : * Tools * UNIX in Industry * Networking * UNIX in Business * Standardization * UNIX in Government * Security * Real-Rime Systems * Parallel Programming & * GUI/Windowing Enviroments Executing Environments * Other Current UNIX issues. Submitted abstracts-- no more than 3 pages, please-- will be reviewed on the basis of technical merit and content. All abstracts must have a separate cover page containing the title of the paper along with the name, affiliation, and complete mailing address of the author(s). Please include an internet address if available. Accepted papers will be published in the conference proceedings. All submissions should be sent to the following address: Virginia Computer Users Conference Department of Computer Science 562 McBryde Hall Virginia Polytechnic Institute and State University Blacksburg, Virginia 24061-0106. Abstracts should be post-marked no later than April 15, 1991. Notification of acceptance will be made by April 30, 1991. Please announce this "call for papers" to all interested parties. If you have any further questions, please contact me at (clinege@csgrad.cs.vt.edu) or Tamera Gregory at (gregory@ vtccf.cc.vt.edu). Thank you for your time, George Cline, Co-chair VCUC-21 ------------------------------ From: J.Luegger Date: Thu, 4 Apr 91 14:32:30 +0200 Subject: The Electronic Software Library eLib The Electronic Software Library eLib - Featuring NetLib, RedLib and Na-Net ========================================================================== A new network library eLib for the distribution of mathematical software via electronic networks is now available for on-line access (Datex-P, Internet, IXI, WIN) and off-line usage (X.400, BITNET, Internet, uucp, ...). eLib e.g. offers CodeLib, the Scientific Computing library of "Konrad-Zuse- Zentrum fuer Informationstechnik Berlin - ZIB" and many other pieces of high- quality mathematical software, each being integrated within a framework of a problem oriented classification scheme, namely the widespread GAMS index of the U. S. National Institute for Standards and Technology - NIST (formerly NBS). Furthermore, eLib features interactive access to the famous NetLib, maintained by J. J. Dongarra and E. Grosse, and to the well known Reduce Network Library - we call it RedLib here - maintained by A. C. Hearn. We speak of these libraries as being compound, in spite of the fact that they are also accessible stand alone at ZIB. Additionally, eLib makes Na-Net available in form of an index with topics built from Na-Net contributions (na-digest from NetLib) ready for being analyzed interactively via eLib's text and regular expression search facilities. Interactive usage of eLib, NetLib and RedLib is simple. You dial (or telnet) Datex-P (also WIN): (+Germany) 45050331033 (no login necessary) IXI (from Europe): (+Germany) 2043623331033 (+... is the country code) Internet: eLib.zib-berlin.de (130.73.108.11) login: elib (no password required) and you are connected to eLib directly. eLib supports you by a plain menu oriented user interface - you may select a menu item by a number or a text accordingly. Some menu items will prompt you for parameters. Choosing 'netlib' or 'redlib' you will find a suit of commands with which experienced NetLib or RedLib users will already be acquainted, with the following options also available: Select and view a piece of information through eLib's window and inspect it by eLib's search commands before sending it to your local mailbox. You may even prepare a selected piece of information for transmission via an anonymous Internet filetransfer. ftp elib.zib-berlin.de (130.73.108.11) If you have a specific problem to solve, use the conceptual hierarchy of the GAMS index to find a related software item. Or use NetLib's keyword search, or RedLib's complete index or eLib's modul index for finding the software. Off-line usage is now supported (Version 2 of eLib) by a more batch oriented send-command. You may access eLib from almost every scientific network. The address forms given for the most popular are: X.400: S=eLib;OU=sc;P=zib-berlin;A=dbp;C=de RFC822: eLib@sc.zib-berlin.dbp.de BITNET: eLib@sc.zib-berlin.dbp.de Internet: eLib@sc.zib-berlin.de uucp: unido!sc.zib-berlin.dbp.de!eLib Send an electronic mail request, e.g. of the form To: eLib@sc.zib-berlin.dbp.de Subject: * a first request to eLib (this is a commentary) send index and you will get a mail-help document with a generalized index comprising NetLib and RedLib software too. Yes, you may access NetLib and RedLib via off-line requests to eLib - this is a consequence of the compound property. In this mode, you may use the 'send ... from ...' command, borrowed from Netlib, in order to locate and get the desired software. eLib's "send" is not as forgiving as Netlib's "send", because it can be applied interactively too - providing a somewhat firmer frame for a dialog. In case of any error situation eLib additionally will send an execution protocol of its run to you. The specific forms of the send command are: * get index from library Lib, for any library Lib of eLib, NetLib, RedLib send index from Lib * get module-set Mod from library Lib, and all routines it depends from send Mod from Lib * get only module Mod from library Lib, just the routine, no subsidiaries send only Mod from Lib If you want to find a piece of software via the GAMS index you may request * get top level of GAMS index, including the full GAMS index structure send index from gams * get list of modules classified by GAMS index GI within eLib send index from gams GI * get module Mod from GAMS index GI, and all routines it depends from send Mod from gams GI * get only module Mod from GAMS index GI, just the routine, no subsidiaries send only Mod from gams GI Here "gams GI" can be viewed as a specific library "containing" all the items classified by GI. We have modified the GAMS index a little for eLib purposes, representing 'a' by 'a0', 'b' by 'b0', etc. Thus we have arranged the GAMS index as a two-level eLib menu, which is comfortable especially for e-mail requests. Therefore, if you know the GAMS index already, at most two requests are sufficient in order to locate related software - or to get a negative result. Because in the case of a negative request, eLib sends back the index structure above the desired GAMS index together with an indication of where software can be found. For further information see the general index document cited above. You don't need to be registered at eLib for utilizing it off-line. But for using it on-line your e-mail address must have been communicated to eLib before - naturally. You may facilitate this in course of an auto-register procedure following eLib's checkin-menu. Or write a message to us: X400: S=eLib-Adm;OU=sc;P=zib-berlin;A=dbp;C=de other: derive an address according to the scheme given for eLib This is the address of eLib's system administration, which is a person (not a program), which will take care for you in case of any difficulties. We also are grateful for any comments and questions regarding eLib, which we will make available to the public in case of a general interest. You may reach us by yellow mail too, of course J. Luegger, W. Dalitz Konrad-Zuse-Zentrum fuer Informationstechnik Berlin - ZIB Heilbronner Str. 10, D-1000 Berlin 31, Germany Usage of NetLib, RedLib and eLib is free of charge. You even may utilize eLib and its compound libraries anonymously at ZIB. Don't hesitate to visit. ------------------------------ From: R. Baker Kearfott Date: Wed, 3 Apr 91 12:07:18 CST Subject: New Soviet Journal INVITATION FOR SUBSCRIPTION AND CALL FOR PAPERS (second notice) A new refereed Soviet periodical, "Interval Computations" will soon be available. It will contain papers related to the following subjects: * Theoretical research in interval mathematics * Interval methods and algorithms and their implementation * Interval software Items published will be in the form of * original papers * surveys * reports on new software and hardware * reviews of new monographs * abstracts of papers * letters to the editor * information about symposiums, conferences, etc. * advertisements of software Languages of publication will be English and Russian. All articles will have abstracts in both languages. The editor in chief is: V. M. Nesterov Leningrad Institute for Information and Automation (Laboratory for Applied Informatics) Academy of Sciences of the USSR Leningrad 199178, USSR In addition to me, the editorial board will include: B. S. Dobronets (Krasnojarsk) E. A. Musaev (Leningrad) email: eldar@lomi.spb.su A. L. Semenov (Moscow) A. O. Slisenko (Leningrad) A. G. Yakovlev (Pereslavl-Zalessky) V. S. Zjuzin (Saratov) Information regarding submission of items for publication may be obtained from the editor in chief. There will be four issues per year, each with approximately 100 pages. Prices within the United States will initially be approximately $35 per year. I will have worked out payment arrangements shortly. Requests for subscriptions within the United States and Canada should be addressed to me. (I have forwarded subscription requests of those who have already contacted me.) R. Baker Kearfott Department of Mathematics University of Southwestern Louisiana U.S.L. Box 4-1010 Lafayette, LA 70504-1010 Office: (318) 231-5270 Home: (318) 981-9744 Email: rbk@usl.edu (Internet) Here is the table of contents of the first issue: INTERVAL COMPUTATIONS: VOL. 1 ISSUE 1 CONTENTS Interval Computations - Leningrad - #1, 1991 - 117 P. CONTENTS >From the Editor (in Russian) . . . . . . . . . . . . . . . . .2 >From the Editor. . . . . . . . . . . . . . . . . . . . . . . .6 A.G.YAKOVLEV Interval computations - subject of research and useful tool (in Russian) . . . . . . . . . . . . . . 10 A.G.YAKOVLEV Interval computations - subject of research and useful tool. . . . . . . . . . . . . . . . . . . . . 27 J.HERZBERGER, D.BETHKE On two algorithms for bounding the inverses of an interval matrix . . . . . . . . . . . 44 B.S.DOBRONETS, V.I.SENASHOV On interval extension of some classes of functions (in Russian) . . . . . . . . . 54 R.B.KEARFOTT, CHENYI HU, MANUEL NOVOA III A review of preconditioners for the interval Gauss-Seidel method . . 59 E.A.MUSAEV Narrowing of intervals by partial derivatives . 86 S.P.SHARY On compatibility of linear tolerance problem (in Russian) . . . . . . . . . . . . . . . . . . . 92 B.V.PALUH, B.V.VASILYOV, V.L.PEROV Application of interval mathematics for solving technical diagnostics tasks of non-stop manufacture in chemical industry (in Russian) . . . . . . . . . . . . . . . . . . . . 99 SHORT COMMUNICATIONS V.S.Zjuzin Review of the book: H.Bauch, K.-U.Jahn, D.Oelschlagel, H.Susse, V.Wiebigke "Interval Mathematics (Theory and Application)" (in Russian) H.Bauch, K.-U.Jahn, D.Oelschlagel, H.Susse, V.Wiebigke Intervalmathematik (Teorie und Anwendungen).- Leipzig, BSB B.G.Teubner Verlagsgesellschaft, 1987, 260 S. (Mathematisch-Naturwissenschaftliche Bibliothex, Band 72) . . . . . . . . . . . . . . . . . . . . . . . .105 E.A.MUSAEV Interval Methods for Numerical Computation West Germany, Oberwolfach, 3 - 10.3 1990 (Information on international conference)/(in Russian) .108 C.G.IFHSQ YII Dctcj.pyjt cjdtofybt gj bynthdfkmyjq vfntvfnbrt (Cjj,otybt) S.P.SHARY 7-th All-Union Conference on Interval Mathematics (Information) . . . . . . . . . . . . . . .111 Requirements for manuscript preparation (in Russian) . . . 113 Requirements for manuscript preparation . . . . . . . . . . 114 Contents . . . . . . . . . . . . . . . . . . . . . . . . . 115 English text - 60 % Russian text - 40 % Each article is prefaced by title and abstracts both in English and Russian. ------------------------------ From: Richard Brualdi Date: Sun, 31 Mar 91 12:31:45 cst Subject: Contents: Linear Algebra and Applications LAA: Volume 151 June 1991 PP. 1-256 Table of Contents Jian-Ming Miao (Shanghai, China) General Expressions for the Moore-Penrose Inverse of a 2x2 Block Matrix 1 Ricardo N. Cruz (Ithaca, New York) Linear and Lipschitz Similarity 17 Roy Mathias (Baltimore, Maryland) The Equivalence of Two Partial Orders on a Convex Cone of Positive Semidefinite Matrices 27 K. B. Datta (Kharagpur, India) Invertibility of Linear Systems Described by Differential-Difference Equations 57 M. Neumann (Storrs, Connecticut) and H. J. Werner (Bonn, Germany) Nonnegative Group Inverses 85 Emil Klafszky (Miskolc, Hungary) and Tamas Terlaky (Budapest, Hungary) The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra 97 Fuad Kittaneh (Kuwait) On Zero-Trace Matrices 119 A. S. Deif (Riyadh, Saudi Arabia) Singular Values of an Interval Matrix 125 Jerzy K. Baksalary (Tampere, Finland) and Friedrich Pukelsheim (Augsburg, Germany) On the Lowner, Minus, and Star Partial Orderings of Nonnegative Definite Matrices and Their Squares 135 D. R. Jensen (Blacksburg, Virginia) Vector Efficiency in Multiparameter Estimation 143 Paul Binding (Calgary, Alberta, Canada) and Chi-Kwong Li (Williamsburg, Virginia) Joint Ranges of Hermitian Matrices and Simultaneous Diagonalization 157 Jerzy K. Baksalary (Tampere, Finland) and Gotz Trenkler (Dortmund, Germany) Nonnegative and Positive Definiteness of Matrices Modified by Two Matrices of Rank One 169 Krzysztof Galkowski (Wroclaw, Poland) An a Priori Nonminimal State-Space Realization of n-D Systems 185 J. Chun and T. Kailath (Stanford, California) Displacement Structure for Hankel, Vandermonde, and Related (Derived) Matrices 199 Mou-Cheng Zhang (Guangzhou, Peoples' Republic of China) On the Maximal Subgroup of the Semigroup of Generalized Circulant Boolean Matrices 229 J. F. B. M. Kraaijevanger (Leiden, The Netherlands) A Characterization of Lyapunov Diagonal Stability Using Hadamard Products 245 Special Issues in Progress 1. Interior Point Methods for Linear Programming; special editors are D. Gay, M. Kojima, and R. Tapia. To appear as Volume 152, July 1, 1991. 2. Iterations in Linear Algebra and Its Applications (Dedicated to G. H. Golub, R. S. Varga, and D. M. Young); special editors are O. Axelsson, J. de Pillis, M. Neumann, W. Niethammer, and R. J. Plemmons. To appear as Volumes 154/155, August/September 1991. 3. Algebraic Linear Algebra; special editors are Robert M. Guralnick, William H. Gustafson, and Lawrence S. Levy. To appear as Volume 157, October 15, 1991. 4. Proceedings of the Auburn 1990 Matrix Theory Conference; special editors are David Carlson and Frank Uhlig. Submission deadline: August 1, 1990. Details provided with the conference announcement. 5. Proceedings of the Sixth Haifa Conference on Matrix Theory; special editors are A. Berman, M. Goldberg, and D. Hershkowitz. Submission deadline: October 1,990. Details provided with the conference announcement. 6. Proceedings of the International Workshop on Linear Models, Experimental Designs and Related Matrix Theory, (August 6-8, 1990, Tampere, Finland); special editors are Jerzy K. Baksalary and George Styan. Submission deadline: October 31, 1990. Details provided with the conference announcement. 7. Proceedings of the Second NIU Conference on Linear Algebra, Numerical Linear Algebra and Applications, (May 3-5, 1991, Northern Illinois University, DeKalb, Illinois); special editors are Biswa Datta and Robert Plemmons. Submission deadline: July 31, 1991. Details provided with the conference announcement. ------------------------------ From: SIAM Publications Department Date: Thu, 4 Apr 91 11:46 EDT Subject: Contents: SIAM Scientific and Statistical Computing SIAM JOURNAL ON Scientific and Statistical Computing JULY 1991 Volume 12, Number 4 CONTENTS Fast Algorithms for Compact Fixed Point Problems with Inexact Function Evaluations C.T. Kelley and E.W. Sachs Computing Eigenvalues of Banded Symmetric Toeplitz Matrices Peter Arbenz Optimal Triangular Mesh Generation by Coordinate Transformation E.F. D'Azevedo Parallel Triangular System Solving on a Mesh Network of Transputers Rob H. Bisseling and Johannes G. G. van de Vorst A Square Root and Division Free Givens Rotation for Solving Least Squares Problems on Systolic Arrays J. Gotze and U. Schwiegelshohn Self-Sorting In-Place Fast Fourier Transforms Clive Temperton Parallel Algorithms for Banded Linear Systems Stephen J. Wright Conditions at the Downstream Boundary for Simulations of Viscous, Incompressible Flow Thomas Hagstrom A Bivariate Interpolation Algorithm for Data That Are Monotone in One Variable R.E. Carlson and F. N. Fritsch Asymptotic Behavior of the Number of Regression Quantile Breakpoints Stephen Portnoy A Numerical Study of an Augmented Lagrangian Method for the Estimation of Parameters in Elliptic Systems K. Ito, M. Kroller, and K. Kunisch On the Generalized Schur Decomposition of a Matrix Pencil for Parallel Computation A. Bunse-Gerstner and H. Fassbender Multigrid Treatment of "Thin" Domains V. Mikulinksy Automatic Domain Partitioning in Three Dimensions Stephen A. Vavasis A Deferred Correction Method for Nonlinear Two-Point Boundary Value Problems: Implementation and Numerical Evaluation J.R. Cash and M.H. Wright For additional information, please contact Vickie Kearn, Publisher, Society for Industrial and Applied Mathematics (SIAM), 3600 University City Science Center, Philadelphia, PA 19104-2688; telephone: (215) 382-9800; fax: (215) 386-7999; e-mail: siampubs@wharton.upenn.edu. ------------------------------ From: SIAM Publications Department Date: Fri, 5 Apr 91 16:38 EDT Subject: Contents: SIAM Computing SIAM JOURNAL ON COMPUTING Volume 20, Number 4, August 1991 CONTENTS Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves Kurt Mehlhorn and Chee-Keng Yap Reversal Complexity Jian-er Chen and Chee-Keng Yap The Fast m-Transform: A Fast Computation of Cross-Correlations with Binary m-Sequences Erich E. Sutter Computing the Strength of a Graph Dan Gusfield Lower Bounds for Algebraic Computation Trees with Integer Inputs Andrew Chi-Chih Yao Minimization of Rational Word Functions Christophe Reutenauer and Marcel-Paul Schutzenberger On Counting Lattice Points in Polyhedra Martin Dyer Parallel Transitive Closure and Point Location in Planar Structures Roberto Tamassia and Jeffrey S. Vitter On Nonblocking Multirate Interconnection Networks Shun-Ping and Keith W. Ross Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors Michael T. Goodrich Fast Parallel Arithmetic via Modular Representation George I. Davida and Bruce Litow Equality-Test and If-Then-Else Algebras: Axiomization and Specification Don Pigozzi For additional information, contact Vickie Kearn, Publisher, Society for Industrial and Applied Mathematics (SIAM), 3600 University City Science Center, Philadelphia, PA 19104-2688; (215) 382-9800; fax: (215) 386-7999; e-mail: siampubs@wharton.upenn.edu. ------------------------------ End of NA Digest ************************** -------