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

An iterative method of general perturbations programmed for a computer

โœ Scribed by P. K. Seidelmann

Publisher
Springer Netherlands
Year
1970
Tongue
English
Weight
640 KB
Volume
2
Category
Article
ISSN
1572-9478

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A general iterative method for an infini
A general iterative method for an infinite family of nonexpansive mappings
โœ Yonghong Yao; Yeong-Cheng Liou; Rudong Chen ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 266 KB

Let H be a real Hilbert space. Consider the iterative sequence where ฮณ > 0 is some constant, f : H โ†’ H is a given contractive mapping, A is a strongly positive bounded linear operator on H and W n is the W -mapping generated by an infinite countable family of nonexpansive mappings T 1 , T 2 , . . .

Iterative Characterizations of Computabl
Iterative Characterizations of Computable Unary Functions: A General Method
โœ Stefano Mazzanti ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 470 KB

## Abstract Iterative characterizations of computable unary functions are useful patterns for the definition of programming languages based on iterative constructs. The features of such a characterization depend on the pairing producing it: this paper offers an infinite class of pairings involving

Computer generation of feynman diagrams
Computer generation of feynman diagrams for perturbation theory II. Program description
โœ H.C. Wong; J. Paldus ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 53 KB

Programming languages used: FORTRAN IV High speed store required: 46k bytes. No. of bits hi a byte: 8 Is the program overlaid? No No. of magnetic tapes required: None Other peripherals used? Card reader, printer No. of cards in combined program and test deck: 879