| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 3 / 3
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Linear algorithms for the Hosoya index and Hosoya matrix of a tree
Aleksander Vesel, 2021, izvirni znanstveni članek

Opis: The Hosoya index of a graph is defined as the total number of its independent edge sets. This index is an important example of topological indices, a molecular-graph based structure descriptor that is of significant interest in combinatorial chemistry. The Hosoya index inspires the introduction of a matrix associated with a molecular acyclic graph called the Hosoya matrix. We propose a simple linear-time algorithm, which does not require pre-processing, to compute the Hosoya index of an arbitrary tree. A similar approach allows us to show that the Hosoya matrix can be computed in constant time per entry of the matrix.
Ključne besede: Hosoya index, Hosoya matrix, optimal algorithm
Objavljeno v DKUM: 18.10.2024; Ogledov: 0; Prenosov: 3
.pdf Celotno besedilo (260,38 KB)
Gradivo ima več datotek! Več...

2.
An ℋ∞ optimal robust pole placement with fixed transparent controller structure on the basis of nonnegativity of even spectral polynomials
Andrej Sarjaš, Rajko Svečko, Amor Chowdhury, izvirni znanstveni članek

Opis: This paper presents the synthesis of an optimal robust controller with the use of pole placement technique. The presented method includes solving a polynomial equation on the basis of the chosen fixed characteristic polynomial and introduced parametric solutions with a known parametric structure of the controller. Robustness criteria in an unstructured uncertainty description with metrics of norm ℋ∞ are for a more reliable and effective formulation of objective functions for optimization presented in the form of a spectral polynomial with positivity conditions. The method enables robust low-order controller design by using plant simplification with partial-fraction decomposition, where the simplification remainder is added to the performance weight. The controller structure is assembled of well-known parts such as disturbance rejection, and reference tracking. The approach also allows the possibility of multiobjective optimization of robust criteria, application of mixed sensitivity problem, and other closed-loop limitation criteria, where the common criteria function can be composed from different unrelated criteria. Optimization and controller design are performed with iterative evolution algorithm.
Ključne besede: optimal robust controller, optimization, algorithm
Objavljeno v DKUM: 15.06.2017; Ogledov: 1101; Prenosov: 375
.pdf Celotno besedilo (3,03 MB)
Gradivo ima več datotek! Več...

3.
A preconditioning strategy for banded circulant and toeplitz systems
Dušan Caf, David J. Evans, 1998, izvirni znanstveni članek

Opis: A new preconditioning strategy for symmetric positive definite banded circulant and Toeplitz systems is described. The optimal tridiagonal preconditioner for tridiagonal circulant systems is modified and applied to both circulant and Toeplitz banded systems. The strategy is extended to block tridiagonal systems. The parallelisation aspects of the PCG algorithm are discussed.
Ključne besede: optimal preconditioner, Töplitz systems, PCG algorithm
Objavljeno v DKUM: 01.06.2012; Ogledov: 1309; Prenosov: 109
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.1 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici