Rounding of Sequences and Matrices, with Applications
نویسندگان
چکیده
We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all column sums as well as all sums of consecutive row entries are less than two. Such roundings can be computed in linear time. This extends and improves previous results on rounding sequences and matrices in several directions. It has particular applications in just-in-time scheduling, where balanced schedules on machines with negligible switch over costs are sought after. Here we extend existing results to multiple machines and non-constant production rates.
منابع مشابه
Investigating the effect of rounding and revision in predicting earnings per share on investors' attention
Because in the theory of economics, the value of a company is based on the current value of future cash flows and profit is used as a substitute for cash flows, profit forecasting is of particular importance. In the research, the effect of rounding and revision in predicting earnings per share on the investors' attention in Iran has been investigated. After designing the investors' attention as...
متن کاملOperational matrices with respect to Hermite polynomials and their applications in solving linear differential equations with variable coefficients
In this paper, a new and efficient approach is applied for numerical approximation of the linear differential equations with variable coeffcients based on operational matrices with respect to Hermite polynomials. Explicit formulae which express the Hermite expansion coeffcients for the moments of derivatives of any differentiable function in terms of the original expansion coefficients of the f...
متن کاملOn nest modules of matrices over division rings
Let $ m , n in mathbb{N}$, $D$ be a division ring, and $M_{m times n}(D)$ denote the bimodule of all $m times n$ matrices with entries from $D$. First, we characterize one-sided submodules of $M_{m times n}(D)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $D$. Next, we introduce the notion of a nest module of matrices with entries from $D$. We ...
متن کاملThe Operational matrices with respect to generalized Laguerre polynomials and their applications in solving linear dierential equations with variable coecients
In this paper, a new and ecient approach based on operational matrices with respect to the gener-alized Laguerre polynomials for numerical approximation of the linear ordinary dierential equations(ODEs) with variable coecients is introduced. Explicit formulae which express the generalized La-guerre expansion coecients for the moments of the derivatives of any dierentiable function in termsof th...
متن کاملThe Inverse Eigenvector Problem for Real Tridiagonal Matrices
A little known property of a pair of eigenvectors (column and row) of a real tridiagonal matrix is presented. With its help we can define necessary and sufficient conditions for the unique real tridiagonal matrix for which an approximate pair of complex eigenvectors are exact. Similarly we can designate the unique real tridiagonal matrix for which two approximate real eigenvectors, with differe...
متن کامل