Măruşter, Ştefan 2017. Estimating the Local Radius of Convergence for Picard Iteration. Algorithms, Vol. 10, Issue. 1, p. 10.
Dali, Béchir Li, Chong and Wang, Jinhua 2016. Local convergence of Newton’s method on the Heisenberg group. Journal of Computational and Applied Mathematics, Vol. 300, p. 217.
Li, C. and Ng, K.F. 2016. Extended Newton methods for conic inequalities: Approximate solutions and the extended Smale α-theory. Journal of Mathematical Analysis and Applications, Vol. 440, Issue. 2, p. 636.
Chang, Der-Chen Wang, Jinhua and Yao, Jen-Chih 2015. Newton’s method for variational inequality problems: Smale’s point estimate theory under the γ-condition. Applicable Analysis, Vol. 94, Issue. 1, p. 44.
Gandhi, Ratnik and Chatterji, Samaresh 2015. Applications of Algebra for Some Game Theoretic Problems. International Journal of Foundations of Computer Science, Vol. 26, Issue. 01, p. 51.
Măruşter, Ştefan 2015. Local convergence radius for the Mann-type iteration. Annals of West University of Timisoara - Mathematics and Computer Science, Vol. 53, Issue. 2,
Zhou, Fangqin 2014. An Analysis on Local Convergence of Inexact Newton-Gauss Method for Solving Singular Systems of Equations. The Scientific World Journal, Vol. 2014, p. 1.
Argyros, Ioannis K. Khattri, Sanjay K. and Hilout, Saïd 2013. Expanding the applicability of Inexact Newton Methods under Smale’s (α, γ)-theory. Applied Mathematics and Computation, Vol. 224, p. 224.
Cheung, Dennis and Cucker, Felipe 2013. On the Average Condition of Random Linear Programs. SIAM Journal on Optimization, Vol. 23, Issue. 2, p. 799.
Ling, Yonghui Xu, Xiubin and Yu, Shaohua 2013. Convergence Behavior for Newton-Steffensen’s Method under -Condition of Second Derivative. Abstract and Applied Analysis, Vol. 2013, p. 1.
Batra, Prashant 2010. Globally Convergent, Iterative Path-Following for Algebraic Equations. Mathematics in Computer Science, Vol. 4, Issue. 4, p. 507.
Bürgisser, Peter and Cucker, Felipe 2010. Smoothed Analysis of Moore–Penrose Inversion. SIAM Journal on Matrix Analysis and Applications, Vol. 31, Issue. 5, p. 2769.
Li, Chong Hu, Nuchun and Wang, Jinhua 2010. Convergence behavior of Gauss–Newton’s method and extensions of the Smale point estimate theory. Journal of Complexity, Vol. 26, Issue. 3, p. 268.
Shen, Weiping and Li, Chong 2010. Smale's α-theory for inexact Newton methods under the γ-condition. Journal of Mathematical Analysis and Applications, Vol. 369, Issue. 1, p. 29.
Bendito, E. Carmona, A. Encinas, A.M. Gesto, J.M. Gómez, A. Mouriño, C. and Sánchez, M.T. 2009. Computational cost of the Fekete problem I: The Forces Method on the 2-sphere. Journal of Computational Physics, Vol. 228, Issue. 9, p. 3288.
Shen, Weiping and Li, Chong 2009. Kantorovich-type convergence criterion for inexact Newton methods. Applied Numerical Mathematics, Vol. 59, Issue. 7, p. 1599.
Hu, Nuchun Shen, Weiping and Li, Chong 2008. Kantorovich's type theorems for systems of equations with constant rank derivatives. Journal of Computational and Applied Mathematics, Vol. 219, Issue. 1, p. 110.
Li, Chong and Wang, Jinhua 2008. Newton's method for sections on Riemannian manifolds: Generalized covariant <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>α</mml:mi></mml:math>-theory. Journal of Complexity, Vol. 24, Issue. 3, p. 423.
Suykens, J.A.K. 2008. Data Visualization and Dimensionality Reduction Using Kernel Maps With a Reference Point. IEEE Transactions on Neural Networks, Vol. 19, Issue. 9, p. 1501.
He, Jin-Su Wang, Jin-Hua and Li, Chong 2007. Newton's Method for Underdetermined Systems of Equations Under the γ-Condition. Numerical Functional Analysis and Optimization, Vol. 28, Issue. 5-6, p. 663.
Complexity theory of numerical analysis is the study of the number of arithmetic operations required to pass from the input to the output of a numerical problem.
This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.