Search for Topics All Reviews
	Browse All Reviews > Mathematics Of Computing (G) > Numerical Analysis (G.1) > Roots Of Nonlinear Equations (G.1.5) > Convergence (G.1.5...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-3 of 3 Reviews about "Convergence (G.1.5...)": Date Reviewed   A convergence analysis of the inexact simplified Jacobi--Davidson algorithm for polynomial eigenvalue problems Zhao T. Journal of Scientific Computing 75(3): 1207-1228, 2018.  Type: Article Sleijpen and van der Vorst introduced the Jacobi--Davidson (JD) method [1] to find eigenvalues in the interior of the spectrum of a real or complex large and sparse matrix. For generalized eigenvalue problems, Sleijpen et al. ... Dec 20 2018   Algorithm 748: enclosing zeros of continuous functions Alefeld G., Potra F., Shi Y. ACM Transactions on Mathematical Software 21(3): 327-344, 1995.  Type: Article The authors present two new modifications of their previously published algorithms for enclosing a zero of a continuous function f ( x ). The modifications involve the use of inverse cubic interpolation rather than q... May 1 1996   A special extended system and a Newton-like method for simple singular nonlinear equations Mei Z. Computing 45(2): 157-167, 2000.  Type: Article Mei discusses an algorithm for obtaining a simple singular solution of a system of nonlinear equations. The method is based on regularization by extending the system to one of dimension three times higher than the original. Newton&... Sep 1 1991
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy