Convergence in Highly Nonlinear Cable Net Problems
Anil Kumar Kar, Clyde Y. Okazaki
Abstract
Anil Kumar Kar, Clyde Y. Okazaki
Abstract
An iterative method for rapid convergence of nonlinear cable net problems is presented. Three already available methods, and the new method are compared for their efficiency in the convergence of highly nonlinear cable net problems. Three problems used in the comparisons indicate that as the nonlinearity increases, the new iterative method gains in comparative efficiency. For highly nonlinear cases, it is important that the linearized equations of equilibrium should be the true linear equations; otherwise, convergence may not be achieved when the Newton-Raphson procedure or any modified version of it is used for iteration.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An iterative method for rapid convergence of nonlinear cable net problems is presented. Three already available methods, and the new method are compared for their efficiency in the convergence of highly nonlinear cable net problems. Three problems used in the comparisons indicate that as the nonlinearity increases, the new iterative method gains in comparative efficiency. For highly nonlinear cases, it is important that the linearized equations of equilibrium should be the true linear equations; otherwise, convergence may not be achieved when the Newton-Raphson procedure or any modified version of it is used for iteration.
Key concepts: Nonlinear system, Convergence (economics), Iterative method, Local convergence, Applied mathematics, Net (polyhedron), Newton's method, Mathematical optimization