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

The computational algorithm for the parametric objective function

โœ Scribed by Saul Gass; Thomas Saaty

Publisher
John Wiley and Sons
Year
1955
Tongue
English
Weight
307 KB
Volume
2
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computational aspects of incrementally o
Computational aspects of incrementally objective algorithms for large deformation plasticity
โœ Jacob Fish; Kamlun Shek ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 135 KB ๐Ÿ‘ 1 views

A methodology for computationally efficient formulation of the tangent stiffness matrix consistent with incrementally objective algorithms for integrating finite deformation kinematics and with closest point projection algorithms for integrating material response is developed in the context of finit

Efficient Algorithms for Computing the J
Efficient Algorithms for Computing the Jacobi Symbol
โœ S.M. Eikenberry; J.P. Sorenson ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 464 KB

We present two new algorithms for computing the Jacobi Symbol: the right-shift and left-shift k-ary algorithms. For inputs of at most n bits in length, both algorithms take O(n 2 / log n) time and O(n) space. This is asymptotically faster than the traditional algorithm, which is based in Euclid's al