Iterative solution of large sparse systems of equations

Applied Mathematical Sciences (Switzerland)

Volumn 95, Issue , 2016, Pages

  Hackbusch, Wolfgang ^a  

^a MAX PLANCK INSTITUTE FOR MATHEMATICS IN THE SCIENCES   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85067973190     PISSN: 00665452     EISSN: 2196968X     Source Type: Book Series    
DOI: None     Document Type: Chapter

References (417)

1. Alefeld, G.: Zur Konvergenz des Peaceman-Rachford-Verfahrens. Numer. Math. 26, 409– 419 (1976)
2. Alefeld, G.: On the convergence of the symmetric SOR method for matrices with red-black ordering. Numer. Math. 39, 113–117 (1982)
3. Alefeld, G., Varga, R.S.: Zur Konvergenz des symmetrischen Relaxationsverfahrens. Numer. Math. 25, 291–295 (1976)
4. Allgower, E., Böhmer, K., Zhen, M.: On a problem decomposition for semilinear nearly symmetric elliptic equations. In: Hackbusch [187], pp. 1–17
5. Andreev, R., Tobler, C.: Multilevel preconditioning and low-rank tensor iteration for space-time simultaneous discretizations of parabolic PDEs. Numer. Linear Algebra Appl. 22, 317– 337 (2015)
6. 3
7. Ashby, S.F., Manteuffel, T.A., Saylor, P.E.: Adaptive polynomial preconditioning for Hermitian indefinite linear systems. BIT 29, 583–609 (1989)
8. Astrachancev, G.P.: An iterative method of solving elliptic net problems. USSR Comput. Math. Math. Phys. 11,2, 171–182 (1971)
9. Astrachancev, G.P.: Methods of fictitious domains for a second-order elliptic equation with natural boundary conditions. USSR Comput. Math. Math. Phys. 18, 114–121 (1978)
10. Axelsson, O.: Solution of linear systems of equations: iterative methods. In: Barker [33], pp. 1–51
11. Axelsson, O.: On algebraic multilevel iteration methods for selfadjoint elliptic problems with anisotropy. Rend. Semin. Mat. Politec. Torino pp. 31–61 (1991)
12. Axelsson, O.: Iterative Solution Methods. Cambridge Univ. Press (1994). Reprinted 1996
13. Axelsson, O., Barker, V.A.: Finite element solution of boundary value problems. Academic Press, Orlando (1984). Reprinted by SIAM, Philadelphia, 2001
14. Axelsson, O., Brinkkemper, S., Il’in, V.P.: On some versions of incomplete block-matrix factorization iterative methods. Linear Algebra Appl. 58, 3–15 (1984)
15. Axelsson, O., Polman, B.: A robust preconditioner based on algebraic substructuring and two-level grids. In: Hackbusch [185], pp. 1–26
16. Axelsson, O., Vassilevski, P.: Algebraic multilevel preconditioning methods, part I. Numer. Math. 56, 157–177 (1989)
17. Axelsson, O., Vassilevski, P.: Algebraic multilevel preconditioning methods, part II. SIAM J. Numer. Anal. 27, 1569–1590 (1990)
18. Axelsson, O., Vassilevski, P.: A black box generalized CG solver with inner iterations and variable-step preconditioning. SIAM J. Matrix Anal. Appl. 12, 625–644 (1991)
19. Axelsson, O., Vassilevski, P.: Construction of variable-step preconditioners for inner-outer iteration methods. In: Beauwens and de Groen [38], pp. 1–14
20. Aziz, A.K. (ed.): The mathematical foundation of the finite element method with applications to partial differential equations. Academic Press, New York (1972). (Maryland, Jun. 1972)
21. Babuška, I.: Über Schwarzsche Algorithmen in partiellen Differentialgleichungen der mathematischen Physik. ZAMM 37, 243–245 (1957)
22. Bachem, A., Grötschel, M., Korte, B. (eds.): Mathematical programming, the state of art. Springer, Berlin (1983). (Bonn, Aug. 1982)
23. Bakhvalov, N.S.: On the convergence of a relaxation method with natural constraints on the elliptic operator. USSR Comput. Math. Math. Phys. 6(5), 101–135 (1966)
24. Ballani, J., Grasedyck, L.: A projection method to solve linear systems in tensor format. Numer. Linear Algebra Appl. 20, 27–43 (2013)
25. Bank, R.E.: Marching algorithms and block Gaussian elimination. In: Bunch and Rose [86], pp. 293–307
26. Bank, R.E., Chan, T.F.: An analysis of the composite step biconjugate gradient method. Numer. Math. 66, 295–319 (1993)
27. Bank, R.E., Douglas, C.C.: Sharp estimates for multigrid rates of convergence with general smoothing and acceleration. SIAM J. Numer. Anal. 22, 617–633 (1985)
28. Bank, R.E., Dupont, T.F.: Analysis of a two-level scheme for solving finite element equations. Report CNA-159, University of Texas at Austin (1980)
29. Bank, R.E., Dupont, T.F.: An optimal order process for solving elliptic finite element equations. Math. Comp. 36, 35–51 (1981)
30. Bank, R.E., Dupont, T.F., Yserentant, H.: The hierarchical basis multigrid method. Math. Comp. 52, 427–458 (1988)
31. Bank, R.E., Holst, M.J., Widlund, O.B., Xu, J. (eds.): Domain Decomposition Methods in Science and Engineering XX, Lect. Notes Comput. Sci. Eng., Vol. 91. Springer, Berlin (2013). (San Diego, Feb. 2011)
32. Bank, R.E., Scott, L.R.: On the conditioning of finite element equations with highly refined meshes. SIAM J. Numer. Anal. 26, 1383–1394 (1989)
33. Barker, V.A. (ed.): Sparse matrix techniques, Lect. Notes Math., Vol. 572. Springer, Berlin (1977). (Copenhagen, Aug. 1976)
34. Bastian, P., Hackbusch, W., Wittum, G.: Additive and multiplicative multi-grid – a comparison. Computing 60, 345–364 (1998)
35. Baur, U.: Low-rank solution of data-sparse Sylvester equations. Numer. Linear Algebra Appl. 15, 837–851 (2008)
36. Baur, U., Benner, P.: Factorized solution of Lyapupov equations based on hierarchical matrix arithmetic. Computing 78, 211–234 (2006)
37. Beauwens, R.: Approximate factorizations with s/p consistently ordered M-factors. BIT 29, 658–681 (1989)
38. Beauwens, R., de Groen, P. (eds.): Iterative Methods in Linear Algebra. North-Holland, Amsterdam (1992). (Brussels, April 1991)
39. ∞-coefficients. Numer. Math. 95, 1–28 (2003)
40. Benner, P., Breiten, T.: Low rank methods for a class of generalized Lyapunov equations and related issues. Numer. Math. 124, 441–470 (2013)
41. Benzi, M.: Gianfranco Cimmino’s contributions to numerical mathematics. In: Ciclo di Conferenze in Ricordo di Gianfranco Cimmino, March-May 2004, pp. 87–109. Seminario di Analisi Matematica, Dipartimento di Matematica dell’Universit di Bologna (2005)
42. Benzi, M., Tůma, M.: A robust incomplete factorization preconditioner for positive definite matrices. Numer. Linear Algebra Appl. 10, 385–400 (2003)
43. Bercovier, M., Gander, M.J., Kornhuber, R., Widlund, O.B. (eds.): Domain Decomposition Methods in Science and Engineering XVIII, Lect. Notes Comput. Sci. Eng., Vol. 70. Springer, Berlin (2009). (Jerusalem, Jan. 2008)
44. Berg, L.: Lineare Gleichungssysteme mit Bandstruktur. Deutscher Verlag der Wissen-schaften, Berlin (1986)
45. Berman, A., Plemmons, R.J.: Nonnegative matrices in the mathematical sciences. Academic Press, New York (1979)
46. Berman, A., Plemmons, R.J.: Cones and iterative methods for best least squares solutions of linear systems. SIAM J. Numer. Anal. 11, 145–154 (2006)
47. Björck, Å.: Numerical Methods for Least Squares Problems. SIAM, Philadelphia (1996)
48. Björck, Å.: Numerical Methods in Matrix Computations. Springer, Cham (2015)
49. Bjørstad, P.E.: The direct solution of a generalized biharmonic equation on a disk. In: Hackbusch [182], pp. 1–9
50. Bjørstad, P.E., Espedal, M.S., Keyes, D.E. (eds.): Ninth International Conference on Domain Decomposition Methods. ddm.org (1996). (Bergen, June 1996)
51. Bjørstad, P.E., Mandel, J.L.: On the spectra of sums of orthogonal projections with applications to parallel computing. BIT 31, 76–88 (1991)
52. Bjørstad, P.E., Widlund, O.B.: Iterative methods for the solution of elliptic problems on regions partitioned into substructures. SIAM J. Numer. Anal. 23, 1097–1120 (1986)
53. Börgers, C., Widlund, O.B.: On finite element domain imbedding methods. SIAM J. Numer. Anal. 27, 963–978 (1990)
54. Börm, S.: Efficient Numerical Methods for Non-local Operators. EMS, Zürich (2010). Corrected 2nd printing, 2013
55. Börm, S., Reimer, K.: Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates. Comput. Vis. Sci. 16, 247–258 (2013) [published 2015]
56. Bornemann, F., Deuflhard, P.: The cascadic multigrid method for elliptic problems. Numer. Math. 75, 135–152 (1996)
57. Bornemann, F., Yserentant, H.: A basic norm equivalence for the theory of multilevel methods. Numer. Math. 64, 455–476 (1993)
58. Braess, D.: The contraction number of a multigrid method for solving the Poisson equation. Numer. Math. 37, 387–404 (1981)
59. Braess, D.: The convergence rate of a multigrid method with Gauß-Seidel relaxation for the Poisson equation. Math. Comp. 42, 505–386 (1984)
60. Braess, D.: Nonlinear Approximation Theory. Springer, Berlin (1986)
61. Braess, D.: On the combination of the multigrid method and conjugate gradients. In: Hack-busch and Trottenberg [206], pp. 52–64
62. Braess, D.: A multigrid method for the membran problem. Comput. Mech. 3, 321–329 (1988)
63. Braess, D.: Finite Elements: Theory, Fast Solvers, and Applications in Solid Mechanics, 3rd ed. Cambridge University Press, Cambridge (2007)
64. Braess, D., Dryja, M., Hackbusch, W.: Grid transfer for nonconforming FE-discretisations with application to non-matching grids. Computing 63, 1–25 (1999)
65. Braess, D., Hackbusch, W.: A new convergence proof for the multigrid method including the V-cycle. SIAM J. Numer. Anal. 20, 967–975 (1983)
66. Braess, D., Hackbusch, W.: Approximation of 1/x by exponential sums in [1, ∞). IMA J. Numer. Anal. 25, 685–697 (2005)
67. Braess, D., Hackbusch, W.: On the efficient computation of high-dimensional integrals and the approximation by exponential sums. In: DeVore and Kunoth [107], pp. 39–74
68. Braess, D., Hackbusch, W., Trottenberg, U. (eds.): Advances in Multi-Grid Methods, Notes on Numerical Fluid Mechanics, Vol. 11. Vieweg, Braunschweig (1985). (Oberwol-fach, Dec. 1984)
69. Brakhage, H.: Über die numerische Behandlung von Integralgleichungen nach der Quadra-turformelmethode. Numer. Math. 2, 183–196 (1960)
70. Bramble, J.H., Pasciak, J.E., Schatz, A.H.: The construction of preconditioners for elliptic problems by substructuring, part I. Math. Comp. 47, 103–134 (1986)
71. Bramble, J.H., Pasciak, J.E., Schatz, A.H.: The construction of preconditioners for elliptic problems by substructuring, part II. Math. Comp. 49, 1–16 (1987)
72. Bramble, J.H., Pasciak, J.E., Schatz, A.H.: The construction of preconditioners for elliptic problems by substructuring, part III. Math. Comp. 51, 415–430 (1988)
73. Bramble, J.H., Pasciak, J.E., Schatz, A.H.: The construction of preconditioners for elliptic problems by substructuring, part IV. Math. Comp. 53, 1–24 (1989)
74. Bramble, J.H., Pasciak, J.E., Wang, J., Xu, J.: Convergence estimates for multigrid algorithms without regularity assumptions. Math. Comp. 57, 23–45 (1991)
75. Bramble, J.H., Pasciak, J.E., Xu, J.: The analysis of multigrid algorithms for nonsymmetric and indefinite elliptic problems. Math. Comp. 51, 389–414 (1988)
76. Bramble, J.H., Pasciak, J.E., Xu, J.: Parallel multilevel preconditioners. Math. Comp. 55, 1–22 (1990)
77. Brandt, A.: Multi-level adaptive solutions to boundary-value problems. Math. Comp. 31, 333–390 (1977)
78. Brenner, S.C.: A new look at FETI. In: Debit et al. [106], pp. 41–51
79. Brenner, S.C.: Convergence of the multigrid V-cycle algorithm for second-order boundary value problems without full elliptic regularity. Math. Comp. 71, 507–525 (2002)
80. Brenner, S.C.: An additive Schwarz preconditioner for the FETI method. Numer. Math. 94, 1–31 (2003)
81. Brenner, S.C.: Convergence of nonconforming V-cycle and F-cycle multigrid algorithms for second order elliptic boundary value problems. Math. Comp. 73, 1041–1066 (2004)
82. Brenner, S.C., Scott, L.R.: The Mathematical Theory of Finite Element Methods, 3rd ed. Springer, New York (2008)
83. Buczyński, J.A., Landsberg, J.M.: On the third secant variety. J. Algebraic Combin. (2014). Published on-line
84. Buleev, N.I.: Numerical method for solving two-and three-dimensional diffusion equations [in Russian]. Mat. Sb. 51, 227–238 (1960)
85. Bulirsch, R., Grigorieff, R.D., Schröder, J. (eds.): Numerical treatment of differential equations, Lect. Notes Math., Vol. 631. Springer, Berlin (1978). (Oberwolfach, July 1976)
86. Bunch, J.R., Rose, D.J. (eds.): Sparse Matrix Computations. Academic Press, New York (1976). (Argonne National Laboratory, Sep. 1975)
87. Buneman, O.: A compact non-iterative Poisson solver. SUIPR Report 294, Stanford University (1969)
88. Buoni, J.J., Varga, R.S.: Theorems of Stein–Rosenberg type. In: Ansorge et al. [6], pp. 65–75
89. Buoni, J.J., Varga, R.S.: Theorems of Stein–Rosenberg type II, optimal paths of relaxation in the complex plane. In: Schultz [334], pp. 231–240
90. Buzbee, B., Golub, G.H., Nielson, C.: On direct methods for solving Poisson’s equations. SIAM J. Numer. Anal. 7, 627–656 (1970)
91. Buzdin, A., Wittum, G.: Two-frequency decomposition. Numer. Math. 97, 269–295 (2004)
92. Cai, X.C., Widlund, O.B.: Domain decomposition algorithms for indefinite elliptic problems. SIAM J. Sci. Statist. Comput. 13, 243–258 (1992)
93. Chan, T.F., Glowinski, R., Périaux, J., Widlund, O.B. (eds.): Domain Decomposition Methods. SIAM, Philadelphia (1989). (Los Angeles, Jan. 1988)
94. Chan, T.F., Glowinski, R., Périaux, J., Widlund, O.B. (eds.): Domain Decomposition Methods for Partial Differential Equations. SIAM, Philadelphia (1990). (Houston, Mar. 1989)
95. Chan, T.F., Kako, T., Kawarada, H., Pironneau, O. (eds.): Domain Decomposition Methods in Science and Engineering. ddm.org (2001). (Chiba, Oct. 1999)
96. Ciarlet, P.G., Lions, J.L.: Handbook of Numerical Analysis. North-Holland, Amsterdam (1990)
97. Cimmino, G.: Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. Ricerca Scientifica ed il Progresso Tecnico 9, 326–333 (1938)
98. Concus, P., Golub, G.H.: A generalized conjugate gradient method for nonsymmetric systems of linear equations. In: Glowinski and Lions [152], pp. 56–65
99. Concus, P., Golub, G.H., Meurant, G.A.: Block preconditioning for the conjugate gradient method. SIAM J. Sci. Statist. Comput. 6, 220–252 (1985)
100. Dahmen, W., Faermann, B., Graham, I.G., Hackbusch, W., Sauter, S.A.: Inverse inequalities on non-quasiuniform meshes and applications to the mortar element method. Math. Comp. 73, 1107–1138 (2003)
101. Dahmen, W., Kunoth, A.: Multilevel preconditioning. Numer. Math. 63, 315–344 (1992)
102. de Boor, C., Rice, J.R.: Extremal polynomials with applications to Richardson iteration for indefinite linear systems. SIAM J. Sci. Statist. Comput. 3, 47–57 (1982)
103. De Lathauwer, L., De Moor, B., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21, 1253–1278 (2000)
104. de Zeeuw, P.M.: Matrix-dependent prolongations and restrictions in a blackbox multigrid solvers. J. Comput. Appl. Math. 33, 1–27 (1990)
105. de Zeeuw, P.M.: Incomplete line LU as smoother and as preconditioner. In: Hackbusch and Wittum [208], pp. 215–224
106. Debit, N., Garbey, M., Hoppe, R.H.W., Keyes, D.E., Kuznetsov, Y.A., Périaux, J. (eds.): Domain Decomposition Methods in Science and Engineering. CIMNE, Barcelona (2002). (Lyon, Oct. 2000)
107. DeVore, R.A., Kunoth, A. (eds.): Multiscale, Nonlinear and Adaptive Approximation. Springer, Berlin (2009) (Günzburg, Oct. 2009)
108. Dick, E., Riemslagh, K., Vierendeels, J. (eds.): Multigrid methods VI, Lect. Notes Comput. Sci. Eng., Vol. 14. Springer, Berlin (2000). (Gent, Sep. 1999)
109. Dickopf, T., Gander, M.J., Halpern, L., Krause, R., Pavarino, L.F. (eds.): Domain Decomposition Methods in Science and Engineering XXII, Lect. Notes Comput. Sci. Eng., Vol. 104. Springer, Cham (2016). (Lugano, Sep. 2013)
110. D’Jakonov, E.G.: The construction of iterative methods based on the use of spectrally equivalent operators. USSR Comput. Math. Math. Phys. 6,1, 14–46 (1966)
111. Dryja, M.: A finite-capacitance matrix method for elliptic problems on regions partitioned into subregions. Numer. Math. 44, 153–168 (1984)
112. Dryja, M.: An additive Schwarz algorithm for two-and three-dimensional finite element elliptic problems. In: Chan et al. [93], pp. 168–172
113. Dryja, M., Hackbusch, W.: On the nonlinear domain decomposition method. BIT 37, 296–311 (1997)
114. Dryja, M., Widlund, O.B.: Towards a unified theory of domain decomposition algorithms for elliptic problems. In: Chan et al. [94], pp. 3–21
115. Dryja, M., Widlund, O.B.: Multilevel additive methods for elliptic finite element problems. In: Hackbusch [187], pp. 58–69
116. Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Clarendon Press, Oxford (1989)
117. Duff, I.S., Meurant, G.A.: The effect of ordering on preconditioned conjugate gradients. BIT 29, 635–657 (1989)
118. Eiermann, M., Niethammer, W., Ruttan, A.: Optimal successive overrelaxation iterative methods for p-cyclic matrices. Numer. Math. 57, 593–606 (1990)
119. Eiermann, M., Niethammer, W., Varga, R.S.: A study of semiiterative methods for non-symmetric systems of linear equations. Numer. Math. 47, 505–533 (1985)
120. Eiermann, M., Niethammer, W., Varga, R.S.: Iterationsverfahren für nichtsymmetrische Gleichungssysteme und Approximationsmethoden im Komplexen. Jber. d. Dt. Math.-Verein. 89, 1–33 (1987)
121. Elman, H.C.: Relaxed and stabilized incomplete factorizations for non-self-adjoint linear systems. BIT 29, 890–915 (1989)
122. Erhel, J., Gander, M.J., Halpern, L., Pichot, G., Sassi, T., Widlund, O.B. (eds.): Domain Decomposition Methods in Science and Engineering XXI, Lect. Notes Comput. Sci. Eng., Vol. 98. Springer, Berlin (2014). (Rennes, Jun. 2012)
123. Espig, M., Hackbusch, W., Khachatryan, A.: On the convergence of alternating least squares optimisation in tensor format representations. arXiv (2015)
124. Espig, M., Hackbusch, W., Litvinenko, A., Matthies, H.G., Wähnert, P.: Efficient low-rank approximation of the stochastic Galerkin matrix in tensor formats. Comput. Math. Appl. 67, 818–829 (2014)
125. Espig, M., Hackbusch, W., Rohwedder, T., Schneider, R.: Variational calculus with sums of elementary tensors of fixed rank. Numer. Math. 122, 469–488 (2012)
126. Falcó, A., Nouy, A.: Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces. Numer. Math. 121, 503–530 (2012)
127. Farhat, C., Roux, F.X.: A method of finite element tearing and interconnecting and its parallel solution algorithm. Int. J. Num. Meth. Engng. 32, 1205–1227 (1991)
128. Faustmann, M.: Approximation inverser Finite Elemente-und Randelementematrizen mittels hierarchischer Matrizen. Doctoral thesis, Technische Universität Wien (2015)
129. Faustmann, M., Melenk, J.M., Praetorius, D.: H-matrix approximability of the inverses of FEM matrices. Numer. Math. 131, 615–642 (2015)
130. Faustmann, M., Melenk, J.M., Praetorius, D.: Existence of H-matrix approximants to the inverses of BEM matrices: the simple-layer operator. Math. Comp. 85, 119–152 (2016)
131. Fedorenko, R.P.: A relaxation method for solving elliptic difference equations. USSR Comput. Math. Math. Phys. 1, 1092–1096 (1961)
132. Fedorenko, R.P.: The speed of convergence of one iterative process. USSR Comput. Math. Math. Phys. 4, 227–235 (1964)
133. Fischer, B.: Polynomial Based Iteration Methods for Symmetric Linear Systems. Advances in Numerical Mathematics. J. Wiley and Teubner, Stuttgart (1996)
134. Fischer, B., Freund, R.W.: On the constrained Chebyshev approximation problem on ellipses. J. Approx. Theory 62, 297–315 (1990)
135. Fischer, B., Freund, R.W.: Chebyshev polynomials are not always optimal. J. Approx. Theory 65, 261–272 (1991)
136. Fletcher, R.: Conjugate gradient methods for indefinite systems. In: Watson [389], pp. 73–89
137. Forsythe, G.E.: Gauss to Gerling on relaxation. Math. Tables and Other Aids to Computation 5, 255–258 (1951)
138. Forsythe, G.E.: Solving linear algebraic equations can be interesting. Bull. Amer. Math. Soc. 59, 299–329 (1953)
139. Forsythe, G.E., Strauss, E.G.: On best conditioned matrices. Proc. Amer. Soc. 6, 340–345 (1955)
140. Fridman, V.M.: The method of minimum iterations with minimum errors for a system of linear algebraic equations with a symmetrical matrix. USSR Comput. Math. Math. Phys. 2, 362–363 (1963)
141. Frobenius, G.: Über Matrizen aus positiven Elementen. Sitzungsbericht Akad. Wiss. Phys.-math. Klasse Berlin pp. 417–476 (1908)
142. Frobenius, G.: Über Matrizen aus positiven Elementen. Sitzungsbericht Akad. Wiss. Phys.-math. Klasse Berlin pp. 514–518 (1909)
143. Frommer, A., Szyld, D.B.: H-Splittings and two-stage iterative methods. Numer. Math. 63, 345–356 (1992)
144. Gantmacher, F.R.: Matrizenrechnung, Band I. Deutscher Verlag der Wissenschaften, Berlin (1958)
145. Gantmacher, F.R.: The Theory of Matrices, Vol. 1. AMS Chelsea Publ. (1959)
146. Gauss, C.F.: Nachlass: Theoria interpolationis: methodo nova tractata [1805]. In: Werke, Vol. 3, pp. 265–303. Königliche Gesellschaft der Wissenschaft, Göttingen (1866). Reprint by Georg Olms, Hildesheim, 1981
147. Gauss, C.F.: Supplementum theoriae combinationis observationum erroribus minimis ob-noxiae [1826]. In: Werke, Vol. 4, pp. 55–93. Königliche Gesellschaft der Wissenschaft, Göttingen (1873). Reprint by Georg Olms, Hildesheim, 1981
148. Gauss, C.F.: Brief an Gerling [1823]. In: Werke, Vol. 9, pp. 278–281. Königliche Gesell-schaft der Wissenschaft, Göttingen (1903). Reprint by Georg Olms, Hildesheim, 1981. English translation in [137]
149. George, A.: Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 10, 345–363 (1973)
150. Glowinski, R., Golub, G.H., Meurant, G.A., Périaux, J. (eds.): First International Symposium on Domain Decomposition Methods for Partial Differential Equations. SIAM, Philadelphia (1988). (Paris, Jan. 1987)
151. Glowinski, R., Kuznetsov, Y.A., Meurant, G.A., Périaux, J., Widlund, O.B. (eds.): Fourth International Symposium on Domain Decomposition Methods for Partial Differential Equations. SIAM, Philadelphia (1991). (Moscow, May 1990)
152. Glowinski, R., Lions, J.L. (eds.): Computing Methods in Applied Sciences and Engineering, Lect. Notes Econ. Math. Syst., Vol. 134. Addison-Wesley Publ., Reading, Mass. (1976)
153. Glowinski, R., Périaux, J., Shi, Z.C., Widlund, O.B. (eds.): Domain Decomposition Methods in Science and Engineering. John Wiley & Sons, Strasbourg (1997). (Beijing, May 1995)
154. Golub, G.H.: Direct methods for solving elliptic difference equations. In: Morris [285], pp. 1–19.
155. Golub, G.H., O’Leary, D.P.: Some history of the conjugate gradient and Lanczos algorithms: 1948-1976. SIAM Rev. 31, 50–102 (1989)
156. Golub, G.H., Overton, M.L.: The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems. Numer. Math. 53, 571–593 (1988)
157. Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd ed. The Johns Hopkins University Press, Baltimore (1996)
158. Grasedyck, L.: Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure. Computing 72, 247–265 (2004)
159. Grasedyck, L.: Existence of a low rank or H-matrix approximant to the solution of a Sylvester equation. Numer. Linear Algebra Appl. 11, 371–389 (2004)
160. Grasedyck, L.: Nonlinear multigrid for the solution of large-scale Riccati equations in low-rank and H-matrix format. Numer. Linear Algebra Appl. 15, 779–807 (2008)
161. Grasedyck, L., Hackbusch, W.: Construction and arithmetics of H-matrices. Computing 70, 295–334 (2003)
162. Grasedyck, L., Hackbusch, W.: A multigrid method to solve large scale Sylvester equations. SIAM J. Matrix Anal. Appl. 29, 870–894 (2007)
163. Grasedyck, L., Hackbusch, W., Khoromskij, B.: Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices. Computing 70, 121–165 (2003)
164. Grasedyck, L., Hackbusch, W., Kriemann, R.: Performance of H-LU preconditioning for sparse matrices. Comput. Methods Appl. Math. 8, 336–349 (2008)
165. Grasedyck, L., Kriemann, R., Le Borne, S.: Parallel black box H-LU preconditioning for elliptic boundary value problems. Comput. Vis. Sci. 11, 273–291 (2008)
166. Grasedyck, L., Kriemann, R., Le Borne, S.: Domain decomposition based H-LU pre-conditioning. Numer. Math. 112, 565–600 (2009)
167. Greenbaum, A.: Iterative Methods for Solving Linear Systems. SIAM, Philadelphia (1997)
168. Griebel, M.: Multilevel algorithms considered as iterative methods on semidefinite systems. SIAM J. Sci. Comput. 15, 547–565 (1994)
169. Griebel, M.: Multilevelmethoden als Iterationsverfahren über Erzeugendensystemen. Teub-ner Skripten zur Numerik. Teubner, Stuttgart (1994)
170. Griebel, M., Oswald, P.: On the abstract theory of additive and multiplicative Schwarz algorithms. Numer. Math. 70, 163–180 (1995)
171. Gunn, J.E.: The solution of elliptic difference equations by semi-explicit iterative techniques. SIAM J. Numer. Anal. 2, 24–45 (1964)
172. Gustafsson, I.: A class of first order factorization methods. BIT 18, 142–156 (1978)
173. Gutknecht, M.H.: A completed theory of the unsymmetric Lanczos process and related algorithms, part I. SIAM J. Matrix Anal. Appl. 13, 594–639 (1992)
174. Gutknecht, M.H.: A completed theory of the unsymmetric Lanczos process and related algorithms, part II. SIAM J. Matrix Anal. Appl. 15, 15–58 (1994)
175. Gutknecht, M.H.: Lanczos-type solvers for nonsymmetric linear systems of equations. Acta Numerica 6, 271–397 (1997)
176. Hackbusch, W.: A fast iterative method solving Poisson’s equation in a general region. In: Bulirsch et al. [85], pp. 51–62
177. Hackbusch, W.: The fast numerical solution of very large elliptic difference schemes. J. Inst. Maths. Appl. 26, 119–132 (1980)
178. Hackbusch, W.: Bemerkungen zur iterativen Defektkorrektur und zu ihrer Kombination mit Mehrgitterverfahren. Rev. Roumaine Math. Pures Appl. 26, 1319–1329 (1981)
179. Hackbusch, W.: Fast numerical solution of time-periodic parabolic problems by a multi-grid method. SIAM J. Sci. Statist. Comput. 2, 198–206 (1981)
180. Hackbusch, W.: On the regularity of difference schemes. Ark. Mat. 19, 71–95 (1981)
181. Hackbusch, W.: On the regularity of difference schemes, part II: regularity estimates for linear and nonlinear problems. Ark. Mat. 21, 3–28 (1983)
182. Hackbusch, W. (ed.): Efficient Solvers for Elliptic Systems, Notes on Numerical Fluid Mechanics, Vol. 10. Vieweg, Braunschweig (1984). (Kiel, Jan. 1984)
183. Hackbusch, W.: Multi-grid Methods and Applications, SCM, Vol. 4. Springer, Berlin (1985)
184. Hackbusch, W.: Multi-grid methods of the second kind. In: Paddon and Holstein [306], pp. 11–83
185. Hackbusch, W. (ed.): Robust Multi-grid Methods, Notes on Numerical Fluid Mechanics, Vol. 23. Vieweg, Braunschweig (1988). (Kiel, Jan. 1988)
186. Hackbusch, W.: The frequency decomposition multi-grid method, part I: application to anisotropic equations. Numer. Math. 56, 229–245 (1989)
187. Hackbusch, W. (ed.): Parallel algorithms for PDEs, Notes on Numerical Fluid Mechanics, Vol. 31. Vieweg, Braunschweig (1991). (Kiel, Jan. 1990)
188. Hackbusch, W.: The solution of large systems of BEM equations by the multi-grid and panel clustering technique. Rend. Semin. Mat. Politec. Torino pp. 163–187 (1991)
189. Hackbusch, W.: Comparison of different multi-grid variants for nonlinear equations. ZAMM 72, 148–151 (1992)
190. Hackbusch, W.: The frequency decomposition multi-grid method, part II: convergence analysis based on the additive Schwarz method. Numer. Math. 63, 433–453 (1992)
191. Hackbusch, W.: Integral Equations – Theory and Numerical Treatment, ISNM, Vol. 128. Birkhäuser, Basel (1995)
192. Hackbusch, W.: Direct domain decomposition using the hierarchical matrix technique. In: Herrera et al. [217], pp. 39–50
193. Hackbusch, W.: Elliptic Differential Equations – Theory and Numerical Treatment, SSCM, Vol. 18, 2nd ed. Springer, Berlin (2003)
194. Hackbusch, W.: Multi-Grid Methods and Applications, SCM, Vol. 4. Springer, Berlin (2003)
195. Hackbusch, W.: Tensor Spaces and Numerical Tensor Calculus, SSCM, Vol. 42. Springer, Berlin (2012)
196. Hackbusch, W.: Numerical tensor calculus. Acta Numerica 23, 651–742 (2014)
197. Hackbusch, W.: The Concept of Stability in Numerical Mathematics, SSCM, Vol. 45. Springer, Berlin (2014)
198. Hackbusch, W.: Hierarchical Matrices: Algorithms and Analysis, SSCM, Vol. 49. Springer, Berlin (2015)
199. Hackbusch, W.: Solution of linear systems in high spatial dimensions. Comput. Vis. Sci. 17, 111–118 (2015).
200. Hackbusch, W.: New estimates for the recursive low-rank truncation of block-structured matrices. Numer. Math. 132, 303–328 (2016).
201. Hackbusch, W.: Theorie und Numerik elliptischer Differentialgleichungen, 4th ed. Springer Spektrum, Wiesbaden (2016)
202. Hackbusch, W., Khoromskij, B., Kriemann, R.: Direct Schur complement method by domain decomposition based on H-matrix approximation. Comput. Vis. Sci. 8, 179–188 (2005)
203. Hackbusch, W., Khoromskij, B., Tyrtyshnikov, E.E.: Approximate iterations for structured matrices. Numer. Math. 109, 365–383 (2008)
204. Hackbusch, W., Reusken, A.: Analysis of a damped nonlinear multilevel method. Numer. Math. 55, 225–246 (1989)
205. Hackbusch, W., Trottenberg, U. (eds.): Multigrid Methods, Lect. Notes Math., Vol. 960. Springer, Berlin (1982). (Köln-Porz, Nov. 1981)
206. Hackbusch, W., Trottenberg, U. (eds.): Multigrid Methods II, Lect. Notes Math., Vol. 1228. Springer, Berlin (1986). (Köln, Oct. 1985)
207. Hackbusch, W., Trottenberg, U. (eds.): Multigrid Methods III, ISNM, Vol. 98. Birkhäuser, Basel (1991). (Bonn, Oct. 1990)
208. Hackbusch, W., Wittum, G. (eds.): Incomplete Decompositions (ILU) – Algorithms, Theory, and Applications, Notes on Numerical Fluid Mechanics, Vol. 41. Vieweg, Braunschweig (1992). (Kiel, Jan. 1992)
209. Hackbusch, W., Wittum, G. (eds.): Fast Solvers for Flow Problems, Notes on Numerical Fluid Mechanics, Vol. 49. Vieweg, Braunschweig (1995). (Kiel, Jan. 1994)
210. Hackbusch, W., Wittum, G. (eds.): Multigrid Methods V, Lect. Notes Comput. Sci. Eng., Vol. 3. Springer, Berlin (1998). (Stuttgart, Oct. 1996)
211. Hadjidimos, A.: Successive overrelaxation (SOR) and related methods. J. Comput. Appl. Math. 123, 177–199 (2000)
212. Hageman, L.A., Young, D.M.: Applied Iterative Methods. Academic Press, Orlando (1981)
213. Hanke, M., Neumann, M., Niethammer, W.: On the SOR method for symmetric positive definite systems. Linear Algebra Appl. 154, 457–472 (1991)
214. Håstad, J.: Tensor rank is NP-complete. J. Algorithms 11, 644–654 (1990)
215. Heideman, M.T., Johnson, D.H., Burrus, C.S.: Gauss and the history of the fast Fourier transform. IEEE ASSP Magazine 1(4), 14–21 (1984)
216. Hemker, P.W., Wesseling, P. (eds.): Multigrid Methods IV, ISNM, Vol. 116. Birkhäuser, Basel (1994). (Amsterdam, July 1993)
217. Herrera, I., Keyes, D.E., Widlund, O.B., Yates, R. (eds.): Domain Decomposition Methods in Science and Engineering. National Autonomous University of Mexico, Mexico City (2003). (Cocoyoc, Mexico, Jan. 2002)
218. Hestenes, M.R.: Conjugate Direction Methods in Optimization. Springer, New York (1980)
219. Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Standards 49, 409–436 (1952)
220. Heun, K.: Neue Methoden zur approximativen Integration der Differentialgleichungen einer unabhängigen Veränderlichen. Z. für Math. und Phys. 45, 23–38 (1900)
221. Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd ed. SIAM, Philadelphia (2002)
222. Higham, N.J.: Functions of Matrices, Theory and Computation. SIAM, Philadelphia (2008)
223. Hockney, R.W.: A fast direct solution of Poisson’s equation using Fourier analysis. J. ACM 12, 95–113 (1965)
224. Holtz, S., Rohwedder, T., Schneider, R.: The alternating linear scheme for tensor optimization in the tensor train format. SIAM J. Sci. Comput. 34, A683–A713 (2012)
225. Huang, Y., Kornhuber, R., Widlund, O.B., Xu, J. (eds.): Domain Decomposition Methods in Science and Engineering XIX, Lect. Notes Comput. Sci. Eng., Vol. 78. Springer, Berlin (2011). (Zhanjiajie, Aug. 2009)
226. Ilin, V.P.: Somes estimates for conjugate gradient methods. USSR Comput. Math. Math. Phys. 16,4, 22–30 (1976)
227. Jacobi, C.G.J.: Über eine neue Auflösungsart der bei der Methode der kleinsten Quadrate vorkommenden linearen Gleichungen. Astron. Nachr. 32, 297–306 (1845)
228. Jennings, A., Malik, G.M.: Partial elimination. J. IMA 20, 307–316 (1977)
229. Jovanovič, B., Süli, E.: Analysis of finite difference schemes for linear partial differential equations with generalized solutions, SSCM, Vol. 46. Springer, London (2014)
230. Kaczmarz, S.: Angenäherte Auflösung von Systemen linearer Gleichungen. Bulletin de l’Academie Polonaise des Sciences et Lettres, Classe des Sciences Mathématiques et Naturelles, Série A 35, 355–357 (1937)
231. Kaczmarz, S.: Approximate solution of systems of linear equations. Internat. J. Control 57, 1269–1271 (1993)
232. Kahan, W.M.: Gauss–Seidel methods of solving large systems of linear equations. Doctoral thesis, University of Toronto, Canada (1958)
233. Kanzow, C.: Numerik linearer Gleichungssysteme – Direkte und iterative Verfahren. Springer, Berlin (2005)
234. Karhunen, K.: Über lineare Methoden in der Wahrscheinlichkeitsrechnung. Ann. Acad. Sci. Fennicae. Ser. A. I. Math.-Phys. 37, 1–79 (1947)
235. Kettler, R.: Analysis and comparison of relaxation schemes in robust multigrid and preconditioned conjugate gradient methods. In: Hackbusch and Trottenberg [205], pp. 502–534
236. Keyes, D.E., Chan, T.F., Meurant, G.A., Scroggs, J.S., Voigt, R.G. (eds.): Fifth International Symposium on Domain Decomposition Methods for Partial Differential Equations. SIAM, Philadelphia (1992). (Norfolk, May 1991)
237. Keyes, D.E., Xu, J. (eds.): Domain Decomposition Methods in Science and Engineering Computing. AMS, Providence (1994). (Penn State, Oct. 1993)
238. d. Constr. Approx. 30, 599–620 (2009)
239. Kornhuber, R., Hoppe, R.H.W., Périaux, J., Pironneau, O., Widlund, O.B., Xu, J. (eds.): Domain Decomposition Methods in Science and Engineering XV, Lect. Notes Comput. Sci. Eng., Vol. 40. Springer, Berlin (2005). (Berlin, July 2003)
240. Kosmol, P.: Methoden zur numerischen Behandlung nichtlinearer Gleichungen und Opti-mierungsaufgaben. Teubner, Stuttgart (1989)
241. Kosmol, P., Zhou, X.: The limit points of affine iterations. Numer. Funct. Anal. Optim. 11, 403–409 (1990)
242. Kressner, D., Tobler, C.: Krylov subspace methods for linear systems with tensor product structure. SIAM J. Matrix Anal. Appl. 31, 1688–1714 (2010)
243. Kressner, D., Tobler, C.: Low-rank tensor Krylov subspace methods for parametrized linear systems. SIAM J. Matrix Anal. Appl. 32, 1288–1316 (2011)
244. Kressner, D., Tobler, C.: Preconditioned low-rank methods for high-dimensional elliptic PDE eigenvalue problems. Comput. Methods Appl. Math. 11, 363–381 (2011)
245. Kriemann, R.: Parallel H-matrix arithmetics on shared memory systems. Computing 74, 273–297 (2005)
246. Kriemann, R., Le Borne, S.: H-FAINV: hierarchically factored approximate inverse pre-conditioners. Comput. Vis. Sci. 17, 135–150 (2015).
247. Kronsjö, L.: A note on the ‘nested iteration’ method. BIT 15, 107–110 (1975)
248. Kronsjö, L., Dahlquist, G.: On the design of nested iterations for elliptic difference equations. BIT 12, 63–71 (1972). [The front page of the paper shows wrong data: vol. 11 (1971)]
249. Krylov, A. N.: On the numerical solution of the equation by which in technical questions frequencies of small oscillations of material systems are determined [in Russian]. Izvestiya Akademii Nauk SSSR, Otdelenie Matematicheskikh i Estestvennykh Nauk 7, 491–539 (1931)
250. Kutta, W. M.: Beitrag zur näherungsweisen Integration totaler Differentialgleichungen. Zeitschrift für Math. und Phys. 46, 435–453 (1901)
251. Kuznetsov, Y.A.: Algebraic domain decomposition methods I. Sov. J. Numer. Anal. Math. Modelling 4, 361–392 (1989)
252. Kuznetsov, Y.A.: Multigrid domain decomposition methods for elliptic problems. Comput. Methods Appl. Mech. Engrg. 75, 185–193 (1989)
253. Kuznetsov, Y.A.: Multigrid domain decomposition methods. In: Chan et al. [94], pp. 290–313
254. Lai, C.H., Bjørstad, P.E., Cross, M., Widlund, O.B. (eds.): Eleventh International Conference on Domain Decomposition Methods. ddm.org (1999). (Greenwich, July 1998)
255. Lanczos, C.: Solution of systems of linear equations by minimized iterations. J. Res. Nat. Bur. Standards 49, 33–53 (1952)
256. Landweber, L.: An iteration formula for Fredholm integral equations of the first kind. Amer. J. Math. 73, 615–624 (1951)
257. Langer, R.E. (ed.): Boundary Problems in Differential Equations. Kluwer Academic Publ., Dortrecht (1960). (Madison, April 1959)
258. Langer, U., Discacciati, M., Keyes, D.E., Widlund, O.B., Zulehner, W. (eds.): Domain Decomposition Methods in Science and Engineering XVII, Lect. Notes Comput. Sci. Eng., Vol. 60. Springer, Berlin (2008). (St. Wolfgang/Strobl, July 2006)
259. Le Borne, S., Grasedyck, L., Kriemann, R.: Domain decomposition based H-LU precondi-tioners. In: Widlund and Keyes [399], pp. 661–668. (New York, Jan. 2005)
260. Lebedev, V.I.: On a Zolotarev problem in the method of alternating directions. USSR Comput. Math. Math. Phys. 17,2, 58–76 (1971)
261. Lebedev, V.I., Finogenov, S.A.: On the order of choice of the iteration parameters in the Chebyshev cyclic iteration method. USSR Comput. Math. Math. Phys. 11,2, 155–170 (1971)
262. Lebedev, V.I., Finogenov, S.A.: On the order of choice of the iteration parameters in the Chebyshev cyclic iteration method. USSR Comput. Math. Math. Phys. 13,1, 21–41 (1973)
263. Liebmann, K.O.H.: Die angenäherte Ermittlung harmonischer Funktionen und konformer Abbildung. Sitzungsberichte der Mathematisch-Naturwissenschaftlichen Abteilung der Bayerischen Akademie der Wissenschaften zu München 47, 385–416 (1918)
264. Liesen, J., Saylor, P.E.: Orthogonal Hessenberg reduction and orthogonal Krylov subspace bases. SIAM J. Numer. Anal. 42, 2148–2158 (2005)
265. Liesen, J., Strakos, Z.: Krylov Subspace Methods, Principles and Analysis. Oxford University Press, Oxford (2013)
266. Lions, P. L.: On the Schwarz alternating method I. In: Glowinski et al. [150], pp. 1–42
267. Loève, M.: Probability Theory II, 4th ed. Springer, New York (1978)
268. MacLachlan, S.P., Oosterlee, C.W.: Algebraic multigrid solvers for complex-valued matrices. SIAM J. Sci. Comput. 30, 1548–1571 (2008)
269. Mandel, J.L.: A multilevel iterative method for symmetric, positive definite problems. Appl. Math. Optim. 11, 77–95 (1984)
270. Mandel, J.L.: On block diagonal and Schur complement preconditioning. Numer. Math. 58, 79–93 (1990)
271. Mandel, J.L. (ed.): The Tenth International Conference on Domain Decomposition Methods. AMS, Providence (1998). (Boulder, Aug. 1997)
272. Manteuffel, T.A.: Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration. Numer. Math. 31, 183–208 (1978)
273. Manteuffel, T.A.: An incomplete factorization technique for positive definite linear systems. Math. Comp. 34, 473–497 (1980)
274. Marchuk, G.: Splitting and alternating direction methods. In: Ciarlet–Lions [96], pp. 197–462
275. Marek, I.: Iterative methods for solving linear systems with a rectangular matrix. Report 8132, Universiteit Nijmegen (1981)
276. Mathew, T. P. A.: Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations. Springer, Berlin (2008)
277. Matthies, H.G., Zander, E.: Solving stochastic systems with low-rank tensor compression. Linear Algebra Appl. 436, 3819–3838 (2012)
278. McCormick, S.F. (ed.): Multigrid Methods. SIAM, Philadelphia (1987)
279. Meijerink, J.: Iterative methods for the solution of linear equations based on incomplete factorisation of the matrix. Shell Publ. 643, Rijswijk (1983). Published as SPE Conference Paper, doi:10.2118/12262-MS
280. Meijerink, J., van der Vorst, H.A.: An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. Comp. 31, 148–162 (1977)
281. Meis, T., Marcowitz, U.: Numerische Behandlung partieller Differentialgleichungen. Springer, Berlin (1978)
282. Meis, T., Marcowitz, U.: Numerical Solution of Partial Differential Equations. Springer, New York (1981)
283. Meurant, G.A.: The Lanczos and Conjugate Gradient Algorithms: from Theory to Finite Precision Computations. SIAM, Philadelphia (2006)
284. Mohlenkamp, M.J.: Musings on multilinear fitting. Linear Algebra Appl. 438, 834–852 (2013)
285. Morris, J.L. (ed.): Symposium on the Theory of Numerical Analysis, Lect. Notes Math., Vol. 193. Springer, Berlin (1971). (Dundee, Sep. 1970)
286. Mróz, M.: Domain decomposition method for elliptic mixed boundary value problems. Computing 42, 45–59 (1989)
287. Natterer, F.: The Mathematics of Computerized Tomography. J. Wiley and Teubner, Stuttgart (1986)
288. Nepomnyaschikh, S.V.: Domain decomposition and Schwarz methods in a subspace for the approximate solution of elliptic boundary value problems [in Russian]. Doctoral thesis, University Novosibirsk (1986)
289. Neumaier, A., Varga, R.S.: Exact convergence and divergence domains for the symmetric successive overrelaxation iterative (SSOR) method applied to H-matrices. Linear Algebra Appl. 58, 261–272 (1984)
290. Nicolaides, R.: On multiple grid and related techniques for solving discrete elliptic systems. J. Comput. Phys. 19, 418–431 (1975)
291. Niethammer, W.: Relaxation bei komplexen Matrizen. Math. Z. 86, 34–40 (1964)
292. Niethammer, W.: Relaxation bei nichtsymmetrischen Matrizen. Math. Z. 85, 319–327 (1964)
293. Niethammer, W.: The SOR method on parallel computers. Numer. Math. 56, 247–254 (1989)
294. Niethammer, W., Varga, R.S.: The analysis of k-step iterative methods for linear systems from summability theory. Numer. Math. 41, 177–206 (1983)
295. Oertel, K.D., Stüben, K.: Multigrid with ILU-smoothing: systematic tests and improvements. In: Hackbusch [185], pp. 188–199
296. O’Leary, D.P., White, R.E.: Multi-splitting of matrices and parallel solution of linear systems. SIAM J. Alg. Disc. Meth. 6, 630–640 (1985)
297. Opfer, G., Schober, G.: Richardson’s iteration for nonsymmetric matrices. Linear Algebra Appl. 58, 343–361 (1984)
298. Ortega, J.M.: Introduction to Parallel Vector Solution of Linear Systems. Plenum Press, New York (1988)
299. Oseledets, I.V.: DMRG approach to fast linear algebra in the TT-format. Comput. Methods Appl. Math. 11, 382–393 (2011)
300. Oseledets, I.V., Tyrtyshnikov, E.E.: TT-cross approximation for multidimensional arrays. Linear Algebra Appl. 432, 70–88 (2010)
301. Ostrowski, A.M.: Über die Determinanten mit überwiegender Hauptdiagonale. Comment. Math. Helv. 10, 69–96 (1937)
302. Ostrowski, A.M.: On the linear iteration procedures for symmetric matrices. Rend. Math. Appl. 14, 140–163 (1954)
303. Oswald, P.: On function spaces related to finite element approximation theory. Z. Anal. Anwendungen 9, 43–64 (1990)
304. Oswald, P.: Multilevel finite element approximation. Teubner Skripten zur Numerik. Teubner, Stuttgart (1994)
305. Oswald, P.: On the convergence rate of SOR: a worst case estimate. Computing 52, 245–255 (1994)
306. Paddon, D.J., Holstein, H. (eds.): Multigrid Methods for Integral and Differential Equations. Clarendon Press, Oxford (1985). (Bristol, Sep. 1983)
307. Paige, C.C., Saunders, M.A.: Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12, 617–629 (1975)
308. Peaceman, D.W., Rachford, H.H.: The numerical solution of parabolic and elliptic differential equations. J. SIAM 3, 28–41 (1955)
309. Pearcy, C.: An elementary proof of the power inequality for the numerical radius. Michigan Math. J. 13, 289–291 (1966)
310. Penzl, T.: Low rank solution of data-sparse Sylvester equations. Systems Control Lett. 40, 139–144 (2000)
311. Perron, O.: Zur Theorie der Matrices. Math. Ann. 64, 248–263 (1907)
312. Proskurowski, W., Widlund, O.B.: On the numerical solution of Helmholtz’s equation by the capacitance matrix method. Math. Comp. 30, 433–468 (1976)
313. Quarteroni, A., Périaux, J., Kuznetsov, Y.A., Widlund, O.B. (eds.): Domain Decomposition Methods in Science and Engineering. AMS, Providence (1994). (Como, Jun. 1992)
314. Quarteroni, A., Sacco, R., Saleri, F.: Numerical Mathematics, 2nd ed. Springer, Berlin (2007)
315. Quarteroni, A., Valli, A.: Domain Decomposition Methods for Partial Differential Equations. Oxford University Press, Oxford (1999)
316. Reich, E.: On the convergence of the classical iterative procedures for symmetric matrices. Ann. Math. Statist. 20, 448–451 (1949)
317. Reid, J.K.: A method for finding the optimum successive overrelaxation factor. Comput. J. 9, 200–204 (1966)
318. Reid, J.K. (ed.): Large Sparse Sets of Linear Equations. Academic Press, New York (1971). (Oxford, Apr. 1970)
319. Reid, J.K.: On the method of conjugate gradients for the solution of large sparse systems of linear equations. In: Reid [318], pp. 231–254
320. Reiter, S., Vogel, A., Heppner, I., Rupp, M., Wittum, G.: A massively parallel geometric multigrid solver on hierarchically distributed grids. Comput. Vis. Sci. 16, 151–164 (2013)
321. Reusken, A.: Steplength optimization and linear multigrid methods. Numer. Math. 58, 819–838 (1991)
322. Reusken, A.: On maximum norm convergence of multigrid methods for two-point boundary value problems. SIAM J. Numer. Anal. 29, 1569–1578 (1992)
323. Reusken, A.: The smoothing property for regular splittings. In: Hackbusch and Wittum [208], pp. 130–138
324. Richardson, L.F.: The approximate arithmetical solution by finite differences of physical problems involving differential equations, with an application to the stresses in a masonry dam. Philosophical Transactions of the Royal Society of London, Series A 210, 307–357 (1910)
325. Richardson, L.F., Gaunt, A.: The deferred approach to the limit. Philosophical Transactions of the Royal Society of London, Series A 226, 299–361 (1927)
326. Riesz, F., Sz.-Nagy, B.: Vorlesungen über Funktionalanalysis, 4th ed. VEB Deutscher Verlag der Wissenschaften, Berlin (1982)
327. Runge, C.D.T.: Ueber die numerische Auflösung von Differentialgleichungen. Math. Ann. 46, 167–178 (1895)
328. Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd ed. SIAM, Philadelphia (2003)
329. Saad, Y., Schultz, M.H.: A generalized minimal residual method for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7, 856–869 (1986)
330. Samarskii, A.A., Nikolaev, E.S.: Numerical Methods for Grid Equations, Vol. II, Iterative Methods. Birkhäuser, Basel (1989)
331. Sauter, S.A., Schwab, C.: Boundary Element Methods, SSCM, Vol. 39. Springer, Berlin (2011)
332. Savas, B., Eldén, L.: Krylov-type methods for tensor computations I. Linear Algebra Appl. 438, 891–918 (2013)
333. Schröder, J., Trottenberg, U.: Reduktionsverfahren für Differenzengleichungen I. Numer. Math. 22, 37–68 (1973)
334. Schultz, M. H. (ed.): Elliptic Problem Solvers. Academic Press, New York (1981). (Santa Fe, June 1980)
335. Schwab, C., Todor, R.A.: Karhunen-Loève approximation of random fields by generalized fast multipole methods. J. Comput. Phys. 217, 100–122 (2006)
336. Schwarz, H. A.: Über einen Grenzübergang durch alternierende Verfahren. Vierteljahres-schrift der Naturforschenden Gesellschaft in Zürich 15, 272–286 (1870)
337. Seidel, P.L.: Über ein Verfahren, die Gleichungen, auf welche die Methode der kleinsten Quadrate führt, sowie lineare Gleichungen überhaupt, durch successive Annäherung aufzu-lösen. Abhandlungen der Mathematisch-Physikalischen Klasse der Königlich Bayerischen Akademie der Wissenschaften 11, 81–108 (1874)
338. Shaidurov, V.V.: Multigrid Methods for Finite Elements. Kluwer Academic Publ., Dortrecht (1995)
339. Sheldon, J.: On the numerical solution of elliptic difference equations. Math. Tables and Other Aids to Computation 9, 101–112 (1955)
340. Singh, S.P., Burry, J.W.H., Watson, B. (eds.): Approximation Theory and Spline Functions. Reidel Publ., Dordrecht (1984). (Newfoundland, Aug./Sep. 1983)
341. Skeel, R.D.: Iterative refinement implies numerical stability for Gaussian elimination. Math. Comp. 35, 817–832 (1980)
342. Skeel, R.D.: Effect of equilibration on residual size of partial pivoting. SIAM J. Numer. Anal. 18, 449–454 (1981)
343. Smith, B.F., Bjørstad, P.E., Gropp, W.: Domain Decomposition. Cambridge University Press, Cambridge (1996)
344. Sonneveld, P.: CGS, a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 10, 36–52 (1989)
345. Sonneveld, P., Wesseling, P., de Zeeuw, P.M.: Multigrid and conjugate gradient methods as convergence acceleration techniques. In: Paddon and Holstein [306], pp. 117–168
346. Southwell, R.V.: Stress-calculation in frameworks by the method of “systematic relaxation of constraints”, parts I–II. Proc. Roy. Soc. Edinburgh Sect. A 151, 56–95 (1935)
347. Southwell, R.V.: Stress-calculation in frameworks by the method of “systematic relaxation of constraints”, part III. Proc. Roy. Soc. Edinburgh Sect. A 153, 41–76 (1935)
348. Southwell, R.V.: Relaxation methods in engineering science – a treatise on approximate computation. Oxford University Press, London (1940)
349. Southwell, R.V.: Relaxation methods in theoretical physics. Clarendon Press, Oxford (1946)
350. Starke, G.: Optimal ADI parameter for nonsymmetric systems of linear equations. SIAM J. Numer. Anal. 28, 1431–1445 (1991)
351. Starke, G., Niethammer, W.: SOR for AX − XB = C. Linear Algebra Appl. 154, 355–375 (1991)
352. Stein, P., Rosenberg, R. L.: On the solution of linear simultaneous equations by iteration. J. London Math. Soc. 23, 111–118 (1948)
353. Stiefel, E.: Über einige Methoden der Relaxationsrechnung. Z. Angew. Math. Phys. 3, 1–33 (1952)
354. Stiefel, E.: Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme. Comment. Math. Helv. 29, 157–179 (1955)
355. Stoer, J.: Solution of large systems of linear equations by conjugate gradient type methods. In: Bachem et al. [22], pp. 540–565
356. Stone, H.L.: Iterative solution of implicit approximations of multi-dimensional partial differential equations. SIAM J. Numer. Anal. 5, 530–558 (1968)
357. Strakos, Z.: On the real convergence rate of the conjugate gradient method. Linear Algebra Appl. 154, 535–549 (1991)
358. Strang, G.: Variational crimes in the finite element method. In: Aziz [20], pp. 689–710
359. Stüben, K.: Algebraic multigrid (AMG): experiences and comparisons. Appl. Math. Comput. 13, 419–451 (1983)
360. Stüben, K.: A review of algebraic multigrid. J. Comput. Appl. Math. 128, 281–309 (2001)
361. Tanabe, K.: Projection method for solving a singular system of linear equations and its applications. Numer. Math. 17, 203–214 (1971)
362. Tobler, C.: Low-rank tensor methods for linear systems and eigenvalue problems. Doctoral thesis, ETH Zürich (2012)
363. Todd, J.: Applications of transformation theory: a legacy from Zolotarev (1847-1878). In: Singh et al. [340], pp. 207–245
364. Todd, J.: A lecagy from E. I. Zolotarv (1847–1878). Math. Intelligencer 10, 50–53 (1988)
365. Törnig, W.: Numerische Mathematik für Ingenieure und Physiker, Band 1: Numerische Methoden der Algebra. Springer, Berlin (1979)
366. Toselli, A., Widlund, O.B.: Domain Decomposition Methods – Algorithms and Theory, SCM, Vol. 34. Springer, Berlin (2005)
367. Trottenberg, U., Oosterlee, C.W., Schuller, A.: Multigrid. Academic Press, San Diego (2001)
368. van der Sluis, A.: Condition numbers and equilibrium matrices. Numer. Math. 14, 14–23 (1969)
369. van der Sluis, A.: Condition, equilibration and pivoting in linear algebraic systems. Numer. Math. 15, 74–86 (1970)
370. van der Sluis, A., van der Vorst, H.A.: The rate of convergence of conjugate gradients. Numer. Math. 48, 543–560 (1986)
371. van der Vorst, H.A.: A vectorizable variant of some ICCG methods. SIAM J. Sci. Statist. Comput. 3, 350–356 (1982)
372. van der Vorst, H.A.: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 13, 631–644 (1992)
373. van der Vorst, H.A.: Iterative Krylov Methods for Large Linear Systems. Cambridge University Press (2003)
374. Varga, R.S.: Factorization and normalized iterative methods. In: Langer [257], pp. 121–142
375. Varga, R.S.: Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs (1962)
376. Varga, R.S.: Geršgorin and his Circles. Springer, Berlin (2004)
377. Vassilevski, P.: Multilevel preconditioning matrices and multigrid V-cycle methods. In: Hackbusch [185], pp. 200–208
378. Vassilevski, P.: Multilevel Block Factorization Preconditioners. Springer, New York (2008)
379. Verfürth, R.: A Review of a Posteriori Error Estimation and Adaptive Mesh-refinement Techniques. J. Wiley and Teubner, Stuttgart (1996)
380. Verfürth, R.: A Posteriori Error Estimation Techniques for Finite Element Methods. Oxford University Press, Oxford (2013)
381. von Mises, R., Pollaczek-Geiringer, H.: Praktische Verfahren der Gleichungsauflösung. ZAMM 9, 58–77 (1929)
382. Wachspress, E.L.: Optimum alternating-direction-implicit iteration parameters for a model problem. J. Soc. Indust. Appl. Math. 10, 339–350 (1962)
383. Wachspress, E.L.: The ADI Model Problem. Springer, New York (2013)
384. Wachspress, E. L., Habetler, G. J.: An alternating-direction-implicit iteration technique. J. Soc. Indust. Appl. Math. 8, 403–424 (1960)
385. Wagner, C.: Tangential frequency filtering decompositions for symmetric matrices. Numer. Math. 78, 119–142 (1997)
386. Wagner, C.: Tangential frequency filtering decompositions for unsymmetric matrices. Numer. Math. 78, 143–163 (1997)
387. Wagner, C., Wittum, G.: Adaptive filtering. Numer. Math. 78, 305–328 (1997)
388. Walker, H.: Implementation of the GMRES method using Householder transformations. SIAM J. Sci. Statist. Comput. 9, 152–163 (1988)
389. Watson, G.A. (ed.): Numerical Analysis, Lect. Notes Math., Vol. 506. Springer, Berlin (1976). (Dundee, July 1975)
390. Weiler, W., Wittum, G.: Parallel frequency filtering. Computing 58, 303–316 (1997)
391. Weissinger, J.: Über das Iterationsverfahren. ZAMM 31, 245–246 (1951)
392. Weissinger, J.: Verallgemeinerungen des Seidelschen Iterationsverfahrens. ZAMM 53, 155–163 (1953)
393. Wesseling, P.: A robust and efficient multigrid method. In: Hackbusch and Trottenberg [205], pp. 614–630
394. Wesseling, P.: Theoretical and practical aspects of a multigrid method. SIAM J. Sci. Statist. Comput. 3, 387–407 (1982)
395. Wesseling, P.: An Introduction to Multigrid Methods. Wiley, Chichester (1991)
396. Widlund, O.B.: A Lanczos method for a class of nonsymmetric systems of linear equations. SIAM J. Numer. Anal. 15, 801–812 (1978)
397. Widlund, O.B.: Iterative substructuring methods: algorithms and theory for elliptic problems in the plane. In: Glowinski et al. [150], pp. 113–128
398. Widlund, O.B.: Optimal iterative refinement methods. In: Chan et al. [93], pp. 114–125
399. Widlund, O.B., Keyes, D.E. (eds.): Domain Decomposition Methods in Science and Engineering XVI, Lect. Notes Comput. Sci. Eng., Vol. 55. Springer, Berlin (2007). (New York, Jan. 2005)
400. Wittum, G.: Distributive Iterationen für indefinite Systeme als Glätter im Mehrgitterver-fahren am Beispiel der Stokes-und Navier-Stokes-Gleichungen mit Schwerpunkt auf un-vollständigen Zerlegungen. Doctoral thesis, Universität zu Kiel (1986)
401. Wittum, G.: On the robustness of ILU-smoothing. In: Hackbusch [185], pp. 217–239
402. Wittum, G.: Linear iterations as smoothers in multigrid methods: theory with applications to incomplete decompositions. Impact Comput. Sci. Eng. 1, 180–215 (1989)
403. Wittum, G.: On the robustness of ILU smoothing. SIAM J. Sci. Statist. Comput. 10, 699–717 (1989)
404. Wittum, G.: An ILU-based smoothing correction scheme. In: Hackbusch [187], pp. 228–240
405. Wittum, G.: Filternde Zerlegungen. Teubner Skripten zur Numerik. Teubner, Stuttgart (1992)
406. Wittum, G., Liebau, F.: On truncated incomplete decompositions. BIT 29, 719–740 (1989)
407. Xu, J.: Theory of multilevel methods. Ph.D. thesis, Penn State University (1989)
408. Xu, J.: A new class of iterative methods for nonselfadjoint or indefinite problems. SIAM J. Numer. Anal. 29, 303–319 (1992)
409. Xu, J.: Iterative methods by space decomposition and subspace correction. SIAM Rev. 34, 581–613 (1992)
410. Xu, J., Zikatonov, L.: Algebraic multigrid methods. Acta Numerica 26 (2017). To appear
411. Young, D.M.: Iterative methods for solving partial differential equations of elliptic type. Ph.D. thesis, Harvard University (1950)
412. Young, D.M.: Iterative Solution of Large Linear Systems. Academic Press, Orlando (1971)
413. Young, D.M.: A historical overview of iterative methods. Comput. Phys. Comm. 53, 1–17 (1989)
414. Young, D.M., Huang, R.: Some notes on complex successive overrelaxation. Report CNA-185, University of Texas at Austin (1983)
415. Yserentant, H.: Hierarchical bases of finite element spaces in the discretization of non-symmetric elliptic boundary value problems. Computing 35, 39–49 (1985)
416. Yserentant, H.: On the multi-level splitting of finite element spaces. Numer. Math. 49, 379–412 (1986)
417. Yserentant, H.: Two preconditioners based on the multi-level splitting of finite element spaces. Numer. Math. 58, 163–184 (1990)