𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Further optimization of the Kantorovich method when applied to vibrations problems

✍ Scribed by V.H. Cortinez; P.A.A. Laura


Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
149 KB
Volume
25
Category
Article
ISSN
0003-682X

No coin nor oath required. For personal study only.

✦ Synopsis


It is shown in the present study that, in general, the accuracy of the Kantorovich method can be improved considerably by including an exponen tial optimization parameter, 7, and a multiplier factor, ~, in the part of the expression giving the solution which is chosen a priori when determining eigenvalues in a vibrations problem.


πŸ“œ SIMILAR VOLUMES


The radial integration method applied to
✍ Albuquerque, E. L. ;Sollero, P. ;Portilho de Paiva, W. πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 153 KB

## Abstract In this paper, the radial integration method is applied to transform domain integrals into boundary integrals in a boundary element formulation for anisotropic plate bending problems. The inertial term is approximated with the use of radial basis functions, as in the dual reciprocity bo

A gradient-only line search method for t
✍ J. A. Snyman πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 100 KB

A new implementation of the conjugate gradient method is presented that economically overcomes the problem of severe numerical noise superimposed on an otherwise smooth underlying objective function of a constrained optimization problem. This is done by the use of a novel gradient-only line search t

An adaptive hp-version of the finite ele
✍ V. China Venkata Rao; P. C. Das; T. Sundararajan πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 409 KB πŸ‘ 2 views

This paper describes an adaptive hp-version mesh reΓΏnement strategy and its application to the ΓΏnite element solution of one-dimensional ame propagation problems. The aim is to control the spatial and time discretization errors below a prescribed error tolerance at all time levels. In the algorithm,