1d his
2
3     (FILE 'HOME' ENTERED AT 10:08:33 ON 03 APR 1997)
4
5     FILE 'INSPEC' ENTERED AT 10:09:18 ON 03 APR 1997
6                ACT MROWKA/A
7               ---------
8L1  (      1053)SEA FILE=INSPEC (RELAXATION METHOD?/TI,CT,ST)
9L2  (         2)SEA FILE=INSPEC L1 AND REVIEW/TI,CT
10L3  (         2)SEA FILE=INSPEC L1 AND REVIEW/ST
11L4  (         4)SEA FILE=INSPEC L2 OR L3
12L5  (     12788)SEA FILE=INSPEC A4710/CC
13L6  (        31)SEA FILE=INSPEC L1 AND L5
14L7  (       382)SEA FILE=INSPEC (RELAXATION METHOD?/TI)
15L8          404 SEA FILE=INSPEC L4 OR L6 OR L7
16               ---------
17
18=> d bib ab 1-4,6,7,10,11,13,14-17,19-21,24,27,29,32,33,37,41,44-47,50,51,58,66,69,71,78,88,96,99,101,125,126,136,137,145,155
19
20L8   ANSWER 1 OF 404  INSPEC  COPYRIGHT 1997 IEE
21AN   97:5515417  INSPEC     DN  A9708-4755E-001
22TI   An implicit   ***relaxation***     ***method***   for calculating
23     steady two-dimensional flows of a spontaneously condensing vapour.
24AU   Kosolapov, Yu.S.; Liberzon, A.S.
25SO   Computational Mathematics and Mathematical Physics (1996) vol.36,
26     no.6, p.805-15. 23 refs.
27     Doc. No.: S0965-5425(96)00098-1
28     Published by: Elsevier
29     Price: CCCC 0965-5425/96/$24.00+.00
30     CODEN: CMMPA9  ISSN: 0965-5425
31     SICI (Trl): 0965-5425(1996)36:6L.805:IRMC;1-7
32     Translation of: Zhurnal Vychislitel'noi Matematiki i Matematicheskoi
33     Fiziki (1996) vol.36, no.6, p.138-51. 23 refs.
34     CODEN: ZVMFAN  ISSN: 0044-4669
35     SICI: 0044-4669(1996)36:6L.138;1-7
36DT   Journal; Translation Abstracted
37TC   Theoretical
38CY   Russian Federation; United Kingdom
39LA   English
40AB   An implicit monotone relaxation method of second-order of accuracy
41     with respect to the space coordinates for calculating steady
42     two-dimensional flows of spontaneously condensing and wet steam is
43     constructed. Possible applications of the method are demonstrated
44     using the examples of the calculation of flows of spontaneously
45     condensing vapour in nozzles and turbine cascades. A comparison is
46     made with calculation and the experimental results obtained
47     elsewhere.
48
49L8   ANSWER 2 OF 404  INSPEC  COPYRIGHT 1997 IEE
50AN   96:5495029  INSPEC     DN  B9703-0290F-025; C9703-4130-037
51TI   Convergence of waveform   ***relaxation***     ***methods***   for
52     differential-algebraic systems.
53AU   Jackiewicz, Z. (Dept. of Math., Arizona State Univ., Tempe, AZ,
54     USA); Kwapisz, M.
55SO   SIAM Journal on Numerical Analysis (Dec. 1996) vol.33, no.6,
56     p.2303-17. 25 refs.
57     Published by: SIAM
58     Price: CCCC 0036-1429/96/$2.00+0.15
59     CODEN: SJNAEQ  ISSN: 0036-1429
60     SICI: 0036-1429(199612)33:6L.2303:CWRM;1-1
61DT   Journal
62TC   Theoretical
63CY   United States
64LA   English
65AB   This paper gives sufficient conditions for existence and uniqueness
66     of solutions and for the convergence of Picard iterations and more
67     general waveform relaxation methods for differential-algebraic
68     systems of neutral type. The results are obtained by the contraction
69     mapping principle on Banach spaces with weighted norms and by the
70     use of the Perron-Frobenius theory of nonnegative and nonreducible
71     matrices. It is demonstrated that waveform relaxation methods are
72     convergent faster than the classical Picard iterations.
73
74L8   ANSWER 3 OF 404  INSPEC  COPYRIGHT 1997 IEE
75AN   96:5468386  INSPEC     DN  B9702-0290P-020; C9702-4170-023
76TI   Fourier-Laplace analysis of the multigrid waveform
77     ***relaxation***     ***method***   for hyperbolic equations.
78AU   Shlomo Ta'Asan (Dept. of Math., Carnegie Mellon Univ., Pittsburgh,
79     PA, USA); Hong Zhang
80SO   BIT (Dec. 1996) vol.36, no.4, p.831-41. 19 refs.
81     Published by: BIT Found
82     CODEN: BITTEL  ISSN: 0006-3835
83     SICI: 0006-3835(199612)36:4L.831:FLAM;1-7
84DT   Journal
85TC   Theoretical
86CY   Denmark
87LA   English
88AB   The multigrid waveform relaxation (WR) algorithm has been fairly
89     studied and implemented for parabolic equations. It has been found
90     that the performance of the multigrid WR method for a parabolic
91     equation is practically the same as that of multigrid iteration for
92     the associated steady state elliptic equation. However, the
93     properties of the multigrid WR method for hyperbolic problems are
94     relatively unknown. This paper studies the multigrid acceleration to
95     the WR iteration for hyperbolic problems, with a focus on the
96     convergence comparison between the multigrid WR iteration and the
97     multigrid iteration for the corresponding steady state equations.
98     Using a Fourier-Laplace analysis in two case studies, it is found
99     that the multigrid performance on hyperbolic problems no longer
100     shares the close resemblance in convergence factors between the WR
101     iteration for parabolic equations and the iteration for the
102     associated steady state equations.
103
104L8   ANSWER 4 OF 404  INSPEC  COPYRIGHT 1997 IEE
105AN   96:5467447  INSPEC     DN  A9704-8710-001; C9702-1290L-110
106TI   Fast multiple alignment of ungapped DNA sequences using information
107     theory and a   ***relaxation***     ***method***  .
108AU   Schneider, T.D. (Lab. of Math. Biol., Nat. Cancer Inst., Frederick,
109     MD, USA); Mastronarde, D.N.
110SO   Discrete Applied Mathematics (5 Dec. 1996) vol.71, no.1-3, p.259-68.
111     22 refs.
112     Published by: Elsevier
113     Price: CCCC 0166-218X/96/$15.00
114     CODEN: DAMADU  ISSN: 0166-218X
115     SICI: 0166-218X(19961205)71:1/3L.259:FMAU;1-3
116DT   Journal
117TC   Theoretical
118CY   Netherlands
119LA   English
120AB   An information theory based multiple alignment ("Malign") method was
121     used to align the DNA binding sequences of the OxyR and Fis
122     proteins, whose sequence conservation is so spread out that it is
123     difficult to identify the sites. In the algorithm described, the
124     information content of the sequences is used as a unique global
125     criterion for the quality of the alignment. The algorithm uses
126     look-up tables to avoid recalculating computationally expensive
127     functions such as the logarithm. Because there are no arbitrary
128     constants and because the results are reported in absolute units
129     (bits), the best alignment can be chosen without ambiguity. Starting
130     from randomly selected alignments, a hill-climbing algorithm can
131     track through the immense space of sn combinations, where s is the
132     number of sequences and n is the number of positions possible for
133     each sequence. Instead of producing a single alignment, the
134     algorithm is fast enough that one can afford to use many start
135     points and to classify the solutions. Good convergence is indicated
136     by the presence of a single well-populated solution class having
137     higher information content than other classes. The existence of
138     several distinct classes for the Fis protein indicates that those
139     binding sites have self-similar features.
140
141L8   ANSWER 6 OF 404  INSPEC  COPYRIGHT 1997 IEE
142AN   96:5462446  INSPEC     DN  A9703-0720F-002
143TI   Calorimeter apparatus using a thermal   ***relaxation***
144     ***method***  .
145AU   Azechi, L.S.; da Costa, R.F.; Medina, A.N.; Gandra, F.C.G. (Dept. de
146     Eletronica Quantica, UNICAMP, Campinas, Brazil)
147SO   Revista de Fisica Aplicada e Instrumentacao (June 1995) vol.10,
148     no.2, p.70-5. 8 refs.
149     Published by: Sociedade Brasileira Fisica
150     CODEN: RFAIEE  ISSN: 0102-6895
151     SICI: 0102-6895(199506)10:2L.70:CAUT;1-6
152DT   Journal
153TC   Experimental
154CY   Brazil
155LA   Portuguese
156AB   In this work a specific heat apparatus based on the sample thermal
157     relaxation method is presented. The system is designed for small
158     samples and can be implemented for any temperature range. A full
159     description of the system is given together with some results which
160     ensure the capability of the method.
161
162L8   ANSWER 7 OF 404  INSPEC  COPYRIGHT 1997 IEE
163AN   96:5443790  INSPEC     DN  B9701-6140C-449; C9701-1250-249
164TI   Robust   ***relaxation***     ***method***   for structural matching
165     under uncertainty.
166AU   Horiuchi, T. (Inst. of Inf. Sci. & Electron., Tsukuba Univ.,
167     Ibaraki, Japan); Yamamoto, K.; Yamada, H.
168SO   Proceedings of the 13th International Conference on Pattern
169     Recognition
170     Los Alamitos, CA, USA: IEEE Comput. Soc. Press, 1996. p.176-80 vol.2
171     of 4 vol. (xxxi+976+xxix+922+xxxi+1008+xxix+788) pp. 8 refs.
172     Conference: Vienna, Austria, 25-29 Aug 1996
173     Sponsor(s): Int. Assoc. Pattern Recognition
174     Price: CCCC 1015-4851/96/$5.00
175     ISBN: 0-8186-7282-X
176DT   Conference Article
177TC   Theoretical
178CY   United States
179LA   English
180AB   Probabilistic relaxation labeling processes have been widely used in
181     many different fields including image processing, pattern
182     recognition, and artificial intelligence. However it is impossible
183     to express conviction degrees to be related to human subjectivity.
184     We propose a novel relaxation scheme called "robust relaxation" for
185     structural matching under uncertainty. Since this method is
186     constructed on the Dempster-Shafer measure, the above problem can be
187     solved.
188
189L8   ANSWER 10 OF 404  INSPEC  COPYRIGHT 1997 IEE
190AN   96:5411436  INSPEC     DN  B9612-0250-021; C9612-1160-031
191TI   An epsilon -  ***relaxation***     ***method***   for generalized
192     separable convex cost network flow problems.
193AU   Tseng, P. (Dept. of Math., Washington Univ., Seattle, WA, USA);
194     Bertsekas, D.P.
195SO   Integer Programming and Combinatorial Optimization. 5th
196     International IPCO Conference Proceedings
197     Editor(s): Cunningham, W.C.; McCormick, S.T.; Queyranne, M.
198     Berlin, Germany: Springer-Verlag, 1996. p.85-93 of x+504 pp. 21
199     refs.
200     Conference: Vancouver, BC, Canada, 3-5 June 1996
201     Sponsor(s): Math. Programming Soc
202     ISBN: 3-540-61310-2
203DT   Conference Article
204TC   Theoretical
205CY   Germany, Federal Republic of
206LA   English
207AB   Proposes an extension of the epsilon -relaxation method to
208     generalized network flow problems with separable convex cost. The
209     method maintains epsilon -complementary slackness satisfied at all
210     iterations and adjusts the arc flows and the node prices so as to
211     satisfy flow conservation upon termination. Each iteration of the
212     method involves either a price change at a node or a flow change at
213     an arc or a flow change around a simple cycle. Complexity bounds for
214     the method are derived. For one implementation employing epsilon
215     -scaling, the bound is polynomial in the number of nodes N, the
216     number of arcs A, a certain constant Gamma depending on the arc
217     gains, and ln( epsilon 0/ epsilon ), where epsilon 0 and epsilon
218     denote, respectively, the initial and the final epsilon .
219
220L8   ANSWER 11 OF 404  INSPEC  COPYRIGHT 1997 IEE
221AN   96:5400764  INSPEC     DN  C9612-4130-004
222TI   A class of parallel nonlinear multisplitting   ***relaxation***
223     ***methods***   for the large sparse nonlinear complementarity
224     problems.
225AU   Zhong-Zhi Bai (Acad. Sinica, Beijing, China); De-Ren Wang
226SO   Computers & Mathematics with Applications (Oct. 1996) vol.32, no.8,
227     p.79-95. 15 refs.
228     Doc. No.: S0898-1221(96)00169-1
229     Published by: Elsevier
230     Price: CCCC 0898-1221/96/$15.00+0.00
231     CODEN: CMAPDK  ISSN: 0898-1221
232     SICI: 0898-1221(199610)32:8L.79:CPNM;1-7
233DT   Journal
234TC   Theoretical
235CY   United Kingdom
236LA   English
237AB   By making use of the nonlinear multisplitting and nonlinear
238     relaxation techniques, we present a class of parallel nonlinear
239     multisplitting successive overrelaxation methods for solving large
240     sparse nonlinear complementarity problems on modern high-speed
241     multiprocessors. These new methods particularly include the
242     so-called nonlinear multisplitting SOR-Newton method, the nonlinear
243     multisplitting SOR-chord method, and the nonlinear multisplitting
244     SOR-Steffensen method. Under suitable conditions, we establish local
245     convergence theories of the new methods, and investigate their
246     asymptotic convergence rates. Numerical results show that our new
247     methods are feasible and efficient for parallel solution of
248     nonlinear complementarity problems.
249
250L8   ANSWER 13 OF 404  INSPEC  COPYRIGHT 1997 IEE
251AN   96:5350970  INSPEC     DN  B9610-6140C-043; C9610-5260B-035
252TI   Feature detection of moving images using a hierarchical
253     ***relaxation***     ***method***  .
254AU   Dingding Chang; Hashimoto, S. (Dept. of Appl. Phys., Waseda Univ.,
255     Tokyo, Japan)
256SO   IEICE Transactions on Information and Systems (July 1996) vol.E79-D,
257     no.7, p.997-9. 14 refs.
258     Published by: Inst. Electron. Inf. & Commun. Eng
259     CODEN: ITISEF  ISSN: 0916-8532
260     SICI: 0916-8532(199607)E79D:7L.997:FDMI;1-D
261DT   Journal
262TC   Practical
263CY   Japan
264LA   English
265AB   A hierarchical relaxation method is presented for detecting local
266     features in moving images. The relaxation processes are performed on
267     the temporal spatial pyramid, which is a multi resolution data
268     structure for the moving images. The accurate and high speed edge
269     detection can be obtained by using information in the neighboring
270     frames as well as the processed results in the higher layers of the
271     pyramid.
272
273L8   ANSWER 14 OF 404  INSPEC  COPYRIGHT 1997 IEE
274AN   96:5342789  INSPEC     DN  B9609-0290P-006; C9609-4170-007
275TI   Chaotic waveform   ***relaxation***     ***methods***   for
276     dynamical systems.
277AU   Yongzhong Song (Dept. of Math., Nanjing Normal Univ., China)
278SO   Applied Mathematics and Computation (Aug. 1996) vol.78, no.1,
279     p.83-100. 9 refs.
280     Published by: Elsevier
281     Price: CCCC 0096-3003/96/$15.00
282     CODEN: AMHCBQ  ISSN: 0096-3003
283     SICI: 0096-3003(199608)78:1L.83:CWRM;1-9
284DT   Journal
285TC   Theoretical
286CY   United States
287LA   English
288AB   For solving the large dynamical systems of initial value problems
289     that can be described by a system of mixed implicit differential
290     equations, the waveform relaxation (WR) methods are proposed and
291     investigated by some mathematicians. In this paper, in order to
292     compute the WR methods on parallel processors and to avoid the
293     synchronization costs, the chaotic waveform relaxation (WR) methods
294     are presented and their convergence is investigated. As for the
295     special cases, the nonlinear ODEs, linear ODEs and semi-explicit
296     DAEs are discussed, respectively.
297
298L8   ANSWER 15 OF 404  INSPEC  COPYRIGHT 1997 IEE
299AN   96:5342518  INSPEC     DN  A9618-4710-014; C9609-7320-087
300TI   Data-parallel lower-upper   ***relaxation***     ***method***   for
301     the Navier-Stokes equations.
302AU   Wright, M.J.; Candler, G.V.; Prampolini, M. (Minnesota Univ.,
303     Minneapolis, MN, USA)
304SO   AIAA Journal (July 1996) vol.34, no.7, p.1371-7. 15 refs.
305     Published by: AIAA
306     Price: CCCC 0001-1452/96/$2.00+.50
307     CODEN: AIAJAH  ISSN: 0001-1452
308     SICI: 0001-1452(199607)34:7L.1371:DPLU;1-2
309DT   Journal
310TC   Theoretical
311CY   United States
312LA   English
313AB   The lower-upper symmetric Gauss-Seidel method is modified for the
314     simulation of viscous flows on massively parallel computers. The
315     resulting diagonal data-parallel lower-upper relaxation (DP-LUR)
316     method is shown to have good convergence properties on many
317     problems. However, the convergence rate decreases on the high cell
318     aspect ratio grids required to simulate high Reynolds number flows.
319     Therefore, the diagonal approximation is relaxed, and a full matrix
320     version of the DP-LUR method is derived. The full matrix method
321     retains the data-parallel properties of the original and reduces the
322     sensitivity of the convergence rate to the aspect ratio of the
323     computational grid. Both methods are implemented on the Thinking
324     Machines CM-5, and a large fraction of the peak theoretical
325     performance of the machine is obtained. The low memory use and high
326     parallel efficiency of the methods make them attractive for
327     large-scale simulation of viscous flows.
328
329L8   ANSWER 16 OF 404  INSPEC  COPYRIGHT 1997 FIZ KARLSRUHE
330AN   96:5323906  INSPEC     DN  A9616-4740K-008
331TI     ***Relaxation***     ***method***   for 3-D problems in supersonic
332     aerodynamics.
333AU   Karamyshev, V.; Kovenya, V.; Cherny, S. (Inst. of Comput. Technol.,
334     Rossijskaya Akad. Nauk, Novosibirsk, Russia)
335SO   Fourteenth International Conference on Numerical Methods in Fluid
336     Dynamics. Proceedings of the Conference
337     Editor(s): Deshpande, S.M.; Desai, S.S.; Narasimha, R.
338     Berlin, Germany: Springer-Verlag, 1995. p.280-4 of xiii+588 pp. 3
339     refs.
340     Conference: Bangalore, India, 11-15 July 1994
341     ISBN: 3-540-59280-6
342DT   Conference Article
343TC   Theoretical
344CY   Germany, Federal Republic of
345LA   English
346AB   A version of global iterations method is considered for the
347     numerical solution of stationary 3-D problems of supersonic
348     aerodynamics with the accelerated convergence of internal iteration
349     processes in marching cross-sections by the least square method.
350
351L8   ANSWER 17 OF 404  INSPEC  COPYRIGHT 1997 IEE
352AN   96:5311610  INSPEC     DN  B9608-0290Z-005; C9608-4190-003
353TI   The monotone convergence of a class of parallel nonlinear
354     ***relaxation***     ***methods***   for nonlinear complementarity
355     problems.
356AU   Zhong-Zhi Bai (State Key Lab., Acad. Sinica, Beijing, China)
357SO   Computers & Mathematics with Applications (June 1996) vol.31, no.12,
358     p.17-33. 26 refs.
359     Doc. No.: S0898-1221(96)00073-9
360     Published by: Elsevier
361     Price: CCCC 0898-1221/96/$15.00+0.00
362     CODEN: CMAPDK  ISSN: 0898-1221
363     SICI: 0898-1221(199606)31:12L.17:MCCP;1-9
364DT   Journal
365TC   Practical; Theoretical
366CY   United Kingdom
367LA   English
368AB   We set up a class of parallel nonlinear multisplitting AOR methods
369     by directly multisplitting the nonlinear mapping involved in the
370     nonlinear complementarity problems. The different choices of the
371     relaxation parameters can yield all the known and a lot of new
372     relaxation methods, as well as a lot of new relaxed parallel
373     nonlinear multisplitting methods for solving the nonlinear
374     complementarity problems. The two-sided approximation properties and
375     the influences on the convergence rates from the relaxation
376     parameters about our new methods are shown, and sufficient
377     conditions guaranteeing the methods to converge globally are
378     discussed. Finally, a lot of numerical results show that our new
379     methods are feasible and efficient.
380
381L8   ANSWER 19 OF 404  INSPEC  COPYRIGHT 1997 IEE
382AN   96:5280714  INSPEC     DN  C9607-1250-142
383TI   A   ***relaxation***     ***method***   to classification of
384     straight line segments.
385AU   Faber, P. (Dept. of Math. & Inf. Sci., Friedrich-Schiller-Univ.,
386     Jena, Germany)
387SO   Proceedings of The First International Conference on Visual
388     Information Systems
389     Melbourne, Vic., Australia: Victoria Univ. Technol, 1996. p.283-92
390     of viii+585 pp. 16 refs.
391     Conference: Melbourne, Vic., Australia, 5-6 Feb 1996
392DT   Conference Article
393TC   New Development; Practical
394CY   Australia
395LA   English
396AB   A new approach for classifying characteristic edge segments is
397     presented. The algorithm is based on a relaxation method. It uses
398     local features of edge segments for initialization and global
399     relations between all edge segments to update the values of
400     interpretation. Several updating operators F are investigated with
401     respect to their characteristics, of which the correctness of the
402     results and the iteration steps (speed of convergence) are most
403     important. Some experimental results on intensity images are given
404     in this paper to highlight the distinctive features of the presented
405     technique.
406
407L8   ANSWER 20 OF 404  INSPEC  COPYRIGHT 1997 IEE
408AN   96:5269829  INSPEC     DN  C9607-1290-001
409TI   Incorporating facet-inducing inequalities into graphical-construct-
410     based Lagrangian   ***relaxation***     ***methodologies***  .
411AU   Ali, A.I.; Shmerling, S. (Sch. of Manage., Massachusetts Univ.,
412     Amherst, MA, USA)
413SO   Operations Research Letters (Feb. 1996) vol.18, no.4, p.177-84. 32
414     refs.
415     Published by: Elsevier
416     Price: CCCC 0167-6377/96/$15.00
417     CODEN: ORLED5  ISSN: 0167-6377
418     SICI: 0167-6377(199602)18:4L.177:IFII;1-W
419DT   Journal
420TC   Practical; Theoretical
421CY   Netherlands
422LA   English
423AB   This paper shows that facet-inducing inequalities can be
424     incorporated into graphical-construct-based Lagrangian relaxation
425     methodologies by including them as dualized constraints. It develops
426     an algorithm that successively identifies additional facet-inducing
427     inequalities and incorporates them into the Lagrangian function.
428     Computational experience shows that the algorithm can resolve
429     duality gaps using relatively few facet-inducing inequalities.
430
431L8   ANSWER 21 OF 404  INSPEC  COPYRIGHT 1997 IEE
432AN   96:5268027  INSPEC     DN  B9606-8110B-084; C9606-3340H-169
433TI   Practical approach to unit commitment problem using genetic
434     algorithm and Lagrangian   ***relaxation***     ***method***  .
435AU   Ohta, T.; Matsui, T.; Takata, T. (Chubu Electric Power Co. Inc.,
436     Nagoya, Japan); Kato, M.; Aoyagi, M.; Kunugi, M.; Shimada, K.;
437     Nagata, J.
438SO   ISAP '96. International Conference on Intelligent Systems
439     Applications to Power Systems Proceedings (Cat. No.96TH8152)
440     Editor(s): Mohammed, O.A.; Tomsovic, K.
441     New York, NY, USA: IEEE, 1996. p.434-40 of xxv+476 pp. 7 refs.
442     Conference: Orlando, FL, USA, 28 Jan-2 Feb 1996
443     Sponsor(s): IEEE Power Eng. Soc.; IEEE Neural Network Council; NSF
444     Price: CCCC 0 7803 3115 X/96/$5.00
445     ISBN: 0-7803-3115-X
446DT   Conference Article
447TC   Theoretical
448CY   United States
449LA   English
450AB   This paper presents a practical method of solving the power system
451     unit commitment problem by using a genetic algorithm and the
452     Lagrangian relaxation method, making use of the advantages of both.
453     Moreover, the introduction of heuristics simplifies genetic string
454     manipulations which improve computational efficiency. Numerical
455     results have shown that the method is effective in solving the
456     practical unit commitment problem.
457
458L8   ANSWER 24 OF 404  INSPEC  COPYRIGHT 1997 FIZ KARLSRUHE
459AN   96:5245715  INSPEC     DN  A9610-6630H-007
460TI   Determination of chemical diffusion coefficient of SrFeCo0.5Ox by
461     the conductivity   ***relaxation***     ***method***  .
462AU   Ma, B.; Balachandran, U.; Park, J.H. (Energy Technol. Div., Argonne
463     Nat. Lab., IL, USA); Segre, C.U.
464SO   Solid State Ionics, Diffusion & Reactions (15 Jan. 1996) vol.83,
465     no.1-2, p.65-71. 26 refs.
466     Published by: Elsevier
467     Price: CCCC 0167-2738/96/$15.00
468     CODEN: SSIOD3  ISSN: 0167-2738
469     SICI: 0167-2738(19960115)83:1/2L.65:DCDC;1-E
470DT   Journal
471TC   Experimental; Theoretical
472CY   Netherlands
473LA   English
474AB   A conductivity relaxation experiment has been conducted on an
475     SrFeCo0.5Ox sample by abruptly changing the oxygen partial pressure
476     in the atmosphere and monitoring the change of conductivity as a
477     function of time. The re-equilibrium process obeys Fick's second
478     law. By fitting the relaxation data to the solution of the diffusion
479     equation with appropriate boundary conditions, we could determine
480     the oxygen chemical diffusion coefficient and the activation energy.
481     The oxygen diffusion coefficient is 8.9*10-7 cm2/s at 900 degrees C
482     and it increases with increase in temperature. Measured activation
483     energy is 0.92 eV, which is slightly lower than that of other oxides
484     in the system SrFe1-xCoxOy.
485
486L8   ANSWER 27 OF 404  INSPEC  COPYRIGHT 1997 IEE
487AN   96:5205427  INSPEC     DN  B9604-1130B-019; C9604-7410D-099
488TI     ***Relaxation***     ***methods***   for analogue fault
489     simulation.
490AU   Zwolinski, M. (Dept. of Electron. & Comput. Sci., Southampton Univ.,
491     UK)
492SO   1995 20th International Conference on Microelectronics. Proceedings
493     (Cat. No.95TH8108)
494     New York, NY, USA: IEEE, 1995. p.467-71 vol.2 of 2 vol. x+viii+870
495     pp. 4 refs.
496     Conference: Nis, Serbia, 12-14 Sept 1995
497     Sponsor(s): IEEE Electron. Devices Soc
498     Price: CCCC 0 7803 2786 1/95/$4.00
499     ISBN: 0-7803-2786-1
500DT   Conference Article
501TC   Theoretical
502CY   United States
503LA   English
504AB   The fault simulation of analogue circuits is an inherently difficult
505     problem because of the lack of a simple fault model and because
506     analogue simulation is itself slow. This paper describes a technique
507     in which faulty and fault-free circuits are simulated together, such
508     that if the terminal voltages of an active device are the same for
509     the faulty and fault-free circuit, the model values calculated for
510     the fault-free simulation are reused in the faulty simulation. A
511     simple example is given in which it is shown that some savings in
512     the CPU time are possible. Suggestions for further development of
513     the algorithm to give substantial CPU savings are given.
514
515L8   ANSWER 29 OF 404  INSPEC  COPYRIGHT 1997 IEE
516AN   96:5156791  INSPEC     DN  A9604-4710-004
517TI   Assessment of some iterative methods for non-symmetric linear
518     systems arising in computational fluid dynamics.
519AU   Soria, A.; Ruel, F. (Safety Technol. Inst., Comm. of the Eur.
520     Communities, Ispra, Italy)
521SO   International Journal for Numerical Methods in Fluids (30 Dec. 1995)
522     vol.21, no.12, p.1171-200. 26 refs.
523     Published by: Wiley
524     Price: CCCC 0271-2091/95/121171-30
525     CODEN: IJNFDW  ISSN: 0271-2091
526     SICI: 0271-2091(19951230)21:12L.1171:ASIM;1-I
527DT   Journal
528TC   Theoretical
529CY   United Kingdom
530LA   English
531AB   Various rests have been carried out in order to compare the
532     performances of several methods used to solve the non-symmetric
533     linear systems of equations arising from implicit discretizations of
534     CFD problems, namely the scalar advection-diffusion equation and the
535     compressible Euler equations. The iterative schemes under
536     consideration belong to three families of algorithms: relaxation
537     (Jacobi and Gauss-Seidel), gradient and Newton methods. Two gradient
538     methods have been selected: a Krylov subspace iteration method
539     (GMRES) and a non-symmetric extension of the conjugate gradient
540     method (CGS). Finally, a quasi-Newton method has also been
541     considered (Broyden). The aim of this paper is to provide
542     indications of which appears to be the most adequate method
543     according to the particular circumstances as well as to discuss the
544     implementation aspects of each scheme.
545
546L8   ANSWER 32 OF 404  INSPEC  COPYRIGHT 1997 IEE
547AN   95:5089277  INSPEC     DN  C9512-4140-033
548TI   A parallel   ***relaxation***     ***method***   for quadratic
549     programming problems with interval constraints.
550AU   Sugimoto, T. (Minist. of International Trade & Industry, Tokyo,
551     Japan); Fukushima, M.; Ibaraki, T.
552SO   Journal of Computational and Applied Mathematics (20 June 1995)
553     vol.60, no.1-2, p.219-36. 18 refs.
554     Price: CCCC 0377-0427/95/$09.50
555     CODEN: JCAMDI  ISSN: 0377-0427
556     Conference: International Meeting on Linear/Nonlinear Iterative
557     Methods and Verification of Solution. Matsuyama, Japan, 6-9 July
558     1993
559DT   Conference Article; Journal
560TC   Theoretical
561CY   Netherlands
562LA   English
563AB   Optimization problems with interval constraints are encountered in
564     various fields such as network flows and computer tomography. As
565     these problems are usually very large, they are not easy to solve
566     without taking their sparsity into account. Recently "row-action
567     methods", which originate from the classical Hildreth's method for
568     quadratic programming problems, have drawn much attention, since
569     they are particularly useful for large and sparse problems. Various
570     row-action methods have already been proposed for optimization
571     problems with interval constraints, but they mostly belong to the
572     class of sequential methods based on the Gauss-Seidel and SOR
573     methods. In this paper, we propose a highly parallelizable method
574     for solving those problems, which may be regarded as an application
575     of the Jacobi method to the dual of the original problems. We prove
576     convergence of the algorithm and report some computational results
577     to demonstrate its effectiveness.
578
579L8   ANSWER 33 OF 404  INSPEC  COPYRIGHT 1997 IEE
580AN   95:5088386  INSPEC     DN  B9512-0290P-007; C9512-4170-014
581TI   On the multigrid waveform   ***relaxation***     ***method***  .
582AU   Ta'asan, S. (Dept. of Math., Carnegie Mellon Univ., Pittsburgh, PA,
583     USA); Zhang, H.
584SO   SIAM Journal on Scientific Computing (Sept. 1995) vol.16, no.5,
585     p.1092-104. 13 refs.
586     Price: CCCC 1064-8275/95/$1.50+0.10
587     CODEN: SJOCE3  ISSN: 1064-8275
588DT   Journal
589TC   Theoretical
590CY   United States
591LA   English
592AB   The multigrid waveform relaxation method is an efficient method for
593     solving certain classes of time-dependent partial differential
594     equations (PDEs). This paper studies the relationship between this
595     method and the analogous multigrid method for steady-state problems.
596     Using a Fourier-Laplace analysis, practical convergence rate
597     estimates of the multigrid waveform relaxation are obtained.
598     Experimental results show that the analysis yields accurate
599     performance prediction.
600
601L8   ANSWER 37 OF 404  INSPEC  COPYRIGHT 1997 IEE
602AN   95:5060888  INSPEC     DN  A9521-8140G-003
603TI   Stress   ***relaxation***     ***method***   for investigation of
604     softening kinetics in hot deformed steels.
605AU   Karjalainen, L.P. (Dept. of Mech. Eng., Oulu Univ., Finland)
606SO   Materials Science and Technology (June 1995) vol.11, no.6, p.557-65.
607     30 refs.
608     CODEN: MSCTEP  ISSN: 0267-0836
609DT   Journal
610TC   Experimental
611CY   United Kingdom
612LA   English
613AB   The feasibility of using high temperature stress relaxation to
614     monitor the restoration process in hot deformed austenite has been
615     studied. The stress relaxation technique was applied to determine
616     the kinetics of softening in C-Mn and C-Mn-Nb steels, and the
617     effects of temperature, axisymmetric compressive strain, strain
618     rate, and reheating temperature are demonstrated and the results
619     compared with the predicted values. In particular; the role of
620     niobium in preventing recrystallisation is considered. The results
621     show that the method is able to reveal the progress of static
622     recrystallisation, and that the softening ratio at any given time
623     can be predicted from the recorded relaxation curves. The effects of
624     some particular experimental factors on the results are discussed,
625     such as an applied stress during the softening and the longitudinal
626     temperature gradient present in the specimens. The particular
627     effectiveness of the technique for the investigation of fast
628     restoration processes such as recovery and metadynamic
629     recrystallisation due to instantaneous data acquisition after the
630     deformation stage is emphasised.
631
632L8   ANSWER 41 OF 404  INSPEC  COPYRIGHT 1997 IEE
633AN   95:4988305  INSPEC     DN  A9515-9850-023
634TI     ***Relaxation***     ***method***   for automatic identification
635     (of galaxies).
636AU   Delbos, C.; Pinon, J.M.; Servigne, S.; Vidal, F. (Inst. Nat. des
637     Sci. Appliquees, Villeurbanne, France); Garnier, R.; Paturel, G.
638SO   Astrophysical Letters & Communications (1995) vol.31, no.1-6,
639     p.91-3. 1 refs.
640     CODEN: ALECE7  ISSN: 0888-6512
641     Conference: World of Galaxies II. Lyon, France, 5-7 Sept 1994
642DT   Conference Article; Journal
643TC   Application; Practical
644CY   Switzerland
645LA   English
646AB   In the Lyon-Meudon extragalactic database, LEDA, images are managed
647     together with astrophysical parameters. The probabilistic relaxation
648     method is used to allow an automatic cross-identification between a
649     well-identified galaxy and the corresponding flux enhancement on the
650     image. A test is performed to control the result.
651
652L8   ANSWER 44 OF 404  INSPEC  COPYRIGHT 1997 IEE
653AN   95:4919845  INSPEC     DN  B9505-5240-010
654TI   Transient analysis of lossy coupled transmission lines in a lossy
655     medium using the waveform   ***relaxation***     ***method***  .
656AU   Lau, F.C.M. (Dept. of Electron. Eng., Hong Kong Polytech., Hong
657     Kong); Deeley, E.M.
658SO   IEEE Transactions on Microwave Theory and Techniques (March 1995)
659     vol.43, no.3, p.692-7. 3 refs.
660     Price: CCCC 0018-9480/95/$04.00
661     CODEN: IETMAB  ISSN: 0018-9480
662DT   Journal
663TC   Theoretical
664CY   United States
665LA   English
666AB   The waveform relaxation method has been shown to be both efficient
667     and accurate when applied to coupled transmission lines with
668     conductor losses. In this paper, the method is generalized to
669     include the dielectric loss surrounding the transmission lines. The
670     distributed loss model assumes that the conductance matrix is
671     approximately diagonal and its product with the resistive matrix is
672     a scalar matrix. Computational results using the model is presented
673     and compared with HSPICE solutions.
674
675L8   ANSWER 45 OF 404  INSPEC  COPYRIGHT 1997 IEE
676AN   95:4866237  INSPEC     DN  A9504-6120-012
677TI   Molecular dynamics studies in isotropic phase of n-TPEB's by
678     dielectric   ***relaxation***     ***method***  .
679AU   Jadzyn, J. (Inst. of Molecular Phys., Polish Acad. of Sci., Poznan,
680     Poland); Legrand, C.; Isaert, N.; Cartier, A.; Bonnet, P.;
681     Czechowski, G.; Zywucki, B.
682SO   Journal of Molecular Liquids (Nov. 1994) vol.62, p.55-63. 13 refs.
683     Price: CCCC 0167-7322/94/$07.00
684     CODEN: JMLIDT  ISSN: 0167-7322
685DT   Journal
686TC   Theoretical
687CY   Netherlands
688LA   English
689AB   The result of dielectric relaxation measurements (1 kHz/1 GHz) for
690     series of mesogenic molecules CnH2n+1- phi - phi CH2-CH2 phi -NCS,
691     n-TPEB, (n=7/10) in the isotropic phase, have been presented. Two
692     Debye-type bands have been interpreted as a dielectric absorption
693     due to the rotation around the long and short molecular axis. An
694     optimization of the geometry of non-rigid TPEB molecules have been
695     made using a quantum mechanics semi-empirical method PM3.
696
697L8   ANSWER 46 OF 404  INSPEC  COPYRIGHT 1997 IEE
698AN   95:4846859  INSPEC     DN  C9502-1230D-025
699TI   Modified   ***relaxation***     ***method***   for solution of
700     continuous recurrent neural networks.
701AU   Wilamowski, B.M.; Kanarowski, S.M. (Dept. of Electr. Eng., Wyoming
702     Univ., Laramie, WY, USA)
703SO   Proceedings of the 36th Midwest Symposium on Circuits and Systems
704     (Cat. No.93CH3381-1)
705     New York, NY, USA: IEEE, 1993. p.1081-4 vol.2 of 2 vol. xxxv+1565
706     pp. 9 refs.
707     Conference: Detroit, MI, USA, 16-18 Aug 1993
708     Sponsor(s): Wayne State Univ.; IEEE Circuits & Syst. Soc
709     Price: CCCC CH3381-1/93/$01.00
710     ISBN: 0-7803-1760-2
711DT   Conference Article
712TC   Theoretical
713CY   United States
714LA   English
715AB   The derivation of a modified relaxation algorithm is presented
716     followed by demonstration examples. The algorithm converges very
717     well for continuous recurrent neural networks with both low and high
718     gain neurons. This enables one to simulate recurrent Hopfield
719     networks with both "soft" and "hard" continuous activation
720     functions. The algorithm is suitable for large systems since the
721     computational effort is proportional only to the system size, in
722     contrast to the commonly used Newton-Raphson method where power
723     relationships exist.
724
725L8   ANSWER 47 OF 404  INSPEC  COPYRIGHT 1997 IEE
726AN   94:4837619  INSPEC     DN  B9501-8230-017
727TI   Environmentally constrained economic dispatch using the LaGrangian
728     ***relaxation***     ***method***  .
729AU   El-Keib, A.A.; Ma, H. (Alabama Univ., Tuscaloosa, AL, USA); Hart,
730     J.L.
731SO   IEEE Transactions on Power Systems (Nov. 1994) vol.9, no.4,
732     p.1723-9. 18 refs.
733     Price: CCCC 0885-8950/94/$04.00
734     CODEN: ITPSEG  ISSN: 0885-8950
735DT   Journal
736TC   Theoretical
737CY   United States
738LA   English
739AB   This paper presents a general formulation of the environmentally
740     constrained economic dispatch (ECED) problem based on the
741     requirements of Clean Air Act Amendments of 1990 and others which
742     may be imposed by local air quality regulations. The formulation
743     considers multiple NOx constraints and incorporates the utilization
744     of the affected units (those named in the legislation) along with
745     SO2 constraints. It also proposes a new algorithm to solve the
746     problem for large power systems. This algorithm has the ability to
747     handle a large number of various types of linear and nonlinear
748     environmental constraints. It is reliable, and viable for both
749     offline and online applications. Test results on a large size power
750     system demonstrate the possible savings which can be realized by
751     using the algorithm. Details of the problem formulation and the
752     solution technique are given in the paper.
753
754L8   ANSWER 50 OF 404  INSPEC  COPYRIGHT 1997 IEE
755AN   94:4806786  INSPEC     DN  A9424-3325-009
756TI   Constant-  ***relaxation***     ***methods***   for diffusion
757     measurements in the fringe field of superconducting magnets.
758AU   Demco, D.E.; Johansson, A.; Tegenfeldt, J. (Inst. of Chem., Uppsala
759     Univ., Sweden)
760SO   Journal of Magnetic Resonance, Series A (Oct. 1994) vol.110, no.2,
761     p.183-93. 38 refs.
762     Price: CCCC 1064-1858/94/$6.00
763     CODEN: JMRAE2  ISSN: 1064-1858
764DT   Journal
765TC   Experimental
766CY   United States
767LA   English
768AB   A number of new NMR methods have been introduced for measuring
769     molecular self-diffusion coefficients in the fringe field of
770     superconducting magnets, avoiding the determination of longitudinal
771     and transverse magnetization relaxation rates. Constant-relaxation
772     methods based on the stimulated-echo product signals allow the
773     determination of both constant and time-dependent diffusion
774     coefficients. A density-operator formalism taking into account
775     phenomenologically the effect of relaxation and diffusion encoding
776     on the Liouville coordinates has been used to introduce and
777     characterize an inhomogeneous mixed echo. This echo corresponds to a
778     spatial and temporal superposition of a conventional spin echo and a
779     stimulated echo. The mixed echo is generated by the action of a
780     pulse sequence based on a stimulated-echo three-pulse sequence with
781     an insertion of a Carr-Purcell-like pulse sequence in the last pulse
782     interval. A constant relaxation method using a Carr-Purcell
783     mixed-echo pulse sequence has been developed. It has proved to be
784     advantageous when T2 is not very small compared to T1. The
785     performance and limitations of these methods are discussed and
786     demonstrated experimentally.
787
788L8   ANSWER 51 OF 404  INSPEC  COPYRIGHT 1997 IEE
789AN   94:4766926  INSPEC     DN  C9411-1250B-003
790TI   Recognition of handwritten Chinese characters by modified
791     ***relaxation***     ***methods***  .
792AU   An-Bang Wang; Kuo-Chin Fan (Inst. of Comput. Sci. & Electron. Eng.,
793     Nat. Central Univ., Chung-Li, Taiwan); Huang, J.S.
794SO   Image and Vision Computing (Oct. 1994) vol.12, no.8, p.509-22. 26
795     refs.
796     Price: CCCC 0262-8856/94/08/0509-14$10.00
797     CODEN: IVCODK  ISSN: 0262-8856
798DT   Journal
799TC   Practical; Theoretical
800CY   United Kingdom
801LA   English
802AB   We propose a novel stroke segmentation method and two modified
803     relaxation methods with which to recognize handwritten Chinese
804     characters. The new stroke segmentation method is based on thinning
805     and quadratic equation fit. After stroke segmentation and size
806     normalization, redundant strokes are detected and deleted. With the
807     deletion of redundant strokes, only prominent strokes that must
808     appear in the writing of a character are stored in the database,
809     greatly decreasing the matching time and complexity. The features of
810     each stroke are then extracted. Using the features of a character,
811     two modified relaxation matching methods are introduced to recognize
812     the unknown input character. After relaxation matching, certain
813     rules are devised to detect certain distorted characters, and also
814     to resolve ambiguity when it happens. Some of these distorted
815     characters are reconstructed and their feature vector lists are
816     modified to reflect the change. It is then sent back to the feedback
817     relaxation matching process once again. Experiments are conducted on
818     300 constrained handwritten characters written by two people; 13
819     similar characters and 42 distorted characters are also tested to
820     verify the validity of the approach. The success rate for stroke
821     segmentation is 93.3%. Two proposed matching methods are also
822     efficient and suitable for stroke-based Chinese character
823     recognition. The overall recognition rate is 98.7%, without using
824     Rules 2-5 and without considering the abnormal connection and
825     intersection of strokes.
826
827L8   ANSWER 58 OF 404  INSPEC  COPYRIGHT 1997 IEE
828AN   94:4617645  INSPEC     DN  B9404-6140C-253; C9404-1250-153
829TI   Finding edge in images: a hierarchical   ***relaxation***
830     ***method***  .
831AU   Dingding Chang; Hashimoto, S. (Sch. of Sci. & Eng., Waseda Univ.,
832     Tokyo, Japan)
833SO   Transactions of the Society of Instrument and Control Engineers
834     (1993) vol.29, no.12, p.1379-87. 15 refs.
835     CODEN: TSICA9  ISSN: 0453-4654
836DT   Journal
837TC   Theoretical
838CY   Japan
839LA   English
840AB   Edge features can be used in the scene analysis and computer vision.
841     In this paper, we present a hierarchical relaxation method for
842     detecting edge features in images. The relaxation processes are
843     performed on the pyramid, which is a hierarchical representation
844     about the image. Using multiresolution information about the image,
845     we can change the weighted coefficients by considering the processed
846     results at high hierarchy as a measurement of the local edge
847     features in the image, satisfactory detection can be obtained in all
848     the parts of the image, and convergence speed of the relaxation
849     processes can be improved greatly. This method has the advantage of
850     detection of complete border of the objects in the image.
851
852L8   ANSWER 66 OF 404  INSPEC  COPYRIGHT 1997 IEE
853AN   93:4531812  INSPEC     DN  A9401-8715M-011; C9401-7320-044
854TI   Divide-and-conquer, pattern matching, and   ***relaxation***
855     ***methods***   in interpretation of 2-D NMR spectra of
856     polypeptides.
857AU   Von-Wun Soo (Dept. of Comput. Sci. & Nat. Tsing Hua Univ., Hsin-Chu,
858     Taiwan); Jan-Fu Hwang; Tung-Bo Chen; Chin Yu
859SO   Journal of Computational Chemistry (Oct. 1993) vol.14, no.10,
860     p.1164-71. 22 refs.
861     Price: CCCC 0192-8651/93/101164-08
862     CODEN: JCCHDD  ISSN: 0192-8651
863DT   Journal
864TC   Practical; Theoretical
865CY   United States
866LA   English
867AB   One task in the interpretation of the 2-D nuclear magnetic resonance
868     (NMR) spectrum is to assign its signal patterns to their
869     corresponding amino acids in proteins or polypeptides. To carry out
870     this task of interpretation, one requires sufficient chemical
871     knowledge and expertise to reason from a set of highly noisy data.
872     The authors present a system called RUBIDIUM (a Rule-Based
873     Identification in 2-D NMR Spectrum) to formulate the expertise and
874     automate the process of interpretation. Given a protein or
875     polypeptide with a known amino acid sequence and the 2-D NMR spectra
876     (both COSY and NOESY), RUBIDIUM yields plausible assignments of
877     lines that account for most signals observed in the spectrum and
878     conform to prior chemical knowledge. Rules of pattern matching are
879     used to detect plausible signal patterns. The expertise of the
880     sequence-specific assignment task is formulated to assign a signal
881     pattern to amino acids. To cope with ambiguities and noise, RUBIDIUM
882     adopts various low-level data preprocessing techniques, the strategy
883     of divide and conquer, and the relaxation technique to decrease the
884     complexity and recover from overconstrained conditions. The
885     polypeptides oxytocin and vasopressin are used to illustrate the
886     performance of RUBIDIUM.
887
888L8   ANSWER 69 OF 404  INSPEC  COPYRIGHT 1997 IEE
889AN   93:4510863  INSPEC     DN  A9323-0720-002
890TI   Temperature dependence measurements of thermal parameters of solid
891     samples by the   ***relaxation***     ***method***  .
892AU   Budke, O.; Dieska, P. (Dept. of Phys., Slovak Tech. Univ.,
893     Bratislava, Slovakia)
894SO   International Journal of Heat and Mass Transfer (Oct. 1993) vol.36,
895     no.15, p.3869-72. 7 refs.
896     Price: CCCC 0017-9310/93/$6.00+0.00
897     CODEN: IJHMAK  ISSN: 0017-9310
898DT   Journal
899TC   Theoretical
900CY   United Kingdom
901LA   English
902AB   A generalization of the relaxation method (Budke and Dieska, 1985)
903     has been elaborated. While an application of the relaxation method
904     requires the sample holder temperature to be constant in time, this
905     generalized version admits a polynomial change of the sample holder
906     temperature. Such a temperature course is a very common and
907     realistic one at temperature dependence measurements of thermal
908     parameters.
909
910L8   ANSWER 71 OF 404  INSPEC  COPYRIGHT 1997 IEE
911AN   93:4476853  INSPEC     DN  B9310-1160-003
912TI   Use of a Laplace-transform   ***relaxation***     ***method***   for
913     the analysis of nonlinear electric circuits.
914AU   Ichikawa, S.; Tada, H. (Fac. of Eng., Kyoto Univ., Japan)
915SO   Electronics and Communications in Japan, Part 3 (Fundamental
916     Electronic Science) (Dec. 1992) vol.75, no.12, p.11-20. 5 refs.
917     Price: CCCC 1042-0967/92/0012-0011
918     CODEN: ECJSER  ISSN: 1042-0967
919DT   Journal
920TC   Theoretical
921CY   United States
922LA   English
923AB   The relaxation method is suitable for analysis of large-scale
924     circuits such as those simulating VLSI circuits. Complex frequency
925     domain analysis by means of the Laplace transform is carried out.
926     Semiconducting elements such as transistors of the VLSI circuits
927     exhibit nonlinear characteristics. Thus, the differential equations
928     to be used in the relaxation method must be nonlinear. In some
929     cases, the properties of nonlinear elements are given not by
930     analytic functions but by a series of discrete numerical values such
931     as observed data. To express the nonlinearity of these elements,
932     multidimensional interpolation formulas are used and practical
933     computer algorithms for solving them are derived. The analysis of
934     the conditions of convergence of the relaxation method shows that
935     the proposed algorithm is applicable to circuits which operate in
936     both stable and unstable domains, such as oscillators.
937
938L8   ANSWER 78 OF 404  INSPEC  COPYRIGHT 1997 IEE
939AN   93:4369351  INSPEC     DN  B9305-8110D-001
940TI   An application of the Lagrangean   ***relaxation***     ***method***
941     to unit commitment scheduling in a power generation system with
942     pumped-storage units.
943AU   Kim, S. (Dept. of Manage. Sci. & Technol. Taejon, South Korea);
944     Rhee, M.
945SO   Computers & Industrial Engineering (Jan. 1993) vol.24, no.1,
946     p.69-79. 27 refs.
947     Price: CCCC 0360-8352/93/$6.00+0.00
948     CODEN: CINDDL  ISSN: 0360-8352
949DT   Journal
950TC   Theoretical
951CY   United Kingdom
952LA   English
953AB   The Lagrangean relaxation method is applied to the unit commitment
954     problem of a power generation system with pumped-storage units. The
955     shortest path algorithm is used for the subproblem for each thermal
956     unit and the minimal cost flow algorithm is used for each
957     pumped-storage unit. A method for finding a better feasible solution
958     from a solution of a relaxed problem is presented. A real Korean
959     power generation system with 39 thermal units and one pumped-storage
960     unit is tested. The authors considered 168 planning hours and were
961     able to find a near optimal solution (within 0.5% of optimal)
962     consuming a reasonable amount of CPU time.
963
964L8   ANSWER 88 OF 404  INSPEC  COPYRIGHT 1997 IEE
965AN   92:4276811  INSPEC     DN  A9224-4740-002
966TI   Iterative methods for stationary solutions to the steady-state
967     compressible Navier-Stokes equations.
968AU   Sjogreen, B. (Dept. of Sci. Comput., Uppsala Univ., Sweden)
969SO   Computers & Fluids (Oct. 1992) vol.21, no.4, p.627-45. 15 refs.
970     Price: CCCC 0045-7930/92/$5.00+0.00
971     CODEN: CPFLBI  ISSN: 0045-7930
972DT   Journal
973TC   Theoretical
974CY   United Kingdom
975LA   English
976AB   Numerical experiments are presented for the solution of the
977     steady-state compressible Navier-Stokes equations. One test problem
978     is fixed supersonic flow past a double ellipse, and the various
979     solution methods studied. The problem is discretized using Osher's
980     scheme, first- and second-order accurate. The fastest convergence to
981     steady state is obtained using Newton's method. Simplifications of
982     Newton's method based on domain decomposition are shown to perform
983     well, whereas line relaxation methods meet with difficulties.
984
985L8   ANSWER 96 OF 404  INSPEC  COPYRIGHT 1997 IEE
986AN   92:4185303  INSPEC     DN  A9216-4110D-010; B9208-5120-012
987TI   The use of a   ***relaxation***     ***method***   to calculate the
988     3D magnetic field contribution of an iron yoke.
989AU   Caspi, S.; Helm, M.; Laslett, L.J. (Lawrence Berkeley Lab., CA, USA)
990SO   IEEE Transactions on Magnetics (March 1992) vol.28, no.2, p.1096-8.
991     2 refs.
992     Price: CCCC 0018-9464/92/$03.00
993     CODEN: IEMGAQ  ISSN: 0018-9464
994     Conference: Computation of Electromagnetic Fields (COMPUMAG).
995     Sorrento, Italy, 7-11 July 1991
996     Sponsor(s): IEEE
997DT   Conference Article; Journal
998TC   Theoretical
999CY   United States
1000LA   English
1001AB   A computational procedure has been developed for calculating the 3-D
1002     field produced by an axisymmetric iron yoke of high permeability in
1003     the presence of a system of conductors. The procedure is
1004     particularly applicable to the end regions of multipole magnets of
1005     the sort used in particle accelerators. The field produced by the
1006     conductors is calculated using the Biot-Savart law. If one solves
1007     the appropriate individual differential equations for specified
1008     scalar potential functions throughout the iron-free region, with the
1009     proper applied boundary condition for the scalar potential of each
1010     harmonic number, one will achieve upon summation the appropriate
1011     potential function to describe the field contribution of the
1012     surrounding high-permeability iron.
1013
1014L8   ANSWER 99 OF 404  INSPEC  COPYRIGHT 1997 IEE
1015AN   92:4152884  INSPEC     DN  A9212-4730-015
1016TI   Flow of a viscous fluid past a flexible membrane at low Reynolds
1017     numbers.
1018AU   Yamamoto, K.; Okada, M.; Kameyama, J. (Dept. of Mech. Eng., Fac. of
1019     Eng., Okayama Univ., Japan)
1020SO   Fluid Dynamics Research (April 1992) vol.9, no.5-6, p.289-99. 13
1021     refs.
1022     Price: CCCC 0169-5983/92/$3.75
1023     CODEN: FDRSEH  ISSN: 0169-5983
1024DT   Journal
1025TC   Theoretical
1026CY   Netherlands
1027LA   English
1028AB   The numerical calculation of a steady two-dimensional viscous flow
1029     past a flexible membrane is treated. Both edges of the membrane are
1030     fixed in the flow and its chord is set normal to the flow. The
1031     Navier-Stokes equation in terms of the stream function and the
1032     vorticity is transformed to the body fitted coordinate system. The
1033     numerical calculations, based on a finite difference method and
1034     relaxation method, are carried out for several values of the
1035     membranes tension for cases when the Reynolds numbers are 5, 10 and
1036     20. It is found that two different shapes of the membranes are
1037     possible at a given value of tension and Reynolds number: one with a
1038     small deformation, and the other with a large deformation. Two
1039     vortices appear in the concave region of the membrane if its
1040     deformation increases beyond a certain extent.
1041
1042L8   ANSWER 101 OF 404  INSPEC  COPYRIGHT 1997 IEE
1043AN   92:4140055  INSPEC     DN  A9211-4740K-003
1044TI   An improved upwind finite volume   ***relaxation***     ***method***
1045     for high speed viscous flows.
1046AU   Taylor, A.C., III (Dept. of Mech. Eng. & Mech., Old Dominion Univ.,
1047     Norfolk, VA, USA); Wing-fai Ng; Walters, R.W.
1048SO   Journal of Computational Physics (March 1992) vol.99, no.1,
1049     p.159-68. 22 refs.
1050     Price: CCCC 0021-9991/92/$3.00
1051     CODEN: JCTPAH  ISSN: 0021-9991
1052DT   Journal
1053TC   Theoretical
1054CY   United States
1055LA   English
1056AB   An improved upwind relaxation algorithm for the Navier-Stokes
1057     equations is presented, and results are given from the application
1058     of the method to two test problems, including (1) a shock/boundary
1059     layer interaction on a flat plate (Minfinity =2.0) and (2) a
1060     high-speed inlet (Minfinity =5.0). The technique is restricted to
1061     high-speed (i.e., supersonic/hypersonic) viscous flows. The new
1062     algorithm depends on a partitioning of the global domain into
1063     regions or sub-domains, where a relatively thin 'elliptic' region is
1064     identified near each solid wall boundary, and the remainder of the
1065     flowfield is identified to be a single larger 'hyperbolic' (i.e.,
1066     hyperbolic/parabolic in the streamwise direction) region. A direct
1067     solution procedure by lower/upper factorization is applied to the
1068     elliptic region, the results of which are then coupled to a standard
1069     line Gauss-Seidel relaxation sweep across the entire domain in the
1070     primary flow direction.
1071
1072L8   ANSWER 125 OF 404  INSPEC  COPYRIGHT 1997 IEE
1073AN   91:3784657  INSPEC     DN  A91013094
1074TI   A new approach to the borehole temperature   ***relaxation***
1075     ***method***  .
1076AU   Wilhelm, H. (Geophys. Inst., Karlsruhe Univ., West Germany)
1077SO   Geophysical Journal International (Nov. 1990) vol.103, no.2,
1078     p.469-81. 20 refs.
1079     ISSN: 0956-540X
1080DT   Journal
1081TC   Practical
1082CY   United Kingdom
1083LA   English
1084AB   The borehole temperature relaxation method is used to determine in
1085     situ thermal properties of rock by a thermal disturbance in an
1086     uncased borehole. The conventional application of this method is
1087     based on the assumption that the heat flow through the borehole wall
1088     is constant in time and only a function of depth during the
1089     disturbance phase. The new approach described in this paper offers a
1090     solution to the problem which does not refer directly to the thermal
1091     history during the disturbance phase. It is only based on
1092     temperature measurements during the relaxation phase when the
1093     disturbance fades away by conduction.
1094
1095L8   ANSWER 126 OF 404  INSPEC  COPYRIGHT 1997 IEE
1096AN   91:3778580  INSPEC     DN  A91013447; B91006258
1097TI   A   ***relaxation***     ***method***   for integral inversion
1098     applied to HF radar measurement of the ocean wave directional
1099     spectrum.
1100AU   Wyatt, L.R. (Dept. of Appl. & Comput. Math., Sheffield Univ., UK)
1101SO   International Journal of Remote Sensing (Aug. 1990) vol.11, no.8,
1102     p.1481-94. 22 refs.
1103     Price: CCCC 0143-1161/90/$3.00
1104     CODEN: IJSEDK  ISSN: 0143-1161
1105DT   Journal
1106TC   Practical; Theoretical
1107CY   United Kingdom
1108LA   English
1109
1110AB   The Chahine-Twomey relaxation method for inversion of the
1111     atmospheric radiative transfer equation is extended to provide an
1112     inverse solution to Barrick's equation describing second order
1113     scatter of high frequency (HF) radio waves from the ocean surface.
1114     The success of the method is demonstrated using synthesised radar
1115     Doppler spectra obtained by solving the direct problem with wave
1116     buoy directional spectrum measurements. Wave buoy measurements are
1117     limited in the range of directional characteristics that can be
1118     measured. The results presented suggest that HF radar is capable of
1119     providing a more general measurement of the directional spectrum.
1120
1121L8   ANSWER 136 OF 404  INSPEC  COPYRIGHT 1997 IEE
1122AN   90:3707065  INSPEC     DN  B90058649; C90056028
1123TI   Lagrangian   ***relaxation***     ***method***   for long-term unit
1124     commitment.
1125AU   Aoki, K.; Nara, K.; Satoh, T.; Itoh, M. (Dept. of Electr. & Syst.
1126     Eng., Hiroshima Univ., Japan)
1127SO   Power Systems and Power Plant Control 1989. Selected Papers from the
1128     IFAC Symposium
1129     Editor(s): Uhi Ahn
1130     Oxford, UK: Pergamon, 1990. p.123-8 of xvi+545 pp. 8 refs.
1131     Conference: Seoul, South Korea, 22-25 Aug 1989
1132     Sponsor(s): IFAC
1133     SBN: 0-08-037039-x
1134DT   Conference Article
1135TC   Theoretical
1136CY   United Kingdom
1137LA   English
1138AB   The authors present a new method for large-scale long-term unit
1139     commitment problem composed of three types of generating units. In
1140     the proposed unit commitment algorithm, the transmission loss is
1141     expressed as a quadratic function of generator outputs. In the
1142     demand increasing period in the morning, the planning period (one
1143     hour) should be divided into shorter periods such as a half an hour
1144     of fifteen minutes, and the ramping rate constraints should be
1145     imposed on generator outputs. Since the unit commitment problem
1146     (primal problem) is formulated as a large-scale mixed-integer
1147     programming problem, the Lagrangian relaxation method is employed to
1148     solve the problem efficiently.
1149
1150L8   ANSWER 137 OF 404  INSPEC  COPYRIGHT 1997 IEE
1151AN   90:3690713  INSPEC     DN  A90110333
1152TI   A method for solving three-dimensional viscous incompressible flows
1153     over slender bodies.
1154AU   Rosenfeld, M.; Israeli, M.; Wolfshtein, M. (Technion-Israel Inst. of
1155     Technol., Haifa, Israel)
1156SO   Journal of Computational Physics (June 1990) vol.88, no.2, p.255-83.
1157     21 refs.
1158     Price: CCCC 0021-9991/90/$3.00
1159     CODEN: JCTPAH  ISSN: 0021-9991
1160DT   Journal
1161TC   Theoretical
1162CY   United States
1163LA   English
1164AB   A marching iterative method for solving the three-dimensional
1165     incompressible and steady reduced Navier-Stokes equations in general
1166     orthogonal coordinate systems is described with the velocity and the
1167     pressure as dependent variables. The coupled set of the linearized
1168     finite-difference continuity and momentum equations are solved
1169     iteratively without any splitting or factorization errors. Each
1170     iteration consists of spatial marching from the upstream boundary to
1171     the downstream boundary. The discrete continuity and the two
1172     linearized crossflow momentum equations are satisfied at each
1173     marching step, even when the mainstream momentum equation is not
1174     converged. This solution procedure is equivalent to the solution of
1175     a single Poisson-like equation by the successive plane over
1176     relaxation method, while other available solution methods employ a
1177     Jacobi-type iterative scheme and therefore are less efficient.
1178     Several properties of the numerical method have been assessed
1179     through a series of tests performed on the laminar incompressible
1180     flow over prolate spheroids at intermediate incidence.
1181
1182L8   ANSWER 145 OF 404  INSPEC  COPYRIGHT 1997 IEE
1183AN   90:3632363  INSPEC     DN  B90034989; C90036810
1184TI   Availability of nonlinear   ***relaxation***     ***method***   for
1185     network analysis in the frequency domain.
1186AU   Kawashima, T.; Hagiwara, Y.; Asai, H. (Fac. of Eng., Shizuoka Univ.,
1187     Hamamatsu, Japan)
1188SO   Transactions of the Institute of Electronics, Information and
1189     Communication Engineers A (Dec. 1989) vol.J72A, no.12, p.2061-4. 4
1190     refs.
1191     CODEN: DJTAER  ISSN: 0913-5707
1192DT   Journal
1193TC   Theoretical; Experimental
1194CY   Japan
1195LA   Japanese
1196AB   Describes the availability of the nonlinear relaxation method for
1197     the solution of the determining equation given by the harmonic
1198     balance method for the frequency domain network analysis. The
1199     authors show that their algorithm saves CPU time and memory
1200     capacity, compared with the previous one.
1201
1202L8   ANSWER 155 OF 404  INSPEC  COPYRIGHT 1997 IEE
1203AN   90:3521419  INSPEC     DN  A90007776
1204TI   Application of thermal conductivity measurement by the
1205     ***relaxation***     ***method***   to crystallization kinetics of
1206     glassy As2Se3+1 mol.% In.
1207AU   Budke, O. (Dept. of Phys., Slovak Tech. Univ., Bratislava,
1208     Czechoslovakia); Svec, P.
1209SO   Physica Status Solidi A (16 Sept. 1989) vol.115, no.1, p.143-8. 13
1210     refs.
1211     CODEN: PSSABA  ISSN: 0031-8965
1212DT   Journal
1213TC   Experimental
1214CY   German Democratic Republic
1215LA   English
1216AB   The use of a recently developed nonstationary relaxation method of
1217     measuring thermal conductivity lambda of solids for monitoring
1218     crystallization kinetics of chalcogenide glasses has been analyzed.
1219     Time dependences lambda (t) upon crystallization have been obtained
1220     for isothermally annealed glasses As2Se3+1 mol.% In and the models
1221     for calculation of degree of crystallinity and evaluation of kinetic
1222     parameters of crystallization have been presented. Activation energy
1223     of crystallization, dimensionality of grain growth, and character of
1224     nucleation have been determined and the character of kinetic
1225     behavior has been discussed with consideration to possible
1226     autocatalysis of the process.
1227
1228=> d bib ab 156,158,170,174,177,200,211,212,221,224,225,230,240,243,246,258,278,281,283,285,290,300,304,306,314,317,327,328,340
1229
1230L8   ANSWER 156 OF 404  INSPEC  COPYRIGHT 1997 IEE
1231AN   89:3495790  INSPEC     DN  C89066511
1232TI   Solution of ordinary differential equations by waveform
1233     ***relaxation***     ***methods***  .
1234AU   Skelboe, S. (Dept. of Comput. Sci., Copenhagen Univ., Denmark)
1235SO   Aspects of Computation on Asynchronous Parallel Processors.
1236     Proceedings of the IFIP WG 2.5 Working Conference
1237     Editor(s): Wright, M.
1238     Amsterdam, Netherlands: North-Holland, 1989. p.225 of xi+271 pp. 0
1239     refs.
1240     Conference: Stanford, CA, USA, 22-26 Aug 1988
1241     Sponsor(s): Lawrence Livermore Nat. Lab.; Appl. Dynamics Int.;
1242     Stanford Univ
1243     ISBN: 0-444-87310-4
1244DT   Conference Article
1245TC   Theoretical
1246CY   Netherlands
1247LA   English
1248AB   Summary form only given, as follows. Waveform relaxation methods
1249     have proved efficient for the simulation of digital circuits using
1250     parallel computers. The author describes the method and reports on
1251     some of the research activities in this area including: application
1252     of the Gauss-Seidel method on parallel computers; stability
1253     properties of multirate integration formulas; and application of
1254     waveform relaxation to chemical process simulation.
1255
1256L8   ANSWER 158 OF 404  INSPEC  COPYRIGHT 1997 IEE
1257AN   89:3470743  INSPEC     DN  A89120540
1258TI   Numerical simulation of laminar incompressible viscous flow with
1259     extremely thin finite elements near the boundaries.
1260AU   D'Errico, M.A.
1261CS   Inst. Nat. Recherche Inf. Autom., Le Chesnay, France
1262NR   997
1263SO   Feb. 1989. 29 pp. 9 refs.
1264DT   Report
1265TC   Theoretical
1266CY   France
1267LA   French
1268AB   Viscous and lamina flow simulations are a source of problems at very
1269     high Reynolds number (Re) because of the boundary layers. Extremely
1270     thin discretization grids are needed in the perpendicular direction
1271     to the boundary layer and that produces a bad, or at least mediocre,
1272     conditioning of the linear systems. The author does not propose a
1273     new approximation in order to solve the problem, but a new way of
1274     resolving the linear system that arises from a finite element
1275     discretization of the nonstationary, incompressible and laminar
1276     Navier-Stokes equations. It is a simple idea that consists in
1277     changing the method of resolution in the boundary layer by a block
1278     relaxation method, adapted to physics, that imitates the method of
1279     resolution of the parabolic Prandtl boundary layer equations, while
1280     in the remaining domain a Cholesky or conjugate gradient method is
1281     employed. The global linear system is solved by blocks. The first
1282     corresponds to the boundary layer and wake; the second corresponds
1283     to the remaining domain. The author obtained better results on a
1284     wing profile at Reynolds number 100000 because this method seems not
1285     to propagate the round off errors due to the bad conditioning of the
1286     global linear system.
1287
1288L8   ANSWER 170 OF 404  INSPEC  COPYRIGHT 1997 IEE
1289AN   89:3321079  INSPEC     DN  A89029184; C89023068
1290TI   An adaptive dynamic   ***relaxation***     ***method***   for
1291     nonlinear problems.
1292AU   Shizhong Qiang (Dept. of Civil Eng., Southwestern Jiaotong Univ.,
1293     Emei, China)
1294SO   Computers and Structures (1988) vol.30, no.4, p.855-9. 9 refs.
1295     Price: CCCC 0045-7949/88/$3.00+0.00
1296     CODEN: CMSTCJ  ISSN: 0045-7949
1297DT   Journal
1298TC   Practical; Theoretical
1299CY   United Kingdom
1300LA   English
1301AB   Outlines the so-called dynamic relaxation method (DRM) which is
1302     found to be suitable in analyses of both geometrical and material
1303     nonlinearities using personal computers, and discuss an approach
1304     recently developed at SWJT for the automatic selection of iteration
1305     parameters in the DRM. The solution of a nonlinear truss-spring, the
1306     analysis of plate bending problems with large deflections under
1307     transverse loading, and the calculation of the ultimate load of
1308     plates under an in-plane load, using DRM with personal computers,
1309     are described.
1310
1311L8   ANSWER 174 OF 404  INSPEC  COPYRIGHT 1997 IEE
1312AN   89:3264002  INSPEC     DN  C89000789
1313TI   Lagrangian   ***relaxation***     ***methods***   solving the
1314     minimum fleet size multiple traveling salesman problem with time
1315     windows.
1316AU   Desrosiers, J.; Sauve, M.; Soumis, F. (Ecole des Hautes Etudes
1317     Commerciales, Montreal, Que., Canada)
1318SO   Management Science (Aug. 1988) vol.34, no.8, p.1005-22. 36 refs.
1319     Price: CCCC 0025-1909/88/3408-1005$01.25
1320     CODEN: MSCIAM  ISSN: 0025-1909
1321DT   Journal
1322TC   Theoretical
1323CY   United States
1324LA   English
1325AB   Considers the problem of finding the minimum number of vehicles
1326     required to visit once a set of nodes subject to time window
1327     constraints, for homogeneous fleet of vehicles located at a common
1328     depot. This problem can be formulated as a network flow problem with
1329     additional time constraints. The paper presents an optimal solution
1330     approach using the augmented Lagrangian method. Two Lagrangian
1331     relaxations are studied. In the first one, the time constraints are
1332     relaxed producing network subproblems which are easy to solve, but
1333     the bound obtained is weak. In the second relaxation, constraints
1334     requiring that each node be visited are relaxed producing shortest
1335     path subproblems with time window constraints and integrality
1336     conditions. The bound produced is always excellent. Numerical
1337     results for several actual school busing problems with up to 223
1338     nodes are discussed. Comparisons with a set partitioning formulation
1339     solved by column generation are given.
1340
1341L8   ANSWER 177 OF 404  INSPEC  COPYRIGHT 1997 IEE
1342AN   88:3235109  INSPEC     DN  B88064577
1343TI   Waveform   ***relaxation***     ***method***  .
1344AU   Urahama, K. (Fac. of Eng., Kyushu Univ., Fukuoka, Japan)
1345SO   Journal of the Institute of Electronics, Information and
1346     Communication Engineers (Feb. 1988) vol.71, no.2, p.145-7. 21 refs.
1347     CODEN: DJTGEB  ISSN: 0373-6121
1348DT   Journal
1349TC   Application; Experimental
1350CY   Japan
1351LA   Japanese
1352AB   The waveform relaxation method is a repetitive method of the
1353     initialization problem for the algebraic/differential equation
1354     system, which is similar to Picard's consecutive simulation, the
1355     method to apply the Newton method to differential equations, etc.
1356     The waveform relaxation method has lately been proved to be
1357     effective particularly for simulation of the MOS digital circuit.
1358     The multirate integration method is effective for transient analysis
1359     of the circuit. In the waveform relaxation method, multirate
1360     integration is carried in a natural form. The author describes the
1361     convergence of the waveform relaxation method in transient analysis
1362     of the MOS digital circuit and high-speed simulation techniques.
1363
1364L8   ANSWER 200 OF 404  INSPEC  COPYRIGHT 1997 IEE
1365AN   87:2965207  INSPEC     DN  A87113750
1366TI   Applications of exponential   ***relaxation***     ***methods***
1367     for corrosion studies and corrosion rate measurement.
1368AU   Lakshminarayanan, V. (Raman Res. Inst., Bangalore, India);
1369     Rajagopalan, S.R.
1370SO   Proceedings of the Indian Academy of Sciences, Chemical Sciences
1371     (Oct. 1986) vol.97, no.3-4, p.465-77. 6 refs.
1372     CODEN: PIAADM  ISSN: 0370-0089
1373DT   Journal
1374TC   Theoretical
1375CY   India
1376LA   English
1377AB   Investigations on the use of an exponential relaxation technique for
1378     studying corrosion systems are reported. The polarisation resistance
1379     and the double layer capacitance of corrosion systems can be
1380     obtained by the small amplitude exponential relaxation technique
1381     (SAERT). The rate of corrosion can be measured by the large
1382     amplitude exponential relaxation technique (LAERT). This technique
1383     yields an 'accelerated Tafel plot' only when the charging current is
1384     negligible, which is seldom so. Methods for correcting for double
1385     layer charging are described. Double layer capacitance as a function
1386     of potential is obtained from LAERT. Therefore it can be used for
1387     studies on inhibitors. The utility of LAERT for corrosion systems
1388     with only one of the conjugate reactions under activation control is
1389     established. The effect of series resistance (Re) is discussed and
1390     an in situ method for its determination is described. A procedure
1391     for correcting the experimental data for errors due to Re is given.
1392
1393L8   ANSWER 211 OF 404  INSPEC  COPYRIGHT 1997 IEE
1394AN   87:2860637  INSPEC     DN  A87051021
1395TI   Multiple grid and Osher's scheme for the efficient solution of the
1396     steady Euler equations.
1397AU   Hemker, P.W.; Spekreijse, S.P. (Centrum voor Wiskunde en Inf.,
1398     Amsterdam, Netherlands)
1399SO   Applied Numerical Mathematics (Dec. 1986) vol.2, no.6, p.475-93. 22
1400     refs.
1401     Price: CCCC 0168-9274/86/$3.50
1402     CODEN: ANMAEL  ISSN: 0168-9274
1403DT   Journal
1404TC   Theoretical; Experimental
1405CY   Netherlands
1406LA   English
1407AB   An iterative method is developed for the solution of the steady
1408     Euler equations for inviscid flow. The system of hyperbolic
1409     conservation laws is discretized by a finite-volume
1410     Osher-discretization. The iterative method is a multiple grid (FAS)
1411     iteration with symmetric Gauss-Seidel (SGS) as a relaxation method.
1412     Initial estimates are obtained by full multigrid (FMG). In the
1413     pointwise relaxation the equations are kept in block-coupled form
1414     and local linearization of the equations and the boundary conditions
1415     is considered. The efficient formulation of Osher's discretization
1416     of the 2-D nonisentropic steady Euler equations and its
1417     linearization is presented. The efficiency of FAS-SGS iteration is
1418     shown for a transonic model problem. It appears that, for the
1419     problem considered, the rate of convergence is almost independent of
1420     the grid size and that for all mesh sizes the discrete system is
1421     solved up to truncation error accuracy in only a few (2 or 3)
1422     iteration cycles.
1423
1424L8   ANSWER 212 OF 404  INSPEC  COPYRIGHT 1997 IEE
1425AN   87:2845023  INSPEC     DN  C87021805
1426TI   An introduction to   ***relaxation***     ***methods***  .
1427AU   Williams, G. (BYTE, Peterborough, NH, USA)
1428SO   BYTE (Jan. 1987) vol.12, no.1, p.111-14, 116, 118, 120, 122, 124. 0
1429     refs.
1430     CODEN: BYTEDJ  ISSN: 0360-5280
1431DT   Journal
1432TC   Theoretical
1433CY   United States
1434LA   English
1435AB   A numeric technique called the relaxation method is very useful in
1436     solving such matters as systems of simultaneous equations. The
1437     author concentrates on the solution of two-dimensional systems that
1438     can be described by Poisson's equation. He focuses on a special
1439     case, Laplace's equation.
1440
1441L8   ANSWER 221 OF 404  INSPEC  COPYRIGHT 1997 IEE
1442AN   86:2730070  INSPEC     DN  A86101541
1443TI   A direct   ***relaxation***     ***method***   for calculating
1444     eigenfunctions and eigenvalues of the Schrodinger equation on a
1445     grid.
1446AU   Kosloff, R. (Dept. of Phys. Chem., Hebrew Univ., Jerusalem, Israel);
1447     Tal-Ezer, H.
1448SO   Chemical Physics Letters (13 June 1986) vol.127, no.3, p.223-30. 23
1449     refs.
1450     Price: CCCC 0009-2614/86/$03.50
1451     CODEN: CHPLBC  ISSN: 0009-2614
1452DT   Journal
1453TC   Theoretical
1454CY   Netherlands
1455LA   English
1456AB   Eigenfunctions and eigenvalues of the Schrodinger equation are
1457     determined by propagating the Schrodinger equation in imaginary
1458     time. The method is based on representing the Hamiltonian operation
1459     on a grid. The kinetic energy is calculated by the Fourier method.
1460     The propagation operator is expanded in a Chebychev series. Excited
1461     states are obtained by filtering out the lower states. Comparative
1462     examples include: eigenfunctions and eigenvalues of the Morse
1463     oscillator, the Henon-Heiles system and weakly bound states of He on
1464     a Pt surface.
1465
1466L8   ANSWER 224 OF 404  INSPEC  COPYRIGHT 1997 IEE
1467AN   86:2667490  INSPEC     DN  A86063383
1468TI   A   ***relaxation***     ***method***   for steady Navier-Stokes
1469     equations, based on flux-vector splitting.
1470AU   Dick, E. (Dept. of Machinery, State Univ. of Ghent, Belgium)
1471SO   Numerical Methods in Laminar and Turbulent Flow. Proceedings of the
1472     Fourth International Conference
1473     Editor(s): Taylor, C.; Olson, M.D.; Gresho, P.M.; Habashi, W.G.
1474     Swansea, UK: Pineridge Press, 1985. p.527-38 vol.1 of 2 vol. 1851
1475     pp. 4 refs.
1476     Conference: Swansea, UK, 9-12 July 1985
1477     Sponsor(s): US Office Naval Res.
1478     ISBN: 0-906674-43-3
1479DT   Conference Article
1480TC   Theoretical
1481CY   United Kingdom
1482LA   English
1483AB   Using the example of Cauchy-Riemann equations, the flux-vector
1484     splitting method is illustrated for systems of first order
1485     equations. It is shown that for this linear elliptic system of
1486     equations, flux-vector splitting combined with upwind differencing
1487     results in discrete equations which can be solved by relaxation
1488     methods. It is shown how the same splitting can be used on the
1489     hybrid first order (subprincipal) part of the steady Navier-Stokes
1490     equations in primitive variable form. By the use of central
1491     difference discretisations on the second order (principal) part, the
1492     resulting set of discrete equations can be solved by relaxation
1493     methods. A computational example on a backward facing step problem
1494     is given.
1495
1496L8   ANSWER 225 OF 404  INSPEC  COPYRIGHT 1997 IEE
1497AN   86:2653230  INSPEC     DN  B86027038; C86025933
1498TI   Application of the   ***relaxation***     ***method***   to analysis
1499     of DC nonlinear networks.
1500AU   Tadeusiewicz, M. (Inst. of Principles of Electr. Eng., Tech. Univ.,
1501     Lodz, Poland)
1502SO   Modelling, Simulation & Control A (1984) vol.1, no.3, p.9-16. 9
1503     refs.
1504     CODEN: MSCAE2  ISSN: 0761-2508
1505DT   Journal
1506TC   Theoretical
1507CY   France
1508LA   English
1509AB   The application of the relaxation method to computer-aided analysis
1510     of nonlinear networks is discussed. For a certain class of DC
1511     nonlinear networks, the sufficient conditions under which the
1512     relaxation sequence is convergent to a unique solution for each
1513     initial guess are formulated. The diode-transistor networks are
1514     discussed and a numerical example is demonstrated.
1515
1516L8   ANSWER 230 OF 404  INSPEC  COPYRIGHT 1997 IEE
1517AN   86:2588411  INSPEC     DN  B86007690; C86008145
1518TI   A block   ***relaxation***     ***method***   for the
1519     three-dimensional Poisson equation.
1520AU   Huang Duo (Comput. Center, Acad. Sinica, China)
1521SO   Mathematica Numerica Sinica (1985) vol.7, no.3, p.332-6. 6 refs.
1522     CODEN: JSUXDP  ISSN: 0254-7791
1523DT   Journal
1524TC   Theoretical
1525CY   China
1526LA   Chinese
1527AB   A block relaxation method is proposed for the three-dimensional
1528     Poisson equation on the basis of a cyclic reduction method. Its
1529     convergence is analysed and a formula for determining the optimum
1530     relaxation factor is given.
1531
1532L8   ANSWER 240 OF 404  INSPEC  COPYRIGHT 1997 IEE
1533AN   85:2475705  INSPEC     DN  C85031615
1534TI   A Lagrangean-  ***relaxation***     ***method***   for the
1535     constrained assignment problem.
1536AU   Aggarwal, V. (Dept. of Manage. & Syst., Washington State Univ.,
1537     Pullman, WA, USA)
1538SO   Computers & Operations Research (1985) vol.12, no.1, p.97-106. 14
1539     refs.
1540     Price: CCCC 0305-0548/85$3.00+.00
1541     CODEN: CMORAP  ISSN: 0305-0548
1542DT   Journal
1543TC   Theoretical
1544CY   United Kingdom
1545LA   English
1546AB   This paper addresses the problem of finding a minimal weight
1547     assignment subject to a knapsack-type constraint. It develops a
1548     two-stage algorithm based on the Lagrangean-relaxation formulation
1549     of this problem. The first stage obtains the optimal Lagrange
1550     multiplier in a polynomial effort by generating the efficient
1551     frontier in a bicriteria framework. The second stage uses this
1552     information to zero in on the optimal solution in a relatively lower
1553     depth of search in the ordered-generation-of-assignments framework.
1554     The algorithm is supported by a numerical example and its advantages
1555     over other schemes are shown.
1556
1557L8   ANSWER 243 OF 404  INSPEC  COPYRIGHT 1997 IEE
1558AN   85:2448430  INSPEC     DN  A85058371
1559TI   Measurement of thermal parameters of small plane-parallel samples by
1560     a   ***relaxation***     ***method***  .
1561AU   Budke, O.; Dieska, P. (Dept. of Phy., Electrotech., Slovak Tech.
1562     Univ., Bratislava, Czechoslovakia)
1563SO   Acta Physica Slovaca (1985) vol.35, no.1, p.27-39. 2 refs.
1564     CODEN: APSVCO  ISSN: 0323-0465
1565DT   Journal
1566TC   Experimental
1567CY   Czechoslovakia
1568LA   English
1569AB   A non-stationary method for measuring thermal conductivity and
1570     thermal diffusivity of small plane-parallel samples (5*5*1 mm3) is
1571     developed. The principle of the method consists in measuring the
1572     time dependence of the temperature of a plane heat source heated by
1573     a constant power during a finite time interval. The heat capacity of
1574     the source is taken into account in the formulation of the problem.
1575     A model is proposed to estimate a parasitical heat flow through the
1576     lead-in wires of the heat source and the wires of the thermocouple
1577     used for measuring the temperature of the heat source. The method is
1578     suitable for a quick measuring of the temperature dependence of
1579     thermal parameters.
1580
1581L8   ANSWER 246 OF 404  INSPEC  COPYRIGHT 1997 IEE
1582AN   85:2404651  INSPEC     DN  C85012851
1583TI   A case for   ***relaxation***     ***methods***  .
1584AU   Kumar, G.S. (Sch. of Bus. Adm., Tennessee Univ., Martin, TN, USA)
1585SO   Proceedings of the 16th Annual Meeting of the American Institute for
1586     Decision Sciences
1587     Atlanta, GA, USA: American Inst. Decision Sci, 1984. p.682 of
1588     xvii+817 pp. Microfiche
1589     Conference: Toronto, Ont., Canada, 5-7 Nov 1984
1590DT   Conference Article
1591TC   Theoretical
1592CY   United States
1593LA   English
1594AB   Summary form only given, as follows. Many practical problems can be
1595     reduced to finding a point of a polyhedron. Relaxation methods solve
1596     the problem by successively finding points of polyhedrons containing
1597     the polyhedron of interest. The authors discuss the advantages of
1598     using iterative methods for large scale linear programs and survey
1599     some of the relaxation methods.
1600
1601L8   ANSWER 258 OF 404  INSPEC  COPYRIGHT 1997 IEE
1602AN   84:2178142  INSPEC     DN  A84013606
1603TI     ***Relaxation***     ***methods***   in investigations of
1604     transport processes.
1605AU   Buevich, Yu.A.; Yasnikov, G.P.
1606SO   Journal of Engineering Physics (March 1983) vol.44, no.3, p.340-53.
1607     131 refs.
1608     CODEN: JEPHAL  ISSN: 0022-0841
1609     Translation of: Inzhenerno-Fizicheskii Zhurnal (March 1983) vol.44,
1610     no.3, p.489-504. 131 refs.
1611     CODEN: INFZA9  ISSN: 0021-0285
1612DT   Journal; Translation Abstracted
1613TC   Theoretical
1614CY   Byelorussian SSR; USSR; United States
1615LA   English
1616AB   In spite of the large variety of existing transport processes they
1617     all have one fundamental property in common: these processes strive
1618     to neutralize external actions that take a system out of the
1619     equilibrium state. Any physical system has some inertia, related to
1620     internal processes specific to the system. Such processes are
1621     activated with breakdown of equilibrium and are characterized by
1622     their own internal variables. The approach of the system to
1623     equilibrium, which results in the observed transport processes, can
1624     be viewed as a collection of relaxation processes for these internal
1625     variables. The authors limit their analysis to the relaxation
1626     formalism of nonequilibrium thermodynamics, and they briefly analyze
1627     its relation to the methods of the theory of dynamic systems.
1628
1629L8   ANSWER 278 OF 404  INSPEC  COPYRIGHT 1997 IEE
1630AN   81:1752235  INSPEC     DN  B81044945; C81031168
1631TI   Resolution of the bilinear programming problem via a
1632     ***relaxation***     ***method***  .
1633AU   Chagoya-Guzman, A.; Fonlupt, J. (Lab. d'Informatique et de Math.
1634     Appl., Grenoble, France)
1635SO   Methods of Operations Research (1981) vol.40, p.59-62. 5 refs.
1636     CODEN: MEORDE  ISSN: 0078-5318
1637     Conference: Vth Symposium on Operations Research. Cologne, West
1638     Germany, 25-27 Aug 1980
1639DT   Conference Article; Journal
1640TC   Theoretical
1641CY   Germany, Federal Republic of
1642LA   English
1643AB   The bilinear programming problem (BPP) may be defined in the
1644     following form: v=min(v(x,y)=<pT,x>+<qT,y>+<xT,Cy>; x epsilon K1, y
1645     epsilon K2) where K1=(x>or=0; Ax=e) K2=(y>or=0; By=f) are two
1646     polytopes. The goal is to find the global optimum (x,y) and the
1647     value v=v(x,y) of (BPP). Special methods for nonconvex problems are
1648     needed.
1649
1650L8   ANSWER 281 OF 404  INSPEC  COPYRIGHT 1997 IEE
1651AN   81:1722606  INSPEC     DN  C81024877
1652TI   The Lagrangian   ***relaxation***     ***method***   for solving
1653     integer programming problems.
1654AU   Fisher, M.L. (Univ. of Pennsylvania , Philadelphia, PA, USA)
1655SO   Management Science (Jan. 1981) vol.27, no.1, p.1-18. 46 refs.
1656     CODEN: MSCIAM  ISSN: 0025-1909
1657DT   Journal
1658TC   Theoretical
1659CY   United States
1660LA   English
1661AB   Many hard integer programming problems can be viewed as easy
1662     problems complicated by a relatively small set of side constraints.
1663     Dualizing the side constraints produces a Lagrangian problem that is
1664     easy to solve and whose optimal value is a lower bound (for
1665     minimization problems) on the optimal of the original problem. The
1666     Lagrangian problem can thus be used in place of a linear programming
1667     relaxation to provide bounds in a branch and bound algorithm. This
1668     approach has led to dramatically improved algorithms for a number of
1669     important problems in the areas of routing, location, scheduling,
1670     assignment and set covering. The paper is a review of Lagrangian
1671     relaxation based on what has been learned in the last decade.
1672
1673L8   ANSWER 283 OF 404  INSPEC  COPYRIGHT 1997 IEE
1674AN   81:1694822  INSPEC     DN  B81029190
1675TI     ***Relaxation***     ***methods***   in digital image
1676     segmentation.
1677AU   Gerbrands, J.J. (Tech. Hogeschool Delft, Delft, Netherlands)
1678SO   Tijdschrift van het Nederlands Elektronica- en Radiogenootschap
1679     (1981) vol.46, no.1, p.11-16. 11 refs.
1680     CODEN: NERTA9  ISSN: 0374-3853
1681DT   Journal
1682TC   Theoretical
1683CY   Netherlands
1684LA   Dutch
1685AB   Probabilistic relaxation label procedures are discussed in the
1686     context of low-level image segmentation. Two examples are discussed
1687     in detail. The first is the reinforcement of edges as proposed by
1688     Schachter et al. (1977). The second example deals with image
1689     segmentation by clustering in the feature domain followed by
1690     relaxation in the spatial domain. The features used are gray-level
1691     and texture.
1692
1693L8   ANSWER 285 OF 404  INSPEC  COPYRIGHT 1997 IEE
1694AN   81:1673539  INSPEC     DN  A81042064
1695TI   On a   ***relaxation***     ***method***   for calculating two
1696     dimensional transonic fields of flow.
1697AU   Kozel, K.; Polasek, J.; Vavrincova, M. (Tech. Univ. Prague, Prague,
1698     Czechoslovakia)
1699SO   Zeitschrift fur Angewandte Mathematik und Mechanik (1980) vol.60,
1700     no.7, p.204-6. 6 refs.
1701     CODEN: ZAMMAX  ISSN: 0044-2267
1702DT   Journal
1703TC   Theoretical
1704CY   German Democratic Republic
1705LA   German
1706AB   Applies the relaxation method to the calculation of the two
1707     dimensional steady state transonic flow fields during flow round
1708     thin profiled cascades and round a thin single profile between two
1709     parallel walls. After formulating the differential equations for
1710     both instances and stating the difference problems involved, it is
1711     shown that the results obtained were in good agreement, in the first
1712     instance, with interferograms and, in the second, with
1713     experimentally obtained results.
1714
1715L8   ANSWER 290 OF 404  INSPEC  COPYRIGHT 1997 IEE
1716AN   81:1613678  INSPEC     DN  C81000582
1717TI   A product rule   ***relaxation***     ***method***  .
1718AU   Kirby, R.L. (Computer Sci. Center, Univ. of Maryland, College Park,
1719     MD, USA)
1720SO   Computer Graphics and Image Processing (June 1980) vol.13, no.2,
1721     p.158-89. 11 refs.
1722     CODEN: CGIPBG  ISSN: 0146-664X
1723DT   Journal
1724TC   Theoretical
1725CY   United States
1726LA   English
1727AB   Probabilistic relaxation estimates the probabilities of the
1728     potential labelings of the nodes of a multigraph. The constraints
1729     used are limited to those nodes which are connected by arcs in this
1730     multigraph. A multiplicative formula called the product rule is
1731     introduced for combining the estimates of several nodes. This
1732     formula is then shown to correspond to a discrete relaxation
1733     operator. Experiments were made using the product rule to break a
1734     substitution cipher and to disambiguate the semantic labeling of the
1735     pixels of a color image of a house. The experiments showed that in
1736     some applications, the product rule converges more rapidly to
1737     estimates that permit making reasonable decisions than did a
1738     previous formula using arithmetic averaging. The experiments also
1739     suggested ways to refine the relaxation formulas to produce more
1740     precise estimates.
1741
1742L8   ANSWER 300 OF 404  INSPEC  COPYRIGHT 1997 IEE
1743AN   79:1373449  INSPEC     DN  C79020046
1744TI     ***Relaxation***     ***methods***   in image processing and
1745     analysis.
1746AU   Rosenfeld, A. (Computer Sci. Center, Univ. of Maryland, College
1747     Park, MD, USA)
1748SO   Proceedings of the 4th International Joint Conference on Pattern
1749     Recognition
1750     Kyoto, Japan: Kyoto, Univ, 1978. p.181-5 of xxii+1166 pp. 12 refs.
1751     Conference: Kyoto, Japan, 7-10 Nov 1978
1752     Sponsor(s): Internat. Assoc. Pattern Recognition
1753DT   Conference Article
1754TC   Theoretical
1755CY   Japan
1756LA   English
1757AB   Describes a class of iterative, parallel processes known as
1758     relaxation methods, and reviews some of their uses in image
1759     processing and analysis, with emphasis on recent developments.
1760
1761L8   ANSWER 304 OF 404  INSPEC  COPYRIGHT 1997 IEE
1762AN   79:1296648  INSPEC     DN  A79011888
1763TI   The correct use of the dielectric   ***relaxation***
1764     ***method***   in studying dimensions, shape, and conformational
1765     transitions in proteins.
1766AU   Sedykh, N.V.; Fel'dman, Yu.D. (Kazan' Univ., Kazan', USSR)
1767SO   Colloid Journal of the USSR (July-Aug. 1977) vol.39, no.4, p.719-20.
1768     13 refs.
1769     CODEN: COJOA5  ISSN: 0010-1303
1770     Translation of: Kolloidnyi Zhurnal (July-Aug. 1977) vol.39, no.4,
1771     p.806-8. 13 refs.
1772     CODEN: KOZHAG  ISSN: 0023-2912
1773DT   Journal; Translation Abstracted
1774TC   Theoretical
1775CY   USSR; United States
1776LA   English
1777AB   An examination is made of the possibility of correct use of the
1778     dipole relaxation method in investigating the shapes, sizes, and
1779     confirmation of proteins in solution. Methods are given for taking
1780     into account the difficulties associated with problems of
1781     macroscopic viscosity, discreteness of the medium, and the selection
1782     of a bipolymer model. The sensitivity of the method to change in
1783     dimensions of the dipole-active axis of the macromolecule is
1784     evaluated.
1785
1786L8   ANSWER 306 OF 404  INSPEC  COPYRIGHT 1997 IEE
1787AN   78:1257228  INSPEC     DN  A78078977; B78046557
1788TI   Coherence   ***relaxation***     ***methods***   for holography.
1789AU   Leith, E.N. (Univ. of Michigan, Ann Arbor, MI, USA)
1790SO   Proceedings of the Society of Photo-Optical Instrumentation
1791     Engineers, vol.120. Three-Dimensional Imaging
1792     Editor(s): Benton, S.A.
1793     Bellingham, WA, USA: Soc. Photo-Optical Instrumentation Engr(s),
1794     1977. p.145-9 of vi+214 pp. 0 refs.
1795     Conference: San Diego, CA, USA, 25-26 Aug 1977
1796     Sponsor(s): Soc. Photo-Optical Instrumentation Engr(s)
1797     ISBN: 0-89252-147-3
1798DT   Conference Article
1799TC   Practical
1800CY   United States
1801LA   English
1802AB   Techniques for producing and receiving holograms in light of reduced
1803     coherence are described. Both coherent and incoherent methods are
1804     considered.
1805
1806L8   ANSWER 314 OF 404  INSPEC  COPYRIGHT 1997 IEE
1807AN   77:1110457  INSPEC     DN  A77080137
1808TI     ***Relaxation***     ***methods***   for time dependent
1809     conservation equations in fluid mechanics.
1810AU   Wirz, H.J. (von Karman Inst. for Fluid Dynamics, Rhode-St-Genese,
1811     Belgium)
1812SO   AGARD Lecture Series No.86 on Computational Fluid Dynamics
1813     Neuilly sur Seine, France: AGARD, 1977. p.4/1-49 of v+168 pp. 27
1814     refs.
1815     Conference: Rhode-Saint-Genese, Belgium, 19-23 March 1977
1816     Sponsor(s): AGARD
1817DT   Conference Article
1818TC   Theoretical
1819CY   France
1820LA   English
1821AB   The approximate discrete solution of the fundamental steady state
1822     conservation equations of classical physics and in particular fluid
1823     mechanics leads in general to large nonlinear systems of algebraic
1824     equations, which must be solved iteratively. Of predominant interest
1825     is, of course, the reliability of the discrete analogue of the basic
1826     conservation laws (numerical model) for finite mesh size. Due to the
1827     inherent limitations of available computers (speed, capacity) a
1828     second issue plays an equally important role namely the problem of
1829     efficiency of iterative methods. The acceleration of the convergence
1830     of these methods to solve stationary partial differential equations
1831     is the subject of relaxation.
1832
1833L8   ANSWER 317 OF 404  INSPEC  COPYRIGHT 1997 IEE
1834AN   77:1048606  INSPEC     DN  A77039760
1835TI   Gaussian   ***relaxation***     ***method***  . I. Homopolar
1836     tetrahedral solids.
1837AU   Mele, E.J.; Joannopoulos, J.D. (Dept. of Phys., MIT, Cambridge, MA,
1838     USA)
1839SO   Physical Review B (Solid State) (15 Jan. 1977) vol.15, no.2,
1840     p.901-8. 11 refs.
1841     CODEN: PLRBAQ  ISSN: 0556-2805
1842DT   Journal
1843TC   Theoretical
1844CY   United States
1845LA   English
1846AB   A method is developed for extending an empirical tight-binding
1847     theory to calculate the densities of state for very large but finite
1848     systems. A set of bond-centred analytic wave functions are derived
1849     for application of the method to the calculation of charge densities
1850     in crystalline Ge as a model homopolar tetrahedral solid.
1851
1852L8   ANSWER 327 OF 404  INSPEC  COPYRIGHT 1997 IEE
1853AN   76:878527  INSPEC     DN  A76027657
1854TI   On Chahine's   ***relaxation***     ***method***   for the radiative
1855     transfer equation.
1856AU   Barcilon, V. (Dept. of Geophys. Sci., Univ. of Chicago, Chicago, IL,
1857     USA)
1858SO   Journal of the Atmospheric Sciences (Aug. 1975) vol.32, no.8,
1859     p.1626-30. 11 refs.
1860     CODEN: JAHSAK  ISSN: 0022-4928
1861DT   Journal
1862TC   Practical; Theoretical
1863CY   United States
1864LA   English
1865AB   The iteration scheme proposed by Chahine for the solution of the
1866     radiative transfer equation is discussed in the context of the
1867     inverse problem for the thermal structure of the atmosphere.
1868     Sufficient conditions which insure the convergence of the iteration
1869     are given.
1870
1871L8   ANSWER 328 OF 404  INSPEC  COPYRIGHT 1997 IEE
1872AN   76:875651  INSPEC     DN  A76024138
1873TI   Measurement of the thermal properties of a metal using a
1874     ***relaxation***     ***method***  .
1875AU   Fox, J.N.; McMaster, R.H. (Dept. of Phys., Indiana Univ. of
1876     Pennsylvania, Indiana, PA, USA)
1877SO   American Journal of Physics (Dec. 1975) vol.43, no.12, p.1083-6. 7
1878     refs.
1879     CODEN: AJPIAS  ISSN: 0002-9505
1880DT   Journal
1881TC   Experimental
1882CY   United States
1883LA   English
1884AB   A dynamic method for determining the thermal conductivity and
1885     specific heat of metals in the range 273 to 373K is described. The
1886     necessary theory and experimental techniques for recording the
1887     change in temperature as a function of time are given.
1888
1889L8   ANSWER 340 OF 404  INSPEC  COPYRIGHT 1997 IEE
1890AN   75:812663  INSPEC     DN  A75069822
1891TI   Non-linear   ***relaxation***     ***methods***  . III.
1892     Current-controlled perturbations.
1893AU   Rangarajan, S.K. (Materials Sci. Div., Nat. Aeronautical Lab.,
1894     Bangalore, India)
1895SO   Journal of Electroanalytical Chemistry and Interfacial
1896     Electrochemistry (25 June 1975) vol.62, no.1, p.31-41. 5 refs.
1897     CODEN: JEIEBC  ISSN: 0022-0728
1898DT   Journal
1899TC   Theoretical
1900CY   Switzerland
1901LA   English
1902AB   For pt.II see ibid., vol.56, no.1, p.27 (1974). A unified theory is
1903     presented for the potential perturbations resulting from the
1904     disturbance of an electrode electrolyte interface system with an
1905     arbitrary current profile. A functional expression, valid for
1906     evaluating all orders of potential perturbation when a current of
1907     known profile is superimposed, is derived. Generalized expressions
1908     for distortion potential and rectification potential are given. The
1909     problems of iR drop and charging current compensation are also
1910     discussed.
1911
1912=> d bib ab 341-343,357,359,361,363,376,377,381,386,389,392,399,404,403,402
1913
1914L8   ANSWER 341 OF 404  INSPEC  COPYRIGHT 1997 IEE
1915AN   75:792706  INSPEC     DN  A75059938
1916TI   The simulation of skin temperature distributions by means of a
1917     ***relaxation***     ***method***   (applied to IR thermography).
1918AU   Vermey, G.F. (Dept. of Electrical Engng. Twente Univ. of Technol.,
1919     Enschede, Netherlands)
1920SO   Physics in Medicine and Biology (May 1975) vol.20, no.3, p.384-94.
1921     13 refs.
1922     CODEN: PHMBA7  ISSN: 0031-9155
1923DT   Journal
1924TC   Theoretical
1925CY   United Kingdom
1926LA   English
1927AB   To solve the differential equation for the heat in a two-layer,
1928     rectangular piece of skin tissue, a relaxation method, based on a
1929     finite difference technique, is used. The temperature distributions
1930     on the skin surface are calculated. The results are used to derive a
1931     criterion for the resolution for an infrared thermograph in a
1932     specific situation. A major limitation on the resolution in medical
1933     thermography is given. As an example of the power of the model, the
1934     sensitivity of the temperature profiles for variations of the layer
1935     thickness is determined.
1936
1937L8   ANSWER 342 OF 404  INSPEC  COPYRIGHT 1997 IEE
1938AN   75:790638  INSPEC     DN  A75057639
1939TI     ***Relaxation***     ***methods***   in fluid mechanics.
1940AU   Lomax, H.; Steger, J.L. (NASA, Moffett Field, CA, USA)
1941SO   Annual review of fluid mechanics. Vol.7
1942     Editor(s): Van Dyke, M.; Vincenti, G.
1943     Palo Alto, CA, USA: Annual Reviews, 1975. p.63-88 of ix+398 pp. 70
1944     refs.
1945     Price: $15.50
1946     ISBN: 0-8243-0707-0
1947DT   Book Article
1948TC   Bibliography; General Review
1949CY   United States
1950LA   English
1951AB   It is assumed that the numerical model is an accurate
1952     finite-difference representation of the physical problem for which
1953     it was constructed. An iterative solution of a coupled set of
1954     difference equations is considered and methods are considered that
1955     carry successive approximates to a state that is invariant with
1956     further iteration and independent of the initial guess. This defines
1957     a process of relaxation. The time-like aspect and basic principles
1958     of relaxation are presented.
1959
1960L8   ANSWER 343 OF 404  INSPEC  COPYRIGHT 1997 IEE
1961AN   75:784468  INSPEC     DN  C75015687
1962TI   A   ***relaxation***     ***method***   for reconstructing objects
1963     from noise X-rays.
1964AU   Herman, G.T. (State Univ. New York, Buffalo, Amherst, MA, USA)
1965SO   Mathematical Programming (Feb. 1975) vol.8, no.1, p.1-19. 22 refs.
1966     CODEN: MHPGA4  ISSN: 0025-5610
1967DT   Journal
1968TC   Application; Theoretical
1969CY   Netherlands
1970LA   English
1971AB   An algorithm is presented for estimating the density distribution in
1972     a cross section of an object from X-ray data which in practice is
1973     unavoidably noisy. The data give rise to a large sparse system of
1974     inconsistent equations, not untypically 105 equations with 104
1975     unknowns, with only about 1% of the coefficients non-zero. Using the
1976     physical interpretation of the equations, each equality can in
1977     principle be replaced by a pair of inequalities, giving the limits
1978     within which the sum is believed to lie. An algorithm is proposed
1979     for solving this set of inequalities. The algorithm is basically a
1980     relaxation method. A finite convergence result is proved. In spite
1981     of the large size of the system, in the application area of interest
1982     practical solution on a computer is possible because of the simple
1983     geometry of the problem and the redundancy of equations obtained
1984     from nearby X-rays. The algorithm has been implemented, and is
1985     demonstrated by actual reconstructions.
1986
1987L8   ANSWER 357 OF 404  INSPEC  COPYRIGHT 1997 IEE
1988AN   73:537779  INSPEC     DN  C73016792
1989TI   A new   ***relaxation***     ***method***   for obtaining the lowest
1990     eigenvalue and eigenvector of a matrix equation.
1991AU   Muda, Y. (Osaka Univ., Suita, Japan)
1992SO   International Journal for Numerical Methods in Engineering (1973)
1993     vol.6, no.4, p.511-19. 4 refs.
1994     CODEN: IJNMBH  ISSN: 0029-5981
1995DT   Journal
1996TC   Theoretical
1997CY   United Kingdom
1998LA   English
1999AB   The matrix eigenvalue problem Hui= lambda iui is considered. It is
2000     shown that when a new approximate vector v(n+1) to u1 (the
2001     eigenvector of the lowest eigenvalue) is computed from the present
2002     one v(n) by the relation v(n+1)=(1- alpha H+ beta H2)v(n+1)=1- alpha
2003     H+BH2- gamma H3)v(n), the convergence rate is at least double that
2004     of the gradient method which corresponds to set beta = theta =0.
2005     Moreover, by choosing parameters alpha , beta , or gamma properly,
2006     one can get about three to five times faster convergence rate than
2007     that of the latter method, for H having very small lambda 2- lambda
2008     1 and very large lambda N (the largest eigenvalue). Further
2009     modifications are suggested. The relation with the Richardson method
2010     is also discussed.
2011
2012L8   ANSWER 359 OF 404  INSPEC  COPYRIGHT 1997 IEE
2013AN   73:531350  INSPEC     DN  A73044722
2014TI   On linear   ***relaxation***     ***methods***  .
2015AU   Rangarajan, S.K. (Nat. Aeronautical Lab., Bangalore, India)
2016SO   Journal of Electroanalytical Chemistry and Interfacial
2017     Electrochemistry (9 Feb. 1973) vol.41, no.3, p.459-71. 5 refs.
2018     CODEN: JEIEBC  ISSN: 0022-0728
2019DT   Journal
2020TC   Theoretical
2021CY   Switzerland
2022LA   English
2023AB   A parametric approach towards the classification of relaxation
2024     methods is presented. It is emphasised how such a perspective is
2025     non-trivial and informative. As a natural consequence, this formal
2026     theory of the methodology of linear methods suggests two new
2027     current-based transient techniques with two parameters. A comparison
2028     of one of these is made with the other methods already available.
2029
2030L8   ANSWER 361 OF 404  INSPEC  COPYRIGHT 1997 IEE
2031AN   73:530411  INSPEC     DN  A73043526
2032TI   Determination of some structure characteristic data of a ribonucleic
2033     acid and of a protein through the dielectric   ***relaxation***
2034     ***method***  .
2035AU   Constantinescu, S.; Dumitrescu, H. (Inst. Politehnic 'Gheorghe
2036     Gheorghiu-Dej' Bucuresti, Romania)
2037SO   Buletinul Institutului Politehnic 'Gheorghe Gheorghiu-Dej' Bucuresti
2038     (Nov.-Dec. 1972) vol.34, no.6, p.29-33. 2 refs.
2039     CODEN: BIGBAY  ISSN: 0366-0419
2040DT   Journal
2041TC   Experimental
2042CY   Romania
2043LA   Romanian
2044AB   The paper shows the results of the study on some bipolymers (a
2045     ribonucleic acid and a protein-ovalbumin) through the dielectric
2046     relaxation method. Information is obtained concerning the mode of
2047     statistical arrangement, the dipole moment, molecular weight, etc.
2048     of the studied biopolymers in dilute solutions.
2049
2050L8   ANSWER 363 OF 404  INSPEC  COPYRIGHT 1997 IEE
2051AN   73:526795  INSPEC     DN  C73015129
2052TI   A program using the successive extrapolated   ***relaxation***
2053     ***method***   to solve Laplace's equation.
2054AU   Kinsner, W.; Torre, E.D. (McMaster Univ., Hamilton, Ont., Canada)
2055SO   IEEE Transactions on Microwave Theory and Techniques (May 1973)
2056     vol.MTT21, no.5, p.365. 2 refs.
2057     CODEN: IETMAB  ISSN: 0018-9480
2058DT   Journal
2059TC   Application; Theoretical
2060CY   United States
2061LA   English
2062AB   Using Fortran IV, the program determines fields satisfying Laplace's
2063     equation with Dirichlet and/or Neumann boundary conditions.
2064     Subroutine SER may be applied to other iterative methods.
2065
2066L8   ANSWER 376 OF 404  INSPEC  COPYRIGHT 1997 IEE
2067AN   72:374963  INSPEC     DN  C72009526
2068TI     ***Relaxation***     ***methods***  .
2069AU   Birkhoff, G. (Harvard Univ., MA, USA)
2070SO   Regional Conference Series in Applied Mathematics (1971) no.1,
2071     p.29-37. 10 refs.
2072     CODEN: RCSMBO  ISSN: 0160-7642
2073DT   Journal
2074TC   Theoretical
2075CY   United States
2076LA   English
2077AB   Discusses iterative methods for solving systems of linear (vector)
2078     equations of the form Au=b. Methods involving 'relaxation methods'
2079     are especially applicable when A is a Stieltjos mat4ix of the form
2080     A=D-E-F, F=E/sup T/. The Gauss-Seidal method, Richardson's method,
2081     point successive overrelaxation, line and block overrelaxation and
2082     rates of convergence of methods are considered.
2083
2084L8   ANSWER 377 OF 404  INSPEC  COPYRIGHT 1997 IEE
2085AN   72:374041  INSPEC     DN  C72008575
2086TI     ***Relaxation***     ***methods***   for pure and mixed integer
2087     programming problems.
2088AU   Gorry, G.A.; Shapiro, J.F. (MIT, Cambridge, MA, USA); Wolsey, L.A.
2089SO   Management Science (Jan. 1971) vol.18, pt.1, no.5, p.229-39. 12
2090     refs.
2091     CODEN: MSCIAM  ISSN: 0025-1909
2092DT   Journal
2093TC   Practical
2094CY   United States
2095LA   English
2096AB   The usefulness of group theoretic methods in solving integer
2097     programming (IP) problems is extended by procedures for controlling
2098     the size of the groups. The main procedure given shows how an
2099     optimal linear programming basis can be altered to reduce the
2100     magnitude of its determinant thereby reducing the size of the group
2101     induced by the basis. An adaption of Benders' mixed IP algorithm is
2102     given which uses these methods. Some limited computational
2103     experience is given.
2104
2105L8   ANSWER 381 OF 404  INSPEC  COPYRIGHT 1997 IEE
2106AN   71:323191  INSPEC     DN  C71023758
2107TI     ***Relaxation***     ***method***   for mixed boundary conditions.
2108AU   Niki, H.; Kimura, H.; Usui, M.; Akutu, Y. (okayama Coll. Sci.,
2109     Syuku, Japan)
2110SO   Electronics Letters (9 Sept. 1971) vol.7, no.18, p.525-7
2111     CODEN: ELLEAK  ISSN: 0013-5194
2112DT   Journal
2113TC   Theoretical
2114CY   United Kingdom
2115LA   English
2116AB   The numerical solution of Laplace's equation in 2-dimensional
2117     Cartesian co-ordinates with mixed boundary conditions is described
2118     using the successive-overrelaxation method for solution with the
2119     acceleration parameter decided by a method proposed formerly. Its
2120     effectiveness is compared with that of other methods.
2121
2122L8   ANSWER 386 OF 404  INSPEC  COPYRIGHT 1997 IEE
2123AN   71:233879  INSPEC     DN  A71019840
2124TI   A   ***relaxation***     ***method***   for the computation of model
2125     stellar atmospheres.
2126AU   Price, M.J. (Kitt Peak Nat. Obs., Tucson, AZ, USA)
2127SO   Theory and observation of normal stellar atmospheres, proceedings of
2128     3rd Harvard-Smithsonian conference on stellar atmospheres
2129     Editor(s): Gingerich, O.
2130     Cambridge, MA, USA: MIT Press, 1969. p.139-41 of xv+472 pp.
2131     Conference: Cambridge, MA, USA, 8-11 April 1968
2132     Sponsor(s): Smithsonian Astrophys. Obs.; Harvard College Obs
2133     ISBN: 0-262-07035-9
2134DT   Conference Article
2135TC   Theoretical
2136CY   United States
2137LA   English
2138AB   A Monte Carlo relaxation method has been developed for the
2139     computation of model stellar atmospheres. The equations of
2140     statistical equilibrium for the atomic-level populations are solved
2141     simultaneously with the radiative-transfer and electron-temperature
2142     equations by use of the constraints of hydrostatic and radiative
2143     equilibrium. Selected LTE boundary conditions are applied deep in
2144     the atmosphere. In the solution of the statistical-equilibrium
2145     equations, all possible electron collisional and radiative processes
2146     are considered. In formulating the source function, all atomic
2147     processes contributing to the absorption and emission coefficients
2148     are considered in microscopic detail. The local electron temperature
2149     is obtained by solving the kinetic-energy balance equation for the
2150     electron gas. All electron collisional and radiative processes
2151     whereby kinetic energy is gained and lost by the electron gas are
2152     considered. Thomson scattering is taken into account in formulating
2153     the equation of radiative transfer. The free-bound and bound-bound
2154     radiation is transferred throughout the atmosphere by use of the
2155     Monte Carlo technique.
2156
2157L8   ANSWER 389 OF 404  INSPEC  COPYRIGHT 1997 IEE
2158AN   70:187216  INSPEC     DN  A70068527
2159TI   Thermodynamic properties of interstitial solid solutions by
2160     ***relaxation***     ***methods***  .
2161AU   Alefeld, G.; Volkl, J.; Tretkowski, J. (Inst. Festkorper,
2162     Neutronenphys., Julich, West Germany)
2163SO   Journal of the Physics and Chemistry of Solids (Aug. 1970) vol.31,
2164     no.8, p.1765-9. 17 refs.
2165     CODEN: JPCSAW  ISSN: 0022-3697
2166     Conference: International conference on ultrasonic attenuation and
2167     internal friction. Providence, RI, USA, 3-6 Sept 1969
2168     Sponsor(s): IUPAP
2169DT   Conference Article; Journal
2170CY   United Kingdom
2171LA   English
2172AB   By elastic relaxation methods the derivative ( delta mu / delta rho
2173     )T of the chemical potential of solutes can be determined absolutely
2174     as a function of temperature and density rho . Therefore useful
2175     parameters which characterize the solubility of gases in metals or
2176     which determine phase transitions of solutes can be found by elastic
2177     relaxation methods. As an example experiments on hydrogen in niobium
2178     are discussed. On the basis of experimental parameters (trace of the
2179     elastic dipole moment tensor, critical density, critical
2180     temperature) it will be argued that the attractive interaction of H
2181     in Nb, which is responsible for the phase transition, is of elastic
2182     nature.
2183
2184L8   ANSWER 392 OF 404  INSPEC  COPYRIGHT 1997 IEE
2185AN   70:125882  INSPEC     DN  A70029268; C70007947
2186TI   A computer adaptation of southwell's   ***relaxation***
2187     ***method***   with application to elastic-plastic stress analysis.
2188AU   Wesner, J.W., Jr.
2189CS   Carnegie-Mellon Univ., Pittsburgh, PA, USA
2190SO   205 pp. Availability: Univ. Microfilms, Ann Arbor, MI., USA Order
2191     no. 68-17620
2192DT   Dissertation
2193CY   United States
2194LA   English
2195AB   Southwell's relaxation method is studied, as a means for solving
2196     problems of elastic-perfectly plastic stress analysis with the aid
2197     of a digital computer. Procedures are developed for computerized
2198     relaxation. A number of the special techniques for facilitating hand
2199     relaxation are evaluated, and those which profitably adapt to
2200     automatic computation are incorporated into the computerized
2201     process. Specific applications of the method to problems of
2202     elastic-perfectly plastic stress analysis are considered. Special
2203     techniques are developed for the yielded zone. These are then
2204     demonstrated by solutions for the notched bar loaded in tension, and
2205     for the plane strain indenter. The computer method is evaluated by
2206     comparing the notched bar solutions with similar solutions obtained
2207     by hand. Results for the indenter are compared with slip-line
2208     theory, and with a solution obtained using a finite- element
2209     computer code.
2210
2211L8   ANSWER 399 OF 404  INSPEC  COPYRIGHT 1997 IEE
2212AN   69:58871  INSPEC     DN  C69009320
2213TI   A digital computer solution of the Laplace equation using the
2214     dynamic   ***relaxation***     ***method***  .
2215AU   Rushton, K.R.; Laing, L.M. (Univ. Birmingham, UK)
2216SO   Aeronautical Quarterly (Nov. 1968) vol.19, pt.4, p.375-87
2217     CODEN: AEQUAY  ISSN: 0001-9259
2218DT   Journal
2219CY   United Kingdom
2220LA   English
2221AB   The Dynamic Relaxation solution of the Laplace equation introduces
2222     dynamic terms into the basic equation. When this is written as an
2223     explicit finite difference formulation it can be solved by an
2224     iterative process which only requires a simple substitution routine.
2225     The method is easy to programme and requires small storage in the
2226     computer. By studying problems involving wind tunnel interference in
2227     steady flow, the potentialities of the method are demonstrated.
2228
2229L8   ANSWER 404 OF 404  INSPEC  COPYRIGHT 1997 IEE
2230AN   69:6426  INSPEC     DN  A69004293
2231TI   A systematic   ***relaxation***     ***method***   for the
2232     determination of the normal modes and the natural frequencies of
2233     vibrating systems.
2234AU   Allman, D.J.; Brotton, D.M. (Dept. Civil Engineering, StrEngineering
2235     Div., Univ. Manchester Inst. Sci. Technology, UK)
2236SO   International Journal of Mechanical Sciences (Feb. 1968) vol.10,
2237     no.2, p.129-41. 10 refs.
2238     CODEN: IMSCAW  ISSN: 0020-7403
2239DT   Journal
2240CY   United Kingdom
2241LA   English
2242AB   A systematic relaxation method for the determination of the normal
2243     modes and natural frequencies of harmonic and quasi-harmonic
2244     vibrating systems is presented. The method is capable of dealing
2245     with systems which can be idealized as discrete masses with
2246     interconnecting massless elastic springs. The method is based on the
2247     numerical integration of the restraint accelerations acting on the
2248     masses of a system as it vibrates in a constrained configuration and
2249     it is thus convenient for use with a digital comowever,Hsolutions to
2250     systems with a small number of degrees of freedom may be obtained by
2251     hand calculations alone.
2252
2253L8   ANSWER 403 OF 404  INSPEC  COPYRIGHT 1997 IEE
2254AN   69:19149  INSPEC     DN  C69002847
2255TI   Numerical solution of the problem of heat propagation in one
2256     dimension by the iterative super-  ***relaxation***     ***method***
2257     .
2258AU   Ribero dos Santos, J.; Rigal, A.
2259SO   Remote Sensing of Environment (July 1968) vol.2, no.10, p.53-64
2260     CODEN: RSEEA7  ISSN: 0034-4257
2261DT   Journal
2262CY   United States
2263LA   French
2264AB   Concerns the problem of heat propagation or diffusion in one
2265     dimension in an isotropic homogeneous medium. The 2nd order
2266     approximation of the problem can be expressed in a formula depending
2267     on a parameter theta . For a certain value of theta a 4th order
2268     approximation in x and a second order approximation in t can be
2269     obtained. The problem is solved by the iterative super-relaxation
2270     method, applying the property of the reducibility of the total
2271     linear system. A numerical example is also given.
2272
2273L8   ANSWER 402 OF 404  INSPEC  COPYRIGHT 1997 IEE
2274AN   69:19158  INSPEC     DN  C69002856
2275TI   On the use of gradient   ***relaxation***     ***method***   for
2276     solution of a system of nonlinear equations.
2277AU   Spiridonov, V.S.
2278SO   Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki (July
2279     1968) vol.8, no.4, p.872-3
2280     CODEN: ZVMFAN  ISSN: 0044-4669
2281DT   Journal
2282CY   USSR
2283LA   Russian
2284AB   An algorithm is given for convergence of an iterative
2285     trajectory-following method if the vicinity of a root is convex.
2286
2287=>