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)
  • Linear Complementarity Problem  (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
  • 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
    Mathematical programming 23 (1982), S. 181-192 
    ISSN: 1436-4646
    Keywords: Linear Complementarity Problem ; Stability ; Classes of Matrices
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It has been shown previously that the Linear Complementarity Problem is stable when the defining matrix is positive semidefinite and when (locally) the set of solutions is nonempty and bounded. We enlarge the class of matrices for which this is true and also demonstrate how the boundedness condition leads to other stability type questions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 24 (1982), S. 216-224 
    ISSN: 1436-4646
    Keywords: Piecewise-linear Homotopy Algorithms ; Computational Complexity ; Exponential Growth ; Linear Complementarity Problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We show that piecewise-linear homotopy algorithms may take a number of steps that grows exponentially with the dimension when solving a system of linear equations whose solution lies close to the starting point. Our examples are based on an example of Murty exhibiting exponential growth for Lemke's algorithm for the linear complementarity problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 23 (1982), S. 206-215 
    ISSN: 1436-4646
    Keywords: Simplicial Cone ; Nearest Point ; Linear Complementarity Problem ; Orthogonal Projection ; Critical Index ; Dimension Reduction
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider the linear complementarity problem (q, M) in whichM is a positive definite symmetric matrix of ordern. This problem is equivalent to a nearest point problem [Γ; b] in whichΓ = {A.1,⋯, A. n } is a basis for R n ,b is a given point in R n ; and it is required to find the nearest point in the simplicial cone Pos(Γ) tob. We develop an algorithm for solving the linear complementarity problem (q, M) or the equivalent nearest point problem [Γ; b]. Computational experience in comparison with an existing algorithm is presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    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 ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...