Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Set Reduction In Nonlinear Equations (1203.3059v1)

Published 14 Mar 2012 in cs.MS, cs.NA, and math.NA

Abstract: In this paper, an idea to solve nonlinear equations is presented. During the solution of any problem with Newton's Method, it might happen that some of the unknowns satisfy the convergence criteria where the others fail. The convergence happens only when all variables reach to the convergence limit. A method to reduce the dimension of the overall system by excluding some of the unknowns that satisfy an intermediate tolerance is introduced. In this approach, a smaller system is solved in less amount of time and already established local solutions are preserved and kept as constants while the other variables that belong to the "set" will be relaxed. To realize the idea, an algorithm is given that utilizes applications of pointers to reduce and evaluate the sets. Matrix-free Newton-Krylov Techniques are used on a test problem and it is shown that proposed idea improves the overall convergence.

Citations (1)

Summary

We haven't generated a summary for this paper yet.