COMMENT ⊗   VALID 00008 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.REQUIRE "ABSCMD[BIB,CSR]" SOURCE FILE
C00003 00003	%3MOST RECENT CS REPORTS - NOVEMBER 1978%1
C00005 00004	%3AIM-316  NATURAL LANGUAGE PROCESSING IN AN AUTOMATIC PROGRAMMING DOMAIN
C00006 00005	%3STAN-CS-78-672  COMPARISON OF NUMERICAL METHODS FOR INITIAL VALUE 
C00008 00006	%3STAN-CS-78-673  A NUMERICAL LIBRARY AND ITS SUPPORT
C00009 00007	%3STAN-CS-78-674  FINITE ELEMENT APPOXIMATION AND ITERATIVE SOLUTION OF A 
C00011 00008	.next page
C00013 ENDMK
C⊗;
.REQUIRE "ABSCMD[BIB,CSR]" SOURCE FILE
.next page
.once center
%3MOST RECENT CS REPORTS - NOVEMBER 1978%1

@Listed below are abstracts of the most recent reports published by the Computer
Science Department of Stanford University.

@TO REQUEST REPORTS:##Check the appropriate places on the enclosed order form,
and return the entire order form page (including mailing label) by  November 3, 1978.
In many cases we can print only a limited number of copies, and requests will
be filled on a first come, first serve basis.  In the code (FREE) is printed
on your mailing label, you will not be charged for hardcopy.  This exemption
from payment is limited primarily to libraries.  (The costs shown include all
applicable sales taxes.  PLEASE SEND NO MONEY NOW, WAIT UNTIL YOU GET AN INVOICE.)

@ALTERNATIVELY:  Copies of most Stanford CS Reports may be obtained by writing
(about 2 months after MOST RECENT CS REPORTS listing) to NATIONAL TECHNICAL
INFORMATION SERVICE, 5285 Port Royal Road, Springfield, Virginia 22161.  Stanford
Ph.D. theses are available from UNIVERSITY MICROFILMS, 300 North Zeeb Road,
Ann Arbor, Michigan 48106.
.begin nofill
%4-------------------------------------------------------------------------------------%1
%3AIM-316  NATURAL LANGUAGE PROCESSING IN AN AUTOMATIC PROGRAMMING DOMAIN
%3Author:%1  Jerrold Ginsparg     (Thesis)
.end
%3Abstract:%1@
.break
.begin nofill
No. of pages:  172
Cost:  $ 6.55
%4-----------------------------------------------------------------------------------------------%1
%3STAN-CS-78-672  COMPARISON OF NUMERICAL METHODS FOR INITIAL VALUE 
		PROBLEMS
%3Author:%1  Tony F. Chan     (Thesis)
.end
%3Abstract:%1@A framework is set up within which the efficiency and storage
requirements of different numerical methods for solving time dependent partial
differential equations can be realistically and rigorously compared.  The
approach is based on getting good error estimates for a one-dimensional model
equation u↓[t] = au↓[x] + bu↓[xx] + cu↓[xxx] .  Results on the comparison
of different orders of centered-differencing in space and various commonly used
methods for differencing in time will be discussed.  Both semi-discrete and
fully-discrete studies will be presented.
.break
.begin nofill
No. of pages:  195
Available in microfiche only.
%4-----------------------------------------------------------------------------------------------%1
%3STAN-CS-78-673  A NUMERICAL LIBRARY AND ITS SUPPORT
%3SU36 P30-59
%3Authors:%1  Tony F. Chan, William M. Coughran, Jr., Eric H. Grosse & Michael T. Heath
.end
%3Abstract:%1@Reflecting on four years of numerical consulting at the Stanford
Linear Accelerator Center, we point out solved and outstanding problems in
selecting and installing mathematical software, helping users, maintaining the
library and monitoring its use, and managing the consulting operation.
.break
.begin nofill
No. of pages:  22
Cost:  $ 2.35
%4-----------------------------------------------------------------------------------------------%1
%3STAN-CS-78-674  FINITE ELEMENT APPOXIMATION AND ITERATIVE SOLUTION OF A 
		CLASS OF MILDLY NON-LINEAR ELLIPTIC EQUATIONS
SU326 P30-60
%3Authors:%1  Tony F. Chan and Roland Glowinski
.end
%3Abstract:%1@We describe in this report the numerical analysis of a particular
calss of nonlinear Dirichlt problems.  We consider an equivalent variational
inequality formulation on which the problems of existence, uniqueness and
approximation are easier to discuss.  We prove in particular the convergence of
an approximation by piecewise linear finite elements.  Finally, we describe and
compare several iterative methods for solving the approximate problems and
particularly some new algorithms of augmented lagrangian type, which contain
as special case some well-known alternating direction methods.  Numerical
results are presented.
.break
.begin nofill
No. of pages:  76
Cost:  $ 3.85
%4-----------------------------------------------------------------------------------------------%1
.next page
.begin nofill; select 4
.once center
NOVEMBER REPORT ORDER FORM
To order reports, or to change your mailing address, return this sheet by:
November 3, 1978.
.once center
Check the reports you wish to receive.
            HARDCOPY				         MICROFICHE
1.  _____  AIM-316          $ 6.55	     2.  _____  AIM-316          FREE
                                  	     4.  _____  STAN-CS-78-672   FREE
5.  _____  STAN-CS-78-673   $ 2.35 	     6.  _____  STAN-CS-78-673   FREE
7.  _____  STAN-CS-78-674   $ 3.85	     8.  _____  STAN-CS-78-674   FREE
9.  _____                   $     	     A.  _____                   FREE

Please DO NOT send money with your order, wait until you get an invoice.
_____  Check here to change your address; print changes above the mailing label.
-------------------------------------------------------------------------------------




















-------------------------------------------------------------------------------------
									 AFFIX
									POSTAGE








				     STANFORD UNIVERSITY
				     COMPUTER SCIENCE DEPARTMENT
				     POLYA HALL, ROOM 202
				     STANFORD, CALIFORNIA  94305
				     U.S.A.
.end