The ADI model problem

The ADI Model Problem

Volumn 9781461451228, Issue , 2013, Pages 1-167

  Wachspress, Eugene ^a  

^a NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84929677823     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4614-5122-8     Document Type: Book

References (83)

1. Abramowitz M, Stegun IA (1964) Handbook of mathematical functions, NBS AMS-55; NIST Handbook of mathematical functions. Cambridge University Press, 2010
2. Achieser NI (1967) Theory of approximation. Ungar, New York
3. Bagby T (1969) On interpolation of rational functions. Duke J Math 36:95-104
4. Bartels RH, Stewart GW(1972) Solution of the matrix equation AX CXB D C. Commun. ACM 15:820-826
5. Benner P, Li R-C, Truhar N (2009) On the ADI method for Sylvester equations. J Comput Appl Math 233(4):1035-1045
6. Birkhoff G, Varga RS, Young DM (1962) Alternating direction implicit methods. Advances in computers, vol 3. Academic, New York, pp 189-273
7. Buzbee BL, Golub GH, Nielson CW (1970) On direct methods for solving Poisson's equation. SIAM J Numer Anal 7:627-656
8. Byers R (1983) Hamilton and symplectic algorithms for the algebraic Riccati equation. Ph.D. Thesis, Cornell University
9. Cauer W (1958) Synthesis of linear communication networks. McGraw-Hill, New York
10. Cesari L (1937) Sulla risoluzione dei sistemi di equazioni lineari par aprossimazioni successive Atti Accad. Naz. Lincei. Rend. Cl. Sci. Fis. Mat. Nat. VI S-25:422-428
11. Clayton AJ (1963) Further results on polynomials having least maximum modulus over an ellipse in the complex plane. UKAEA Memorandum AAEEW, M 348
12. Concus P, Golub G (1973) Use of fast direct methods for the efficient numerical solution of nonseparable elliptic equations. SIAM J Numer Anal 20:1103-1120
13. Copson ET (1935) Theory of functions of a complex variable. Clarendon Press, Oxford
14. Dax A, Kaniel S (1981) The ELR method for computing the eigenvalues of a general matrix. SIAM J Numer Anal 18:597-605
15. Diliberto SP, Strauss EG (1951) On the approximation of a function of several variables by a sum of functions of fewer variables. Pacific J Math 1:195-210
16. Dodds HL, Sofu T, Wachspress EL (1990) A nine point ADI model problem for solution of the diffusion equation. Trans Am Nucl Soc 62:298
17. Douglas J Jr (1962) Alternating direction methods for three space variables. Numerische Mathematik 4:41-63
18. Douglas J Jr, Rachford HH Jr (1956) On the numerical solution of heat conduction problems in two or three space variables. Trans Am Math Soc 82:421-493
19. D'Yakonov EG (1961) An iteration method for solving systems of linear difference equations. Soviet Math (AMS translation) 2:647
20. Ellner NS, Wachspress EL (1986) Alternating direction implicit iteration for systems with complex spectra. SIAM J. Numer Anal 28(3):859-870
21. (1991); also New ADI model problem applications. In: Proceedings of fall joint computer conference, IEEE Computer Society Press1986 and Master's thesis of N. Saltzman (Ellner), on ADI parameters for some complex spectra, University of Tennessee, Knoxville, TN, 1987
22. Engeli M, Ginsburg T, Rutishauser H, Stiefel E (1959) Refined iterative methods for computation of the solution and the eigenvalues of self-Adjoint boundary value problems. Mitteilungen aus dem Institut fur angewandte Mathematik, vol 8. Birkha & die;user, Basel
23. Fischer B, Freund R (1991) Chebyshev polynomials are not always optimal. J Approx Theor 65(3):261-272
24. Gastinel N (1962) Sur le meilleur choix des parametres de sur-relaxation. Chiffres 5:109-126
25. Geist GA (1989) Reduction of a general matrix to tridiagonal form. ORNL/TM-10991
26. Geist GA, Lu A, Wachspress EL (1989) Stabilized Gaussian reduction of an arbitrary matrix to tridiagonal form. ORNL/TM-11089
27. Golub GH, O'Leary DP (1987) Some history of the conjugate gradient and Lanczos algorithms UMIACS-TR-87-20, CS-TR-1859, University of Maryland Institute for Advanced Computer Studies and Computer Science Department
28. Golub GH, Van Loan C (1983) Matrix computations. Johns Hopkins University Press, New York
29. Golub GH, Nash S, Van Loan C (1979) A Hessenberg-Shur method for solution of the problem AX CXB D C. IEEE Trans Automat Contr AC24:909-913
30. Gonchar AA (1969) Zolotarev problems connected with rational functions. Math USSR Sbornik 7:623-635
31. Guilinger WH (1965) Peaceman-Rachford method for small mesh increments. J Math Anal Appl 11:261-277
32. Gutknecht MH (1983) On complex rational approximation. In: Werner H et. al (eds) Part I: The characterization problem in computational aspects of complex analysis. Reidel, Dordrecht, pp 79-101
33. Hare DE, Tang WP (1989) Toward a stable tridiagonalization algorithm for general matrices. University of Waterloo technical report CS-89-03, 1989
34. Howell GW (1994) Toward an efficient and stable determination of spectra of a general matrix and a more efficient solution of the Lyapunov equation. First world congress of nonlinear analysis, 1994
35. Hestenes M, Stieffel E (1952) Methods of conjugate gradients for solving linear systems. J Res NBS 49(6):409-436
36. Howell G, Geist G (1995) Direct reduction to a similar near-tridiagonal form, section 6. In: Elmaghraby A, Ammar A (eds) Parallel and distributed computing systems. ISCA, Raleigh, pp 426-432
37. Howell G, Diaa N (2005) Algorithm 841: BHESS: Gaussian reduction to a similar banded Hessenberg form, ACM transactions on Mathematical Software vol. 31 (1
38. Hubert L, Meulman J, Heiser W (2000) Two purposes for matrix factorization: A historical appraisal. SIAM Rev 42(1):68-82
39. Hurwitz H (1984) Infinitesimal scaling: A new procedure for modeling exterior field problems. IEEE Trans 20:1918-1923
40. Istace MP, Thiran JP (1993) On the third and fourth Zolotarev problems in the complex plane. Math Comput
41. Leja F (1957) Sur certaines suits liees aux ensem le plan et leur application a la representation conforme. Ann. Polon. Math 4:8-13
42. Lehoucq RB, Sorensen DC (1996) Deflation techniques for an implicitly restarted Arnoldi iteration. SIAM J Matrix Anal Appl 17:789-821
43. Li J-R, White J (2002) Low rank solution of Lyapunov equations. SIAM J Matrix Anal Appl 24(1):260-280
44. Lu A, Wachspress EL (1991) Solution of Lyapunov equations by ADI iteration. Comput Math Appl 21(9):43-58
45. Wachspress EL (1987) Iterative solution of the Lyapunov matrix equation. Appl Math Ltrs (1):87-90
46. Lynch RE, Rice JR (1968) Convergence rates of ADI methods with smooth initial error. Math Comp 22(102):331-335
47. Manteuffel TA (1977) The Tchebychev iteration for nonsymmetric linear systems. Numer Math 28:307-327
48. Nachtigal NM, Reddy SC, Trefethen LN (1990) How fast are nonsymmetric matrix iterations? MIT Numerical Analysis Report, pp 90-92, 1990
49. (2010) NIST Handbook of mathematical functions, chapter 19 by B.C. Carlson and chapter 22 by W.P. Reinhardt and P.L. Walke. Cambridge University Press, Cambridge
50. Opfer G, Schober G (1984) Richardson's iteration for nonsymmetric matrices. Linear Algebra Appl 58:343-361
51. Osborne MR, Watson GA (1978) Nonlinear approximation problems in vector norms. In: Watson GA (ed) Proceedings of Biennial conference on numerical analysis, Dundee 1977. Lecture notes in mathematics, vol 630. Springer, Berlin
52. Penzl T (1999) A cyclic low-rank Smith method for large sparse Lyapunov equations. SIAM J Sci Comp 21(4):1401-1418
53. Peaceman DW, Rachford HH Jr (1955) The numerical solution of parabolic and elliptic differential equation. J SIAM 3:28-41
54. Rivlin TJ (1980) Best uniform approximation by polynomials in the complex plane. In: Cheney EW (ed) Approximation theory III. Academic, New York
55. Ruttan A (1985) A characterization of best complex rational appproximants in a fundamental case. Const Approx 1:230-243
56. Saltzman N (1987) ADI parameters for some complex spectra. University of Tennessee Master's Thesis
57. Smirnov VI, Lebedev NA (1968) Functions of a complex variable. MIT Press, Cambridge
58. Smith RA (1968) Matrix equation XACXB D C. SIAM J Appl Math 16(1):198-201
59. Starke G (1989) Rational minimization problems in connection with optimal ADI-parameters for complex domains. Ph.D. thesis, Institute fur Praktische Mathematik, Universita & die;t Karlsruhe, FRG
60. Starke G (1991) Optimal alternating direction implicit parameters for nonsymmetric systems of linear equations. SIAM J Numer Anal 28:1431-1445
61. Stephenson K, Sundberg C (1985) Level curves of inner functions. Proc London Math Soc III 51:77-94
62. Tang WP(1988) A stabilized algorithm for tridiagonalization of an unsymmetric matrix. University of Waterloo Technical Report CS-88-14
63. Todd J (1984) Applications of transformation theory: A legacy from Zolotarev (1847-1878). Approximation theory and spline functions. D.Reidel, Dordrecht, pp 207-245
64. Varga RS (1962) Matrix iterative analysis. Prentice Hall, Englewood Cliffs
65. Wachspress EL (1957) CURE: A generalized two-space-dimension multigroup coding for the IBM-704. Knolls Atomic Power Report KAPL-1724, AEC R & D Physics and Mathematics TID-4500, 13th edn. Knolls Atomic Power Lab, Schenectady
66. Wachspress EL (1962) Optimum alternating-direction-implicit iteration parameters for a model problem. J Soc Indust Appl Math 10(2):339-350
67. Wachspress EL (1963) Extended application of alternating-direction-implicit iteration model problem theory. J Soc Indust Appl Math 11:994-1016
68. Wachspress EL (1966) Iterative solution of elliptic systems. Prentice Hall, Englewood Cliffs
69. Wachspress EL (1984) Generalized ADI preconditioning. Comput Math Appl 10(6):457-461
70. Wachspress EL (1988a) ADI solution of the Lyapunov equation. MSI Workshop on practical iterative methods for large-scale computations, Minneapolis, MN, 1988
71. Wachspress EL (1988b) Iterative solution of the Lyapunov matrix equation. Appl Math Lett 1: 87-90
72. Wachspress EL (1988c) The ADI minimax problem for complex spectra. Appl Math Lett 1(3):311-314
73. Wachspress EL (1990) The ADI minimax problem for complex spectra. In: Kincaid D, Hayes L, (eds) Iterative methods for large linear system. Academic, New York, pp 251-271
74. Wachspress EL (1991) Optimum alternating direction implicit iteration parameters for rectangular regions in the complex plane. Center for Mathematical Analysis of the Australian National University Report CMA-R33-90, 1991
75. Wachspress EL (1994) Three-variable alternating-direction-implicit iteration. Comput Math Appl 27:1-7
76. Wachspress EL (1995) The ADI model problem. Windsor, CA
77. Wachspress EL, Habetler GJ (1960) An alternating-direction-implicit iteration technique. J Soc Indust Appl Math 8(2):403-424
78. Wachspress, EL (2008) Trail to a Lyapunov equation solver, Computers and Mathematics with Applications 55, pp. 1653-1659
79. Watkins D (1988) Use of the LR algorithm to tridiagonalize a general matrix. SIAM annual meeting, Minneapolis, MN, 1988
80. Wilkinson JH (1965) The algebraic eigenvalue problem. Oxford University Press, Oxford
81. Wrigley HE (1963) Accelerating the Jacobi method for solving simultaneous equations by Chebyshev extrapolation when the eigenvalues of the iteration matrix are complex. Comput J 6:169-176
82. Young DM, Wheeler MF (1964) Alternating direction methods for solving partial difference equations. Nonlinear problems in engineering. Academic, New York, pp 220-246
83. Pemerburiskoi, Z, Oeuvres de G. Zolotarev (1877) Akademuu Nauk XXX, (5), pp 1-59