Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Dimitrios Christou"'
Autor:
Dimitrios Christou
61 ασθενείς με διαπιστωμένη πλήρους πάχους (full thickness) χρόνια ρήξη εκφυλιστικού τύπου του τενόντιου πετάλου του ώμου αντιμετωπίσθηκαν με α
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f11ed830986e572a37e7cd7c6caeed51
https://doi.org/10.12681/eadd/36070
https://doi.org/10.12681/eadd/36070
Publikováno v:
Special Matrices, Vol 6, Iss 1, Pp 155-165 (2018)
Hadamard matrices have many applications in several mathematical areas due to their special form and the numerous properties that characterize them. Based on a recently developed relation between minors of Hadamard matrices and using tools from calcu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5c79dc5990ff3814037705b8b9351a2
https://doaj.org/article/f4c14e91968840d1bcf7b81ba4c8b288
https://doaj.org/article/f4c14e91968840d1bcf7b81ba4c8b288
Publikováno v:
Special Matrices, Vol 5, Iss 1, Pp 202-224 (2017)
This paper revisits the Bézout, Sylvester, and power-basis matrix representations of the greatest common divisor (GCD) of sets of several polynomials. Furthermore, the present work introduces the application of the QR decomposition with column pivot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e747cd964153b178100722114bc1ff78
https://doaj.org/article/6fa06bdda3b942ffa196d203ce82e56f
https://doaj.org/article/6fa06bdda3b942ffa196d203ce82e56f
In this paper a numerical method for the computation of the approximate least common multiple (ALCM) of a set of several univariate real polynomials is presented. The most important characteristic of the proposed method is that it avoids root finding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a069690041478515d8aef7736cc7f64f
Publikováno v:
Applied Mathematics and Computation. 219:1975-1987
In this paper we present a symbolic-numeric (hybrid) method for computing the intersection and tangency points of given plane curves. The whole procedure involves three phases: (i) implicitization, (ii) root specification, and (iii) inversion. For ea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b82c5093f9bb35ad80be626ed7ba9662
https://doi.org/10.1016/j.amc.2012.08.039
https://doi.org/10.1016/j.amc.2012.08.039
Autor:
Marilena Mitrouli, Dimitrios Christou
Publikováno v:
Applied Numerical Analysis & Computational Mathematics. 2:293-305
The computation of the Greatest Common Divisor (GCD) of a set of more than two polynomials is a non-generic problem. There are cases where iterative methods of computing the GCD of many polynomials, based on the Euclidean algorithm, fail to produce a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2abef3106661a3d846edb2f131f7e196
https://doi.org/10.1002/anac.200410052
https://doi.org/10.1002/anac.200410052
The Extended-Row-Equivalence and Shifting (ERES) method is a matrix-based method developed for the computation of the greatest common divisor (GCD) of sets of many polynomials. In this paper we present the formulation of the shifting operation as a m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00da813feed51e71a35864b92fe86941
The paper is concerned with establishing the links between the approximate GCD of a set of polynomials and the notion of the pseudo-spectrum defined on a set of polynomials. By examining the pseudo-spectrum of the structured matrix we will derive est
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70916923879d6eef7bc64141e9707dd0
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9789400706019
The computation of the Greatest Common Divisor (GCD) of a set of polynomials is an important issue in computational mathematics and it is linked to Control Theory very strong. In this paper we present different matrix-based methods, which are develop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5fe4e61a6924df3b761a5ede5573e6c6
https://doi.org/10.1007/978-94-007-0602-6_7
https://doi.org/10.1007/978-94-007-0602-6_7
Publikováno v:
Applied Numerical Mathematics
The computation of the greatest common divisor (GCD) of a set of polynomials has interested the mathematicians for a long time and has attracted a lot of attention in recent years. A challenging problem that arises from several applications, such as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0cf85059a82edff1e9f88a1ad6f3dab8