‎In this paper‎, ‎Haar wavelets are performed for solving continuous time-variant linear-quadratic optimal control problems‎. ‎Firstly‎, ‎using necessary conditions for optimality‎, ‎the problem is changed into a two-boundary value problem (TBVP)‎. ‎Next‎, ‎Haar wavelets are applied for converting the TBVP‎, ‎as a system of differential equations‎, ‎in to a system of matrix algebraic equations‎...

We study the quadratic matrix equation X2 − EX − F = 0, where E is diagonal and F is an M -matrix. Quadratic matrix equations of this type arise in noisy Wiener–Hopf problems for Markov chains. The solution of practical interest is a particular M -matrix solution. The existence and uniqueness of M -matrix solutions and numerical methods for finding the desired M -matrix solution are discussed b...

By relating the projective camera model to the perspective one, the intrinsic camera parameters give rise to what is called the calibration matrix. This paper presents two new methods to retrieve the calibration matrix from the projective camera model. In both methods, a collective approach was adopted, using matrix representation. The calibration matrix was retrieved from a quadratic matrix te...

(N × N)-matrix is called additive when its elements are pair-wise sums of N real numbers ai. For a quadratic binary functional with an additive connection matrix we succeeded in finding the global minimum expressing it through external parameters of the problem. Computer simulations show that energy surface of a quadratic binary functional with an additive matrix is complicate enough.

By relating the projective camera model to the perspective one, using homogenous coordinates representation, the interior orientation parameters constitute what is called the calibration matrix. This paper presents two new algorithms to retrieve the calibration matrix from the projective camera model. In both algorithms, a collective approach was adopted, using matrix factorization. The calibra...

A full-rank lattice L in R is a discrete subgroup of R which is the set of all integer linear combinations of n-linearly independent vectors, say b1, · · · ,bn i.e., L = { ∑n i=1 zibi | z1, · · · , zn ∈ Z}. The matrix B = [b1, · · · ,bn] is called the basis of the lattice and the matrix Q = B′B is called a Gram matrix of the lattice. A lattice is integral if its Gram matrix has only integer ent...

We provide a general theoretical framework to derive Bernstein-von Mises theorems for matrix functionals. The conditions on functionals and priors are explicit and easy to check. Results are obtained for various functionals including entries of covariance matrix, entries of precision matrix, quadratic forms, log-determinant, eigenvalues in the Bayesian Gaussian covariance/precision matrix estim...

We consider minimization of a quadratic objective function subject to a sign-indefinite quadratic equality constraint. We derive necessary and sufficient conditions for the existence of solutions to the constrained minimization problem. These conditions involve a generalized eigenvalue of the matrix pencil consisting of a symmetric positivesemidefinite matrix and a symmetric indefinite matrix. ...