Àngela Grau
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Àngela Grau has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Miquel Noguera
Technical University of Catalonia
7 shared publications - Miquel Grau-Sánchez
Department of Applied Mathematics II, Technical University of Catalonia, 08034 Barcelona, Spain
6 shared publications - Jose Antonio Ezquerro
Department of Mathematics and Computation, University of La Rioja, Logroño, Spain
5 shared publications - Miguel Ángel Hernández Verón
Department of Mathematics and Computation, University of La Rioja, Logroño, Spain
5 shared publications Miquel Grau-Sánchez
5 shared publications- José Ramon Herrero
Universitat Politecnica de Catalunya
2 shared publications
Latest Publications
- 26 July 2014
- Published by Mathematical Sciences Publishers in Communications in Applied Mathematics and Computational Science
- Vol. 9 (2) , 201-213
A new class of secant-like methods for solving nonlinear systems of equations
- 26 July 2014
- Published by Mathematical Sciences Publishers in Communications in Applied Mathematics and Computational Science
- Vol. 9 (2) , 201-213
A new class of secant-like methods for solving nonlinear systems of equations
- 1 May 2013
- Published by World Scientific Pub Co Pte Ltd in Analysis and Applications
- Vol. 11 (03) , 1350009
CONSTRUCTION OF DERIVATIVE-FREE ITERATIVE METHODS FROM CHEBYSHEV'S METHOD
From some modifications of Chebyshev's method, we consider a uniparametric family of iterative methods that are more efficient than Newton's method, and we then construct two iterative methods in a similar way to the Secant method from Newton's method. These iterative methods do not use derivatives in their algorithms and one of them is more efficient than the Secant method, which is the classical method with this feature.
- 1 May 2013
- Published by World Scientific Pub Co Pte Ltd in Analysis and Applications
- Vol. 11 (03) , 1350009
CONSTRUCTION OF DERIVATIVE-FREE ITERATIVE METHODS FROM CHEBYSHEV'S METHOD
From some modifications of Chebyshev's method, we consider a uniparametric family of iterative methods that are more efficient than Newton's method, and we then construct two iterative methods in a similar way to the Secant method from Newton's method. These iterative methods do not use derivatives in their algorithms and one of them is more efficient than the Secant method, which is the classical method with this feature.
- 1 April 2013
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 219 (15) , 7954-7963
Maximum efficiency for a family of Newton-like methods with frozen derivatives and some applications
- 1 April 2013
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 219 (15) , 7954-7963
Maximum efficiency for a family of Newton-like methods with frozen derivatives and some applications
- 23 January 2013
- Published by Springer Nature in Numerical Algorithms
- Vol. 64 (4) , 685-698
On the efficiency of two variants of Kurchatov’s method for solving nonlinear systems
- 23 January 2013
- Published by Springer Nature in Numerical Algorithms
- Vol. 64 (4) , 685-698
On the efficiency of two variants of Kurchatov’s method for solving nonlinear systems
- 1 December 2012
- Published by Elsevier in Applied Mathematics Letters
- Vol. 25 (12) , 2023-2030
On new computational local orders of convergence
- 1 December 2012
- Published by Elsevier in Applied Mathematics Letters
- Vol. 25 (12) , 2023-2030
On new computational local orders of convergence
- 29 April 2012
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 64 (6) , 2066-2073
Analysing the efficiency of some modifications of the secant method
- 29 April 2012
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 64 (6) , 2066-2073
Analysing the efficiency of some modifications of the secant method
- Open Access
A study on new computational local orders of convergence
Four new variants of the Computational Order of Convergence (COC) of a one-point iterative method with memory for solving nonlinear equations are presented. Furthermore, the way to approximate the new variants to the local order of convergence is analyzed. Three of the new definitions given here do not involve the unknown root. Numerical experiments using adaptive arithmetic with multiple precision and a stopping criteria are implemented without using any known root.
Open AccessA study on new computational local orders of convergence
Four new variants of the Computational Order of Convergence (COC) of a one-point iterative method with memory for solving nonlinear equations are presented. Furthermore, the way to approximate the new variants to the local order of convergence is analyzed. Three of the new definitions given here do not involve the unknown root. Numerical experiments using adaptive arithmetic with multiple precision and a stopping criteria are implemented without using any known root.
- 1 November 2011
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 218 (6) , 2377-2385
Ostrowski type methods for solving systems of nonlinear equations
- 1 November 2011
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 218 (6) , 2377-2385
Ostrowski type methods for solving systems of nonlinear equations
- 1 October 2011
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 236 (6) , 1259-1266
On the computational efficiency index and some iterative methods for solving systems of nonlinear equations
- 1 October 2011
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 236 (6) , 1259-1266
On the computational efficiency index and some iterative methods for solving systems of nonlinear equations
- 21 June 2011
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 151 (1) , 163-174
On Iterative Methods with Accelerated Convergence for Solving Systems of Nonlinear Equations
- 21 June 2011
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 151 (1) , 163-174
On Iterative Methods with Accelerated Convergence for Solving Systems of Nonlinear Equations