Quadrature based optimal iterative methods with applications in high-precision computing
From MaRDI portal
Recommendations
- On the Kung-Traub conjecture for iterative methods for solving quadratic equations
- A new family of fourth-order optimal iterative schemes and remark on Kung and Traub's conjecture
- An optimal thirty-second-order iterative method for solving nonlinear equations and a conjecture
- Optimal fourth-order family of iterative methods
- Root finding by high order iterative methods based on quadratures
Cited in
(11)- On the Kung-Traub conjecture for iterative methods for solving quadratic equations
- Efficient optimization-based quadrature for variational discretization of nonlocal problems
- Solving quadratic programs to high precision using scaled iterative refinement
- Fast, reliable and unrestricted iterative computation of Gauss-Hermite and Gauss-Laguerre quadratures
- Quadrature processes for efficient calculation of the Clausen functions
- Optimal Quadrature-Sparsification for Integral Operator Approximation
- Direct optimization using collocation based on high-order Gauss-Lobatto quadrature rules
- Performance and accuracy of the basic closure algorithm of quadrature-based moment methods
- An efficient extension of three-step optimal iterative scheme into with memory and its stability
- Uni- and bi-parametric two-step iterative method with memory for solving nonlinear equations
- High order iterative schemes for quadratic equations
This page was built for publication: Quadrature based optimal iterative methods with applications in high-precision computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2858634)
