ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (5)
  • pattern recognition  (3)
  • 65L10  (2)
  • Springer  (5)
  • American Chemical Society (ACS)
  • 1980-1984  (5)
  • 1982  (5)
  • Computer Science  (5)
Collection
  • Articles  (5)
Publisher
  • Springer  (5)
  • American Chemical Society (ACS)
Years
  • 1980-1984  (5)
Year
Topic
  • Computer Science  (5)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Computing 28 (1982), S. 43-51 
    ISSN: 1436-5057
    Keywords: spurious solutions ; discretizations ; nonlinear eigenvalue problems ; superlinear functions ; 34B15 ; 65H10 ; 65L10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es werden endlich dimensionale, nichtlineare Eigenwertprobleme der FormAu=λFu mit einer MatrixA und einem Feld(Fu) i =f(u i ),i=1, ...,m betrachtet. Diese können als Diskretisierung eines entsprechenden Randwertproblems angesehen werden. Wir zeigen, daß diese diskreten Gleichungen dann zusätzliche, positive Lösungszweige (welche in [1,7] beobachtet wurden) aufweisen, wennf hinreichend stark wächst undA −1 mindestens zwei positive Spalten von einem bestimmten Typ besitzt. Ausführlicher, werden die Fällef(u)=e u undf(u)=u α behandelt, für die auch diskrete Verzweigungsdiagramme angegeben werden.
    Notes: Abstract We consider finite dimensional nonlinear eigenvalue problems of the typeAu=λFu whereA is a matrix and(Fu) i =f(u i ),i=1, ...,m. These may be thought of as discretizations of a corresponding boundary value problem. We show that positive, spurious solution branches of the discrete equations (which have been observed in some cases in [1, 7]) typically arise iff increases sufficiently strong and ifA −1 has at least two positive columns of a certain type. We treat in more detail the casesf(u)=e u andf(u)=u α where also discrete bifurcation diagrams are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Computing 28 (1982), S. 333-343 
    ISSN: 1436-5057
    Keywords: 34B05 ; 65L10 ; (Unstable) linear boundary value problems ; invariant imbedding ; Riccati equation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Das Verfahren des Invarianten Einbettens kann instabile lineare Randwertaufgaben auf stabile Art lösen. Die dabei zu integrierende Matrixriccatigleichung hängt von den Randwerten des Problems ab. Ihre Dimension wird durch ein geeignetes Entkoppeln der Systemgleichungen bestimmt. Das Verfahren muß versagen, wenn dieselbe Entkopplung nicht auch mit den Randwerten durchführbar ist. Außerdem muß für neue Randwerte die Riccatigleichung nochmals gelöst werden. Es wird ein Erweiterungsalgorithmus definiert, der die Randwertaufgabe eindeutig auf einer doppelten Dimension abbildet, die dann durch modifiziertes Invariantes Einbetten gelöst wird. Dieses „Erweiterte (Duale) Invariante Einbetten” ist immer durchführbar. Die zugehörige Riccatigleichung hängt nicht mehr von den Randwerten ab, sie muß nur mehr einmal „offline” gelöst werden. Für neue Randwerte sind nur mehr lineare Gleichungssysteme „online” zu lösen.
    Notes: Abstract Unstable linear boundary value problems can be solved by the method of Invariant Imbedding in a stable manner. Instead of integration of the system equations this method requires the integration of a matrix Riccati equation, which depends on the boundary values of the problem. The dimension of the Riccati equation is determined by a suitable decoupling of the system equations. Invariant Imbedding now fails, if this decoupling does not correspond with the boundary condition. In addition, the Riccati equation has to be solved once more for each new boundary condition. An extension algorithm is defined, which maps the boundary value problem into a problem of double dimension. This “extended” boundary value is solved by a modified Invariant Imbedding. The resulting “Extended (Dual) Invariant Imbedding” is always applicable and does not depend on the boundary conditions. The corresponding “extended” Riccati equation has to be integrated only once “offline”. If the boundary condition is changed, only systems of linear equations have to be solved “online”.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 11 (1982), S. 341-356 
    ISSN: 1573-7640
    Keywords: Artificial intelligence ; automatic classification ; cluster analysis ; fuzzy sets ; inductive reasoning ; learning algorithms ; measurement theory ; pattern recognition ; tolerance theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We investigate in this paper approximate operations on sets, approximate equality of sets, and approximate inclusion of sets. The presented approach may be considered as an alternative to fuzzy sets theory and tolerance theory. Some applications are outlined.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 11 (1982), S. 409-415 
    ISSN: 1573-7640
    Keywords: Kleene closure ; regular expression matrices ; fuzzy regular expression matrices ; automata theory ; pattern recognition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An efficient algorithm for finding the Kleene closure of regular expressions matrices or fuzzy regular expression matrices is presented and illustrated by examples. Properties of Kleene closure are also investigated. The results may have useful applications in automata theory, pattern recognition, and pictorial information systems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 11 (1982), S. 75-100 
    ISSN: 1573-7640
    Keywords: Attributes ; attributed grammars ; automata ; features ; formal languages ; grammatical inferrence ; linguistic ; pattern recognition ; probabilistic systems ; semantics ; stochastic systems ; structure ; syntax ; syntactic
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper surveys some of the contemporary work in syntactic/semantic pattern recognition, with emphasis on four topics that are active research areas. These areas-grammatical inferrence, probabilistic models, syntactic errorcorrection, and grammars with attributes-present challenging questions both as to theory and as to practice.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...