132
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods

&
Pages 1562-1573 | Received 02 Dec 2013, Accepted 13 Apr 2016, Published online: 03 Sep 2016

References

  • N.I. Abdelmalek, Roundoff error analysis for Gram–Schmidt method and solution of linear least squares problems, BIT 11(4) (1971), pp. 354–367. doi: 10.1007/BF01939404
  • M. Arioli, The use of QR factorization in sparse quadratic programming and backward error issues, SIAM J. Matrix Anal. Appl. 21(3) (2000), pp. 825–839. doi: 10.1137/S0895479898338147
  • J.L. Barlow and A. Smoktunowicz, Reorthogonalized block classical Gram–Schmidt, Numer. Math. 123 (2013), pp. 395–423. doi: 10.1007/s00211-012-0496-2
  • M. Benzi, G. H. Golub and J. Liesen, Numerical solution of saddle point problems, Acta Numer. 14 (2005), pp. 1–137. doi: 10.1017/S0962492904000212
  • Å. Björck, Numerical Methods for Least Squares Problems, SIAM Publications, Philadelphia, PA, 1996.
  • J.W. Demmel, N.J. Higham and R.S. Schreiber, Stability of block LU factorization, Numer. Linear Algebra Appl. 12 (1995), pp. 173–190. doi: 10.1002/nla.1680020208
  • J.M. Dłużewski: Nonlinear problems during consolidation process, In Advanced numerical applications and plasticity in geomechanics, D.V. Griffiths, and G. Gioda (Eds.), Springer-Verlag, Berlin Heidelberg, 2001, pp. 81–158.
  • P.E. Gill, M.A. Saunders and J.R. Shinnerl, On the stability of Cholesky factorization for symmetric quasidefinite systems, SIAM J.Matrix Anal. Appl. 17 (1996), pp. 35–46. doi: 10.1137/S0895479893252623
  • G. H. Golub, Ch.F. Van Loan, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1996.
  • G. H. Golub and C. Greif, On solving block-structured indefinite linear systems, SIAM J. Sci. Comput. 24(6) (2003), pp. 2076–2092. doi: 10.1137/S1064827500375096
  • A. Greenbaum, M. Rozložnik and Z. Strakoš, Numerical behavior of the modified Gram–Schmidt GMRES implementation, BIT 37 (1997), pp. 706–719. doi: 10.1007/BF02510248
  • S. J. Leon, Å. Björck and W. Gander, Gram–Schmidt orthogonalization: 100 years and more, Numer. Linear Algebra Appl. 20(3) (2012), pp. 492–532. doi: 10.1002/nla.1839
  • Matrix Market. Available from http://math.nist.gov/MatrixMarket/ (2015).
  • M.F. Murphy, G. H. Golub and A. A. J. Wathen, A note on preconditioning for indefinite linear systems, SIAM J. Sci. Comput. 21(6) (2000), pp. 1969–1972. doi: 10.1137/S1064827599355153
  • F. Okulicka-Dłużewska, High-performance computing in geomechanics by a parallel finite element approach, in Applied Parallel Computing. New Paradigms for HPC in Industry and Academia, Lecture Notes In Computer Science, no. 1947, T. Sørevik, M. Fredrik, G.A. Hadish, and M. Randi, eds., Springer, Berlin Heidelberg, 2001, pp. 391–398.
  • F. Okulicka, Solving coupled consolidation equations, in Numerical Methods and Applications, Volume 4310 of the series Lecture Notes in Computer Science, T. Boyanov, S. Dimova, K. Georgiev, and G. Nikolov, eds., Springer-Verlag, Berlin Heidelberg, 2007, pp. 100–105.
  • C.C. Paige, M. Rozložnik and Z. Strakoš, Modified Gram–Schmidt (mgs), least squares and the backward stability of MGS-GMRES, SIAM J. Matrix Anal. Appl. 28(1) (2006), pp. 264–284. doi: 10.1137/050630416
  • A. Smoktunowicz and A. Smoktunowicz, Iterative refinement techniques for solving block linear systems of equations, Appl. Numer. Math. 67 (2013), pp. 220–229. doi: 10.1016/j.apnum.2011.11.004

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.