Generalized Traub Family for Solving Nonlinear Systems: Fourth-Order Optimal Method and Dynamical Analysis

A novel two-stage procedure for approximating solutions of nonlinear systems is introduced. The scheme employs two evaluations of the vector function F together with a single Jacobian computation, followed by the resolution of two linear subproblems that share an identical coefficient matrix. This structure reduces the computational cost and enhances the adaptability of the method with respect to existing alternatives. The design of the algorithm is motivated by criteria relating efficiency to the total number of functional evaluations, ensuring that the resulting strategy achieves the optimal convergence order permitted within this framework. A proof of the local convergence order is provided, and its accuracy is supported by a series of experiments on distinct nonlinear models, including problems arising from differential equations. The numerical evidence confirms that the developed technique reaches the theoretical convergence rate and performs favorably when compared with other methods of equal order. Moreover, we examine the dynamical features of the related parametric variant, offering additional understanding of its stability properties and iterative behavior.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-03-31
DOI
https://doi.org/10.3390/math14071161
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generalized Traub Family for Solving Nonlinear Systems: Fourth-Order Optimal Method and Dynamical Analysis

Miguel A. Leonardo-Sepúlveda, María P. Vassileva, Juan R. Torregrosa, Alicia Cordero et al.
Mathematics
Advanced Optimization Algorithms Research
article

Generalized Traub Family for Solving Nonlinear Systems: Fourth-Order Optimal Method and Dynamical Analysis

Miguel A. Leonardo-Sepúlveda, María P. Vassileva, Juan R. Torregrosa, Alicia Cordero, Antmel Rodríguez Cabral
article en

Abstract

A novel two-stage procedure for approximating solutions of nonlinear systems is introduced. The scheme employs two evaluations of the vector function F together with a single Jacobian computation, followed by the resolution of two linear subproblems that share an identical coefficient matrix. This structure reduces the computational cost and enhances the adaptability of the method with respect to existing alternatives. The design of the algorithm is motivated by criteria relating efficiency to the total number of functional evaluations, ensuring that the resulting strategy achieves the optimal convergence order permitted within this framework. A proof of the local convergence order is provided, and its accuracy is supported by a series of experiments on distinct nonlinear models, including problems arising from differential equations. The numerical evidence confirms that the developed technique reaches the theoretical convergence rate and performs favorably when compared with other methods of equal order. Moreover, we examine the dynamical features of the related parametric variant, offering additional understanding of its stability properties and iterative behavior.

MathematicsVol. 14(7)
Universidad Autónoma de Santo Domingo (DO), Instituto Tecnológico de Santo Domingo (DO), Instituto Superior de Formación Docente Salomé Ureña (DO), Universidad Acción Pro-Educación y Cultura (DO), Universitat Politècnica de València (ES)
University of Agricultural Sciences, Dharwad
Openalex Percentile: Top 29%
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.