Subspace selection algorithms to be used with the nonlinear projection methods in solving systems of nonlinear equations
From MaRDI portal
Publication:1245680
DOI10.1016/0898-1221(76)90015-8zbMath0375.65027OpenAlexW1993690050MaRDI QIDQ1245680
Publication date: 1976
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(76)90015-8
Related Items (3)
Three dimensional x-projection method (with acceleration techniques) for solving systems of linear equations ⋮ Acceleration techniques for a class of x-projection methods for solving systems of linear equations ⋮ Subspace projection variants on Newton's method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deflation techniques for the calculation of further solutions of a nonlinear system
- Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation
- Nonlinear partial differential equations in engineering. Vol. II
- The Modified Gauss-Newton Method for the Fitting of Non-Linear Regression Functions by Least Squares
- Iteration Methods for Nonlinear Problems
- On the Convergence of Broyden's Method for Nonlinear Systems of Equations
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- Numerical Solution of Systems of Nonlinear Equations
- A Rapidly Convergent Descent Method for Minimization
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- A Method for Minimizing a Sum of Squares of Non-Linear Functions Without Calculating Derivatives
- Resolution by Iteration of Some Nonlinear Systems
- Variance algorithm for minimization
- Quasi- Newton Methods for Nonlinear Equations
- A New Method of Solving Nonlinear Simultaneous Equations
- Relaxation Methods for Convex Problems
- On Solving Nonlinear Equations with a One-Parameter Operator Imbedding
- Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
- The Conjugate Residual Method for Constrained Minimization Problems
- The Convergence of Single-Rank Quasi-Newton Methods
- The Solution of Nonlinear Systems of Equations by A-Stable Integration Techniques
- Conditioning of Quasi-Newton Methods for Function Minimization
- The Convergence of an Algorithm for Solving Sparse Nonlinear Systems
- A General Convergence Result for Unconstrained Minimization Methods
- Coercivity Conditions in Nonlinear Complementarity Problems
This page was built for publication: Subspace selection algorithms to be used with the nonlinear projection methods in solving systems of nonlinear equations
