Some Efficient Algorithms for Solving Systems of Nonlinear Equations
From MaRDI portal
Publication:5674319
DOI10.1137/0710031zbMath0258.65051OpenAlexW2035910846WikidataQ56939408 ScholiaQ56939408MaRDI QIDQ5674319
Publication date: 1973
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/680bd81c90ff3db93162bbeaad39845afbdc02ab
Related Items (58)
An efficient derivative free family of fourth order methods for solving systems of nonlinear equations ⋮ A new heavy-tailed distribution defined on the bounded interval: the logit slash distribution and its application ⋮ Monte Carlo simulations of an Ising bilayer with non-equivalent planes ⋮ The local convergence of ABS methods for nonlinear algebraic equations ⋮ Local convergence of an inexact-restoration method and numerical experiments ⋮ On Brown's method with convexity hypotheses. ⋮ Global convergence and the Powell singular function ⋮ On Q-order and R-order of convergence ⋮ Implementing Brown's method for systems of nonlinear equations with dense banded Jacobian ⋮ The primal power affine scaling method ⋮ A Class of Higher-Order Newton-Like Methods for Systems of Nonlinear Equations ⋮ A dimension-reducing method for unconstrained optimization ⋮ Shooting Methods for Two‐Point BVPs with Partially Separated Endconditions ⋮ Shooting Methods for Two‐Point BVPs with Partially Separated Endconditions ⋮ A class of computationally efficient Newton-like methods with frozen inverse operator for nonlinear systems ⋮ Parallel algorithms for solving systems of nonlinear equations ⋮ New higher-order methods for the simultaneous inclusion of polynomial zeros ⋮ A simple yet efficient two-step fifth-order weighted-Newton method for nonlinear models ⋮ The Chebyshev-Shamanskii method for solving systems of nonlinear equations ⋮ A comparison of methods for determining turning points of nonlinear equations ⋮ Affine invariant convergence results for Newton's method ⋮ A computational method for finding all the roots of a vector function ⋮ A contact algorithm for 3D discrete and finite element contact problems based on penalty function method ⋮ A modified Newton method for the quadratic vector equation arising in Markovian binary trees ⋮ An improved inexact Newton method ⋮ The Borwein Brothers, Pi and the AGM ⋮ A coupled 3D isogeometric and discrete element approach for modeling interactions between structures and granular matters ⋮ Theoretical efficiency of a new inexact method of tangent hyperbolas ⋮ Variants of the reduced Newton method for nonlinear equality constrained optimization problems ⋮ Risoluzione di un sistema di equazioni non lineari con metodo numerico ai minimi quadrati ⋮ Risoluzione di un sistema di equazioni non lineari con metodo numerico ai minimi quadrati ⋮ A survey on the high convergence orders and computational convergence orders of sequences ⋮ A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods ⋮ A modified Brown algorithm for solving singular nonlinear systems with rank defects ⋮ Theoretical efficiency of a new inexact method of tangent hyperbolas ⋮ A coupled 3D isogeometric/least-square MPS approach for modeling fluid-structure interactions ⋮ On the global stabilization of locally convergent algorithms ⋮ An inexact Newton method derived from efficiency analysis ⋮ Bootstrap-calibrated interval estimates for latent variable scores in item response theory ⋮ Extended iterative methods for the solution of operator equations ⋮ Two-grid algorithms for some linear and nonlinear elliptic systems ⋮ An efficient algorithm for the determination of certain bifurcation points ⋮ Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros ⋮ Implementation and comparison of brown algorithm with analytical partial derivatives for boundary value problems ⋮ On an application of dynamical systems theory to determine all the zeros of a vector function ⋮ Numerical methods for nonlinear equations ⋮ On the numerical stability of Huang's and related methods ⋮ Second-order probability matching priors for the person parameter in unidimensional IRT models ⋮ A discrete Newton algorithm for minimizing a function of many variables ⋮ A quasi-Newton method with modification of one column per iteration ⋮ Inexact overlapped block Broyden methods for solving nonlinear equations ⋮ Multi-step nonlinear ABS methods and their efficiency analysis ⋮ Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations ⋮ The semilocal convergence of a generalization of Brent's and Brown's methods ⋮ On Brown's and Newton's methods with convexity hypotheses ⋮ Solution of nonlinear equations and computation of multiple solutions of a simple reaction-diffusion equation ⋮ A class of accurate Newton-Jarratt-like methods with applications to nonlinear models ⋮ A modified secant method for unconstrained minimization
Uses Software
This page was built for publication: Some Efficient Algorithms for Solving Systems of Nonlinear Equations
