The Experts below are selected from a list of 296619 Experts worldwide ranked by ideXlab platform
M. Sebek - One of the best experts on this subject based on the ideXlab platform.
-
Efficient Numerical Method for the discrete-time symmetric matrix polynomial equation
IEE Proceedings - Control Theory and Applications, 1998Co-Authors: D. Henrion, M. SebekAbstract:A Numerical procedure is proposed to solve a matrix polynomial equation frequently encountered in discrete-time control and signal processing. The algorithm is based on a simple rewriting of the original equation in terms of a reduced Sylvester matrix. In contrast to previously published Methods, it does not make use of elementary polynomial operations. Moreover, and most notably, it is Numerically reliable. Basic examples borrowed from control and signal processing literature are aimed at illustrating the simplicity and efficiency of this new Numerical Method.
-
An efficient Numerical Method for the discrete time symmetric matrix polynomial equation
1997 European Control Conference (ECC), 1997Co-Authors: D. Henrion, M. SebekAbstract:A novel Numerical procedure is proposed to solve the discrete time symmetric matrix polynomial equation A'(d-1)X(d.) +X'(d-1)A(d) = B(d) frequently encountered in control and signal processing. In contrast to previously published Methods, it does not make use of elementary polynomial operations. The algorithm is based on a simple rewriting of the original equation in terms of reduced Sylvester resultant matrices. It handles all critical cases and namely, is Numerically reliable. Some basic examples are provided to illustrate the simplicity and efficiency of the Numerical Method.
D. Henrion - One of the best experts on this subject based on the ideXlab platform.
-
Efficient Numerical Method for the discrete-time symmetric matrix polynomial equation
IEE Proceedings - Control Theory and Applications, 1998Co-Authors: D. Henrion, M. SebekAbstract:A Numerical procedure is proposed to solve a matrix polynomial equation frequently encountered in discrete-time control and signal processing. The algorithm is based on a simple rewriting of the original equation in terms of a reduced Sylvester matrix. In contrast to previously published Methods, it does not make use of elementary polynomial operations. Moreover, and most notably, it is Numerically reliable. Basic examples borrowed from control and signal processing literature are aimed at illustrating the simplicity and efficiency of this new Numerical Method.
-
An efficient Numerical Method for the discrete time symmetric matrix polynomial equation
1997 European Control Conference (ECC), 1997Co-Authors: D. Henrion, M. SebekAbstract:A novel Numerical procedure is proposed to solve the discrete time symmetric matrix polynomial equation A'(d-1)X(d.) +X'(d-1)A(d) = B(d) frequently encountered in control and signal processing. In contrast to previously published Methods, it does not make use of elementary polynomial operations. The algorithm is based on a simple rewriting of the original equation in terms of reduced Sylvester resultant matrices. It handles all critical cases and namely, is Numerically reliable. Some basic examples are provided to illustrate the simplicity and efficiency of the Numerical Method.
M. Mitrouli - One of the best experts on this subject based on the ideXlab platform.
-
A matrix pencil based Numerical Method for the computation of the GCD of polynomials
[1992] Proceedings of the 31st IEEE Conference on Decision and Control, 1992Co-Authors: N. Karcanias, M. MitrouliAbstract:The authors present a novel Numerical Method for the computation of the greatest common divisor (GCD) of an m-set of polynomials of R(s), P/sub m,d/, of maximal degree d. It is based on a procedure that characterizes the GCD of P/sub m,d/ as the output decoupling zero polynomial of a linear system that may be associated with P/sub m,d/. The computation of the GCD is thus reduced to finding the finite zeros of a certain pencil. An error analysis proving the stability of the described procedures is given. Three Numerical results that demonstrate the effectiveness of the Method are presented.
N. Karcanias - One of the best experts on this subject based on the ideXlab platform.
-
A matrix pencil based Numerical Method for the computation of the GCD of polynomials
[1992] Proceedings of the 31st IEEE Conference on Decision and Control, 1992Co-Authors: N. Karcanias, M. MitrouliAbstract:The authors present a novel Numerical Method for the computation of the greatest common divisor (GCD) of an m-set of polynomials of R(s), P/sub m,d/, of maximal degree d. It is based on a procedure that characterizes the GCD of P/sub m,d/ as the output decoupling zero polynomial of a linear system that may be associated with P/sub m,d/. The computation of the GCD is thus reduced to finding the finite zeros of a certain pencil. An error analysis proving the stability of the described procedures is given. Three Numerical results that demonstrate the effectiveness of the Method are presented.
Zhiping Li - One of the best experts on this subject based on the ideXlab platform.
-
A coupled Numerical Method for relaxed minimizers and inhomogeneous microstructures
Proceedings Fourth International Conference Exhibition on High Performance Computing in the Asia-Pacific Region, 2000Co-Authors: Zhiping LiAbstract:A Numerical Method is established to solve a coupled problem of minimizing a nonquasiconvex potential energy and its relaxed energy. Convergence of the Method is proved. A Numerical example shows that the Method is successful and efficient in solving problems with nonlinear boundary data and inhomogeneous laminated microstructures.
