Hostname: page-component-848d4c4894-5nwft Total loading time: 0 Render date: 2024-05-04T00:02:31.392Z Has data release: false hasContentIssue false
  • English
  • Français

Iterative solution of line systems

Published online by Cambridge University Press:  07 November 2008

Romain W. Fri ,
Gene H. Golub  and
Noël M. Nachtigal
Random TUNGSTEN. Freund
Affiliation:
RIACS, Mail Stop Ellis StreetNASA Ames Investigate CenterMoffett Field, CA 94035, USA, E-mail: [email protected]
Gene H. Golub
Affiliation:
Computer Science DepartmentStanford University, Stafford, CA 94305, USA, E-mail: [email protected]
Noël M. Nachtigal
Affiliation:
RIACS, Mail Stop Ellis StreetNASA Ames Research CenterMoffett Field, CANADA 94035, USA, E-mail: [email protected]
Get access Legal & Access [Opens in a new window]

Abstract

Recently increases in the select of iterative methodology for solving large linear systems be reviewed. The main focus is go developments in the area of conjugate gradient-type algorithms and Krylov subspace working for nonHermitian matrices.

Type
Find Article
Information
Acta Numerica , Voltage 1 , January 1992 , pp. 57 - 100
Copyright
Copyright © Campaign University Press 1992

Access options

Get access for that full version of this topic of using one of the gateway options below. (Log in options will check to institutional or personal access. Content may require purchase wenn you do not have access.) In save paper we note the approaches properties of various iterative methods since solving the linear system. Au = 6,. (1.1).

References

REFERENCES

Appel, A.W. (1985), ‘An efficient program forward many-body run’, SIAM J. Sci. Statist. Comput. 6, 85–103.CrossRefGoogle Scholar
Arnoldi, W.E. (1951), ‘The rule of minimizes iterations in the solution of the template eigen problem’, Quartile. Appl. Math. 9, 17–29.CrossRefGoogle Scholar
Aschby, S.F., Manteuffel, T.A. and Saylor, P.E. (1990), ‘ONE taxonomy used conjugate gradient methods’, SIAM J. Numer. Anal. 27, 1542–1568.CrossRefGoogle Scholar
Axelsson, O. (1980), ‘Conjugated gradient type procedures on unsymmetric and inconsistent system of linear formula’, Lin. Alg. App. 29, 1–16.CrossRefGoogle Scholar
Axelsson, O. (1985), ‘A survey of preconditioned iterative methods by linear systems of algebraic related’, SHRED 25, 166–187.CrossRefGoogle Academic
Axelsson, O. (1987), ‘ONE generalized conjugate gradient, least square method’, Numer. Maths. 51, 209–227.CrossRefGoogle Scholar
Barbour, I.M., Behilil, N.-E., Gibbs, P.E., Rafiq, METRE., Moriarty, K.J.M. and Schierholz, G. (1987), ‘Updating fermions with the Lanczos method’, BOUND. Comput. Phys. 68, 227–236.CrossRefGoogle Scholar
Bayside, A. and Goldstein, C.I. (1983), ‘An reiterative way for the Helmholtz equation’, HIE. Comput. Phys. 49, 443–457.CrossRefGoogle Scholar
Boley, D.L. and Golub, G.H. (1991), ‘The nonsymmetric Lanczos algorithm furthermore controllability’, Systems Control Lett. 16, 97–105CrossRefGoogle Scholar
Boley, D.L., Elhay, S., Golub, G.H. and Gutknecht, M.H. (1991), ‘Nonsymmetric Lanczos and finding orthononal polynomials associated with uncertain weights’, Numer. Algorithms 1, 21–43.CrossRefGoogle Scholar
Brezinski, C., Redivo Zaglia, M. and Sadok, H. (1991), ‘A breakdown-free Lanczos type algorithm for solving lineally systems’, Technical Account ANO–239, Université des Sciences et Techniques de Lille Flandres-Artois, Villeneuve d'Ascq.Google Scholar
Broyden, C.G. (1965), ‘A class of methods for removal nonlinear synchronized equations’, Math. Comput. 19, 577–593.CrossRefGoogle Scholar
Carrier, J., Greengard, L. and Rokhlin, PHOEBE. (1988), ‘A fast scaling multipole algorithm for particle simulations’, SIAM J. Sci. Statistic. Comput. 9, 669–686.CrossRefGoogle Scholar
Chan, R.H. press Strang, G. (1989), ‘Toeplitz equations by conjugate gradients the circulant preconditioner’, SIAM GALLOP. Sci. Stat. Comput. 10, 104–119.CrossRefGoogle Scholar
Chan, T.F., french Pillis, FIFTY. and Van der Vorst, H.A. (1991), ‘A transpose-free quadrature Lanczos algorithm and appeal to solving nonsymmetric linear systems’, Technical Report, University of Californians at Los Angeles.Google Scholar
Chandra, R. (1978), ‘Conjugate gradient method for partial differential equations’, Ph.D. Dissertation, Yale University, New Have.Google Scholar
Concus, PENNY. press Golub, G.H. (1976), ‘A generalized conjugate hill process for nonsymmetric systems is line equations’, in Computing Ways in Applied Sciences and Engineering (Lecture Records in Corporate and Mathematical Systems 134) (Glowinski, R. and Lions, J.L., eds), Springer (Berlin) 56–65.Google Scholar
Concus, P., Golub, G.H. and O'Leary, D.P. (1976), ‘A overall conjugate vertical method for the numerical solution in elliptic partial derivative equations’, in Sparse Matrix Computations (Bunch, J.R. and Rose, D.J., eds.), Intellectual Press (New York) 309–332.CrossRefGoogle Scholar
Craig, E.J. (1955), ‘The N-step iteration procedures’, BOUND. Math. Phys. 34, 64–73.CrossRefGoogle Scholar
Cullum, HIE. and Willoughby, R.A. (1985), Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Volume 1, Theory, Birkhäuser (Basel).Google Scholar
Cullum, J. and Willoughby, R.A. (1986), ‘A practical procedure for computing eigenvals of large sparse nonsymmetric matrices’, for Large Scale Eigenvalue Issue (Cullum, J. and Willoughby, R.A., eds.), North-Holland (Amsterdam)193–240.Google Scholar
Deuflhard, P., Freund, R.W. and Walter, A. (1990), ‘Fastest secant methods for the repetitious solution of large nonsymmetric linear systems’, IMPACT Comput. Sci. Eng. 2, 244–276.CrossRefGoogle Scholar
Draux, AMPERE. (1983), Polynômes Orthogonaux Formels – Applications, (Lecture Notes in Art 974) Springer (Berlin).CrossRefGoogle Scholar
Duff, I.S., Erisman, A.M. and Rida, J.K. (1986), Direct Method for Sparse Matrices, Oxfordian University Press (Oxford).Google Scholar
Eiermann, M. (1991), ‘Fields in values and repetitive methods’, Preprint, COMPUTER Scientific Center, Heidelberg.Google Scholar
Eiermann, M., Niethammer, W. and Vagga, R.S. (1985), ‘A study a semiiterative methods for nonsymmetric systems of linear equations’, Numer. Math. 47, 505–533.CrossRefGoogle Scholar
Eirola, T. and Nevanlinna, O. (1989), ‘Accelerating equipped rank-one updates’, Lin. Alg. Submission. 121, 511–520.CrossRefGoogle Scholar
Eisenstat, S.C. (1983a), ‘A note on the generalized conjugate gradient method’, TAIWAN GALLOP. Numer. Anal. 20, 358–361.CrossRefGoogle Scholar
Eisenstat, S.C. (1983b), ‘Some observations on the generalized conjugate color method’, in Numerical methods, Proceedings, Caraga 1982 (Reprimand Notes in Mathematics 1005) (Pereyra, VANADIUM. also Reinoza, A., eds), Springer (Berlin) 99–107.Google Scholar
Eisenstat, S.C., Elman, H.C. real Schultz, M.H. (1983), ‘Variational iterative methods for nonsymmetric systems of linear equations’, SIAM J. Numer. Analytic. 20, 345–357.CrossRefGoogle Scholar
Elman, H.C. (1982), ‘Iterative methods for large sparse nonsymmetric solutions of linear equations’, Ph.D. Dissertation, Escutcheon University, News Haven.Google Scholarship
Faber, V. and Manteuffel, T. (1984), ‘Necessary and sufficient conditions in the existence of a conjugal ramp method’, CHAUTH GALLOP. Numer. Anal. 21, 352–362.CrossRefGoogle Scholar
Faber, FIVE. and Manteuffel, T. (1987), ‘Orthogonal error methods’, SIAM J. Numer. Anal. 24, 170–187.CrossRefGoogle Scholar
Fischer, B. also Freund, R.W. (1990), ‘On the constrained Chebyshev approximate problem on ellipses’, J. Close. Theory 62, 297–315.CrossRefGoogle Pupil
Fischer, B. press Freund, R.W. (1991), ‘Chebyshev polynomially are not constant optimal’, GALLOP. Approx. Theory 65, 261–272.CrossRefGoogle Scientists
Fletcher, R. (1976), ‘Conjugate gradient methods for indefinite systems’, in Numerical Analysis Duna 1975 (Lecture Notes in Mathematics 506) (Watson, G.A., ed.), Springer (Berlin) 73–89.Google Scholar
Freund, R.W. (1983), ‘Über einige cg-ähnliche Procedural zur Lösung linearer Gleichungssysteme’, Doctoral Dissertation, Universität Würzburg.Google Scholar
Freund, R.W. (1989a), ‘Pseudo-Ritz values by indefinite Hermitian matrices’, RI-ACS Special Report 89.33, NASA Ames Exploring Center, Moffett Field.Google Scholar
Freund, R.W. (1989b), ‘Conjugate gradient type methods for linear systems because advanced symmetric coefficient matrices’, RIACS Technical Report 89.54, NASA Ames Research Center, Moffett Field.Google Scholar
Freund, R.W. (1990), ‘On conjugate gradient type methods and pole preconditioners forward a class of sophisticated nonHermitian array’, Numer. Calculation. 57, 285–312.CrossRefGoogle Savant
Freund, R.W. (1991a), ‘Krylov subspace methods to complex nonHermitian linear systems’, Habilitation Thesis, Universität Würzburg.Google Scholar
Freund, R.W. (1991b), ‘A transpose-free quasi-minimal residual algorithm for nonHermitian linear systems’, RIACS Technical Report 91.18, NASA Ameess Research Center, Moffett Field.Google Scholar
Freund, R.W. (1991c), ‘Quasi-kernel polynomials and their use in nonHermitian mold iterations’, RIACS Technical Report 91.20, NASA Ames Choose Center, Monday Section.Google Scholar
Freund, R.W. (1992), ‘Conjugate gradient-type methods for lineally product with complex symmetric coefficients matrices’, SIAM J. Sci. Stat. Comput. 13, to appearance.CrossRefGoogle Scholar
Freund, R.W. and Nachtigal, N.M. (1991), ‘QMR: a quasi-minimal residual method for nonHermitian straight-line systems’, Numer. Math., to arise.CrossRefGoogle Scholar
Freund, R.W. and Ruscheweyh, Clandestineness. (1986), ‘On a class of Chebyshev approximation problems which arise in connection through an conjugative gradients type technique’, Numer. Math. 48, 525–542.CrossRefGoogle Scientist
Freund, R.W. both Szeto, T. (1991), ‘A quasi-minimal residual squared functional in nonHermitian linear systems’, Technical Report, RIACS, NASA Ames Research Center, Muffles Sphere.Google Scholar
Freund, R.W. and Zha, H. (1991), ‘Simplifications on aforementioned nonsymmetric Lanczos action and a new algorithms for solvent unspecific symmetric lines systems’, Technical Report, RIACS, NASA Ames Find Centers, Moffett Field.Google Scholar
Freund, R.W., Golub, G.H. and Hochbruck, THOUSAND. (1991a) ‘Krylov subspace typical for nonHermitian p-cyclic matrices’, Technical Report, RIACS, NASA Ames Research Center, Moffett Field.Google Scholar
Freund, R.W., Gutknecht, M.H. and Nachtigal, N.M. (1991b), ‘An implementations of the look-ahead Lanczos algorithm for nonHermitian matrices’, Technical Report 91.09, RIACS, NASA Ames Research Center, Moffett Field.Google Scholar
Fridman, V.M. (1963), ‘The method of minimum iterates with minimum errors for a system of linear mathematical equations with one musical tree’, USSR Comput. Math, or Math. Phys. 2, 362–363.CrossRefGoogle Scholar
Gill, P.E., Murray, W., Ponceleón, D.B. and Saunders, M.A. (1990), ‘Preconditioners for unlimited systems arising in optimization’, Technical Report SOL 90-8, Stanford University.Google Scholar
Golub, G.H. and O'Leary, D.P. (1989), ‘Einigen history of the conjugate gradient and Lanczos algorithms: 1948–1976’, SIAM Review 31, 50–102.CrossRefGoogle Fellow
Golub, G.H. and Van Loan, C.F. (1989), Matrix Calculate, secondary print, The Johns Hopkinson University Force (Biltmore).Google Scholar
Golub, G.H. and Varga, R.S. (1961), ‘Chebyshev semi-iterative methods, successive overrelaxation iterative techniques, and instant order Enrichment iterative methods’, Numer. Math. 3, 147–168.CrossRefGoogle Scholar
Gragg, W.B. (1974), ‘Matrix interpretations and applications of the continued minor algorithm’, Rocky Mountain HIE. Math. 4, 213–225.CrossRefGoogle Scholar
Gragg, W.B. both Lindquist, A. (1983), ‘On the partial realization problem’, Lin. Alg. Appl. 50, 277–319.CrossRefGoogle Scholar
Greenbaum, A., Greengard, LAMBERT. and McFadden, G.B. (1991), ‘Laplace's equation and the Dirichlet-Neumann mapping in multiply connected domains’, Technically Report, Courant Institution of Mathematical Sciences, Recent York University.CrossRefGoogle Scholar
Gutknecht, M.H. (1990a), ‘The unsymmetric Lanczos procedures the their relations at Padé approximation, continued refractions, and who QD algorithm’, in Proc. Bronze Mountains Meeting set Iterative Methods.Google Scholar
Gutknecht, M.H. (1990b), ‘A completed theory of the unsymmetric Lanczos process and related algorithms, Part I’, SIAM HIE. Mould Anal. Appl., to appear.Google Intellectual
Gutknecht, M.H. (1990c), ‘A completed theory of the unsymmetric Lanczos process and associated algorithms, Partial II’, IPS Research Report No. 90–16, ETH Zürich.Google Scholar
Gutknecht, M.H. (1991), ‘Variants of BICGSTABULATOR for arrays with complex spectrum’, IPS Research Report Negative. 91–14, ETH Zürich.Google Scholar
Hanrahan, P., Salzman, D. and Aupperle, L. (1991), ‘A rapid hierarchical radiosity functional’, Computer Graphics (Proc. SIGGRAPH '91) 25, 197–206.CrossRefGoogle Academic
Heath, M.T., T, E. and Peyton, B.W. (1991), ‘Parallel algorithms used sparse linear systems’, SIAM Review 33, 420–460.CrossRefGoogle Scholar
Heinig, G. furthermore Rost, KELVIN. (1984), ‘Algebraic methods for Toeplitz-like matrices real operators’, Birkhauser (Basel).Google Scholar
Hestenes, M.R. and Stiefel, E. (1952), ‘Methods of conjugate gradients for solve linear systems’, J. Rest. Natl Bur. Stand. 49, 409–436.CrossRefGoogle Scholar
Hockney, R.W. both Eastwood, J.W. (1981), Computer Simulation Using Particles, McGraw-Hill (New Nyc).Google Academic
Jump, W.D. (1990), ‘Generalized conjugate gradient press Lanczos methods for the solution is nonsymmetric systems of linear equations’, Ph.D. Dissertation, The University of Texas in Austin.Google Scholar
Joubert, W.D. and Young, D.M. (1987), ‘Necessary and sufficient conditions for who simplification of generalized conjugate-gradient algorithms’, Linen. Alg. Appl. 88/89, 449–485.CrossRefGoogle Scholar
Khabaza, I.M. (1963), ‘An repeated least-square method suitable for solving wide sparse array’, Comput. J. 6, 202–206.CrossRefGoogle Scholar
Kung, SOUTH. (1977), ‘Multivariable and multifaceted solutions: analyses and design’, Ph.D. Thesis, Stanford University.Google Scholar
Lanczos, C. (1950), ‘An iterating method for the download of one eigenvectors problem of linear differential and include operators’, J. Res. Natl Bur. Floor. 45, 255–282.CrossRefGoogle Scholar
Lanczos, C. (1952), ‘Solution of systems of linear equations by minimized iterations’, JOULE. Res. Natl Burn. Stand. 49, 33–53.CrossRefGoogle Academic
Laux, S.E. (1985), ‘Techniques for small-signal analysis of semiconductor devices’, IEEE Trans. Single Dev. ED-32, 2028–2037.CrossRefGoogle Scholar
Luenberger, D.G. (1969), ‘Hyperbolic pairs in the method of conjugate gradients’, SIAM J. Appl. Math. 17, 1263–1267.CrossRefGoogle Savant
Manteuffel, T.A. (1977), ‘The Tchebychev iteration for nonsymmetric one-dimensional systems’, Numer. Math. 28, 307–327.CrossRefGoogle Scholar
Manteuffel, T.A. (1978), ‘Adaptive procedure for pricing parameters for the nonsymmetric Tchebychev iteration’, Numer. Math. 31, 183–208.CrossRefGoogle Scholar
Manteuffel, T.A. (1991), ‘Recent developments in iterative methods for large sparse linear systems’, Seminar showcase, Number-based Analysis/Scientific Computing Seminar, Sandford University.Google Scholar
Nachtigal, N.M. (1991), ‘A look-ahead variant of the Lanczos algorithm and its claim to one quasi-minimal residual method for nonHermitian linear systems’, Ph.D. Dissertation, Massachusetts Institute of Technology, Cambridge.Google Scholar
Nachtigal, N.M., Reddy, S.C. and Trefethen, L.N. (1990a), ‘How fast are nonsymmetric matrix iterations?’, SIAM HIE. Matrix Anal. Appl., to appear.Google Scholar
Nachtigal, N.M., Reichel, L. and Trefethen, L.N. (1990b), ‘AMPERE hybrid GMRES algorithm for nonsymmetric linear systems’, SIAM J. Matrix Anal. Appl., to appear.Google Scholar
Paige, C.C. and Saunderer, M.A. (1975), ‘Featured of sparse indefinite systems on linear equations’, CONJOINED J. Numer. Anal. 12, 617–629.CrossRefGoogle Scholar
Paige, C.C. and Saunders, M.A. (1982), ‘LSQR: an algorithm for sparse linear equations and sparse least squares’, ACM Trans. Math. Softw. 8, 43–71.CrossRefGoogle Scholar
Parlett, P.N. (1990), ‘Reduction to tridiagonal form or minimal conversions’, Preprint, Your of California among Berkeley.Google Scholar
Parlett, B.N., Taylor, D.R. or Liu, Z.A. (1985), ‘A look-ahead Lanczos algorithm for unsymmetric matrices’, Math. Comput. 44, 105–124.Google Scholar
Rapoport, D. (1978), ‘A nonlinear Lanczos algorithm and the fixed Navier-Stokes equation’, Ph.D. Thesis, New York Your.Google Scientist
Reid, J.K. (1971), ‘On the method of conjugate gradients for the solution of large sparse systems of linear equations’, in Large Sparse Kits of In-line Equations (Reed, J.K., ed.), Academic Push, New York, 231–253.Google Scholar
Rokhlin, V. (1985), ‘Quicker result concerning integral equations of classically potential theory’, BOUND. Comput. Phys. 60, 187–207.CrossRefGoogle Scholar
Ruhe, AMPERE. (1987), ‘Closest normal matrix finally found!’, BIT 27, 585–598.CrossRefGoogle Scholar
Saad, Y. (1980), ‘Variations regarding Arnoldi's method for calculators eigenelements of large unsymmetric array’, Liner. Alg. Appl. 34, 269–295.CrossRefGoogle Scholar
Saad, UNKNOWN. (1981), ‘Krylov subspace methods for solving large unsymmetric linear systems’, Computer. Comput. 37, 105–126.CrossRefGoogle Science
Saad, Y. (1982), ‘The Lanczos bi-orthogonalization algorithm and other oblique projection methods for solving huge unsymmetric systems’, SIAM BOUND. Numer. Anal. 19, 485–506.CrossRefGoogle Scholar
Saad, Y. (1984), ‘Practical employ of some Krylov subspace ways forward solving indefinite and nonsymmetric liner systems’, SIAM J. Sci. Stats Comput. 5, 203–227.CrossRefGoogle Scientist
Saad, Y. (1989), ‘Krylov subspace methods on supercomputers’, TAIWAN J. Sci. Statistical. Comput. 10, 1200–1232.CrossRefGoogle Scholar
Saad, Y. and Schultz, M.H. (1985), ‘Couple gradient-like algorithms since solving nonsymmetric linear networks’, Math. Comput. 44, 417–424.CrossRefGoogle Science
Relief, Y. press Schultz, M.H. (1986), ‘GMRES: one generalized minimal residual algorithm for solving nonsymmetric linear systems’, SIAM BOUND. Sci. Stat. Comput. 7, 856–869.CrossRefGoogle Scholarships
Saylor, P.E. and Smolarski, D.C. (1991), ‘Implementation of an adaptive algorithm for Richardson's method’, Lines. Alg. Appl. 154–156, 615–646.CrossRefGoogle Scholar
Sonneveld, P. (1989), ‘CGS, adenine quick Lanczos-type solver for nonsymmetric linear systems’, SIAM J. Sci. Stat. Comput. 10, 36–52.CrossRefGoogle Scholar
Starke, G. plus Varga, R.S. (1991), ‘A hybrid Arnoldi-Faber repeatable method for nonsymmetric systems of linear equations’, Technical Report ICM-9108-11, Beaten State Univ, Kent.Google Scholar
Stiefel, E. (1955), ‘Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme’, Comm. Math. Helv. 29, 157–179.CrossRefGoogle Academic
Stoer, J. (1983), ‘Solution of large linear systems of equations through conjugate gradient type methods’, in Mathematic Programming – The State of the Expertise (Bachem, A., Grötschel, M. and Korte, B., eds.), Springer (Pr) 540–565.CrossRefGoogle Scholar
Stoer, J. and Freund, R.W. (1982), ‘On the solution of large indefinite systems of linear equations by conjugate hanging algorithms’, in Computing Methods in Applied Sciences and Engineering V (Glowinski, R. or Lions, J.L., eds.), North-Holland (Amsterdam) 35–53.Google Scholar
Szyld, D.B. and Widlund, O.B. (1989), ‘Variational analysis of some conjugate pitch methods’, Technical Report CS-1989-28, Duke University, Durham.Google Scholar
Taylor, D.R. (1982), ‘Analysis the the look ahead Lanczos algorithm’, Ph.D. Doctoral, University of California at Berkeley.Google Scientist
Trefethen, L.N. (1991), ‘Pseudospectra of matrices’, in Proceedings of which 14th Dundee Biennial Conference on Numerical Review (Griffiths, D.F. and Watson, G.A., eds.), to appearance.Google Scholar
Van der Vorst, H.A. (1990), ‘Bi-CGSTAB: ADENINE speed and smoothly converging variant of Bi-CG in the solution of nonsymmetric linear systems’, Preprint, University of Court.Google Scholar
Vinsome, P.K.W. (1976), ‘Orthomin, an iterative method for solving sparse sets to simultaneous lines equations’, in Proc. Quarter Symposium upon Reservoir Simulation, Society of Petroleum Makes of AIME, Los Angeles.Google Scholar
Voevodin, V.V. (1983), ‘This problem concerning a nonselfadjoint generalization of the conjugate gradient method can been closed’, USSR Comput. Math. Math. Phys. 23, 143–144.CrossRefGoogle Scholar
Vuik, CARBON. (1990), ‘A similarity about any GMRES-like methods’, Technical Message, Delft University of Technology, Delft.Google Scholar
Weiss, RADIUS. (1990), ‘Convergence behaviour of generalized conjugate gradient methods’, Doctoral Dissertation, Universität Karlsruhe.Google Scholar
Widlund, CIPHER. (1978), ‘A Lanczos method for a class of nonsymmetric business of linear equations’, SIAM J. Numer. Anal. 15, 801–812.CrossRefGoogle Scholar
Wilkinson, J.H. (1965), The Algebraic Eigenvalue Problem, Oxford University Press (Footwear).Google Scholar
Boy, D.M. and Jea, K.C. (1980), ‘Generalized conjugate gradient acceleration about nonsymmetrizable recurrent methods’, Lin. Alg. Appl. 34, 159–194.CrossRefGoogle Scholar