From linear to nonlinear iterative methods
type: Item
instance of: scholarly article
title: From linear to nonlinear iterative methods
zbMATH Open document ID: 1022.65060
DOI: 10.1016/S0168-9274(02)00235-0
author: Michael N. Vrahatis
author: George D. Magoulas
author: V. P. Plagianakos
published in: Applied Numerical Mathematics
publication date: 2003-05-19T00:00:00Z
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1912433
zbMATH Keywords: nonlinear Gauss-Seidel iteration
zbMATH Keywords: Jacobi method
zbMATH Keywords: systems of nonlinear equations
zbMATH Keywords: numerical examples
zbMATH Keywords: convergence
zbMATH Keywords: successive overrelaxation
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: algorithms
describes a project that uses: BRENT
describes a project that uses: PVM
describes a project that uses: minpack
describes a project that uses: CHABIS
MaRDI profile type: Publication
cites work: Iterative Solution Methods
cites work: Q5657612
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Q4001920
cites work: Q4891458
cites work: Q4841246
cites work: Q4362742
cites work: Testing Unconstrained Optimization Software
cites work: Q5652137
cites work: Locating and computing in parallel all the simple roots of special functions using PVM
cites work: Optimization. Algorithms and consistent approximations
cites work: An efficient method for finding the minimum of a function of several variables without calculating derivatives
cites work: Q4195836
cites work: Q4089722
cites work: Bisection is optimal
cites work: Q4057472
cites work: Q4947421
cites work: Solving systems of nonlinear equations using the nonzero value of the topological degree
cites work: Algorithm 666: Chabis: a mathematical software package for locating and evaluating roots of systems of nonlinear equations
cites work: A Short Proof and a Generalization of Miranda's Existence Theorem
cites work: A class of gradient unconstrained minimization algorithms with adaptive stepsize
cites work: A new unconstrained optimization method for imprecise function and gradient values
cites work: On the Localization and Computation of Zeros of Bessel Functions
cites work: A rapid generalized method of bisection for solving systems of non-linear equations
cites work: Locating and Computing Zeros of Airy Functions
cites work: Rates of Convergence for a Class of Iterative Procedures
cites work: Iterative Methods for Solving Partial Difference Equations of Elliptic Type
cites work: Convergence Conditions for Ascent Methods
cites work: Convergence Conditions for Ascent Methods. II: Some Corrections
cites work: Minimizing a function without calculating derivatives
cites work: Q4103338
full work available at URL: s0168-9274(02)00235-0
OpenAlex ID: W2118051048
description: scientific article; zbMATH DE number 1912433