Numerical algorithms using wavelet bases are similar to other transform methods in that vectors and operators are expanded into a basis and the computations take place in the new system of coordinates. As in all transform methods, such approach seeks an advantage in that the computation is faster in the new system of coordinates than in the original domain. However, due to the recursive definit...

The rapidly evolving field of parallel computing has seen four eras, substantially overlapping, yet progressive. The first, which we could label the Stone Age, was characterized by having speed-up as its primary objective (" Solve my problem faster... "). The tyranny of Amdahl's Law, combined with architectural convergence to systems that added memory in fixed proportion to processors, led to t...

Combination of algebraic and numerical techniques for improving the computations in algebra and geometry is a popular research topic of growing interest. We survey some recent progress that we made in this area, in particular , regarding polynomial roottnding, the solution of a polynomial system of equations, the computation of an approximate greatest common divisor of two polynomials as well a...

In 1994, ASHRAE began developing a guideline for measuring retrofit savings (GPC-14P). In support ofGuide­ line-14p, ASHRAE initiated RP-1050 to develop a toolkit for calculating linear, change-point linear, and multiple-linear inverse building energy models. The resulting Inverse Model­ ing Toolkit (IMT) can be usedaspart ofaprocedure to measure savings. This paper describes the numerical algo...

Efficient and robust parallel and distributed algorithms with portable and easy-to-use implementations for the solution of fundamental problems in numerical mathematics are essential components of most parallel software systems for scientific and engineering applications. This topic provides a forum for the presentation and discussion of new developments in the area of parallel and distributed ...

This paper presents a bi-objective MIP model for the flexible flow shop scheduling  problem (FFSP) in which the total weighted tardiness and the energy consumption are minimized simultaneously. In addition to considering unrelated machines at each stage, the set-up times are supposed to be sequence- and machine-dependent, and it is assumed that jobs have different release tim...