For the line-contact EHL problem, the widely-used solution
method is the Newton–Raphson algorithm. The convergence rate
of this method is fast (quadratic), but the procedure requires
decomposition of the Jacobian matrix to solve the equations For
1-D problem of line-contact, applying Newton–Raphson algorithm
was found to be the best choice, while the use of this approach for
2-D problem of point contact is not efficient. In other words, for N
nodes along the line contact domain, the number of elements in
the Jacobian matrix is equal to N2 while for point contact problem
with N N number of nodes, the Jacobian matrix has N4 elements,
which is difficult to handle.
For the line-contact EHL problem, the widely-used solution
method is the Newton–Raphson algorithm. The convergence rate
of this method is fast (quadratic), but the procedure requires
decomposition of the Jacobian matrix to solve the equations For
1-D problem of line-contact, applying Newton–Raphson algorithm
was found to be the best choice, while the use of this approach for
2-D problem of point contact is not efficient. In other words, for N
nodes along the line contact domain, the number of elements in
the Jacobian matrix is equal to N2 while for point contact problem
with N N number of nodes, the Jacobian matrix has N4 elements,
which is difficult to handle.
การแปล กรุณารอสักครู่..
