Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 31 (1978), S. 247-263 
    ISSN: 0945-3245
    Keywords: AMS(MOS):65F15 ; CR:5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A gradient method is presented for solving the eigentuple-eigenvector problem, $$Ax = \sum\limits_{i = 1}^P {\lambda _i B_i x} $$ which is a generalization ofAx=λBx that occurs in generalized Sturm-Liouville theory. Under certain conditions on matricesA, B 1,...,B P , the method is proved to converge locally. Numerical computations are given in a companion paper.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 31 (1978), S. 231-246 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F15 ; CR: 5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A gradient technique previously developed for computing the eigenvalues and eigenvectors of the general eigenproblemAx=λBx is generalized to the eigentuple-eigenvector problem $$Ax = \sum\limits_{i = 1}^p {\lambda _i B_i x} $$ . Among the applications of the latter are (1) the determination of complex (λ,x) forAx=λBx using only real arithmetic, (2) a 2-parameter Sturm-Liouville equation and (3) λ-matrices. The use of complex arithmetic in the gradient method is also discussed. Computational results are presented.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 62 (1990), S. 337-348 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Conclusions We have given evidence by mathematical analysis and by example that the construction of CAM's as quasineural networks based on the twin principles of an outer-product weight matrix and a random asynchronous single-neuron dynamics encounters two obstacles to good performance which appear to be inherent. It is desirable to have the stored memory vectors of a CAM as mutually far apart as possible in order to have unambiguous retrieval with as large a fraction of initial errors (minrad) as possible. For a given number,m, of memory vectors to be stored this requires that their dimension,n, be larger thanm and that the memory vectors be nearly mutually orthogonal (except for complementary pairs). In HOCAM's, it does not seem possible to have both a large minrad and an efficient ratiom/n. Attempts to increasem/n are likely to introduce extraneous fixed-points which reduce minrad appreciably. We have demonstrated this phenomenon in several cases for a particular mode of constructing CAM's of arbitrary size which have a desirable spacing between memory vectors. We conjecture that it is present also in HOCAM's having a random selection of memory vectors. (A mathematical proof of this conjecture now seems possible.) This may account for the rather pessimistic results on capacity obtained by mathematical analysis here and in Cottrell (1988), by a probabilistic analysis in Posner (1987) and by simulation in Hopfield (1982). Further, in Cottrell (1988) there is evidence that outer-product weights are near optimal with respect to minrad, so that otherW may not improve matters. We have left to another paper a study of other approaches to content-addressable memories of which we are aware, but which are not focused on asynchronous dynamics; e.g. computer CAM's as in Kohonen (1977) and biological memory models as in Little (1974); Palm (1980) and Little and Shaw (1978). We have not considered the learning, or adaptive, aspects of CAM's. However, insofar as learning is Hebbian and leads to outer-product weights, our analysis has implications for the effectiveness of learned weights, as may be inferred from our results on ambiguous retrieval.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Acta informatica 6 (1976), S. 109-131 
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary SEMANOL is a practical programming system for writing readable formal specifications of the syntax and semantics of programming languages. SEMANOL is based on a theory of semantics which embraces algorithmic (operational) and extensional (input/output) semantics. Specifications for large contemporary languages have been constructed in the formal language, SEMANOL (73), which is a readable high-level notation. A SEMANOL (73) specification can be executed (by an existing interpreter program); when given a program from the specified language, and its input, the execution of the SEMANOL (73) specification produces the program's output. The demonstrated executability of SEMANOL (73) provides important practical advantages. This paper includes discussions of the theory of semantics underlying SEMANOL, the syntax and semantics of the SEMANOL (73) language, the use of the SEMANOL (73) language in the SEMANOL method for describing programming languages, and the contrast between the Vienna definition method (VDL) and SEMANOL.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...