From linear to nonlinear iterative methods

DOI10.1016/S0168-9274(02)00235-0zbMath1022.65060OpenAlexW2118051048MaRDI QIDQ1873166

Michael N. Vrahatis, George D. Magoulas, Vassilis P. Plagianakos

Publication date: 19 May 2003

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-9274(02)00235-0

zbMATH Keywords

algorithmsunconstrained optimizationconvergencenumerical examplessuccessive overrelaxationsystems of nonlinear equationsJacobi methodnonlinear Gauss-Seidel iteration

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)

Related Items

Aeroelastic design optimization for laminar and turbulent flows ⋮ A Schur-Newton-Krylov solver for steady-state aeroelastic analysis and design sensitivity analysis ⋮ A new accurate and efficient iterative numerical method for solving the scalar and vector nonlinear equations: approach based on geometric considerations ⋮ A new ghost cell/level set method for moving boundary problems: application to tumor growth ⋮ A Numerical Approach for a System of Transport Equations in the Field of Radiotherapy ⋮ Improved sign-based learning algorithm derived by the composite nonlinear Jacobi process ⋮ ADAPTIVE ALGORITHMS FOR NEURAL NETWORK SUPERVISED LEARNING: A DETERMINISTIC OPTIMIZATION APPROACH ⋮ Determining the number of real roots of polynomials through neural networks ⋮ MICE: Multiple‐Peak Identification, Characterization, and Estimation ⋮ Dynamic search trajectory methods for global optimization ⋮ Improved Newton's method without direct function evaluations

Uses Software

• CHABIS
• PVM
• minpack
• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A rapid generalized method of bisection for solving systems of non-linear equations
• Bisection is optimal
• Optimization. Algorithms and consistent approximations
• A new unconstrained optimization method for imprecise function and gradient values
• A class of gradient unconstrained minimization algorithms with adaptive stepsize
• A Short Proof and a Generalization of Miranda's Existence Theorem
• Algorithm 666: Chabis: a mathematical software package for locating and evaluating roots of systems of nonlinear equations
• Solving systems of nonlinear equations using the nonzero value of the topological degree
• Testing Unconstrained Optimization Software
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• On the Localization and Computation of Zeros of Bessel Functions
• Locating and Computing Zeros of Airy Functions
• Iterative Solution Methods
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Convergence Conditions for Ascent Methods
• Minimizing a function without calculating derivatives
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Rates of Convergence for a Class of Iterative Procedures
• Iterative Methods for Solving Partial Difference Equations of Elliptic Type
• Locating and computing in parallel all the simple roots of special functions using PVM