Bøger af Siegfried Müller

Therefore new numerical algorithms have to be developed with a computational complexity that can be termed nearly optimal in the sense that storage and computational expense remain proportional to the "inher ent complexity" (a term that will be made clearer later) problem.