Fast Algorithm for Extremal Biparametric Eigenproblem
نویسندگان
چکیده
∗Martin GAVALEC, ∗∗Ján PLAVKA ∗Department of Information Technologies, Faculty of Informatics and Management, University of Hradec Králové, Rokitanského 62, 500 03 Hradec Králové, Czech Republic E-mail: [email protected] ∗∗Department of Mathematics, Faculty of Electrical Engineering and Informatics, Technical University of Košice, B. Němcovej 32, 042 00 Košice, tel. 095/602 3256, E-mail: [email protected]
منابع مشابه
On the extremal total irregularity index of n-vertex trees with fixed maximum degree
In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...
متن کاملGeneralized Eigenproblem for Stochastic Process Covariances
This paper presents a novel algorithm for nding the solution of the generalized eigenproblem where the matrices involved contain expectation values from stochastic processes. The algorithm is iterative and sequential to its structure and uses on-line stochastic approximation to reach an equilibrium point. A quotient between two quadratic forms is suggested as an energy function for this problem...
متن کاملA Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets
We present a fast algorithm to compute an optimal rec-tilinear Steiner tree for extremal point sets. A point set is extremal if each point lies on the boundary of a rectilinear convex hull of the point set. Our algorithm can be used in homotopic routing in VLSI layout design and it runs in O(k 2 n) time, where n is the size of the point set and k is the size of its rectilinear convex hull.
متن کاملTR-2004009: A Reduction of the Matrix Eigenproblem to Polynomial Rootfinding via Similarity Transforms into Arrow-Head Matrices
We modify the customary approach to solving the algebraic eigenproblem. Instead of applying the QR algorithm to a Hessenberg matrix, we begin with the recent unitary similarity transform into a triangular plus rank-one matrix. Our novelty is nonunitary transforms of this matrix into similar arrow-head matrices, which we perform at a low arithmetic cost. The resulting eigenproblem can be effecti...
متن کاملA Parallelizable and Fast Algorithm for Very Large Generalized Eigenproblems
We discuss a novel iterative approach for the computation of a number of eigenvalues and eigenvectors of the generalized eigenproblem A x = ABx . Our method is based on a combination of the JacobiDavidson method and the QZ-method. For that reason we refer to the method as JDQZ. The effectiveness of the method is illustrated by a numerical example.
متن کامل