Skip to main content
Log in

Spectral Variants of Krylov Subspace Methods

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

Krylov iterative methods usually solve an optimization problem, per iteration, to obtain a vector whose components are the step lengths associated with the previous search directions. This vector can be viewed as the solution of a multiparameter optimization problem. In that sense, Krylov methods can be combined with the spectral choice of step length that has recently been developed to accelerate descent methods in optimization. In this work, we discuss different spectral variants of Krylov methods and present encouraging preliminary numerical experiments, with and without preconditioning.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. Barzilai and J.M. Borwein, Two point step size gradient methods, IMA J. Numer. Anal. 8 (1988) 141–148.

    Google Scholar 

  2. E.G. Birgin, I. Chambouleyron and J.M. Martínez, Estimation of the optical constants and the thickness of thin films using unconstrained optimization, J. Comput. Phys. 151 (1999) 862–880.

    Google Scholar 

  3. E.G. Birgin and Y.G. Evtushenko, Automatic differentiation and spectral projected gradient methods for optimal control problems, Optimization Methods Software 10 (1998) 125–146.

    Google Scholar 

  4. C. Brezinski, Projection Methods for Systems of Equations (North-Holland, Amsterdam, 1997).

    Google Scholar 

  5. C. Brezinski, Multiparameter descent methods, Linear Algebra Appl. 296 (1999) 113–142.

    Google Scholar 

  6. C. Brezinski and J.P. Chehab, Multiparameter iterative schemes for the solution of systems of linear and nonlinear equations, SIAM J. Sci. Comput. 20 (1999) 2140–2159.

    Google Scholar 

  7. Z. Castillo, D. Cores and M. Raydan, Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem, Optimization Engrg. 1 (2000) 155–169.

    Google Scholar 

  8. D. Cores, G. Fung and R. Michelina, A fast and global two point low storage optimization technique for tracing rays in 2D and 3D isotropic media, J. Appl. Geophys. 45 (2000) 273–287.

    Google Scholar 

  9. Y.H. Dai and L.Z. Liao, R-linear convergence of the Barzilai and Borwein gradient method, Technical Report ICM-99-039, Laboratory of Scientific and Engineering Computing, Chinese Academy of Sciences, Beijing, China (1999).

    Google Scholar 

  10. R. Fletcher, Low storage methods for unconstrained optimization, Lectures Appl. Math. 26 (1990) 165–179.

    Google Scholar 

  11. A. Friedlander, J.M. Martínez, B. Molina and M. Raydan, Gradient method with retards and generalizations, SIAM J. Numer. Anal. 36 (1999) 275–289.

    Google Scholar 

  12. W. Glunt, T.L. Hayden and M. Raydan, Molecular conformations from distance matrices, J. Comput. Chem. 14 (1993) 114–120.

    Google Scholar 

  13. A. Greenbaum, Iterative Methods for Solving Linear Systems (SIAM, Philadelphia, PA, 1997).

    Google Scholar 

  14. B. Molina and M. Raydan, The preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations, Numer. Algorithms 13 (1996) 45–60.

    Google Scholar 

  15. M. Raydan, On the Barzilai and Borwein choice of steplength for the gradient method, IMA J. Numer. Anal. 13 (1993) 321–326.

    Google Scholar 

  16. Y. Saad, Iterative Methods for Sparse Linear Systems (PWS, Boston, 1996).

    Google Scholar 

  17. C. Wells, W. Glunt and T.L. Hayden, Searching conformational space with the spectral distance geometry algorithm, J. Molecular Struct. (Theochem) 308 (1994) 263–271.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Molina, B., Raydan, M. Spectral Variants of Krylov Subspace Methods. Numerical Algorithms 29, 197–208 (2002). https://doi.org/10.1023/A:1014828526857

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014828526857

Navigation