-
1 матричное неравенство
matrix inequality мат.Русско-английский научно-технический словарь Масловского > матричное неравенство
-
2 матричное неравенство
Mathematics: matrix inequalityУниверсальный русско-английский словарь > матричное неравенство
-
3 неравенство сохраняет силу для
Для полуопределенности симметричной матрицы А заменим строгие неравенства нестрогими и потребуем, чтобы нестрогие неравенства сохраняли силу для всех матриц, полученных перестановкой строк и столбцов А. — For semidefiniteness of the symmetric matrix A, we replace the strict inequalities by weak inequalities and require that the weak inequalities hold for all matrices formed by permuting the rows and columns of A.
Russian-English Dictionary "Microeconomics" > неравенство сохраняет силу для
-
4 Определенные артикли перед существительными, которые снабжены ссылками
The differential problem (1) can be reduced to the form (2)The asymptotic formula (1) follows from the above lemmaThe differential equation (1) can be solved numericallyWhat is needed in the final result is a simple bound on quantities of the form (1)The inequality (1) (артикль можно опустить) shows that $a>b$The bound (estimate) (2) is not quite as good as the bound (estimate) (1)If the norm of $A$ satisfies the restriction (1), then by the estimate (2) this term is less than unitySince the spectral radius of $A$ belongs to the region (1), this iterative method converges for any initial guessesThe array (1) is called the matrix representing the linear transformation of $f$It should be noted that the approximate inequality (1) bounds only the absolute error in $x$The inequality (1) shows that...The second step in our analysis is to substitute the forms (1) and (2) into this equation and simplify it by dropping higher-order termsFor small $ze$ the approximation (1) is very good indeedA matrix of the form (1), in which some eigenvalue appears in more than one block, is called a derogatory matrixThe relation between limits and norms is suggested by the equivalence (1)For this reason the matrix norm (1) is seldom encountered in the literatureTo establish the inequality (1) from the definition (2)Our conclusion agrees with the estimate (1)The characterization is established in almost the same way as the results of Theorem 1, except that the relations (1) and (2) take place in the eigenvalue-eigenvector relation...This vector satisfies the differential equation (1)The Euclidean vector norm (2) satisfies the properties (1)The bound (1) ensures only that these elements are small compared with the largest element of $A$There is some terminology associated with the system (1) and the matrix equation (2)A unique solution expressible in the form (1) restricts the dimensions of $A$The factorization (1) is called the $LU$-factorizationIt is very uncommon for the condition (1) to be violatedThe relation (1) guarantees that the computed solution gives very small residualThis conclusion follows from the assumptions (1) and (2)The factor (1) introduced in relation (2) is now equal to 2The inequalities (1) are still adequateWe use this result without explicitly referring to the restriction (1)Русско-английский словарь по прикладной математике и механике > Определенные артикли перед существительными, которые снабжены ссылками
-
5 Отсутствие артиклей перед существительными, которые снабжены ссылками
It follows from Theorem 1 that $x=1$Section 2 of this paper gives (contains) a concise presentation of the notation to be used belowProperty 1 is called (known as) the triangle inequalityThis assertion (statement, proposition) has been proved in part 1 (part (a)) of the (our) proofAlgorithm 1 (с большой буквы) defines elementary permutations and elementary triangle matrices of index 2Equation (1) ((the) inequality (1)) can thus be written in the (артикль обязателен) form (2)In the language of our notation, algorithm (1) (с маленькой буквы) is a stable way of computing the inner productThe only place where the algorithm can break down is in statement 3 (in Statement 3)We combine Exercises 1 and 2 to construct an algorithm for finding an approximate eigenvectorThis case is illustrated in (но не on) Figure 1The asymptotic formula (1) was proved in Example 1Corollary 1 can be used to estimate the error in the inverse of a perturbed matrixBy property 1 (by Theorem 1), this function is positive except at the zero vectorA less trivial example is given in Appendix 3Step 1 in Example 1 and steps 2 and 3 in Example 2The idea of a norm will be introduced in Chapter 4Now from statements 2 and 3 of (1), we have...All the drivers for solving linear systems are listed in Table 1 (are illustrated in Figure 1)If Algorithm 1 in four-digit arithmetic is applied to refine $x$, then we obtain...Assertion (ii) is nothing but the statement that one natural way of extending these ideas to $R^n$ is to generalize formula (1) to obtain a Euclidean length of a vectorBy property 1, this function is positive except at the zero vectorWe have seen on page 3 that set of matrices is a vector space which is essentially identical with...Equation (1) effectively gives an algorithm for using the output of Algorithm 1 to solve...Русско-английский словарь по прикладной математике и механике > Отсутствие артиклей перед существительными, которые снабжены ссылками
-
6 оценка
f. bound, estimate, evaluation, valuation, estimation, inequality, estimator;
оценка сверху - upper bound;
оценка снизу - lower bound;
асимптотически эффективная оценка - asymptotically efficient estimate;
достаточная оценка - sufficient estimate;
оценка максимального правдоподобия - maximum likelihood estimate;
несмещённая оценка - unbiased estimate;
состоятельная оценка - consistent estimate;
эффективная оценка - efficient estimate;
случай регулярной оценки - regular estimation case;
совместно-достаточная сцинка - joint sufficient estimate;
совместно-эффективная оценка - joint efficient estimate;
регулярная оценка - regular estimate;
матрица оценок - rating matrix;
оценка плотности Розенблатта-Парзена - kernel density estimate -
7 оценка
f.bound, estimate, evaluation, valuation, estimation, inequality, estimator
См. также в других словарях:
Linear matrix inequality — In convex optimization, a linear matrix inequality (LMI) is an expression of the form: LMI(y):=A 0+y 1A 1+y 2A 2+cdots+y m A mgeq0,where * y= [y i,, i!=!1dots m] is a real vector, * A 0,, A 1,, A 2,,dots,A m are symmetric matrices in the subspace … Wikipedia
Matrix mechanics — Quantum mechanics Uncertainty principle … Wikipedia
Matrix norm — In mathematics, a matrix norm is a natural extension of the notion of a vector norm to matrices. Contents 1 Definition 2 Induced norm 3 Entrywise norms 3.1 Frobenius norm … Wikipedia
Matrix exponential — In mathematics, the matrix exponential is a matrix function on square matrices analogous to the ordinary exponential function. Abstractly, the matrix exponential gives the connection between a matrix Lie algebra and the corresponding Lie group.… … Wikipedia
Linear inequality — In mathematics a linear inequality is an inequality which involves a linear function.Formal definitionsWhen operating in terms of real numbers, linear inequalities are the ones written in the forms: f(x) < b ext{ or }f(x) leq b,where f(x) is a… … Wikipedia
Muirhead's inequality — In mathematics, Muirhead s inequality, named after Robert Franklin Muirhead, also known as the bunching method, generalizes the inequality of arithmetic and geometric means. Contents 1 Preliminary definitions 1.1 The a mean 1.2 Doubly stochastic… … Wikipedia
Weyl's inequality — In mathematics, there are at least two results known as Weyl s inequality .Weyl s inequality in number theoryIn number theory, Weyl s inequality, named for Hermann Weyl, states that if M , N , a and q are integers, with a and q coprime, q > 0,… … Wikipedia
Positive-definite matrix — In linear algebra, a positive definite matrix is a matrix that in many ways is analogous to a positive real number. The notion is closely related to a positive definite symmetric bilinear form (or a sesquilinear form in the complex case). The… … Wikipedia
Sakurai's Bell inequality — The intention of a Bell inequality is to serve as a test of local realism or local hidden variable theories as against quantum mechanics, applying Bell s theorem, which shows them to be incompatible. Not all the Bell s inequalities that appear in … Wikipedia
Brascamp-Lieb inequality — In mathematics, the Brascamp Lieb inequality is a result in geometry concerning integrable functions on n dimensional Euclidean space R n . It generalizes the Loomis Whitney inequality, the Prékopa Leindler inequality and Hölder s inequality, and … Wikipedia
Bernoulli's inequality — In real analysis, Bernoulli s inequality is an inequality that approximates exponentiations of 1 + x .The inequality states that:(1 + x)^r geq 1 + rx!for every integer r ge; 0 and every real number x > −1. If the exponent r is even, then the… … Wikipedia