Changeset 35715c in git for kernel/linearAlgebra.h
- Timestamp:
- Dec 1, 2010, 5:01:09 PM (13 years ago)
- Branches:
- (u'spielwiese', '5b153614cbc72bfa198d75b1e9e33dab2645d9fe')
- Children:
- 47b559d8a480780a6380da801528adb53dca1000
- Parents:
- af71455603162123e6412ac27852bb08ea8f5126
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/linearAlgebra.h
raf7145 r35715c 219 219 220 220 /** 221 * Solves the linear system A *x = b, where A is an (nx n)-matrix221 * Solves the linear system A * x = b, where A is an (m x n)-matrix 222 222 * which is given by its LU-decomposition. 223 223 * … … 461 461 * polynomial in y of degree m + n with coefficients in K[[x]]. Suppose there 462 462 * are two monic factors f_0(y) (of degree n) and g_0(y) of degree (m) such 463 * that h(0, y) = f_0(y) * g_0(y) , and an integer d >= 0. Then there are464 * monic polynomials in y with coefficients in K[[x]], namely f(x, y) of465 * degree n and g(x, y) of degree m such that463 * that h(0, y) = f_0(y) * g_0(y) and <f_0, g_0> = K[y]. Fix an integer d >= 0. 464 * Then there are monic polynomials in y with coefficients in K[[x]], namely 465 * f(x, y) of degree n and g(x, y) of degree m such that 466 466 * h(x, y) = f(x, y) * g(x, y) modulo <x^(d+1)> (*). 467 467 * … … 471 471 * The method expects the ground ring to contain at least two variables; then 472 472 * x is the first ring variable and y the second one. 473 * 474 * This code was place here since the algorithm works by successively solving 475 * d linear equation systems. It is hence an application of other methods 476 * defined in this h-file and its corresponding cc-file. 477 * 473 478 **/ 474 479 void henselFactors(
Note: See TracChangeset
for help on using the changeset viewer.