No label defined (Q4723172)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3997032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3997032 |
Statements
1987
0 references
ill-conditioned Jacobi matrix
0 references
Tensor methods
0 references
iteration
0 references
finite difference Jacobian
0 references
secant tensor methods
0 references
test problems
0 references
0.9740753769874572
0 references
0.9208222031593324
0 references
0.9019009470939636
0 references
0.9019009470939636
0 references
[For the entire collection see Zbl 0611.00024.] Tensor methods are a class of general purpose methods for solving systems of nonlinear equations. They are especially intended to efficiently solve problems where the Jacobian matrix at the solution is singular or ill- conditioned, while remaining at least as efficient as standard methods on nonsingular problems. Their distinguishing feature is that they base each iteration on a quadratic model of the nonlinear function. The model has a simple second order term that allows it to interpolate more information about the nonlinear function than standard, linear model based methods, without significantly increasing the cost of forming, storing, or solving the model. This paper summarizes two types of tensor methods, derivative tensor methods that calculate an analytic or finite difference Jacobian at each iteration, and secant tensor methods that avoid Jacobian evaluations. Both are shown to require no more function or derivative information per iteration, and hardly more storage or arithmetic operations per iteration, than standard linear model based methods. Computational results are presented that indicate that both tensor methods are consistently at least as reliable as the corresponding linear model based methods, and are significantly more efficient, both on nonsingular and on singular test problems.
0 references