Tateaki Sasaki
- T. Sasaki and M. Sasaki. A unified method for multivariate polynomial factorizations. Japan J. Indust. Appl. Math., 10:21--39, 1993.Google Scholar
Cross Ref
- M. van Hoeij. Factoring polynomials and the knapsack problem. J. Number Theory, 95:167--189, 2002.Google ScholarCross Ref
- K. Belabas, M. van Hoeij, J. Klueners, and A. Steel. Factoring polynomials over global fields. Preprint, 2004; http://arxiv.org/abs/math/0409510Google Scholar
Index Terms
- Approximate factorization of polynomials in Z[x]
Recommendations
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Given a symmetric positive definite matrix $A$, we compute a structured approximate Cholesky factorization $A\approx\mathbf{R}^{T}\mathbf{R}$ up to any desired accuracy, where $\mathbf{R}$ is an upper triangular hierarchically semiseparable (HSS) ...
Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
* Copper Mountain Special Issue on Iterative MethodsWe consider the application of the conjugate gradient method to the solution of large, symmetric indefinite linear systems. Special emphasis is put on the use of constraint preconditioners and a new factorization that can reduce the number of flops ...
Parallel Hybrid Preconditioning: Incomplete Factorization with Selective Sparse Approximate Inversion
We consider parallel preconditioning to solve large sparse linear systems $Ax=b$ using conjugate gradients when $A$ is symmetric and positive definite. We develop a preconditioner that can be viewed as a hybrid of incomplete factorization and sparse ...
Comments