Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  Newton method
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On the Chaplygin method for the Darboux problem

100%
EN
In the paper we deal with the Darboux problem for hyperbolic functional differential equations. We give the sufficient conditions for the existence of the sequence \(\{z^{(m)}\}\) such that if \(\tilde{z}\) is a classical solution of the original problem then \(\{z^{(m)}\}\) is uniformly convergent to z\(\tilde{z}\). The convergence that we get is of the Newton type.
2
Content available remote

A Newton-Kantorovich-SOR type theorem

88%
Open Mathematics
|
2005
|
tom 3
|
nr 2
282-293
EN
In this paper we propose a new method for solving nonlinear systems of equations in finite dimensional spaces, combining the Newton-Raphson's method with the SOR idea. For the proof we adapt Kantorovich's demonstration given for the Newton-Raphson's method. As applications we reobtain the classical Newton-Raphson's method and the author's Newton-Kantorovich-Seidel type result.
EN
We consider a mathematical model which describes the contact between a linearly elastic body and an obstacle, the so-called foundation. The process is static and the contact is bilateral, i.e., there is no loss of contact. The friction is modeled with a nonmotonone law. The purpose of this work is to provide an error estimate for the Galerkin method as well as to present and compare two numerical methods for solving the resulting nonsmooth and nonconvex frictional contact problem. The first approach is based on the nonconvex proximal bundle method, whereas the second one deals with the approximation of a nonconvex problem by a sequence of nonsmooth convex programming problems. Some numerical experiments are realized to compare the two numerical approaches.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.