Examples of using Factorization in English and their translations into Spanish
{-}
-
Colloquial
-
Official
the most time-consuming part of the solution is the factorization of the global stiffness matrix,
which satisfy x 2≡ y 2( mod N){\displaystyle x^{2}\equiv y^{2}{\pmod{N}}} was developed by Shanks, who named it Square Forms Factorization or SQUFOF.
Galois group of K, and it has a factorization in terms of irreducible Artin representations of the Galois group.
I.(1981), Factorization of matrix functions and singular integral operators, Oper.
It is a general-purpose factorization algorithm, meaning that its running time depends solely on the size of the integer to be factored, and not on special structure or properties.
Maxima is a general-purpose system, and special-case calculations such as factorization of large numbers,
sub-exponential running time, algorithm for integer factorization, which employs elliptic curves.
In numerical analysis and linear algebra, lower-upper(LU) decomposition or factorization factors a matrix as the product of a lower triangular matrix
introducing ideas concerning factorization and combinatorial methods.
this will also be an entire function according to the Weierstrass factorization theorem.
introducing ideas concerning factorization and combinatorial methods.
This factorization might turn out to be trivial(i.e. n=n×1),
electric quadrupole electronic transitions along with the incomplete validity of the factorization of the total wavefunction into nuclear, electronic spatial
expressed the failure of unique factorization quantitatively via the class number hp
Non-negative matrix factorization(NMF or NNMF),
This allows to reduce the factorization over a purely transcendental field extension of F to the factorization of multivariate polynomials over F. If two
The primary improvement that quadratic sieve makes over Fermat's factorization method is that instead of simply finding a square in the sequence of a 2- n{\displaystyle a^{2}-n},
2016 by Ilya Gazman Lenstra elliptic curve factorization primality test Carl Pomerance, Analysis and Comparison of Some Integer Factoring Algorithms,
is a factorization of N, then N( c+ d 2)
because of the failure of unique factorization in their rings of integers- that Ernst Kummer first introduced the concept of an ideal number