A KDF9 ALGOL list-processing scheme

DOI10.1093/comjnl/8.2.113zbMath0254.65036OpenAlexW2148463576MaRDI QIDQ5667951

J. G. P. Barnes

Publication date: 1965

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/8.2.113

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (30)

A new algorithm for nonlinear least squares ⋮ The linear algebra of block quasi-Newton algorithms ⋮ Iterative solution of integral equations by a quasi-Newton method ⋮ Quasi-Newton Methods and their Application to Function Minimisation ⋮ Hybrid method for nonlinear least-square problems without calculating derivatives ⋮ Shanks Sequence Transformations and Anderson Acceleration ⋮ Combination of the sequential secant method and Broyden's method with projected updates ⋮ Parallel algorithms for solving systems of nonlinear equations ⋮ Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations ⋮ Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian ⋮ The Convergence of Single-Rank Quasi-Newton Methods ⋮ Conditioning of Quasi-Newton Methods for Function Minimization ⋮ Two classes of multisecant methods for nonlinear acceleration ⋮ Componentwise perturbation theory for linear systems with multiple right- hand sides ⋮ Extremization of functions with equality constraints ⋮ 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 ⋮ Metodo dei momenti per la soluzione di equazioni e sistemi di equazioni ⋮ A new method for adaptation of the dynamic transition matrix ⋮ Reference trajectory tracking for a multi-DOF robot arm ⋮ On Newton-like iteration functions: General convergence theorems and a specific algorithm ⋮ On the use of generalized inverses in function minimization ⋮ Three new algorithms based on the sequential secant method ⋮ A pseudo Newton-Raphson method for function minimization ⋮ Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation ⋮ Secant relations versus positive definiteness in quasi-Newton methods ⋮ Practical quasi-Newton methods for solving nonlinear systems ⋮ Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients ⋮ A modified secant method for unconstrained minimization ⋮ Representations of quasi-Newton matrices and their use in limited memory methods

This page was built for publication: A KDF9 ALGOL list-processing scheme