๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An optimal algorithm for the approximate computation of quadratures

โœ Scribed by S.S. Gaisaryan

Publisher
Elsevier Science
Year
1969
Weight
563 KB
Volume
9
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Algorithm for the Computation of Opti
An Algorithm for the Computation of Optimal Control Gains for Second Order Matrix Equations
โœ M.K. Kwak; L. Meirovitch ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 332 KB

In control of structures, the problem is ordinarily formulated in terms of second order matrix differential equations. In general, for an \(n\)-degree-of-freedom structure, design of a linear quadratic regulator requires the solution of a \(2 n \times 2 n\) matrix Ricatti equation. In the case of se

An Optimal Algorithm for the Straight Se
An Optimal Algorithm for the Straight Segment Approximation of Digital Arcs
โœ Y.M. Sharaiha; N. Christofides ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science โš– 842 KB

In this paper, we define the straight segment approximation problem (SSAP) for a given digital arc as that of locating a minimum subset of vertices on the arc such that they form a connected sequence of digital straight segments. Sharaiha (Ph.D. thesis, Imperial College, London, 1991) introduced the

An approximation technique for computing
An approximation technique for computing optimal dynamic paths
โœ Hector Sierra; Timothy Condon ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 854 KB

This paper describes a method for approximating optimal dynamic paths when model dimensionality prohibits the solution of the exact optimal trajectory. The method reduces the dimensionality, and hence the computational cost, of the problem by approximating the 'key' relationships of the model. The m