Copertina

Efficient and stable derivative-free Steffensen algorithm for root finding

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Wagemakers, Alexandre, Periwal, Vipul
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Numerical Analysis
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Annealing approach to root-finding
di: Jo, Junghyo, et al.
Pubblicazione: (2024)

The upper-crossing/solution (US) algorithm for root-finding with strongly stable convergence
di: Li, Xun-Jian, et al.
Pubblicazione: (2022)

Polynomial root-finding algorithms and branched covers
di: Kim, Myong-Hi, et al.
Pubblicazione: (1991)

A new provably stable weighted state redistribution algorithm
di: Berger, Marsha, et al.
Pubblicazione: (2023)

A numerically stable communication-avoiding s-step GMRES algorithm
di: Xu, Zan, et al.
Pubblicazione: (2023)

On the global complexity of a derivative-free Levenberg-Marquardt algorithm via orthogonal spherical smoothing
di: Chen, Xi, et al.
Pubblicazione: (2024)

Continuous-discrete derivative-free extended Kalman filter based on Euler-Maruyama and Itô-Taylor discretizations: Conventional and square-root implementations
di: Kulikova, Maria V., et al.
Pubblicazione: (2024)

New complementarity formulations for root-finding and optimization of piecewise-affine functions in abs-normal form
di: Zhang, Yulan, et al.
Pubblicazione: (2025)

Schrödingerisation based computationally stable algorithms for ill-posed problems in partial differential equations
di: Jin, Shi, et al.
Pubblicazione: (2024)

A finite-difference summation-by-parts, conditionally stable partitioned algorithm for conjugate heat transfer problems
di: Nataj, Sarah, et al.
Pubblicazione: (2026)

An efficient and memory free algorithm for subdiffusion equation using incremental singular value decomposition
di: Li, Jichun, et al.
Pubblicazione: (2022)

Efficiently parallelizable kernel-based multi-scale algorithm
di: Lot, Federico, et al.
Pubblicazione: (2025)

Computing parameter planes of iterative root-finding methods with several free critical points
di: Campos, Beatriz, et al.
Pubblicazione: (2024)

A globally divergence-free entropy stable nodal DG method for conservative ideal MHD equations
di: Liu, Yuchang, et al.
Pubblicazione: (2025)

Creating walls to avoid unwanted points in root finding and optimization
di: Truong, Tuyen Trung
Pubblicazione: (2023)

Strassen's algorithm is not optimally accurate
di: Dumas, Jean-Guillaume, et al.
Pubblicazione: (2024)

Efficient third-order iterative algorithms for computing zeros of special functions
di: K, Dhivya Prabhu, et al.
Pubblicazione: (2026)

Truncated kernel windowed Fourier projection: a fast algorithm for the 3D free-space wave equation
di: Hassanieh, Nour G. Al, et al.
Pubblicazione: (2025)

Efficient adaptive randomized algorithms for fixed-threshold low-rank matrix approximation
di: Liu, Qiaohua, et al.
Pubblicazione: (2025)

Efficient and stable diffusion generated methods for ground state computation in Bose--Einstein condensates
di: Guo, Jing, et al.
Pubblicazione: (2025)

On the basins of attraction of a one-dimensional family of root finding algorithms: from Newton to Traub
di: Canela, Jordi, et al.
Pubblicazione: (2025)

Dynamics of Newton-like root finding methods
di: Campos, Beatriz, et al.
Pubblicazione: (2025)

Efficient Nehari manifold optimization algorithms for computing ground state solutions of nonlinear elliptic systems
di: Chen, Zhaoxing, et al.
Pubblicazione: (2026)

Efficient numerical method for multi-term time-fractional diffusion equations with Caputo-Fabrizio derivatives
di: Fan, Bin
Pubblicazione: (2023)

Towards automated generation of fast and accurate algorithms for recursive matrix multiplication
di: Dumas, Jean-Guillaume, et al.
Pubblicazione: (2025)

Component-wise accurate computation of the square root of an M-matrix
di: Bini, Dario A., et al.
Pubblicazione: (2026)

On weak greedy algorithms
di: Spivak, A. S., et al.
Pubblicazione: (2026)

Acceleration of multi-component multiple-precision arithmetic with branch-free algorithms and SIMD vectorization
di: Kouya, Tomonori
Pubblicazione: (2026)

Stochastic BDDC algorithms
di: Tu, Xuemin, et al.
Pubblicazione: (2025)

LRBF meshless methods for predicting soil moisture distribution in root zone
di: Boujoudar, Mohamed, et al.
Pubblicazione: (2024)

Backtracking New Q-Newton's method for finding roots of meromorphic functions in 1 complex variable: Global convergence, and local stable/unstable curves
di: Fornæss, John Erik, et al.
Pubblicazione: (2024)

Finding roots of complex analytic functions via generalized colleague matrices
di: Zhang, Hanwen, et al.
Pubblicazione: (2023)

Efficient manifold evolution algorithm using adaptive B-Spline interpolation
di: Ammad, Muhammad, et al.
Pubblicazione: (2025)

Energy-stable Port-Hamiltonian Systems
di: Buchfink, Patrick, et al.
Pubblicazione: (2025)

Sparse sampling recovery by greedy algorithms
di: Temlyakov, V.
Pubblicazione: (2023)

Tropical Laurent series, their tropical roots, and localization results for the eigenvalues of nonlinear matrix functions
di: Porzio, Gian Maria Negri, et al.
Pubblicazione: (2021)

A new class of one-step A-stable and L-stable schemes of high-order accuracy for parabolic type equations
di: Li, Xiaoyi, et al.
Pubblicazione: (2025)

On the robustness of double-word addition algorithms
di: Yang, Yuanyuan, et al.
Pubblicazione: (2024)

Universal numerical algorithms and their software implementation
di: Litvinov, Grigori, et al.
Pubblicazione: (2001)

Homogeneous algorithms and solvable problems on cones
di: Krieg, David, et al.
Pubblicazione: (2023)