Πλοήγηση ανά Συγγραφέα "Adam, M."
Αποτελέσματα 1-14 από 14
-
An assessment of the performance of greek mutual equity funds selectivity and market timing
(2011)This paper empirically examines the performance of fifteen Greek mutual equity funds. The data on which this study was based is monthly and refer to the period January, 2000 to December, 2008. Based on the Treynor-Mazuy ... -
The generalized Levinger transformation
(2010)In this paper, we present new results relating the numerical range of a matrix A with the generalized Levinger transformation L(A, alpha, beta) = alpha H(A) + beta S(A), where H(A) and S(A), are, respectively the Hermitian ... -
Global Systems for Mobile Position Tracking Using Kalman and Lainiotis Filters
(2014)We present two time invariant models for Global Systems for Mobile (GSM) position tracking, which describe the movement in x-axis and y-axis simultaneously or separately. We present the time invariant filters as well as ... -
Golden section, Fibonacci sequence and the time invariant Kalman and Lainiotis filters
(2015)We consider the discrete time Kalman and Lainiotis filters for multidimensional stochastic dynamic systems and investigate the relation between the golden section, the Fibonacci sequence and the parameters of the filters. ... -
Inversion free algorithms for computing the principal square root of a matrix
(2014)New algorithms are presented about the principal square root of an n×n matrix A. In particular, all the classical iterative algorithms require matrix inversion at every iteration. The proposed inversion free iterative ... -
Lainiotis filter, golden section and Fibonacci sequence
(2013)The relation between the discrete time Lainiotis filter on the one side and the golden section and the Fibonacci sequence on the other is established. As far as the random walk system is concerned, the relation between the ... -
LIMITED APPROXIMATION OF NUMERICAL RANGE OF NORMAL MATRIX
(2010)Let A be an n x n normal matrix, whose numerical range NR[A] is a k-polygon. If a unit vector v is an element of W subset of C(n), with dimW = k and the point v*Av is an element of IntNR[A], then NR[A] is circumscribed to ... -
A new author's productivity index: p-index
(2010)In this paper a new author's productivity index is introduced, namely the golden productivity index. The proposed index measures the productivity of an individual researcher evaluating the number of papers as well as the ... -
Nonrecursive solution for the discrete algebraic Riccati equation and X plus A*X-1 A = L
(2015)In this paper, we present two new algebraic algorithms for the solution of the discrete algebraic Riccati equation. The first algorithm requires the nonsingularity of the transition matrix and is based on the solution of ... -
On numerical ranges of the compressions of normal matrices
(2011)For an n x n normal matrix A, whose numerical range NR[A] is a k-polygon (k <= n), an n x (k - 1) isometry matrix P is constructed by a unit vector upsilon is an element of C(n), and NR[P*AP] is inscribed to NR[A]. In this ... -
On the positive definite solutions of the matrix equation X s + A *X _S A = Q
(2011)In this paper, necessary and sufficient conditions for the existence of the positive definite solutions of the nonlinear matrix equation X s + A * X -s A = Q are presented, when A is nonsingular and s an integer, as well ... -
Optimal decentralized Kalman filter and Lainiotis filter
(2013)A method to implement the optimal decentralized Kalman filter and the optimal decentralized Lainiotis filter is proposed; the method is based on the a priori determination of the optimal distribution of measurements into ... -
Optimal distributed kalman and lainiotis filters: Optimal uniform distribution of measurements into local processors
(2009)A method to implement the optimal distributed Kalman and Lainiotis filters is proposed. The method is based on the a-priori determination of the optimal uniform distribution of the measurements into parallel processors, ... -
Riccati equation solution method for the computation of the extreme solutions of X + A* X-1 A = Q and X - A* X-1 A = Q
(2009)Algebraic and recursive methods for computing the extreme solutions of the matrix equations X + A* X-1 A = Q and X - A* X -1 A = Q are presented in this paper. The proposed algorithms are based on the solution of the ...