In der Arbeit wird ein gewisses von drei Parametern abhängiges Iterationsverfahren für ein lineares algebraisches Gleichungssystem von der Form mit schwach 2-zyklischer Blockmatrix untersucht. Es werden verschiedene Varianten dieses Verfahrens studiert. Die Konvergenzgeschwindigkeit wird mit der Konvergenzgeschwindigkeit üblicher Iterationsverfahren verglichen.
Die Arbeit befasst sich mit der Anwendung eines gewissen mehrparametrigen Iterationsverfahrens bei der Lösung des linearen Gleichungsystems der Form , wo eine gewisse, eine grosse Anzahl von Nullelementen enthaltende. Matrix bezeichnet und irgendeine von der Hauptuntermatrizen der Matrix leicht invertierbar ist. Das, in der Arbeit vorgeschlagende Iterationsverfahren stellt eine Kombination des iterativen und direkten Verfahrens dar.
The well-known bottleneck of systems pharmacology, i. e., systems biology applied to pharmacology, refers to the model parameters determination from experimentally measured datasets. This paper represents the development of our earlier studies devoted to inverse (ill-posed) problems of model parameters identification. The key feature of this research is the introduction of control (or periodic forcing by an input signal being a drug intake) of the nonlinear model of drug-induced enzyme production...
It is shown that a real Hankel matrix admits an approximate block diagonalization in which the successive transformation matrices are upper triangular Toeplitz matrices. The structure of this factorization was first fully discussed in [1]. This approach is extended to obtain the quotients and the remainders appearing in the Euclidean algorithm applied to two polynomials u(x) and v(x) of degree n and m, respectively, whith m < ...
The aim of the paper is to present a procedure for the approximation of a symmetric positive definite matrix by symmetric block partitioned matrices with structured off-diagonal blocks. The entropy loss function is chosen as approximation criterion. This procedure is applied in a simulation study of the statistical problem of covariance structure identification.
This paper is concerned with bounds of eigenvalues of a complex matrix. Both lower and upper bounds of modulus of eigenvalues are given by the Stein equation. Furthermore, two sequences are presented which converge to the minimal and the maximal modulus of eigenvalues, respectively. We have to point out that the two sequences are not recommendable for practical use for finding the minimal and the maximal modulus of eigenvalues.