Bibliography
Published online by Cambridge University Press: 20 November 2017
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Numerical Linear AlgebraAn Introduction, pp. 395 - 402Publisher: Cambridge University PressPrint publication year: 2017
References
[1] , and 2008. Numerical linear algebra. New York: Springer. Translated from the 2002 French original by Karim Trabelsi.CrossRefGoogle Scholar
[2] 1951. The principle of minimized iteration in the solution of the matrix eigenvalue problem. Quart. Appl. Math., 9, 17–29.CrossRefGoogle Scholar
[3] , and 1993. Approximate nearest neighbor searching. Pages 271–280 of: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms. New York: ACM Press.Google Scholar
[4] , and 1995. Approximate range searching. Pages 172–181 of: Proceedings of the 11th Annual ACM Symposium on Computational Geometry. New York: ACM Press.Google Scholar
[5] 1985. A survey of preconditioned iterative methods for linear systems of algebraic equations. BIT, 25(1), 166–187.CrossRefGoogle Scholar
[6] 1994. Iterative solution methods. Cambridge: Cambridge University Press.
[7] , and 1984. Finite element solution of boundary value problems. Orlando FL: Academic Press.
[8] , and 1986. On the rate of convergence of the preconditioned conjugate gradient method. Numer. Math., 48(5), 499–523.Google Scholar
[9] , , , and 2013. The road to deterministic matrices with the restricted isometry property. J. Fourier Anal. Appl., 19(6), 1123–1149.CrossRefGoogle Scholar
[10] , , , and 2008. A simple proof of the restricted isometry property for random matrices. Constr. Approx., 28(3), 253–263.CrossRefGoogle Scholar
[11] , and 1997. A short course on fast multipole methods. Pages 1–37 of: , , , and (eds.), Wavelets, multilevel methods and elliptic PDEs. 7th EPSRC numerical analysis summer school, University of Leicester, Leicester, GB, July 8–19, 1996. Oxford: Clarendon Press.Google Scholar
[12] 2000. Approximation of boundary element matrices. Numer. Math., 86(4), 565–589.CrossRefGoogle Scholar
[13] 2008. Hierarchical matrices – A means to efficiently solve elliptic boundary value problems. Berlin: Springer.Google Scholar
[14] 2011. Adaptive cross approximation of multivariate functions. Constr. Approx., 34(2), 149–179.Google Scholar
[15] , , and 2014. Comparison of some reduced representation approximations. Pages 67–100 of: Reduced order methods for modeling and computational reduction. Cham: Springer.Google Scholar
[16] 2002. Preconditioning techniques for large linear systems: a survey. J. Comput. Phys., 182(2), 418–477.CrossRefGoogle Scholar
[17] , and 1999. A comparative study of sparse approximate inverse preconditioners. Appl. Numer. Math., 30(2–3), 305–340.CrossRefGoogle Scholar
[18] , , and 2000. Robust approximate inverse preconditioning for the conjugate gradient method. SIAM J. Sci.Comput., 22(4), 1318–1332.CrossRefGoogle Scholar
[19] , , and 1996. A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM J. Sci. Comput., 17(5), 1135–1149.CrossRefGoogle Scholar
[20] 1996. Numerical methods for least squares problems. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).CrossRefGoogle Scholar
[23] 1977. Multi-level adaptive solutions to boundary-value problems. Math. Comp., 31(138), 333–390.CrossRefGoogle Scholar
[24] , , and 1985. Algebraic multigrid (AMG) for sparse matrix equations. Pages 257–284 of: Sparsity and its applications (Loughborough, 1983). Cambridge: Cambridge University Press.Google Scholar
[25] , and 1994. The Mathematical Theory of Finite Element Methods. 3rd edn. New York: Springer.CrossRefGoogle Scholar
[26] , and 1987. Introduction. Pages 1–30 of: Multigrid methods. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).Google Scholar
[27] , , and 2000. A multigrid tutorial. 2nd edn. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).CrossRefGoogle Scholar
[28] 1995. A survey of preconditioned iterative methods. Harlow: Longman Scientific & Technical.Google Scholar
[29] 2006. Compressive sampling. Pages 1433–1452 of: International Congress of Mathematicians. Vol. III. Zürich: European Mathematical Society.Google Scholar
[30] 2008. The restricted isometry property and its implications for compressed sensing. C. R. Math. Acad. Sci. Paris, 346(9–10), 589–592.CrossRefGoogle Scholar
[31] , and 2005. Decoding by linear programming. IEEE Trans. Inform. Theory, 51(12), 4203–4215.Google Scholar
[32] , and 2008. An introduction to compressive sampling. IEEE Signal Processing Magazine, 25(2), 21–30.CrossRefGoogle Scholar
[33] , , and 2006. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math., 59(8), 1207–1223.CrossRefGoogle Scholar
[34] , , , , and 1994. A quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems. SIAM J. Sci. Comput., 15(2), 338–347.CrossRefGoogle Scholar
[35] , , and 2002. Fast evaluation of radial basis functions: Methods for generalised multiquadrics in Rn. SIAM J. Sci. Comput., 23, 1272–1310.CrossRefGoogle Scholar
[36] , and 1998. Approximate inverse preconditioners via sparse– sparse iterations. SIAM J. Sci. Comput., 19(3), 995–1023.CrossRefGoogle Scholar
[37] , and 1990. Matrix multiplication via arithmetic progressions. J. Symboli. Comput., 9(3), 251–280.CrossRefGoogle Scholar
[38] , , and 1992. Approximate inverse preconditionings for sparse linear systems. International Journal of Computer Mathematics, 44(1–4), 91–110.
[39] , , and 1991. Approximate inverse preconditioning for nonsymmetric sparse systems. Pages 101–111 of: Advances in numerical partial differential equations and optimization (Mérida, 1989). Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).Google Scholar
[40] 1996. Iterative methods for solving Ax = b, GMRES/FOM versus QMR/BiCG. Adv. Comput. Math., 6(1), 1–24.CrossRefGoogle Scholar
[41] 2010. Numerical linear algebra and applications. 2nd edn. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).
[42] , , , and 2012. Introduction to compressed sensing. Pages 1–64 of: Compressed sensing. Cambridge: Cambridge University Press.CrossRefGoogle Scholar
[44] 1997. Applied numerical linear algebra. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).CrossRefGoogle Scholar
[45] 2007. Deterministic constructions of compressed sensing matrices. J. Complexity, 23(4–6), 918–925.CrossRefGoogle Scholar
[47] , , and 2014. Finite elements and fast iterative solvers: with applications in incompressible fluid dynamics. 2nd edn. Oxford: Oxford University Press.CrossRefGoogle Scholar
[48] , and 2011. Alternating projection methods. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).CrossRefGoogle Scholar
[49] , and 1984. Necessary and sufficient conditions for the existence of a conjugate gradient method. SIAM J. Numer. Anal., 21(2), 352–362.CrossRefGoogle Scholar
[50] 2011. Polynomial based iteration methods for symmetric linear systems. Philadelphia, PA: Society for Industrial and AppliedMathematics (SIAM). Reprint of the 1996 original.CrossRefGoogle Scholar
[51] 1976. Conjugate gradient methods for indefinite systems. Pages 73–89 of: Numerical analysis (Proceedings of the 6th Biennial Dundee Conference, University of Dundee, Dundee, 1975). Berlin: Springer.Google Scholar
[52] 2015. Numerical linear algebra with applications. Amsterdam: Elsevier/ Academic Press.Google Scholar
[53] , and 2011. Compressive sensing. Pages 187–228 of: (ed.), Handbook of Mathematical Methods in Imaging. New York: Springer.Google Scholar
[54] , and 2013. A mathematical introduction to compressive sensing. New York: Birkhäuser/Springer.CrossRefGoogle Scholar
[56] 1961/1962a. The QR transformation: a unitary analogue to the LR transformation. I. Comput. J., 4, 265–271.
[57] 1961/1962b. The QR transformation. II. Comput. J., 4, 332–345.
[58] 1992. Conjugate gradient-type methods for linear systems with complex symmetric coefficient matrices. SIAM J. Sci. Statist. Comput., 13(1), 425–448.CrossRefGoogle Scholar
[59] 1993. A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems. SIAM J. Sci. Comput., 14(2), 470–482.CrossRefGoogle Scholar
[60] , and 1991. QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numer. Math., 60(3), 315–339.CrossRefGoogle Scholar
[61] , , and 1993. An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices. SIAM J. Sci. Comput., 14(1), 137–158.CrossRefGoogle Scholar
[62] , and 1994. On vector-valued inequalities of the Marcinkiewicz–Zygmund, Herz and Krivine type. Math. Nachr., 167, 95–129.
[63] , and 1982. On the numerical radius and its applications. Linear Algebra Appl., 42, 263–284.CrossRefGoogle Scholar
[64] , and 1965. Calculating the singular values and pseudoinverse of a matrix. J. Soc. Indust. Appl. Math. Ser. B Numer. Anal., 2, 205–224.CrossRefGoogle Scholar
[65] , and 1970. Singular value decomposition and least squares solutions. Numer. Math., 14(5), 403–420.Google Scholar
[66] , and 2013. Matrix computations. 4th edn. Baltimore, MD: Johns Hopkins University Press.Google Scholar
[67] , , and 1979. Generalized cross-validation as a method for choosing a good ridge parameter. Technometrics, 21(2), 215–223.CrossRefGoogle Scholar
[68] , and 1998. Sparse approximate-inverse preconditioners using norm-minimization techniques. SIAM J. Sci. Comput., 19(2), 605–625.CrossRefGoogle Scholar
[69] 1997. Iterative methods for solving linear systems. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).CrossRefGoogle Scholar
[70] 1994. Multilevelmethoden als Iterationsverfahren über Erzeugendensystemen. Stuttgart: B. G. Teubner.CrossRefGoogle Scholar
[71] , and 1995. On the abstract theory of additive and multiplicative Schwarz algorithms. Numer. Math., 70(2), 163–180.CrossRefGoogle Scholar
[72] , and 1997. Parallel preconditioning with sparse approximate inverses. SIAM J. Sci. Comput., 18(3), 838–853.CrossRefGoogle Scholar
[73] 2007. A brief introduction to Krylov space methods for solving linear systems. Pages 53–62 of: , , and (eds.), Frontiers of Computational Science. Berlin: Springer.Google Scholar
[75] 1994. Iterative solution of large sparse systems of equations. New York: Springer. Translated and revised from the 1991 German original.CrossRefGoogle Scholar
[76] 1999. A sparse matrix arithmetic based on H-matrices. I. Introduction to H-matrices. Computing, 62(2), 89–108.CrossRefGoogle Scholar
[77] 2015. Hierarchical matrices: algorithms and analysis. Heidelberg: Springer.CrossRefGoogle Scholar
[78] , and 2002. Data-sparse approximation by adaptive H2- matrices. Computing., 69(1), 1–35.CrossRefGoogle Scholar
[79] , , and 2002. An introduction to hierarchical matrices. Mathematic. Bohemica, 127(2), 229–241.Google Scholar
[80] , , and 2000. On H2-matrices. Pages 9–29 of: Lectures on applied mathematics (Munich, 1999). Berlin: Springer.Google Scholar
[81] 1992. Analysis of discrete ill-posed problems by means of the L-curve. SIAM Rev., 34(4), 561–580.CrossRefGoogle Scholar
[82] 1958. On the speed of convergence of cyclic and quasicyclic Jacobi methods for computing eigenvalues of Hermitian matrices. J. Soc. Indust. Appl. Math., 6, 144–162.CrossRefGoogle Scholar
[83] , and 1952. Methods of conjugate gradients for solving linear systems. J. Research Nat. Bur. Standards, 49, 409–436 (1953).CrossRefGoogle Scholar
[84] 1990. Exploiting fast matrix multiplication within the level 3 BLAS. ACM Trans. Math. Software, 16(4), 352–368.CrossRefGoogle Scholar
[85] 2002. Accuracy and stability of numerical algorithms. 2nd edn. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).CrossRefGoogle Scholar
[86] 1958. Unitary triangularization of a nonsymmetric matrix. J. Assoc. Comput. Mach., 5, 339–342.CrossRefGoogle Scholar
[87] , and 1993. Factorized sparse approximate inverse preconditionings. I. Theory. SIAM J. Matrix Anal. Appl., 14(1), 45–58.CrossRefGoogle Scholar
[88] , and 2011. Fast evaluation of multiquadric RBF sums by a Cartesian treecode. SIAM J. Sci. Comput., 33(5), 2341–2355.Google Scholar
[89] 1950. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Research Nat. Bur. Standards, 45, 255–282.CrossRefGoogle Scholar
[90] 1952. Solution of systems of linear equations by minimizediterations. J. Research Nat. Bur. Standards, 49, 33–53.CrossRefGoogle Scholar
[91] , and 2010. An overlapping additive Schwarz preconditioner for interpolation on the unit sphere with spherical basis functions. Journal of Complexity, 26, 552–573.CrossRefGoogle Scholar
[92] , and 2013. Krylov subspace methods – Principles and analysis. Oxford: Oxford University Press.Google Scholar
[93] 1997. On the norms of operators in the real and the complex case. Pages 67–71 of: Proceedings of the Second Seminar on Banach Spaces and Related Topics. Kitakyushu: Kyushu Institute of Technology.Google Scholar
[94] , and 1977. An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. Comp., 31(137), 148–162.Google Scholar
[95] 1999. Numerik linearer Gleichungssysteme – Eine Einführung in moderne Verfahren. Braunschweig: Friedrich Vieweg & Sohn.CrossRefGoogle Scholar
[96] , and 2001. Efficient preconditioning of linear systems arising from the discretization of hyperbolic conservation laws. Adv. Comput. Math., 14(1), 49–73.CrossRefGoogle Scholar
[97] 1984. Methods for solving incorrectly posed problems. New York: Springer. Translated from the Russian by A. B. Aries, Translation edited by Z. Nashed.CrossRefGoogle Scholar
[98] 1959. A quantitative formulation of Sylvester's law of inertia. Proc. Nat. Acad. Sci. U.S.A., 45, 740–744.CrossRefGoogle Scholar
[99] , and 1975. Solutions of sparse indefinite systems of linear equations. SIAM J. Numer. Anal., 12(4), 617–629.CrossRefGoogle Scholar
[100] 1998. The symmetric eigenvalue problem. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). Corrected reprint of the 1980 original.CrossRefGoogle Scholar
[101] 1966. An elementary proof of the power inequality for the numerical radius. Michigan Math. J., 13, 289–291.Google Scholar
[102] , and 1999. Domain decomposition methods for partial differential equations. New York: Clarendon Press.Google Scholar
[103] 1994. Highly parallel preconditioners for general sparse matrices. Pages 165–199 of: Recent advances in iterative methods. New York: Springer.Google Scholar
[104] 2003. Iterative methods for sparse linear systems. 2nd edn. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).CrossRefGoogle Scholar
[105] , and 1986. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput., 7(3), 856–869.CrossRefGoogle Scholar
[106] , and 2000. Iterative solution of linear systems in the 20th century. J. Comput. Appl. Math., 123(1-2), 1–33.CrossRefGoogle Scholar
[108] 2002. Numerical Analysis: A Mathematical Introduction. Oxford: Oxford University Press.Google Scholar
[109] , and 2002. Flexible inner–outer Krylov subspace methods. SIAM J. Numer. Anal., 40(6), 2219–2239.Google Scholar
[110] , and 2005. On the occurrence of superlinear convergence of exact and inexact Krylov subspace methods. SIAM Rev., 47(2), 247–272.CrossRefGoogle Scholar
[111] , and 2007. Recent computational developments in Krylov subspace methods for linear systems. Numer. Linear Algebr. Appl., 14(1), 1–59.Google Scholar
[112] , and 1993. BiCGstab(l) for linear equations involving unsymmetric matrices with complex spectrum. Electron. Trans. Numer. Anal., 1(Sept.), 11–32 (electronic only).
[113] , , and 1977. Practical and mathematical aspects of the problem of reconstructing objects from radiographs. Bull. Amer. Math. Soc., 83, 1227–1270.CrossRefGoogle Scholar
[114] 1989. CGS, a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J. Sci. Statist. Comput., 10(1), 36–52.CrossRefGoogle Scholar
[115] , and 2008/09. IDR(s): a family of simple and fast algorithms for solving large nonsymmetric systems of linear equations. SIAM J. Sci. Comput., 31(2), 1035–1062.Google Scholar
[116] 2005. Lösungsverfahren für lineare Gleichungssysteme. Wiesbaden: Teubner.CrossRefGoogle Scholar
[117] 1998. Matrix algorithms. Volume I: Basic decompositions. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).CrossRefGoogle Scholar
[118] 2001. Matrix algorithms. Volume II: Eigensystems. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).CrossRefGoogle Scholar
[121] , and 2003. An introduction to numerical analysis. Cambridge: Cambridge University Press.CrossRefGoogle Scholar
[122] 1996. Regression shrinkage and selection via the lasso. J. Roy. Statist. Soc. Ser. B, 58(1), 267–288.Google Scholar
[123] , and 2005. Domain decomposition methods – algorithms and theory. Berlin: Springer.CrossRefGoogle Scholar
[124] , and 1997. Numerical linear algebra. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM).CrossRefGoogle Scholar
[125] , , and 2001. Multigrid. San Diego, CA: Academic Press. With contributions by A. Brandt P., Oswald and K. Stüben.Google Scholar
[127] 1992. Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Statist. Comput., 13(2), 631–644.CrossRefGoogle Scholar
[128] 2009. Iterative Krylov methods for large linear systems. Cambridge: Cambridge University Press. Reprint of the 2003 original.Google Scholar
[130] 2007. Preconditioning and convergence in the right norm. Int. J. Comput. Math., 84(8), 1199–1209.CrossRefGoogle Scholar
[132] 2010. Fundamentals of matrix computations. 3rd edn. Hoboken, NJ: John Wiley & Sons.Google Scholar
[134] 1992a. Numerische Mathematik. Band 1: Lineare und nichtlineare Gleichungssysteme, Interpolation, numerische Integration. Braunschweig: Friedrich Vieweg & Sohn.Google Scholar
[135] 1992b. Numerische Mathematik. Band 2: Eigenwertaufgaben, lineare Optimierungsaufgaben, unrestringierte Optimierungsaufgaben. Braunschweig: Friedrich Vieweg & Sohn.Google Scholar
[136] 1983. On Ostrowski's generalization of Sylvester's law of inertia. Linear Algebra Appl., 52/53, 739–741.
[137] 1992. Iterative methods by space decomposition and subspace correction. SIAM Rev., 34(4), 581–613.CrossRefGoogle Scholar
[138] , , , and 2008. Bregman iterative algorithms for l1-minimization with applications to compressed sensing. SIAM J. Imagin. Sci., 1(1), 143–168.CrossRefGoogle Scholar
[139] 1970. Convergence properties of the symmetric and unsymmetric successive overrelaxation methods and related methods. Math. Comp., 24, 793–807.CrossRefGoogle Scholar