ill-conditioned problem

ill-conditioned problem

[¦il kən¦dish·ənd ′präb·ləm]
(computer science)
A problem in which a small error in the data or in subsequent calculation results in much larger errors in the answers.
References in periodicals archive ?
The cost of the iterations for AMG clearly increases for the more ill-conditioned problem as well.
Memory requirements for each solver show that the memory requirements for the PCG and SPAR solver are nearly identical while the AMG solver requires about twice as much memory for this example and increases additionally when the more ill-conditioned problem uses a more expensive preconditioner.
7 that gives improved convergence for ill-conditioned problems and better parallel scaling.
Simon Bolivar, Venezuela) survey modern techniques for the numerical solution of linear and nonlinear least squares, and introduce the treatment of large and ill-conditioned problems.
It is the aim of this paper to extend this theory to the case of discrete ill-conditioned problems.
By studying some typical examples of ill-conditioned problems in Section 5.
Nevertheless ill-conditioned problems show in many cases a similar behavior as ill-posed ones and usually have to be approached by regularization.
It is the aim of this article to extend the analysis of [10] to the case of discrete, ill-conditioned problems (2.