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 pivoting to a Bézout matrix achieving the computation of the degree and the coeffcients of the GCD through the range of the Bézout matrix. A comparison in terms of computational complexity and numerical effciency of the Bézout-QR, Sylvester-QR, and subspace-SVD methods for the computation of theGCDof sets of several polynomials with real coeffcients is provided.Useful remarks about the performance of the methods based on computational simulations of sets of several polynomials are also presented.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The late Professor Yanai has contributed to many fields ranging from aptitude diagnostics, epidemiology, and nursing to psychometrics and statistics. This paper reviews some of his accomplishments in multivariate analysis through his collaborative work with the present author, along with some untold episodes for the inception of key ideas underlying the work. The various topics covered include constrained principal component analysis, extensions of Khatri’s lemma, theWedderburn-Guttman theorem, ridge operators, generalized constrained canonical correlation analysis, and causal inference. A common thread running through all of them is projectors and singular value decomposition, which are the main subject matters of a recent monograph by Yanai, Takeuchi, and Takane [60].
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.